World's Best Scientists 2026 revealed!
Journal of Combinatorial Optimization
H-index 13

Journal of Combinatorial Optimization

1382-6905

Published by: Springer

https://www.springer.com/journal/10878

Ranking & Metrics

Discipline name Position Best Scientists Publications D-Index
Mathematics 239 39 66 11
Computer Science 512 59 84 11
Engineering and Technology 979 12 17 8

Additional Metrics

Number of Best Scientists*: 88
Documents by Best Scientists*: 117
Top 100 Ranked Scientists*: 4
SCIMAGO H-index: 57
SCIMAGO SJR: 0.432
Impact Factor: 1.1

Overview

Top Research Topics at Journal of Combinatorial Optimization?

The discussions in the journal mainly cover the fields of Combinatorics, Theory of computation, Discrete mathematics, Mathematical optimization and Graph. Many of the studies tackled connect Combinatorics with a similar field of study like Upper and lower bounds. Upper and lower bounds research is the primary subject tackled in it with a focus on Competitive analysis.

The research on Theory of computation tackled can also make contributions to studies in the areas of Time complexity, Scheduling (computing), Approximation algorithm and Combinatorial optimization. The journal connects research in Discrete mathematics with the related topic of Bounded function. In Journal of Combinatorial Optimization, Set (abstract data type) and Job shop scheduling are investigated in conjunction with one another to address concerns in Mathematical optimization research.

  • Combinatorics (55.26%)
  • Theory of computation (51.38%)
  • Discrete mathematics (35.24%)

What are the most cited papers published in the journal?

  • Hybrid Evolutionary Algorithms for Graph Coloring (421 citations)
  • Coverage by directional sensors in randomly deployed wireless sensor networks (346 citations)
  • Pipage Rounding: A New Method of Constructing Algorithms with Proven Performance Guarantee (304 citations)

Research areas of the most cited articles at Journal of Combinatorial Optimization:

The most cited articles aim to foster the development of research in Combinatorics, Theory of computation, Discrete mathematics, Combinatorial optimization and Mathematical optimization. The journal articles explore studies in Theory of computation as part of the wider topic of Algorithm. The studies on Mathematical optimization discussed at the journal publications can also contribute to research in the domains of Vehicle routing problem and Benchmark (computing).

What topics the last edition of the journal is best known for?

  • Artificial intelligence
  • Statistics
  • Algorithm

The previous edition focused in particular on these issues:

The primary areas of discussion in the journal are Theory of computation, Combinatorics, Mathematical optimization, Time complexity and Upper and lower bounds. The Theory of computation study which was featured in the journal aims to expound on the research in Algorithm. Combinatorics research in it involves the investigation of Bounded function studies, all of which are linked to disciplines such as Degree (graph theory).

Journal of Combinatorial Optimization centers on topics in Mathematical optimization, with a focus on Combinatorial optimization. It encompasses Time complexity studies in the context of Discrete mathematics as a whole. While Graph is the key highlight in the journal, it also covered some subjects on Order (ring theory) and Cubic graph.

The most cited articles from the last journal are:

  • Designing emergency flood evacuation plans using robust optimization and artificial intelligence (4 citations)
  • On characterizations for subclasses of directed co-graphs (4 citations)
  • Application of multi-objective optimization algorithm for siting and sizing of distributed generations in distribution networks (3 citations)

Papers citation over time

A key indicator for each journal is its effectiveness in reaching other researchers with the papers published at that venue.

The chart below presents the interquartile range (first quartile 25%, median 50% and third quartile 75%) of the number of citations of articles over time.

The top authors publishing in Journal of Combinatorial Optimization (based on the number of publications) are:

  • Panos M. Pardalos (50 papers) published 1 paper at the last edition, 3 less than at the previous edition,
  • Weili Wu (40 papers) published 1 paper at the last edition,
  • Yinfeng Xu (31 papers) absent at the last edition,
  • Michael A. Henning (27 papers) published 3 papers at the last edition, 1 more than at the previous edition,
  • Weifan Wang (22 papers) published 1 paper at the last edition the same number as at the previous edition.

The overall trend for top authors publishing in this journal is outlined below. The chart shows the number of publications at each edition of the journal for top authors.

Only papers with recognized affiliations are considered

The top affiliations publishing in Journal of Combinatorial Optimization (based on the number of publications) are:

  • University of Florida (65 papers) published 1 paper at the last edition, 3 less than at the previous edition,
  • Zhejiang Normal University (65 papers) published 2 papers at the last edition, 5 less than at the previous edition,
  • University of Texas at Dallas (64 papers) published 1 paper at the last edition, 4 less than at the previous edition,
  • Xi'an Jiaotong University (52 papers) published 4 papers at the last edition, 2 less than at the previous edition,
  • Chinese Academy of Sciences (45 papers) published 6 papers at the last edition, 2 less than at the previous edition.

