SIAM Journal on Discrete Mathematics

Article	Citations
Cayley Sums and Minkowski Sums of Lattice Polytopes	29
On Powers of Hamilton Cycles in Ramsey–Turán Theory	25
Pure Pairs. IX. Transversal Trees	20
Strong Cocomparability Graphs and Slash-Free Orderings of Matrices	19
On Bipartite Graph Realizations of a Single Degree Sequence	16
On Perles’ Configuration	15
Rock Extensions with Linear Diameters	14
Reconstructing Almost All of a Point Set in \(\boldsymbol{\mathbb{R}}\) d from Randomly Revealed P	13
Isomorphism Testing Parameterized by Genus and Beyond	13
Monotonic Decompositions of Submodular Set Functions	11
Upward and Rectilinear Planarity are W[1]-Hard Parameterized by Treewidth	10
Concepts of Dimension for Convex Geometries	10
Fractionally Subadditive Maximization under an Incremental Knapsack Constraint with Applications to Incremental Flows	9
Topology of Cut Complexes of Graphs	9
On Density of \(\boldsymbol{\mathbb{Z}_3}\) -Flow-Critical Graphs	8
Graphs of Degree at Least \({3}\) with Minimum Algebraic Connectivity	8
Excluding a Clique or a Biclique in Graphs of Bounded Induced Matching Treewidth	8
Tuza’s Conjecture for Binary Geometries	8
Transversal Hamilton Paths and Cycles	8
On the Turán Number of Generalized Theta Graphs	8
Turán Densities for Small Hypercubes	8
On the Weisfeiler–Leman Dimension of Permutation Graphs	8
Dividing a Graphical Cake	8
Degrees of Interior Polynomials and Parking Function Enumerators	7
Cycle Saturation in Random Graphs	7

Bridge-Depth Characterizes which Minor-Closed Structural Parameterizations of Vertex Cover Admit a Polynomial Kernel	7
Weaver’s Discrepancy for Gaussian Random Vectors	7
Additive Energy of Polynomial Images	7
Online Spanners in Metric Spaces	6
On the Size of Matchings in 1-Planar Graph with High Minimum Degree	6
Matchings, Relaxed Popularity, and Optimality	6
Topology of Cut Complexes II	6
Two-Colorings of Normed Spaces without Long Monochromatic Unit Arithmetic Progressions	6
On Packing Dijoins in Digraphs and Weighted Digraphs	6
The Lower Bound Theorem for $d$-Polytopes with $2{d}+1$ Vertices	6
The Success Probability in Levine’s Hat Problem, and Independent Sets in Graphs	6
Bootstrap Percolation on the High-Dimensional Hamming Graph	6
Robust Factorizations and Colorings of Tensor Graphs	5
Reconfiguration of Digraph Homomorphisms	5
Decomposing Random Permutations into Order-Isomorphic Subpermutations	5
Tangles and Hierarchical Clustering	5
Longest Cycle above Erdős–Gallai Bound	5
Partial Reflections and Globally Linked Pairs in Rigid Graphs	5
On the PoA Conjecture: Trees versus Biconnected Components	5
Limit Profile for the Transpose Top-2 with Random Shuffle	5
Odd Paths, Cycles, and \(T\)-Joins: Connections and Algorithms	5
Parameterized Complexity for Finding a Perfect Phylogeny from Mixed Tumor Samples	5
Modules in Robinson Spaces	5
Binary Cyclic Transversal Polytopes	5
Circular \({\boldsymbol{(4-\epsilon )}}\) -Coloring of Some Classes of Signed Graphs	5
The Rainbow Saturation Number Is Linear	5
Twin-Width of Subdivisions of Multigraphs	5
Extremal Problems for Hypergraph Blowups of Trees	5
Coloring Tournaments with Few Colors: Algorithms and Complexity	5
Asymptotic Fair Division: Chores Are Easier Than Goods	5
Letter Graphs and Geometric Grid Classes of Permutations	5
Matroids on Eight Elements with the Half-Plane Property and Related Concepts	5
Planarity via Spanning Tree Number: A Linear-Algebraic Criterion	5
The Tropical Critical Points of an Affine Matroid	5
The Spectrum of Triangle-Free Graphs	5
Hamilton Cycles in Random Digraphs with Minimum Degree at Least One	4
Decompositions of \(q\)-Matroids Using Cyclic Flats	4
Classification of Finite Highly Regular Vertex-Colored Graphs	4
Packing Signatures in Signed Graphs	4
Approximating Submodular \({k}\)-Partition via Principal Partition Sequence	4
Highly Connected Subgraphs with Large Chromatic Number	4
Midpoints of Vertex Pairs of Convex Polytopes	4
Long Induced Paths and Forbidden Patterns: Polylogarithmic Bounds	4
A Proof of the 3/4-Conjecture for the Total Domination Game	4
On Supersaturation for Oddtown and Eventown	4
Acyclic Colorings of Graphs with Obstructions	4
The Ramsey Number for 4-Uniform Tight Cycles	4
On Multicolor Ramsey Numbers of Triple System Paths of Length 3	4
Inverse Problems for Discrete Heat Equations and Random Walks for a Class of Graphs	4
M-Convexity of Vexillary Grothendieck Polynomials via Bubbling	4

