SIAM Journal on Discrete Mathematics

Aims & Scope

SIAM Journal on Discrete Mathematics (SIDMA) publishes research papers of exceptional quality in pure and applied discrete mathematics, broadly interpreted.

The journal's focus is primarily theoretical rather than empirical, but the editors welcome papers that evolve from or have potential application to real-world problems.

Submissions must be clearly written and make a significant contribution.

Topics include but are not limited to: properties of and extremal problems for discrete structures combinatorial optimization, including approximation algorithms algebraic and enumerative combinatorics coding and information theory additive, analytic combinatorics and number theory combinatorial matrix theory and spectral graph theory design and analysis of algorithms for discrete structures discrete problems in computational complexity discrete and computational geometry discrete methods in computational biology, and bioinformatics probabilistic methods and randomized algorithms.

View Aims & Scope

---

Metrics & Ranking

Impact Factor

Year	Value
2025	1
2024	0.90

SJR (SCImago Journal Rank)

Year	Value
2024	1.094

Quartile

Year	Value
2024	Q1

h-index

Year	Value
2024	72

Journal Rank

Year	Value
2024	4169

Journal Citation Indicator

Year	Value
2024	507

---

---

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 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.

• A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems

  Citation: 626

  Authors: Hanif D., Warren P.

• Labelling Graphs with a Condition at Distance 2

  Citation: 529

  Authors: Jerrold R., Roger K.

• Comparing Top<i>k</i>Lists

  Citation: 515

  Authors: Ronald, Ravi, D.

• Singularity Analysis of Generating Functions

  Citation: 470

  Authors: Philippe, Andrew

• A Mathematical Model for Periodic Scheduling Problems

  Citation: 377

  Authors: Paolo, Walter

• The Laplacian Spectrum of a Graph II

  Citation: 311

  Authors: Robert, Russell

• On the Metric Dimension of Cartesian Products of Graphs

  Citation: 307

  Authors: José, Carmen, Mercè, Ignacio M., María L., Carlos, David R.

• Sorting by Transpositions

  Citation: 298

  Authors: Vineet, Pavel A.

• The $L(2,1)$-Labeling Problem on Graphs

  Citation: 270

  Authors: Gerard J., David

• Computing Edge-Connectivity in Multigraphs and Capacitated Graphs

  Citation: 252

  Authors: Hiroshi, Toshihide

---