The overall trend for top affiliations publishing in this journal is outlined below. The chart shows the number of publications at each edition of the journal for top affiliations.

Publication chance based on affiliation

The publication chance index shows the ratio of articles published by the best research institutions in the journal edition to all articles published within that journal. The best research institutions were selected based on the largest number of articles published during all editions of the journal.

The chart below presents the percentage ratio of articles from top institutions (based on their ranking of total papers).Top affiliations were grouped by their rank into the following tiers: top 1-10, top 11-20, top 21-50, and top 51+. Only articles with a recognized affiliation are considered.

During the most recent 2021 edition, 12.34% of publications had an unrecognized affiliation. Out of the publications with recognized affiliations, 14.07% were posted by at least one author from the top 10 institutions publishing in the journal. Another 11.11% included authors affiliated with research institutions from the top 11-20 affiliations. Institutions from the 21-50 range included 17.04% of all publications and 57.78% were from other institutions.

Returning Authors Index

A very common phenomenon observed among researchers publishing scientific articles is the intentional selection of journals they have already attended in the past. In particular, it is worth analyzing the case when the authors participate in the same journal from year to year.

The Returning Authors Index presented below illustrates the ratio of authors who participated in both a given as well as the previous edition of the journal in relation to all participants in a given year.

Returning Institution Index

The graph below shows the Returning Institution Index, illustrating the ratio of institutions that participated in both a given and the previous edition of the conference in relation to all affiliations present in a given year.

The experience to innovation index

Our experience to innovation index was created to show a cross-section of the experience level of authors publishing in a journal. The index includes the authors publishing at the last edition of a journal, grouped by total number of publications throughout their academic career (P) and the total number of citations of these publications ever received (C).

The group intervals were selected empirically to best show the diversity of the authors' experiences, their labels were selected as a convenience, not as judgment. The authors were divided into the following groups:

  • Novice - P < 5 or C < 25 (the number of publications less than 5 or the number of citations less than 25),
  • Competent - P < 10 or C < 100 (the number of publications less than 10 or the number of citations less than 100),
  • Experienced - P < 25 or C < 625 (the number of publications less than 25 or the number of citations less than 625),
  • Master - P < 50 or C < 2500 (the number of publications less than 50 or the number of citations less than 2500),
  • Star - P ≥ 50 and C ≥ 2500 (both the number of publications greater than 50 and the number of citations greater than 2500).

The chart below illustrates experience levels of first authors in cases of publications with multiple authors.

Top Publications

  • Single machine lot scheduling with optional job-rejection

    Baruch Mor;Gur Mosheiov;Dana Shapira

    (2021)
    29 Citations
  • Dynamic three-stage operating room scheduling considering patient waiting time and surgical overtime costs

    Shuwan Zhu;Shuwan Zhu;Wenjuan Fan;Wenjuan Fan;Tongzhu Liu;Shanlin Yang;Shanlin Yang

    (2020)
    27 Citations
  • Compact quadratizations for pseudo-Boolean functions

    Endre Boros;Yves Crama;Elisabeth Rodríguez-Heck

    (2020)
    25 Citations
  • A note on the single machine CON and CONW problems with lot scheduling

    Baruch Mor;Gur Mosheiov

    (2021)
    21 Citations
  • Top-k overlapping densest subgraphs: approximation algorithms and computational complexity

    Riccardo Dondi;Mohammad Mehdi Hosseinzadeh;Giancarlo Mauri;Italo Zoppis

    (2021)
    21 Citations

Related Online Degrees & Career Pathways

For students considering a Computer Science education in the USA, exploring online doctorate programs can be a strategic step toward advanced research and specialized career roles. These programs often offer flexibility without compromising on depth, allowing learners to earn their doctorate at their own pace.

Many professionals also benefit from pursuing online masters degrees that can be completed in just one year. These accelerated programs provide the skills and credentials needed to stay competitive in the fast-changing tech industry, often leading to leadership and innovation opportunities.

Understanding the balance between effort and reward is crucial. Some of the easiest online degrees that pay well include options related to technology and computer science, making them attractive to candidates seeking both financial security and manageable study commitments.

Finally, keeping an eye on the best college majors for the future can help students align their education with emerging industries. Computer Science consistently ranks high due to its role in driving innovation and digital transformation across multiple sectors.

Best Scientists Contributing to This Journal

Recently Published Articles