SIAM Journal on Discrete Mathematics

Article	Citations
On the Turán Number of Generalized Theta Graphs	20
Graphs of Degree at Least \({3}\) with Minimum Algebraic Connectivity	20
Cayley Sums and Minkowski Sums of Lattice Polytopes	18
Rock Extensions with Linear Diameters	17
Approximability of Monotone Submodular Function Maximization under Cardinality and Matroid Constraints in the Streaming Model	15
Clean Clutters and Dyadic Fractional Packings	13
Concepts of Dimension for Convex Geometries	13
Fractionally Subadditive Maximization under an Incremental Knapsack Constraint with Applications to Incremental Flows	12
On Powers of Hamilton Cycles in Ramsey–Turán Theory	11
Isomorphism Testing Parameterized by Genus and Beyond	11
Strong Cocomparability Graphs and Slash-Free Orderings of Matrices	10
Pure Pairs. IX. Transversal Trees	10
On Bipartite Graph Realizations of a Single Degree Sequence	9
Topology of Cut Complexes of Graphs	9
Excluding a Clique or a Biclique in Graphs of Bounded Induced Matching Treewidth	8
On Perles’ Configuration	8
On Density of \(\boldsymbol{\mathbb{Z}_3}\) -Flow-Critical Graphs	7
The Lower Bound Theorem for $d$-Polytopes with $2{d}+1$ Vertices	7
Tuza’s Conjecture for Binary Geometries	7
Dividing a Graphical Cake	7
Online Spanners in Metric Spaces	7
On the Weisfeiler–Leman Dimension of Permutation Graphs	7
A Quantitative Helly-Type Theorem: Containment in a Homothet	7
Bridge-Depth Characterizes which Minor-Closed Structural Parameterizations of Vertex Cover Admit a Polynomial Kernel	6
Turán Densities for Small Hypercubes	6

Modules in Robinson Spaces	6
The Success Probability in Levine’s Hat Problem, and Independent Sets in Graphs	6
Two-Colorings of Normed Spaces without Long Monochromatic Unit Arithmetic Progressions	6
Additive Energy of Polynomial Images	6
Topology of Cut Complexes II	6
Rapid Mixing of the Switch Markov Chain for 2-Class Joint Degree Matrices	6
On the Size of Matchings in 1-Planar Graph with High Minimum Degree	6
Pure Pairs VI: Excluding an Ordered Tree	6
Weaver’s Discrepancy for Gaussian Random Vectors	6
Degrees of Interior Polynomials and Parking Function Enumerators	6
Cycle Saturation in Random Graphs	6
The Multivariate Schwartz--Zippel Lemma	5
Bootstrap Percolation on the High-Dimensional Hamming Graph	5
Binary Cyclic Transversal Polytopes	5
Odd Paths, Cycles, and \(T\)-Joins: Connections and Algorithms	5
Letter Graphs and Geometric Grid Classes of Permutations	5
Matchings, Relaxed Popularity, and Optimality	5
Extremal Problems for Hypergraph Blowups of Trees	5
Robust Factorizations and Colorings of Tensor Graphs	5
On Packing Dijoins in Digraphs and Weighted Digraphs	5
When Do Gomory--Hu Subtrees Exist?	5
Coloring Tournaments with Few Colors: Algorithms and Complexity	5
Decomposing Random Permutations into Order-Isomorphic Subpermutations	5
A Precise Condition for Independent Transversals in Bipartite Covers	4
Classification of Finite Highly Regular Vertex-Colored Graphs	4
Longest Cycle above Erdős–Gallai Bound	4
Planarity via Spanning Tree Number: A Linear-Algebraic Criterion	4
The Tropical Critical Points of an Affine Matroid	4
Reconfiguration of Digraph Homomorphisms	4
Matroids on Eight Elements with the Half-Plane Property and Related Concepts	4
Limit Profile for the Transpose Top-2 with Random Shuffle	4
The Rainbow Saturation Number Is Linear	4
Bounding the Number of Edges of Matchstick Graphs	4
Inverse Problems for Discrete Heat Equations and Random Walks for a Class of Graphs	4
A Sublinear Bound on the Page Number of Upward Planar Graphs	4
On Ordered Ramsey Numbers of Tripartite 3-Uniform Hypergraphs	4
Circular \({\boldsymbol{(4-\epsilon )}}\) -Coloring of Some Classes of Signed Graphs	4
Planarity and Genus of Sparse Random Bipartite Graphs	4
Partial Reflections and Globally Linked Pairs in Rigid Graphs	4
Tangles and Hierarchical Clustering	4
A $\frac{4}{3}$-Approximation Algorithm for the Minimum 2-Edge Connected Multisubgraph Problem in the Half-Integral Case	4
On Multicolor Ramsey Numbers of Triple System Paths of Length 3	4
Twin-Width of Subdivisions of Multigraphs	4
On the PoA Conjecture: Trees versus Biconnected Components	4
On the Stability of the Graph Independence Number	4
Packing Signatures in Signed Graphs	4
Parameterized Complexity for Finding a Perfect Phylogeny from Mixed Tumor Samples	4
The Spectrum of Triangle-Free Graphs	4
Maximizing Line Subgraphs of Diameter at Most t	4
Hamilton Cycles in Random Digraphs with Minimum Degree at Least One	3