Adapting the Directed Grid Theorem into an FPT Algorithm	4
Protecting the Connectivity of a Graph Under Nonuniform Edge Failures	4
Orientation of Fitch Graphs and Reconciliation-Free Inference of Horizontal Gene Transfer in Gene Trees	4
On a Conjecture of Feige for Discrete Log-Concave Distributions	4
Computing Paths of Large Rank in Planar Frameworks Deterministically	4
Kinetic Geodesic Voronoi Diagrams in a Simple Polygon	4
Shape Enumerators of Self-Dual NRT Codes over Finite Fields	4
Tropical Linear Regression and Mean Payoff Games: Or, How to Measure the Distance to Equilibria	4
Efficient Linear and Affine Codes for Correcting Insertions/Deletions	4
A Sublinear Bound on the Page Number of Upward Planar Graphs	4
A Precise Condition for Independent Transversals in Bipartite Covers	4
Induced Subgraphs and Tree Decompositions XIX: Thetas and Forests	4
The Threshold of Symmetry in Random Graphs with Specified Degree Sequences	4
Bounding and Computing Obstacle Numbers of Graphs	4
Nonuniform Degrees and Rainbow Versions of the Caccetta–Häggkvist Conjecture	4
Short Rank-Metric Codes and Scattered Subspaces	4
On Off-Diagonal F -Ramsey Numbers	4
Computing Twin-Width Parameterized by the Feedback Edge Number and Vertex Integrity	3
Greedy Causal Discovery Is Geometric	3
Local Certification of Local Properties: Tight Bounds, Trade-Offs, and New Parameters	3
The Overfullness of Graphs with Small Minimum Degree and Large Maximum Degree	3
On the Ramsey–Turán Problem for 4-Cliques	3
Distances between Realizations of Order Types	3
Unavoidable Cycle-Contraction Minors of Large 2-Connected Graphs	3
Simple Codes and Sparse Recovery with Fast Decoding	3
Matroid Intersection under Restricted Oracles	3
EMSO(FO$^2$) 0-1 Law Fails for All Dense Random Graphs	3
Effective Poset Inequalities	3
Convex Characters, Algorithms, and Matchings	3
Further Exploiting c-Closure for FPT Algorithms and Kernels for Domination Problems	3
The Strong Fractional Choice Number and the Strong Fractional Paint Number of Graphs	3
A Stability Result for \(\boldsymbol{C}_{\boldsymbol{2k+1}}\)-Free Graphs	3
Obviously Strategy-Proof Mechanisms without Money for Scheduling	3
A Canonical Tree Decomposition for Order Types, and Some Applications	3
Hitting Sets and Colorings of Hypergraphs	3
Twin-Width of Planar Graphs Is at Most 8, and Some Related Bounds	3
Edge-Connectivity Augmentation of Simple Graphs	3
Dirac’s Theorem for Linear Hypergraphs	3
A Kneser-Type Theorem for Restricted Sumsets	3
Upper Bounds on Mixing Time of Finite Markov Chains	3
On the Bit Size of Sum-of-Squares Proofs for Symmetric Formulations	3
Aggregation of Evaluations without Unanimity	3
The Fractional Chromatic Number of \(\boldsymbol{K_{\Delta }}\)-Free Graphs	3
Three Applications of Coverings to Difference Patterns	3
Revisiting and Improving Upper Bounds for Identifying Codes	3
Canonical Theorems for Colored Integers with Respect to Some Linear Combinations	3
Cliques, Chromatic Number, and Independent Sets in the Semi-random Process	3
Corrigendum: Orthogonal Tree-Decompositions of Graphs	3
Extremal Graph Realizations and Graph Laplacian Eigenvalues	3
Stable Approximation Algorithms for Dominating Set and Independent Set	3
Heroes in Orientations of Chordal Graphs	3
Extremal Problem for Matchings and Rainbow Matchings on Direct Products	3
Graphs with Large Girth and Chromatic Number are Hard for Nullstellensatz	3
On Ramsey Size-Linear Graphs and Related Questions	3
Ideal Membership Problem over 3-Element CSPs with Dual Discriminator Polymorphism	3
Invertibility of Digraphs and Tournaments	3
The Treewidth and Pathwidth of Graph Unions	3
Seymour and Woodall’s Conjecture Holds for Graphs with Independence Number Two	3
Improved NP-Hardness of Approximation for Orthogonality Dimension and Minrank	3
Fibonacci Sumsets and the Gonality of Strip Graphs	3
Chip-Firing and Critical Groups of Signed Graphs	2
Group Connectivity in 3-Edge-Connected Signed Graphs	2
Sample Compression Schemes for Balls in Graphs	2
Cops and Robbers on \(\boldsymbol{P_5}\)-Free Graphs	2
Large Rainbow Cliques in Randomly Perturbed Dense Graphs	2
Disjoint Cycles in a Digraph with Partial Degree	2
Sárközy’s Theorem in Various Finite Field Settings	2
Don’t Roll the Dice, Ask Twice: The Two-Query Distortion of Matching Problems and Beyond	2
Hitting Cycles through Prescribed Vertices or Edges	2
A Property on Monochromatic Copies of Graphs Containing a Triangle	2
A Menger-Type Theorem for Two Induced Paths	2
Positive Codegree Thresholds for Perfect Matchings in Hypergraphs	2
Approximate Hypergraph Vertex Cover and Generalized Tuza’s Conjecture	2
Set-Valued Catalan Combinatorics	2
Rank-Metric Codes, Semifields, and the Average Critical Problem	2
Computational Complexity of Minimal Trap Spaces in Boolean Networks	2
\(\mathcal{P}\)-Matchings Parameterized by Treewidth	2
The Early Evolution of the Random Graph Process in Planar Graphs and Related Classes	2
Improved Approximation Algorithms for the Expanding Search Problem	2
Chasing Tripods to Obtain a Rooted Subdivision	2

