SIAM Journal on Discrete Mathematics

Papers
(The median citation count of SIAM Journal on Discrete Mathematics is 1. The table below lists those papers that are above that threshold based on CrossRef citation counts [max. 250 papers]. The publications cover those that have been published in the past four years, i.e., from 2021-11-01 to 2025-11-01.)
ArticleCitations
On the Turán Number of Generalized Theta Graphs20
Graphs of Degree at Least \({3}\) with Minimum Algebraic Connectivity19
Rock Extensions with Linear Diameters17
Cayley Sums and Minkowski Sums of Lattice Polytopes17
Approximability of Monotone Submodular Function Maximization under Cardinality and Matroid Constraints in the Streaming Model14
Concepts of Dimension for Convex Geometries13
Fractionally Subadditive Maximization under an Incremental Knapsack Constraint with Applications to Incremental Flows12
Clean Clutters and Dyadic Fractional Packings12
On Powers of Hamilton Cycles in Ramsey–Turán Theory11
Isomorphism Testing Parameterized by Genus and Beyond11
Pure Pairs. IX. Transversal Trees10
Strong Cocomparability Graphs and Slash-Free Orderings of Matrices9
On Bipartite Graph Realizations of a Single Degree Sequence8
On Perles’ Configuration8
Topology of Cut Complexes of Graphs8
A Quantitative Helly-Type Theorem: Containment in a Homothet7
Dividing a Graphical Cake7
Excluding a Clique or a Biclique in Graphs of Bounded Induced Matching Treewidth7
The Lower Bound Theorem for $d$-Polytopes with $2{d}+1$ Vertices7
Letter Graphs and Geometric Grid Classes of Permutations6
On Density of \(\boldsymbol{\mathbb{Z}_3}\) -Flow-Critical Graphs6
Weaver’s Discrepancy for Gaussian Random Vectors6
Degrees of Interior Polynomials and Parking Function Enumerators6
On the Weisfeiler–Leman Dimension of Permutation Graphs6
Online Spanners in Metric Spaces6
Topology of Cut Complexes II6
The Success Probability in Levine’s Hat Problem, and Independent Sets in Graphs6
Tuza’s Conjecture for Binary Geometries6
Turán Densities for Small Hypercubes6
Rapid Mixing of the Switch Markov Chain for 2-Class Joint Degree Matrices6
Matchings, Relaxed Popularity, and Optimality6
Two-Colorings of Normed Spaces without Long Monochromatic Unit Arithmetic Progressions5
Bridge-Depth Characterizes which Minor-Closed Structural Parameterizations of Vertex Cover Admit a Polynomial Kernel5
The Multivariate Schwartz--Zippel Lemma5
Extremal Problems for Hypergraph Blowups of Trees5
On the Size of Matchings in 1-Planar Graph with High Minimum Degree5
Pure Pairs VI: Excluding an Ordered Tree5
On Packing Dijoins in Digraphs and Weighted Digraphs5
When Do Gomory--Hu Subtrees Exist?5
Coloring Tournaments with Few Colors: Algorithms and Complexity5
Cycle Saturation in Random Graphs5
Modules in Robinson Spaces5
Binary Cyclic Transversal Polytopes5
Decomposing Random Permutations into Order-Isomorphic Subpermutations5
Bootstrap Percolation on the High-Dimensional Hamming Graph5
Additive Energy of Polynomial Images5
Circular \({\boldsymbol{(4-\epsilon )}}\) -Coloring of Some Classes of Signed Graphs4
Planarity and Genus of Sparse Random Bipartite Graphs4
Matroids on Eight Elements with the Half-Plane Property and Related Concepts4
The Tropical Critical Points of an Affine Matroid4
The Rainbow Saturation Number Is Linear4
On Ordered Ramsey Numbers of Tripartite 3-Uniform Hypergraphs4
Maximizing Line Subgraphs of Diameter at Most t4
On the PoA Conjecture: Trees versus Biconnected Components4
Packing Signatures in Signed Graphs4
Parameterized Complexity for Finding a Perfect Phylogeny from Mixed Tumor Samples4
Tangles and Hierarchical Clustering4
Reconfiguration of Digraph Homomorphisms4
Planarity via Spanning Tree Number: A Linear-Algebraic Criterion4
Longest Cycle above Erdős–Gallai Bound4
Twin-Width of Subdivisions of Multigraphs4
Partial Reflections and Globally Linked Pairs in Rigid Graphs4
The Spectrum of Triangle-Free Graphs4
Robust Factorizations and Colorings of Tensor Graphs4
Odd Paths, Cycles, and \(T\)-Joins: Connections and Algorithms4
On the Stability of the Graph Independence Number4
Inverse Problems for Discrete Heat Equations and Random Walks for a Class of Graphs4
A Sublinear Bound on the Page Number of Upward Planar Graphs4
Limit Profile for the Transpose Top-2 with Random Shuffle4
Short Rank-Metric Codes and Scattered Subspaces3
Shape Enumerators of Self-Dual NRT Codes over Finite Fields3
Self-Dual Maps I: Antipodality3
Computing Paths of Large Rank in Planar Frameworks Deterministically3
The Ramsey Number for 4-Uniform Tight Cycles3
Efficient Linear and Affine Codes for Correcting Insertions/Deletions3
Improved NP-Hardness of Approximation for Orthogonality Dimension and Minrank3
Tropical Linear Regression and Mean Payoff Games: Or, How to Measure the Distance to Equilibria3
Decompositions of \(q\)-Matroids Using Cyclic Flats3
Edge-Connectivity Augmentation of Simple Graphs3
On Multicolor Ramsey Numbers of Triple System Paths of Length 33
Seymour and Woodall’s Conjecture Holds for Graphs with Independence Number Two3
A Stability Result for \(\boldsymbol{C}_{\boldsymbol{2k+1}}\)-Free Graphs3
On a Conjecture of Feige for Discrete Log-Concave Distributions3
Adapting the Directed Grid Theorem into an FPT Algorithm3
Kinetic Geodesic Voronoi Diagrams in a Simple Polygon3
Hamilton Cycles in Random Digraphs with Minimum Degree at Least One3
Acyclic Colorings of Graphs with Obstructions3
Approximating Submodular \({k}\)-Partition via Principal Partition Sequence3
The Power of the Weisfeiler--Leman Algorithm to Decompose Graphs3
Midpoints of Vertex Pairs of Convex Polytopes3
2-Modular Matrices3
Nonuniform Degrees and Rainbow Versions of the Caccetta–Häggkvist Conjecture3
A Precise Condition for Independent Transversals in Bipartite Covers3
Effective Poset Inequalities3
Bounding and Computing Obstacle Numbers of Graphs3
Invertibility of Digraphs and Tournaments3
Bounding the Number of Edges of Matchstick Graphs3
The $\chi$-Ramsey Problem for Triangle-Free Graphs3
A Proof of the 3/4-Conjecture for the Total Domination Game3
Canonical Theorems for Colored Integers with Respect to Some Linear Combinations3
The Threshold of Symmetry in Random Graphs with Specified Degree Sequences3
Posets and Spaces of $k$-Noncrossing RNA Structures3
M-Convexity of Vexillary Grothendieck Polynomials via Bubbling3
Revisiting and Improving Upper Bounds for Identifying Codes3
A $\frac{4}{3}$-Approximation Algorithm for the Minimum 2-Edge Connected Multisubgraph Problem in the Half-Integral Case3
The Strong Fractional Choice Number and the Strong Fractional Paint Number of Graphs3
Reconstructibility of Matroid Polytopes3
Classification of Finite Highly Regular Vertex-Colored Graphs3
Further Exploiting c-Closure for FPT Algorithms and Kernels for Domination Problems3
Orientation of Fitch Graphs and Reconciliation-Free Inference of Horizontal Gene Transfer in Gene Trees3
Highly Connected Subgraphs with Large Chromatic Number3
Cliques, Chromatic Number, and Independent Sets in the Semi-random Process2
Crux and Long Cycles in Graphs2
Tree-Degenerate Graphs and Nested Dependent Random Choice2
Extremal Problem for Matchings and Rainbow Matchings on Direct Products2
Combinatorial Generation via Permutation Languages. V. Acyclic Orientations2
On Ramsey Size-Linear Graphs and Related Questions2
Chip-Firing and Critical Groups of Signed Graphs2
Disjoint Cycles in a Digraph with Partial Degree2
Matroid Intersection under Restricted Oracles2
Disjoint Cycles with Length Constraints in Digraphs of Large Connectivity or Large Minimum Degree2
A Stability Result on Matchings in 3-Uniform Hypergraphs2
Upper Bounds on Mixing Time of Finite Markov Chains2
A Property on Monochromatic Copies of Graphs Containing a Triangle2
Local Certification of Local Properties: Tight Bounds, Trade-Offs, and New Parameters2
Color-Bias Perfect Matchings in Hypergraphs2
Left-Cut-Percolation and Induced-Sidorenko Bigraphs2
NP-Hardness of Computing PL Geometric Category in Dimension 22
On Covering Segments with Unit Intervals2
Approximate Hypergraph Vertex Cover and Generalized Tuza’s Conjecture2
Convex Characters, Algorithms, and Matchings2
An Algorithm to Recover Shredded Random Matrices2
On the Ramsey–Turán Problem for 4-Cliques2
A Canonical Tree Decomposition for Order Types, and Some Applications2
Globally Rigid Augmentation of Rigid Graphs2
Greedy Causal Discovery Is Geometric2
Hitting Weighted Even Cycles in Planar Graphs2
Computing Twin-Width Parameterized by the Feedback Edge Number and Vertex Integrity2
The Fractional Chromatic Number of \(\boldsymbol{K_{\Delta }}\)-Free Graphs2
Tight Probability Bounds with Pairwise Independence2
The Overfullness of Graphs with Small Minimum Degree and Large Maximum Degree2
Quasirandom-Forcing Orientations of Cycles2
Rainbow Perfect Matchings for 4-Uniform Hypergraphs2
Probability Mass of Rademacher Sums Beyond One Standard Deviation2
Twin-Width of Planar Graphs Is at Most 8, and Some Related Bounds2
On Cliques in Three-Dimensional Dense Point-Line Arrangements2
Corrigendum: Orthogonal Tree-Decompositions of Graphs2
Structured Codes of Graphs2
Ideal Membership Problem over 3-Element CSPs with Dual Discriminator Polymorphism2
Cops and Robbers on \(\boldsymbol{P_5}\)-Free Graphs2
Obviously Strategy-Proof Mechanisms without Money for Scheduling2
On Hop-Constrained Steiner Trees in Tree-Like Metrics2
Constant Congestion Brambles in Directed Graphs2
The Treewidth and Pathwidth of Graph Unions2
Product Structure Extension of the Alon–Seymour–Thomas Theorem2
A Kneser-Type Theorem for Restricted Sumsets2
Sample Compression Schemes for Balls in Graphs2
On Discrete LOG-Brunn--Minkowski Type Inequalities2
Dirac’s Theorem for Linear Hypergraphs2
Graphs with Large Girth and Chromatic Number are Hard for Nullstellensatz2
Extremal Graph Realizations and Graph Laplacian Eigenvalues2
Simple Codes and Sparse Recovery with Fast Decoding2
Sárközy’s Theorem in Various Finite Field Settings2
Stable Approximation Algorithms for Dominating Set and Independent Set2
A Small Maximal Sidon Set in ${\mathbb{Z}}_2^n$2
Distances between Realizations of Order Types2
The Excluded Minors for Three Classes of 2-Polymatroids Having Special Types of Natural Matroids2
Heroes in Orientations of Chordal Graphs2
Poincaré Polynomials of Odd Diagram Classes2
EMSO(FO$^2$) 0-1 Law Fails for All Dense Random Graphs2
Pfaffian Pairs and Parities: Counting on Linear Matroid Intersection and Parity Problems2
Rank-Metric Codes, Semifields, and the Average Critical Problem1
The Dimension of the Region of Feasible Tournament Profiles1
Small Cocircuits in Minimally Vertically 4-Connected Matroids1
Parameterized Max Min Feedback Vertex Set1
Hat Guessing Numbers of Strongly Degenerate Graphs1
Rank of the Vertex-Edge Incidence Matrix of r-Out Hypergraphs1
A Bounded Diameter Strengthening of Kőnig’s Theorem1
Taming Graphs with No Large Creatures and Skinny Ladders1
Characteristic Dependence of Syzygies of Random Monomial Ideals1
Constant-Ratio Approximation for Robust Bin Packing with Budgeted Uncertainty1
Tropicalizing the Graph Profile of Some Almost-Stars1
Kissing Polytopes1
Multiplicative Properties of Hilbert Cubes1
Stochastic Probing with Increasing Precision1
The Discrepancy of Unsatisfiable Matrices and a Lower Bound for the Komlós Conjecture Constant1
Anti-Ramsey Number of Matchings in 3-Uniform Hypergraphs1
Rapid Mixing of \({\boldsymbol{k}}\)-Class Biased Permutations1
Two-Colored Ramsey–Turán Densities Involving Triangles1
Nontrivial t-Intersecting Families for Vector Spaces1
On Dyadic Fractional Packings of $T$-Joins1
A Fixed-Parameter Tractable Algorithm for Elimination Distance to Bounded Degree Graphs1
Group Connectivity in 3-Edge-Connected Signed Graphs1
Recoloring Planar Graphs of Girth at Least Five1
Set-Valued Catalan Combinatorics1
Exchange Distance of Basis Pairs in Split Matroids1
Computational Complexity of Minimal Trap Spaces in Boolean Networks1
Square Coloring Planar Graphs with Automatic Discharging1
Self-Dual Maps II: Links and Symmetry1
Lower Bounds on Lattice Covering Densities of Simplices1
On Graphs Coverable by \({k}\) Shortest Paths1
Circuit Decompositions of Binary Matroids1
A General Framework for Hypergraph Coloring1
Matching of Given Sizes in Hypergraphs1
A Note on Infinite Antichain Density1
Percolation on Random Graphs with a Fixed Degree Sequence1
Independent Sets in Discrete Tori of Odd Sidelength1
A Water-Filling Primal-Dual Algorithm for Approximating NonLinear Covering Problems1
A Simple Proof of the Nonuniform Kahn–Kalai Conjecture1
Digraphs and Variable Degeneracy1
Large Rainbow Cliques in Randomly Perturbed Dense Graphs1
Tverberg Partition Graphs1
On the Erdős–Pósa Property for Long Holes in \(\boldsymbol{C_4}\)-Free Graphs1
The Early Evolution of the Random Graph Process in Planar Graphs and Related Classes1
The Main Zero-Sum Constants over \({\boldsymbol{D}}\) 2n \({\boldsymbol{\times C_2}}\)1
Lattice Size of Plane Convex Bodies1
Algorithmic Applications of Tree-Cut Width1
A Stability Result of the Pósa Lemma1
Functors on Relational Structures Which Admit Both Left and Right Adjoints1
Phase Transitions of Structured Codes of Graphs1
Transversal Hamilton Cycle in Hypergraph Systems1
Solving the Maximum Popular Matching Problem with Matroid Constraints1
The Spectrum of the Grigoriev–Laurent Pseudomoments1
\(\mathcal{P}\)-Matchings Parameterized by Treewidth1
Target Set Selection in Dense Graph Classes1
Don’t Roll the Dice, Ask Twice: The Two-Query Distortion of Matching Problems and Beyond1
The Power of Filling in Balanced Allocations1
Anticoncentration and the Exact Gap-Hamming Problem1
On Multicolor Ramsey Numbers and Subset Coloring of Hypergraphs1
Stability of Large Rainbow Intersecting Families with Product Measure1
Ordered and Colored Subgraph Density Problems1
On the Chromatic Number of Random Regular Hypergraphs1
Perfect Matching and Hamilton Tight Cycle Decomposition of Complete $n$-Balanced $r$-Partite $k$-Uniform Hypergraphs1
Feedback Vertex Set and Even Cycle Transversal for $H$-Free Graphs: Finding Large Block Graphs1
On Isomorphism-Invariant Antistochastic Properties of Random Graphs1
Approximation Algorithms for the Random Field Ising Model1
Reconstructing a Point Set from a Random Subset of Its Pairwise Distances1
Grundy Distinguishes Treewidth from Pathwidth1
Extensions of Discrete Helly Theorems for Boxes1
Phase Transition of Degenerate Turán Problems in \({p}\)-Norms1
Hanani--Tutte and Hierarchical Partial Planarity1
Faster 3-Coloring of Small-Diameter Graphs1
Tropical Lines on Cubic Surfaces1
Euclidean Steiner Spanners: Light and Sparse1
A Menger-Type Theorem for Two Induced Paths1
Rigidity of Balanced Minimal Cycle Complexes1
Chasing Tripods to Obtain a Rooted Subdivision1
On Treewidth and Stable Marriage: Parameterized Algorithms and Hardness Results (Complete Characterization)1
Rigidity of Random Subgraphs and Eigenvalues of Stiffness Matrices1
Bounds on Maximum Weight Directed Cut1
0.58183121681213