SIAM Journal on Discrete Mathematics

Article	Citations
Three Combinatorial Perspectives on Minimal Codes	14
Improved Randomized Algorithm for k-Submodular Function Maximization	13
BCH Codes with Minimum Distance Proportional to Code Length	10
Large Book-Cycle Ramsey Numbers	8
A Proof of Brouwer's Toughness Conjecture	8
Crux and Long Cycles in Graphs	8
The Size Ramsey Number of Graphs with Bounded Treewidth	8
A General Family of MSRD Codes and PMDS Codes with Smaller Field Sizes from Extended Moore Matrices	7
A Note on the Erdös Distinct Subset Sums Problem	7
Sprinkling a Few Random Edges Doubles the Power	7
Closing Gaps in Asymptotic Fair Division	7
Parameterized Pre-Coloring Extension and List Coloring Problems	6
More Applications of the $d$-Neighbor Equivalence: Acyclicity and Connectivity Constraints	5
On the Generation of Rank 3 Simple Matroids with an Application to Terao's Freeness Conjecture	5
Large Induced Matchings in Random Graphs	5
Small Strong Blocking Sets by Concatenation	5
Perfect Matching Index versus Circular Flow Number of a Cubic Graph	5
On the Existence of Paradoxical Motions of Generically Rigid Graphs on the Sphere	5
Graph Classes and Forbidden Patterns on Three Vertices	5
An Irrational Lagrangian Density of a Single Hypergraph	5
Nearly Perfect Matchings in Uniform Hypergraphs	5
Approximability of Monotone Submodular Function Maximization under Cardinality and Matroid Constraints in the Streaming Model	5
Improved Bounds for the Excluded-Minor Approximation of Treedepth	4
On Discrete Truthful Heterogeneous Two-Facility Location	4
A Note on Color-Bias Hamilton Cycles in Dense Graphs	4

Ramsey Numbers Involving Large Books	4
A General Framework for Hypergraph Coloring	4
Feedback Vertex Set and Even Cycle Transversal for $H$-Free Graphs: Finding Large Block Graphs	4
Enumerating Integer Points in Polytopes with Bounded Subdeterminants	4
Rainbow Hamilton Cycles in Randomly Colored Randomly Perturbed Dense Graphs	4
Rainbow Perfect Matchings for 4-Uniform Hypergraphs	4
Entropy Inequalities for Sums in Prime Cyclic Groups	4
An Approximation Algorithm for Fully Planar Edge-Disjoint Paths	4
Clean Clutters and Dyadic Fractional Packings	4
Shortest Reconfiguration of Perfect Matchings via Alternating Cycles	4
Tournaments and Bipartite Tournaments without Vertex Disjoint Cycles of Different Lengths	4
List Coloring of Two Matroids through Reduction to Partition Matroids	4
Spectral Radius on Linear $r$-Graphs without Expanded $K_{r+1}$	4
Fairly Allocating Many Goods with Few Queries	4
Rainbow Odd Cycles	4
A Mélange of Diameter Helly-Type Theorems	4
Planar Turán Number of the 6-Cycle	4
Linear Kernels for Edge Deletion Problems to Immersion-Closed Graph Classes	4
The Recognition Problem of Graph Search Trees	4
The Price of Connectivity in Fair Division	3
$K_2$-Hamiltonian Graphs: I	3
Repeated Patterns in Proper Colorings	3
On the Length of Monotone Paths in Polyhedra	3
Parameterized Approximation Schemes for Steiner Trees with Small Number of Steiner Vertices	3
Bounding the Cop Number of a Graph by Its Genus	3
Lower Bounds for Max-Cut in $H$-Free Graphs via Semidefinite Programming	3
The Power of the Weisfeiler--Leman Algorithm to Decompose Graphs	3
Ample Completions of Oriented Matroids and Complexes of Uniform Oriented Matroids	3
Lower Bounds on Sparse Spanners, Emulators, and Diameter-Reducing Shortcuts	3
When Do Gomory--Hu Subtrees Exist?	3
The Ising Antiferromagnet and Max Cut on Random Regular Graphs	3
Exploiting $c$-Closure in Kernelization Algorithms for Graph Problems	3
On Lattice Width of Lattice-Free Polyhedra and Height of Hilbert Bases	3
Faces of Root Polytopes	3
Kernelization of Graph Hamiltonicity: Proper $H$-Graphs	3
Faster Approximation Algorithms for Computing Shortest Cycles on Weighted Graphs	3
Packing Signatures in Signed Graphs	3
Bipartite Independence Number in Graphs with Bounded Maximum Degree	3
An Improved Bound for the Rigidity of Linearly Constrained Frameworks	3
Improved Bounds on Sizes of Generalized Caps in $AG(n,q)$	3
Lower and Upper Bounds on the Randomness Complexity of Private Computations of AND	3
Total Positivity from the Exponential Riordan Arrays	3
Revisiting and Improving Upper Bounds for Identifying Codes	3
The Complexity of Approximating the Complex-Valued Ising Model on Bounded Degree Graphs	3
Sublinear Separators in Intersection Graphs of Convex Shapes	2
Exponential Sums with Sparse Polynomials over Finite Fields	2
Constructing Clustering Transformations	2
Pure Pairs VI: Excluding an Ordered Tree	2
Treewidth versus Clique Number. I. Graph Classes with a Forbidden Structure	2
Identifiability of Graphs with Small Color Classes by the Weisfeiler--Leman Algorithm	2

