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 2022-05-01 to 2026-05-01.)
ArticleCitations
Graphs of Degree at Least \({3}\) with Minimum Algebraic Connectivity23
Cayley Sums and Minkowski Sums of Lattice Polytopes22
Excluding a Clique or a Biclique in Graphs of Bounded Induced Matching Treewidth19
Fractionally Subadditive Maximization under an Incremental Knapsack Constraint with Applications to Incremental Flows17
Pure Pairs. IX. Transversal Trees14
On Powers of Hamilton Cycles in Ramsey–Turán Theory14
Strong Cocomparability Graphs and Slash-Free Orderings of Matrices14
Topology of Cut Complexes of Graphs13
On Bipartite Graph Realizations of a Single Degree Sequence13
Dividing a Graphical Cake10
On Perles’ Configuration10
Rock Extensions with Linear Diameters10
On the Turán Number of Generalized Theta Graphs9
Concepts of Dimension for Convex Geometries9
Isomorphism Testing Parameterized by Genus and Beyond9
On the Weisfeiler–Leman Dimension of Permutation Graphs8
On Density of \(\boldsymbol{\mathbb{Z}_3}\) -Flow-Critical Graphs8
Reconstructing Almost All of a Point Set in \(\boldsymbol{\mathbb{R}}\) d from Randomly Revealed P8
Tuza’s Conjecture for Binary Geometries8
Monotonic Decompositions of Submodular Set Functions8
Additive Energy of Polynomial Images7
Topology of Cut Complexes II7
Online Spanners in Metric Spaces7
Bridge-Depth Characterizes which Minor-Closed Structural Parameterizations of Vertex Cover Admit a Polynomial Kernel7
Turán Densities for Small Hypercubes7
Weaver’s Discrepancy for Gaussian Random Vectors7
Degrees of Interior Polynomials and Parking Function Enumerators6
The Success Probability in Levine’s Hat Problem, and Independent Sets in Graphs6
Bootstrap Percolation on the High-Dimensional Hamming Graph6
Modules in Robinson Spaces6
On the Size of Matchings in 1-Planar Graph with High Minimum Degree6
On Packing Dijoins in Digraphs and Weighted Digraphs6
Cycle Saturation in Random Graphs6
Two-Colorings of Normed Spaces without Long Monochromatic Unit Arithmetic Progressions6
Letter Graphs and Geometric Grid Classes of Permutations6
The Lower Bound Theorem for $d$-Polytopes with $2{d}+1$ Vertices5
Extremal Problems for Hypergraph Blowups of Trees5
Parameterized Complexity for Finding a Perfect Phylogeny from Mixed Tumor Samples5
Robust Factorizations and Colorings of Tensor Graphs5
Planarity and Genus of Sparse Random Bipartite Graphs5
Partial Reflections and Globally Linked Pairs in Rigid Graphs5
The Rainbow Saturation Number Is Linear5
When Do Gomory--Hu Subtrees Exist?5
Matchings, Relaxed Popularity, and Optimality5
Reconfiguration of Digraph Homomorphisms5
Limit Profile for the Transpose Top-2 with Random Shuffle5
Circular \({\boldsymbol{(4-\epsilon )}}\) -Coloring of Some Classes of Signed Graphs5
A Sublinear Bound on the Page Number of Upward Planar Graphs5
The Tropical Critical Points of an Affine Matroid5
Odd Paths, Cycles, and \(T\)-Joins: Connections and Algorithms5
Decomposing Random Permutations into Order-Isomorphic Subpermutations5
Binary Cyclic Transversal Polytopes5
Coloring Tournaments with Few Colors: Algorithms and Complexity5
Matroids on Eight Elements with the Half-Plane Property and Related Concepts5
Planarity via Spanning Tree Number: A Linear-Algebraic Criterion5
Longest Cycle above Erdős–Gallai Bound5
Tangles and Hierarchical Clustering5
Approximating Submodular \({k}\)-Partition via Principal Partition Sequence4
Tropical Linear Regression and Mean Payoff Games: Or, How to Measure the Distance to Equilibria4
Classification of Finite Highly Regular Vertex-Colored Graphs4
Packing Signatures in Signed Graphs4
The Threshold of Symmetry in Random Graphs with Specified Degree Sequences4
M-Convexity of Vexillary Grothendieck Polynomials via Bubbling4
On Off-Diagonal F -Ramsey Numbers4
Hamilton Cycles in Random Digraphs with Minimum Degree at Least One4
Posets and Spaces of $k$-Noncrossing RNA Structures4
Acyclic Colorings of Graphs with Obstructions4
Midpoints of Vertex Pairs of Convex Polytopes4
Decompositions of \(q\)-Matroids Using Cyclic Flats4
Twin-Width of Subdivisions of Multigraphs4
The Spectrum of Triangle-Free Graphs4
On Multicolor Ramsey Numbers of Triple System Paths of Length 34
Nonuniform Degrees and Rainbow Versions of the Caccetta–Häggkvist Conjecture4
On Supersaturation for Oddtown and Eventown4
Computing Paths of Large Rank in Planar Frameworks Deterministically4
Efficient Linear and Affine Codes for Correcting Insertions/Deletions4
Orientation of Fitch Graphs and Reconciliation-Free Inference of Horizontal Gene Transfer in Gene Trees4
A $\frac{4}{3}$-Approximation Algorithm for the Minimum 2-Edge Connected Multisubgraph Problem in the Half-Integral Case4
Inverse Problems for Discrete Heat Equations and Random Walks for a Class of Graphs4
On the PoA Conjecture: Trees versus Biconnected Components4
A Precise Condition for Independent Transversals in Bipartite Covers4
The Ramsey Number for 4-Uniform Tight Cycles4
Kinetic Geodesic Voronoi Diagrams in a Simple Polygon4
On a Conjecture of Feige for Discrete Log-Concave Distributions4
Canonical Theorems for Colored Integers with Respect to Some Linear Combinations3
Extremal Problem for Matchings and Rainbow Matchings on Direct Products3
A Kneser-Type Theorem for Restricted Sumsets3
Unavoidable Cycle-Contraction Minors of Large 2-Connected Graphs3
Graphs with Large Girth and Chromatic Number are Hard for Nullstellensatz3
Corrigendum: Orthogonal Tree-Decompositions of Graphs3
EMSO(FO$^2$) 0-1 Law Fails for All Dense Random Graphs3
Obviously Strategy-Proof Mechanisms without Money for Scheduling3
Seymour and Woodall’s Conjecture Holds for Graphs with Independence Number Two3
On the Ramsey–Turán Problem for 4-Cliques3
Edge-Connectivity Augmentation of Simple Graphs3
Computing Twin-Width Parameterized by the Feedback Edge Number and Vertex Integrity3
Adapting the Directed Grid Theorem into an FPT Algorithm3
A Proof of the 3/4-Conjecture for the Total Domination Game3
Shape Enumerators of Self-Dual NRT Codes over Finite Fields3
Invertibility of Digraphs and Tournaments3
On Discrete LOG-Brunn--Minkowski Type Inequalities3
On Ramsey Size-Linear Graphs and Related Questions3
Disjoint Cycles with Length Constraints in Digraphs of Large Connectivity or Large Minimum Degree3
On Covering Segments with Unit Intervals3
Simple Codes and Sparse Recovery with Fast Decoding3
Effective Poset Inequalities3
Cliques, Chromatic Number, and Independent Sets in the Semi-random Process3
Further Exploiting c-Closure for FPT Algorithms and Kernels for Domination Problems3
Improved NP-Hardness of Approximation for Orthogonality Dimension and Minrank3
The Strong Fractional Choice Number and the Strong Fractional Paint Number of Graphs3
A Stability Result for \(\boldsymbol{C}_{\boldsymbol{2k+1}}\)-Free Graphs3
Self-Dual Maps I: Antipodality3
Revisiting and Improving Upper Bounds for Identifying Codes3
Greedy Causal Discovery Is Geometric3
The Treewidth and Pathwidth of Graph Unions3
Local Certification of Local Properties: Tight Bounds, Trade-Offs, and New Parameters3
Upper Bounds on Mixing Time of Finite Markov Chains3
The Fractional Chromatic Number of \(\boldsymbol{K_{\Delta }}\)-Free Graphs3
Convex Characters, Algorithms, and Matchings3
Long Induced Paths and Forbidden Patterns: Polylogarithmic Bounds3
Ideal Membership Problem over 3-Element CSPs with Dual Discriminator Polymorphism3
2-Modular Matrices3
Matroid Intersection under Restricted Oracles3
Bounding and Computing Obstacle Numbers of Graphs3
Short Rank-Metric Codes and Scattered Subspaces3
Highly Connected Subgraphs with Large Chromatic Number3
Grundy Distinguishes Treewidth from Pathwidth2
Globally Rigid Augmentation of Rigid Graphs2
Sárközy’s Theorem in Various Finite Field Settings2
Extremal Graph Realizations and Graph Laplacian Eigenvalues2
A Small Maximal Sidon Set in ${\mathbb{Z}}_2^n$2
The Overfullness of Graphs with Small Minimum Degree and Large Maximum Degree2
The Early Evolution of the Random Graph Process in Planar Graphs and Related Classes2
Hitting Weighted Even Cycles in Planar Graphs2
Twin-Width of Planar Graphs Is at Most 8, and Some Related Bounds2
On Isomorphism-Invariant Antistochastic Properties of Random Graphs2
Approximate Hypergraph Vertex Cover and Generalized Tuza’s Conjecture2
Sample Compression Schemes for Balls in Graphs2
Quickly Excluding an Apex-Forest2
Hanani--Tutte and Hierarchical Partial Planarity2
The Degrees of Regular Polytopes of Type [4, 4, 4]2
The Excluded Minors for Three Classes of 2-Polymatroids Having Special Types of Natural Matroids2
Quasirandom-Forcing Orientations of Cycles2
Left-Cut-Percolation and Induced-Sidorenko Bigraphs2
Anti-Ramsey Number of Matchings in 3-Uniform Hypergraphs2
Crux and Long Cycles in Graphs2
Functors on Relational Structures Which Admit Both Left and Right Adjoints2
A Menger-Type Theorem for Two Induced Paths2
On Hop-Constrained Steiner Trees in Tree-Like Metrics2
Cops and Robbers on \(\boldsymbol{P_5}\)-Free Graphs2
Dirac’s Theorem for Linear Hypergraphs2
Color-Bias Perfect Matchings in Hypergraphs2
Tree-Degenerate Graphs and Nested Dependent Random Choice2
Heroes in Orientations of Chordal Graphs2
Algorithmic Applications of Tree-Cut Width2
Pfaffian Pairs and Parities: Counting on Linear Matroid Intersection and Parity Problems2
Stable Approximation Algorithms for Dominating Set and Independent Set2
Combinatorial Generation via Permutation Languages. V. Acyclic Orientations2
A Canonical Tree Decomposition for Order Types, and Some Applications2
Improved Approximation Algorithms for the Expanding Search Problem2
On Cliques in Three-Dimensional Dense Point-Line Arrangements2
Solving the Maximum Popular Matching Problem with Matroid Constraints2
Phase Transitions of Structured Codes of Graphs2
Don’t Roll the Dice, Ask Twice: The Two-Query Distortion of Matching Problems and Beyond2
Structured Codes of Graphs2
A Stability Result on Matchings in 3-Uniform Hypergraphs2
Rainbow Perfect Matchings for 4-Uniform Hypergraphs2
Chasing Tripods to Obtain a Rooted Subdivision2
A Property on Monochromatic Copies of Graphs Containing a Triangle2
Tight Probability Bounds with Pairwise Independence2
Probability Mass of Rademacher Sums Beyond One Standard Deviation2
Disjoint Cycles in a Digraph with Partial Degree2
Euclidean Steiner Spanners: Light and Sparse2
Chip-Firing and Critical Groups of Signed Graphs2
Three Applications of Coverings to Difference Patterns2
Large Rainbow Cliques in Randomly Perturbed Dense Graphs2
An Algorithm to Recover Shredded Random Matrices2
Distances between Realizations of Order Types2
NP-Hardness of Computing PL Geometric Category in Dimension 22
Product Structure Extension of the Alon–Seymour–Thomas Theorem2
Online Assortment and Market Segmentation under Bertrand Competition with Set-Dependent Revenues2
Set-Valued Catalan Combinatorics2
Group Connectivity in 3-Edge-Connected Signed Graphs2
Transversal Numbers of Simplicial Polytopes, Spheres, and Pure Complexes2
Poincaré Polynomials of Odd Diagram Classes2
Nontrivial t-Intersecting Families for Vector Spaces2
A Stability Result of the Pósa Lemma1
A Water-Filling Primal-Dual Algorithm for Approximating NonLinear Covering Problems1
Transversal Hamilton Cycle in Hypergraph Systems1
Rapid Mixing of \({\boldsymbol{k}}\)-Class Biased Permutations1
Maximum Weight Codewords of a Linear Rank-Metric Code1
The Dimension of the Region of Feasible Tournament Profiles1
Minimal Ramsey Graphs with Many Vertices of Small Degree1
Intertwining Connectivities for Vertex-Minors and Pivot-Minors1
A Point-Variety Incidence Theorem over Finite Fields, and Its Applications1
Self-Dual Maps II: Links and Symmetry1
Refinement on Spectral Turán’s Theorem1
Hypergraph Horn Functions1
On Vietoris–Rips Complexes (with Scale 3) of Hypercube Graphs1
On Dyadic Fractional Packings of $T$-Joins1
The Phase Transition of Discrepancy in Random Hypergraphs1
On Graphs Coverable by \({k}\) Shortest Paths1
Rank-Metric Codes, Semifields, and the Average Critical Problem1
On the Erdős–Pósa Property for Long Holes in \(\boldsymbol{C_4}\)-Free Graphs1
Tropicalizing the Graph Profile of Some Almost-Stars1
Lower Bounds on Lattice Covering Densities of Simplices1
Giant Components in Random Temporal Graphs1
On the Chromatic Number of Random Regular Hypergraphs1
The Spectrum of the Grigoriev–Laurent Pseudomoments1
Stochastic Probing with Increasing Precision1
Search-Space Reduction via Essential Vertices1
Rigidity of Balanced Minimal Cycle Complexes1
Ehrhart Bounds for Panhandle and Paving Matroids through Enumeration of Chain Forests1
On Induced Paths, Holes, and Trees in Random Graphs1
The Flow Index of Regular Class I Graphs1
Brillouin Zones of Integer Lattices and Their Perturbations1
Lower Bounds for Maximum Weighted Cut1
A General Family of MSRD Codes and PMDS Codes with Smaller Field Sizes from Extended Moore Matrices1
Recoloring Planar Graphs of Girth at Least Five1
Computational Complexity of Minimal Trap Spaces in Boolean Networks1
Unavoidable Induced Subgraphs of Large 2-Connected Graphs1
The Main Zero-Sum Constants over \({\boldsymbol{D}}\) 2n \({\boldsymbol{\times C_2}}\)1
The Smallest Classes of Binary and Ternary Matroids Closed under Direct Sums and Complements1
Extensions of Discrete Helly Theorems for Boxes1
The Discrepancy of Unsatisfiable Matrices and a Lower Bound for the Komlós Conjecture Constant1
Hat Guessing Numbers of Strongly Degenerate Graphs1
Approximation Algorithms for the Random Field Ising Model1
Taming Graphs with No Large Creatures and Skinny Ladders1
A Bounded Diameter Strengthening of Kőnig’s Theorem1
Constant-Ratio Approximation for Robust Bin Packing with Budgeted Uncertainty1
Exchange Distance of Basis Pairs in Split Matroids1
Tverberg Partition Graphs1
Faster 3-Coloring of Small-Diameter Graphs1
A Simple Proof of the Nonuniform Kahn–Kalai Conjecture1
Anti-Ramsey Number of Edge-Disjoint Rainbow Spanning Trees in All Graphs1
On the Turán Number of Edge Blow-Ups of Cliques1
Noncrossing Partitions of a Marked Surface1
\(\mathcal{P}\)-Matchings Parameterized by Treewidth1
Marked Graphs and the Chromatic Symmetric Function1
The Structure of $I_4$-Free and Triangle-Free Binary Matroids1
Tight Analysis of the Lazy Algorithm for Open Online Dial-a-Ride1
Edges Not Covered by Monochromatic Bipartite Graph1
On \({\boldsymbol q}\)-Counting of Noncrossing Chains and Parking Functions1
Hardness of Finding Combinatorial Shortest Paths on Graph Associahedra1
Densest Subgraphs of a Dense Erdös–Rényi Graph. Asymptotics, Landscape, and Universality1
Phase Transition of Degenerate Turán Problems in \({p}\)-Norms1
Stability of Large Rainbow Intersecting Families with Product Measure1
A General Framework for Hypergraph Coloring1
Square Coloring Planar Graphs with Automatic Discharging1
Two-Colored Ramsey–Turán Densities Involving Triangles1
0.37998700141907