The Excluded Minors for Three Classes of 2-Polymatroids Having Special Types of Natural Matroids	2
Functors on Relational Structures Which Admit Both Left and Right Adjoints	2
Product Structure Extension of the Alon–Seymour–Thomas Theorem	2
Probability Mass of Rademacher Sums Beyond One Standard Deviation	2
Nontrivial t-Intersecting Families for Vector Spaces	2
Left-Cut-Percolation and Induced-Sidorenko Bigraphs	2
An Algorithm to Recover Shredded Random Matrices	2
Finding a Maximum Restricted \({t}\)-Matching via Boolean Edge-CSP	2
Globally Rigid Augmentation of Rigid Graphs	2
NP-Hardness of Computing PL Geometric Category in Dimension 2	2
Quasirandom-Forcing Orientations of Cycles	2
Poincaré Polynomials of Odd Diagram Classes	2
Pfaffian Pairs and Parities: Counting on Linear Matroid Intersection and Parity Problems	2
Hanani--Tutte and Hierarchical Partial Planarity	2
Hypergraph Horn Functions	2
Phase Transitions of Structured Codes of Graphs	2
Intertwining Connectivities for Vertex-Minors and Pivot-Minors	2
Combinatorial Generation via Permutation Languages. V. Acyclic Orientations	2
On Induced Paths, Holes, and Trees in Random Graphs	2
Structured Codes of Graphs	2
Influence of a Set of Variables on a Boolean Function	2
On Cliques in Three-Dimensional Dense Point-Line Arrangements	2
Anti-Ramsey Number of Matchings in 3-Uniform Hypergraphs	2
Tree-Degenerate Graphs and Nested Dependent Random Choice	2
A Small Maximal Sidon Set in ${\mathbb{Z}}_2^n$	2
Transversal Numbers of Simplicial Polytopes, Spheres, and Pure Complexes	2
Crux and Long Cycles in Graphs	2
Color-Bias Perfect Matchings in Hypergraphs	2
A Stability Result on Matchings in 3-Uniform Hypergraphs	2
Tight Probability Bounds with Pairwise Independence	2
Euclidean Steiner Spanners: Light and Sparse	2
Algorithmic Applications of Tree-Cut Width	2
On Isomorphism-Invariant Antistochastic Properties of Random Graphs	2
Hitting Weighted Even Cycles in Planar Graphs	2
Tight Analysis of the Lazy Algorithm for Open Online Dial-a-Ride	2
A General Family of MSRD Codes and PMDS Codes with Smaller Field Sizes from Extended Moore Matrices	2
Self-Dual Maps II: Links and Symmetry	2
On the Turán Number of Edge Blow-Ups of Cliques	2
Quickly Excluding an Apex-Forest	2
Solving the Maximum Popular Matching Problem with Matroid Constraints	2
The Number of Cliques in Graphs Covered by Long Cycles	1
Erratum: Multitasking Capacity: Hardness Results and Improved Constructions	1
Maximum Weight Codewords of a Linear Rank-Metric Code	1
The Low-Degree Hardness of Finding Large Independent Sets in Sparse Random Hypergraphs	1
Stability of Large Rainbow Intersecting Families with Product Measure	1
On the Concentration of the Maximum Degree in the Duplication-Divergence Models	1
Ehrhart Bounds for Panhandle and Paving Matroids through Enumeration of Chain Forests	1
Dyadic Packing of Dijoins	1
Extensions of Discrete Helly Theorems for Boxes	1
Rapid Mixing of \({\boldsymbol{k}}\)-Class Biased Permutations	1
Transversal Hamilton Cycle in Hypergraph Systems	1
A Stability Result of the Pósa Lemma	1
Refinement on Spectral Turán’s Theorem	1
Square Coloring Planar Graphs with Automatic Discharging	1
Noncrossing Partitions of a Marked Surface	1
Recoloring Planar Graphs of Girth at Least Five	1
Search-Space Reduction via Essential Vertices	1
Faster 3-Coloring of Small-Diameter Graphs	1
Marked Graphs and the Chromatic Symmetric Function	1
5-Cycle Double Covers, 4-Flows, and Catlin Reduction	1
The Discrepancy of Unsatisfiable Matrices and a Lower Bound for the Komlós Conjecture Constant	1
Anti-Ramsey Number of Edge-Disjoint Rainbow Spanning Trees in All Graphs	1
An Axiomatization of Matroids and Oriented Matroids as Conditional Independence Models	1
On the Chromatic Number of Random Regular Hypergraphs	1
A Tight Lower Bound for Edge-Disjoint Paths on Planar DAGs	1
A Sumset Version of a Conjecture of Pilz	1
Stochastic Probing with Increasing Precision	1
A Simple Proof of the Nonuniform Kahn–Kalai Conjecture	1
Rigidity of Balanced Minimal Cycle Complexes	1
Exchange Distance of Basis Pairs in Split Matroids	1
A Water-Filling Primal-Dual Algorithm for Approximating NonLinear Covering Problems	1
Edges Not Covered by Monochromatic Bipartite Graph	1
Giant Components in Random Temporal Graphs	1
A Note on Color-Bias Perfect Matchings in Hypergraphs	1
On Dyadic Fractional Packings of $T$-Joins	1
A Point-Variety Incidence Theorem over Finite Fields, and Its Applications	1
A Spectral Independence View on Hard Spheres via Block Dynamics	1
Extremal Uniquely Resolvable Multisets	1
A 3/2-Approximation for the Metric Many-Visits Path TSP	1
Exchange Properties of Finite Set-Systems	1
The Spectrum of the Grigoriev–Laurent Pseudomoments	1
On the Minimum Number of Arcs in \(\boldsymbol{k}\)-Dicritical Oriented Graphs	1
Constant-Ratio Approximation for Robust Bin Packing with Budgeted Uncertainty	1
Semigroup Intersection Problems in the Heisenberg Groups	1
Metric Dimension Parameterized by Feedback Vertex Set and Other Structural Parameters	1
Tverberg Partition Graphs	1
Line Transversals in Families of Connected Sets in the Plane	1
The Dimension of the Region of Feasible Tournament Profiles	1
Better Bounds on the Minimum Lee Distance	1
Approximation Algorithms for the Random Field Ising Model	1
The Flow Index of Regular Class I Graphs	1
A Bounded Diameter Strengthening of Kőnig’s Theorem	1
Strongly Stable Matchings under Matroid Constraints	1
The Main Zero-Sum Constants over \({\boldsymbol{D}}\) 2n \({\boldsymbol{\times C_2}}\)	1
Lower Bounds for Maximum Weighted Cut	1