World's Best Scientists 2026 revealed!
Combinatorics Probability and Computing
H-index 11

Combinatorics Probability and Computing

0963-5483

Published by: Cambridge University Press

http://journals.cambridge.org/action/displayJournal?jid=CPC

Ranking & Metrics

Discipline name Position Best Scientists Publications D-Index
Mathematics 298 36 63 9
Computer Science 578 25 46 10
Engineering and Technology 1315 8 18 4

Additional Metrics

Number of Best Scientists*: 47
Documents by Best Scientists*: 76
Top 100 Ranked Scientists*: 3
SCIMAGO H-index: 58
SCIMAGO SJR: 1.133
Impact Factor: N/A

Overview

Top Research Topics at Combinatorics, Probability & Computing?

Combinatorics, Probability & Computing mainly tackles studies in Combinatorics, Discrete mathematics, Graph, Conjecture and Random graph. Topics in Combinatorics were tackled in line with various other fields like Upper and lower bounds and Humanities. The Discrete mathematics research presented places emphasis on topics like Random regular graph, Vertex (graph theory), Chordal graph, Bipartite graph and Graph power.

  • Combinatorics (98.71%)
  • Discrete mathematics (32.59%)
  • Graph (13.64%)

What are the most cited papers published in the journal?

  • The Size of the Giant Component of a Random Graph with a Given Degree Sequence (716 citations)
  • Improved Bounds for Mixing Rates of Markov Chains and Multicommodity Flow (433 citations)
  • Boltzmann Samplers for the Random Generation of Combinatorial Structures (285 citations)

Research areas of the most cited articles at Combinatorics, Probability & Computing:

The most cited articles are organized to address concerns in the fields of Combinatorics, Discrete mathematics, Graph, Random graph and Conjecture. The works on Combinatorics tackled in the most cited papers bring together disciplines like Upper and lower bounds and Constant (mathematics). Chromatic scale and Degree (graph theory) are some topics wherein Discrete mathematics research discussed in the journal papers has an impact.

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

  • Combinatorics
  • Quantum mechanics
  • Algebra

The previous edition focused in particular on these issues:

Combinatorics, Humanities, Conjecture, Graph and Degree (graph theory) are among the topics commonly tackled in the journal. In the journal, Upper and lower bounds, Bounded function and Constant (mathematics) are investigated in conjunction with one another to address concerns in Combinatorics research. Topics in Conjecture explored in Combinatorics, Probability & Computing were investigated in conjunction with research in Hypergraph, Resilience (materials science), Random matrix, Matrix (mathematics) and Hamiltonian (control theory).

Graph research presented in the journal encompasses a variety of subjects, including Disjoint sets, Eigenvalues and eigenvectors and Stability theorem. In addition to Degree (graph theory) research, Combinatorics, Probability & Computing aims to explore topics under Minor (linear algebra) and Girth (graph theory). The study of Random graph and how it intertwines with concepts under Function (mathematics) were explored in the presented Graph (abstract data type) research.

The most cited articles from the last journal are:

  • Eigenvalues and triangles in graphs (13 citations)
  • Generalizations of the Ruzsa–Szemerédi and rainbow Turán problems for cliques (7 citations)
  • Making Kr+1-Free Graphs r-partite (5 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 Combinatorics, Probability & Computing (based on the number of publications) are:

  • Benny Sudakov (30 papers) published 2 papers at the last edition the same number as at the previous edition,
  • Noga Alon (30 papers) published 1 paper at the last edition the same number as at the previous edition,
  • Alan Frieze (26 papers) absent at the last edition,
  • Svante Janson (23 papers) published 2 papers at the last edition,
  • Michael Krivelevich (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 Combinatorics, Probability & Computing (based on the number of publications) are:

  • Tel Aviv University (64 papers) published 1 paper at the last edition, 1 less than at the previous edition,
  • University of Cambridge (53 papers) published 1 paper at the last edition the same number as at the previous edition,
  • University of Illinois at Urbana–Champaign (43 papers) published 1 paper at the last edition,
  • University of Oxford (38 papers) published 2 papers at the last edition the same number as at the previous edition,
  • Carnegie Mellon University (36 papers) absent at the last 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, 58.26% of publications had an unrecognized affiliation. Out of the publications with recognized affiliations, 14.58% were posted by at least one author from the top 10 institutions publishing in the journal. Another 8.33% included authors affiliated with research institutions from the top 11-20 affiliations. Institutions from the 21-50 range included 16.67% of all publications and 60.42% 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

  • Concentration functions and entropy bounds for discrete log-concave distributions

    Sergey G. Bobkov;Arnaud Marsiglietti;James C Melbourne

    (2021)
    21 Citations
  • A discrepancy version of the Hajnal–Szemerédi theorem

    József Balogh;Béla Csaba;András Pluhár;Andrew Treglown

    (2021)
    20 Citations
  • Clustered 3-colouring graphs of bounded degree

    Vida Dujmović;Louis Esperet;Pat Morin;Bartosz Walczak

    (2021)
    20 Citations
  • Edge-statistics on large graphs

    Noga Alon;Dan Hefetz;Michael Krivelevich;Mykhaylo Tyomkyn

    (2020)
    16 Citations
  • Asymptotics for the number of standard tableaux of skew shape and for weighted lozenge tilings

    Alejandro H. Morales;Igor Pak;Martin Tassy

    (2021)
    15 Citations
  • Approximately counting bases of bicircular matroids

    Heng Guo;Mark Jerrum

    (2021)
    15 Citations
  • Turán numbers of theta graphs

    Boris Bukh;Michael Tait

    (2020)
    15 Citations

Related Online Degrees & Career Pathways

Pursuing a degree in Computer Science in the USA is just the beginning of a dynamic career journey. For students seeking flexibility, exploring some of the easiest online degree options can provide a smoother entry into higher education, especially for those balancing work or personal commitments.

Accelerated learning paths such as accelerated associates degree online programs enable students to complete foundational coursework quickly. These programs can be a smart step before advancing to a bachelor’s degree, making efficient use of time and resources.

For those ready to earn a full undergraduate credential, there are numerous online bachelor's degree programs tailored to fit busy schedules without sacrificing quality. These offer the flexibility to gain crucial skills in areas like software development, data science, and cybersecurity.

Considering career outcomes, it’s useful to focus on degrees known for strong earning potential. Computer Science consistently ranks among the highest earning degrees, underscoring the value of investing in this field and its related career pathways.

Best Scientists Contributing to This Journal