Efficient Linear and Affine Codes for Correcting Insertions/Deletions	3
Revisiting and Improving Upper Bounds for Identifying Codes	3
M-Convexity of Vexillary Grothendieck Polynomials via Bubbling	3
Invertibility of Digraphs and Tournaments	3
Midpoints of Vertex Pairs of Convex Polytopes	3
Further Exploiting c-Closure for FPT Algorithms and Kernels for Domination Problems	3
Tropical Linear Regression and Mean Payoff Games: Or, How to Measure the Distance to Equilibria	3
Shape Enumerators of Self-Dual NRT Codes over Finite Fields	3
On a Conjecture of Feige for Discrete Log-Concave Distributions	3
A Proof of the 3/4-Conjecture for the Total Domination Game	3
A Kneser-Type Theorem for Restricted Sumsets	3
Matroid Intersection under Restricted Oracles	3
Adapting the Directed Grid Theorem into an FPT Algorithm	3
The Power of the Weisfeiler--Leman Algorithm to Decompose Graphs	3
Computing Paths of Large Rank in Planar Frameworks Deterministically	3
Seymour and Woodall’s Conjecture Holds for Graphs with Independence Number Two	3
The Threshold of Symmetry in Random Graphs with Specified Degree Sequences	3
Ideal Membership Problem over 3-Element CSPs with Dual Discriminator Polymorphism	3
Nonuniform Degrees and Rainbow Versions of the Caccetta–Häggkvist Conjecture	3
The Strong Fractional Choice Number and the Strong Fractional Paint Number of Graphs	3
Decompositions of \(q\)-Matroids Using Cyclic Flats	3
Canonical Theorems for Colored Integers with Respect to Some Linear Combinations	3
Reconstructibility of Matroid Polytopes	3
Bounding and Computing Obstacle Numbers of Graphs	3
On Ramsey Size-Linear Graphs and Related Questions	3
Extremal Problem for Matchings and Rainbow Matchings on Direct Products	3
On Discrete LOG-Brunn--Minkowski Type Inequalities	3
Posets and Spaces of $k$-Noncrossing RNA Structures	3
Self-Dual Maps I: Antipodality	3
A Stability Result for \(\boldsymbol{C}_{\boldsymbol{2k+1}}\)-Free Graphs	3
Acyclic Colorings of Graphs with Obstructions	3
Computing Twin-Width Parameterized by the Feedback Edge Number and Vertex Integrity	3
Approximating Submodular \({k}\)-Partition via Principal Partition Sequence	3
2-Modular Matrices	3
The $\chi$-Ramsey Problem for Triangle-Free Graphs	3
Effective Poset Inequalities	3
Orientation of Fitch Graphs and Reconciliation-Free Inference of Horizontal Gene Transfer in Gene Trees	3
Highly Connected Subgraphs with Large Chromatic Number	3
The Ramsey Number for 4-Uniform Tight Cycles	3
Improved NP-Hardness of Approximation for Orthogonality Dimension and Minrank	3
Short Rank-Metric Codes and Scattered Subspaces	3
Greedy Causal Discovery Is Geometric	3
Edge-Connectivity Augmentation of Simple Graphs	3
On Supersaturation for Oddtown and Eventown	3
Kinetic Geodesic Voronoi Diagrams in a Simple Polygon	3
Tree-Degenerate Graphs and Nested Dependent Random Choice	2
Disjoint Cycles in a Digraph with Partial Degree	2
Multiplicative Properties of Hilbert Cubes	2
Tight Probability Bounds with Pairwise Independence	2
Quasirandom-Forcing Orientations of Cycles	2
A Small Maximal Sidon Set in ${\mathbb{Z}}_2^n$	2
Local Certification of Local Properties: Tight Bounds, Trade-Offs, and New Parameters	2
The Early Evolution of the Random Graph Process in Planar Graphs and Related Classes	2
Cliques, Chromatic Number, and Independent Sets in the Semi-random Process	2
Pfaffian Pairs and Parities: Counting on Linear Matroid Intersection and Parity Problems	2
Disjoint Cycles with Length Constraints in Digraphs of Large Connectivity or Large Minimum Degree	2
Poincaré Polynomials of Odd Diagram Classes	2
On Covering Segments with Unit Intervals	2
Convex Characters, Algorithms, and Matchings	2
Product Structure Extension of the Alon–Seymour–Thomas Theorem	2
The Treewidth and Pathwidth of Graph Unions	2
Left-Cut-Percolation and Induced-Sidorenko Bigraphs	2
NP-Hardness of Computing PL Geometric Category in Dimension 2	2
Crux and Long Cycles in Graphs	2
Functors on Relational Structures Which Admit Both Left and Right Adjoints	2
Heroes in Orientations of Chordal Graphs	2
Anti-Ramsey Number of Matchings in 3-Uniform Hypergraphs	2
On Hop-Constrained Steiner Trees in Tree-Like Metrics	2
On Isomorphism-Invariant Antistochastic Properties of Random Graphs	2
Constant Congestion Brambles in Directed Graphs	2
Sárközy’s Theorem in Various Finite Field Settings	2
A Property on Monochromatic Copies of Graphs Containing a Triangle	2
Dirac’s Theorem for Linear Hypergraphs	2
On Cliques in Three-Dimensional Dense Point-Line Arrangements	2
Simple Codes and Sparse Recovery with Fast Decoding	2
An Algorithm to Recover Shredded Random Matrices	2
Upper Bounds on Mixing Time of Finite Markov Chains	2
Hitting Weighted Even Cycles in Planar Graphs	2
The Fractional Chromatic Number of \(\boldsymbol{K_{\Delta }}\)-Free Graphs	2
Obviously Strategy-Proof Mechanisms without Money for Scheduling	2

