Combinatorics Probability and Computing

Aims & Scope

Published bimonthly, Combinatorics, Probability & Computing is devoted to the three areas of combinatorics, probability theory and theoretical computer science.

Topics covered include classical and algebraic graph theory, extremal set theory, matroid theory, probabilistic methods and random combinatorial structures; combinatorial probability and limit theorems for random combinatorial structures; the theory of algorithms (including complexity theory), randomised algorithms, probabilistic analysis of algorithms, computational learning theory and optimisation.

View Aims & Scope

---

Metrics & Ranking

SJR (SCImago Journal Rank)

Year	Value
2024	1.133

Quartile

Year	Value
2024	Q1

h-index

Year	Value
2024	58

Journal Rank

Year	Value
2024	3934

Journal Citation Indicator

Year	Value
2024	133

Impact Factor

Year	Value
2024	0.90

---

---

Abstracting & Indexing

Journal is indexed in leading academic databases, ensuring global visibility and accessibility of our peer-reviewed research.

• Scopus
• Google Scholar
• Web of Science

---

Subjects & Keywords

Journal’s research areas, covering key disciplines and specialized sub-topics in Computer Science and Mathematics, designed to support cutting-edge academic discovery.

---

Most Cited Articles

The Most Cited Articles section features the journal's most impactful research, based on citation counts. These articles have been referenced frequently by other researchers, indicating their significant contribution to their respective fields.

• The Size of the Giant Component of a Random Graph with a Given Degree Sequence

  Citation: 571

  Authors: MICHAEL, BRUCE

• Combinatorial Nullstellensatz

  Citation: 440

  Authors: NOGA

• Improved Bounds for Mixing Rates of Markov Chains and Multicommodity Flow

  Citation: 259

  Authors: Alistair

• Tight Bounds on the Optimization Time of a Randomized Search Heuristic on Linear Functions

  Citation: 172

  Authors: CARSTEN

• Crossing Numbers and Hard ErdÅ‘s Problems in Discrete Geometry

  Citation: 171

  Authors: LÁSZLÓ A.

• Generating Random Regular Graphs Quickly

  Citation: 161

  Authors: A., N. C.

• A Dirac-Type Theorem for 3-Uniform Hypergraphs

  Citation: 153

  Authors: VOJTÄšCH, ANDRZEJ, ENDRE

• Some Inequalities for the Largest Eigenvalue of a Graph

  Citation: 152

  Authors: V.

• Boltzmann Samplers for the Random Generation of Combinatorial Structures

  Citation: 149

  Authors: PHILIPPE, PHILIPPE, GUY, GILLES

• Asymptotic Enumeration of Spanning Trees

  Citation: 140

  Authors: RUSSELL

---