Hitting Time of Edge Disjoint Hamilton Cycles in Random Subgraph Processes on Dense Base Graphs	2
Notes on Hazard-Free Circuits	2
Structured Codes of Graphs	2
Euclidean Steiner Spanners: Light and Sparse	2
Ramsey Goodness of Clique Versus Paths in Random Graphs	2
Recoloring Planar Graphs of Girth at Least Five	2
Partial Permutation and Alternating Sign Matrix Polytopes	2
Fuglede’s Conjecture Holds in \(\boldsymbol{\mathbb{Z}_{p}\times \mathbb{Z}_{p^{n}}}\)	2
Algorithmic Applications of Tree-Cut Width	2
Splitting Necklaces, with Constraints	2
On Dyadic Fractional Packings of $T$-Joins	2
Market Pricing for Matroid Rank Valuations	2
Parity-Unimodality and a Cyclic Sieving Phenomenon for Necklaces	2
Number of Hamiltonian Cycles in Planar Triangulations	2
Line Transversals in Families of Connected Sets in the Plane	2
Invariant Chains in Algebra and Discrete Geometry	2
On the Largest Common Subtree of Random Leaf-Labeled Binary Trees	2
Connectivity for Kite-Linked Graphs	2
On the Size of Matchings in 1-Planar Graph with High Minimum Degree	2
Digraphs and Variable Degeneracy	2
Finding Branch-Decompositions of Matroids, Hypergraphs, and More	2
A Degree Sequence Strengthening of the Vertex Degree Threshold for a Perfect Matching in 3-Uniform Hypergraphs	2
A Quantitative Helly-Type Theorem: Containment in a Homothet	2
Regular Graphs with Few Longest Cycles	2
Fractional Chromatic Number, Maximum Degree, and Girth	2
Erdös--Hajnal Properties for Powers of Sparse Graphs	2
Localized Codegree Conditions for Tight Hamilton Cycles in 3-Uniform Hypergraphs	2
On Covering Numbers, Young Diagrams, and the Local Dimension of Posets	2
Parameterized Complexity of Conflict-Free Graph Coloring	2
Atomicity and Well Quasi-Order for Consecutive Orderings on Words and Permutations	2
Nondegenerate Neural Codes and Obstructions to Closed-Convexity	2
The Cut Metric for Probability Distributions	2
Tight Gaps in the Cycle Spectrum of 3-Connected Planar Graphs	2
Relative Turán Problems for Uniform Hypergraphs	2
Counting Weighted Independent Sets beyond the Permanent	2
Self-Dual Maps I: Antipodality	2
Rigidity of Random Subgraphs and Eigenvalues of Stiffness Matrices	2
The Effect of Adding Randomly Weighted Edges	2
On Sequential Basis Exchange in Matroids	2
Tight Cycle Relaxations for the Cut Polytope	2
Geometric Criteria for Realizability of Tensegrities in Higher Dimensions	2
Bounds for the Twin-Width of Graphs	2
Nontrivial t-Intersecting Families for Vector Spaces	2
Circularly Compatible Ones, $D$-Circularity, and Proper Circular-Arc Bigraphs	2
Tight Probability Bounds with Pairwise Independence	2
Automatic Generation of FPTASes for Stochastic Monotone Dynamic Programs Made Easier	2
Complexity Dichotomy for List-5-Coloring with a Forbidden Induced Subgraph	2
An Improved Approximation Algorithm for the Matching Augmentation Problem	2
Letter Graphs and Geometric Grid Classes of Permutations	1
Adapting the Directed Grid Theorem into an FPT Algorithm	1
Further Exploiting c-Closure for FPT Algorithms and Kernels for Domination Problems	1
A Linear Fixed Parameter Tractable Algorithm for Connected Pathwidth	1
On Connected Components with Many Edges	1
A Polynomial Time Algorithm for Solving the Closest Vector Problem in Zonotopal Lattices	1
Constant-Ratio Approximation for Robust Bin Packing with Budgeted Uncertainty	1
Inequalities on Projected Volumes	1
Two-Colorings of Normed Spaces without Long Monochromatic Unit Arithmetic Progressions	1
Towards Lower Bounds on the Depth of ReLU Neural Networks	1
Lower Bounds for Maximum Weighted Cut	1
Covering 3-Edge-Colored Random Graphs with Monochromatic Trees	1
Marked Graphs and the Chromatic Symmetric Function	1
The Natural Matroid of an Integer Polymatroid	1
Target Set Selection in Dense Graph Classes	1
The Phase Transition of Discrepancy in Random Hypergraphs	1
Geometry of the Minimal Solutions of a Linear Diophantine Equation	1
Lattice Size of Plane Convex Bodies	1
On Vietoris–Rips Complexes (with Scale 3) of Hypercube Graphs	1
The 9-Connected Excluded Minors for the Class of Quasi-graphic Matroids	1
On Discrete LOG-Brunn--Minkowski Type Inequalities	1
Tropical Linear Regression and Mean Payoff Games: Or, How to Measure the Distance to Equilibria	1
Upper Bounds on Mixing Time of Finite Markov Chains	1
A Strengthening on Odd Cycles in Graphs of Given Chromatic Number	1
Finding Large $H$-Colorable Subgraphs in Hereditary Graph Classes	1
A Polynomial-Time Algorithm to Determine (Almost) Hamiltonicity of Dense Regular Graphs	1
Expected Number of Induced Subtrees Shared by Two Independent Copies of a Random Tree	1
Globally Optimizing Small Codes in Real Projective Spaces	1
A Spectral Independence View on Hard Spheres via Block Dynamics	1
A Stability Result on Matchings in 3-Uniform Hypergraphs	1
Small Doubling in Groups with Moderate Torsion	1
Gonality Sequences of Graphs	1