Combinatorial Generation via Permutation Languages. V. Acyclic Orientations	2
A Canonical Tree Decomposition for Order Types, and Some Applications	2
Distances between Realizations of Order Types	2
Color-Bias Perfect Matchings in Hypergraphs	2
Hanani--Tutte and Hierarchical Partial Planarity	2
Twin-Width of Planar Graphs Is at Most 8, and Some Related Bounds	2
Grundy Distinguishes Treewidth from Pathwidth	2
Extremal Graph Realizations and Graph Laplacian Eigenvalues	2
A Stability Result on Matchings in 3-Uniform Hypergraphs	2
Cops and Robbers on \(\boldsymbol{P_5}\)-Free Graphs	2
Globally Rigid Augmentation of Rigid Graphs	2
Probability Mass of Rademacher Sums Beyond One Standard Deviation	2
Rainbow Perfect Matchings for 4-Uniform Hypergraphs	2
Sample Compression Schemes for Balls in Graphs	2
The Overfullness of Graphs with Small Minimum Degree and Large Maximum Degree	2
Approximate Hypergraph Vertex Cover and Generalized Tuza’s Conjecture	2
Corrigendum: Orthogonal Tree-Decompositions of Graphs	2
Structured Codes of Graphs	2
EMSO(FO$^2$) 0-1 Law Fails for All Dense Random Graphs	2
On the Ramsey–Turán Problem for 4-Cliques	2
The Excluded Minors for Three Classes of 2-Polymatroids Having Special Types of Natural Matroids	2
Graphs with Large Girth and Chromatic Number are Hard for Nullstellensatz	2
Stable Approximation Algorithms for Dominating Set and Independent Set	2
Chip-Firing and Critical Groups of Signed Graphs	2