Balanced Subdivisions of a Large Clique in Graphs with High Average Degree	1
Cyclic Matroids	1
Globally Rigid Augmentation of Rigid Graphs	1
Exchange Distance of Basis Pairs in Split Matroids	1
On the Turán Number of the Blow-Up of the Hexagon	1
Improved NP-Hardness of Approximation for Orthogonality Dimension and Minrank	1
Majorization and Minimal Energy on Spheres	1
Bridge-Depth Characterizes which Minor-Closed Structural Parameterizations of Vertex Cover Admit a Polynomial Kernel	1
Extending Drawings of Complete Graphs into Arrangements of Pseudocircles	1
Quasirandom-Forcing Orientations of Cycles	1
On the Highly Connected Dyadic, Near-Regular, and Sixth-Root-of-Unity Matroids	1
Equidistributions around Special Kinds of Descents and Excedances	1
Erdös--Pósa Property for Labeled Minors: 2-Connected Minors	1
Heroes in Orientations of Chordal Graphs	1
Maximum Size Intersecting Families of Bounded Minimum Positive Co-degree	1
Minimal Ramsey Graphs with Many Vertices of Small Degree	1
Sublinear Longest Path Transversals	1
Isometric Universal Graphs	1
Refinement on Spectral Turán’s Theorem	1
Degenerate Turán Densities of Sparse Hypergraphs II: A Solution to the Brown-Erdős-Sós Problem for Every Uniformity	1
The Uniformity Conjecture in Additive Combinatorics	1
Computing the Tandem Duplication Distance is NP-Hard	1
Tomescu's Graph Coloring Conjecture for $\ell$-Connected Graphs	1
Pairwise Disjoint Perfect Matchings in r-Edge-Connected r-Regular Graphs	1
Disjoint Cycles with Length Constraints in Digraphs of Large Connectivity or Large Minimum Degree	1
Completing and Extending Shellings of Vertex Decomposable Complexes	1
Hamiltonicity of Random Graphs in the Stochastic Block Model	1
Packing and Covering Induced Subdivisions	1
2-Modular Matrices	1
On Multicolor Ramsey Numbers of Triple System Paths of Length 3	1
Cubic Graphs with No Short Cycle Covers	1
A Small Maximal Sidon Set in ${\mathbb{Z}}_2^n$	1
Grundy Distinguishes Treewidth from Pathwidth	1
Dense Induced Subgraphs of Dense Bipartite Graphs	1
Semidefinite Programming and Ramsey Numbers	1
Hat Guessing Numbers of Strongly Degenerate Graphs	1
Effective Poset Inequalities	1
Saturation Problems about Forbidden 0-1 Submatrices	1
On a Conjecture of Nagy on Extremal Densities	1
Simplicial Complexes Satisfying Serre's Condition versus the Ones Which Are Cohen--Macaulay in a Fixed Codimension	1
The Strong Fractional Choice Number and the Strong Fractional Paint Number of Graphs	1
The Equivariant Inverse Kazhdan--Lusztig Polynomials of Uniform Matroids	1
On Induced Paths, Holes, and Trees in Random Graphs	1
Sums, Products, and Dilates on Sparse Graphs	1
Faster 3-Coloring of Small-Diameter Graphs	1
Circular \({\boldsymbol{(4-\epsilon )}}\) -Coloring of Some Classes of Signed Graphs	1
$K_4$-Subdivisions Have the Edge-Erdös--Pósa Property	1
The Generalized Rainbow Turán Problem for Cycles	1
Self-Dual Maps II: Links and Symmetry	1
Longest Paths in Random Hypergraphs	1
Perfect Matchings in the Semirandom Graph Process	1
Constructing Partial MDS Codes from Reducible Algebraic Curves	1
Perfect Matching and Hamilton Tight Cycle Decomposition of Complete $n$-Balanced $r$-Partite $k$-Uniform Hypergraphs	1
On Treewidth and Stable Marriage: Parameterized Algorithms and Hardness Results (Complete Characterization)	1
Strengthening a Theorem of Meyniel	1
The Lower Bound Theorem for $d$-Polytopes with $2{d}+1$ Vertices	1
Anticoncentration and the Exact Gap-Hamming Problem	1
A Structure Theorem for Rooted Binary Phylogenetic Networks and Its Implications for Tree-Based Networks	1
IC-Planar Graphs Are 6-Choosable	1
Strong Chordality of Graphs with Possible Loops	1
A Spectral Erdős-Sós Theorem	1
Shadows of 3-Uniform Hypergraphs under a Minimum Degree Condition	1
Characteristic Dependence of Syzygies of Random Monomial Ideals	1
On the Vanishing of Discrete Singular Cubical Homology for Graphs	1
Maker-Breaker Games on Randomly Perturbed Graphs	1
Bounding the Number of Edges of Matchstick Graphs	1
A 3/2-Approximation for the Metric Many-Visits Path TSP	1
Probability Mass of Rademacher Sums Beyond One Standard Deviation	1
Topological Bounds for Graph Representations over Any Field	1
Understanding Popular Matchings via Stable Matchings	1