SIAM Journal on Discrete Mathematics

Article	Citations
Three Combinatorial Perspectives on Minimal Codes	17
Improved Randomized Algorithm for k-Submodular Function Maximization	15
A General Family of MSRD Codes and PMDS Codes with Smaller Field Sizes from Extended Moore Matrices	13
A Proof of Brouwer's Toughness Conjecture	11
BCH Codes with Minimum Distance Proportional to Code Length	11
Crux and Long Cycles in Graphs	10
The Size Ramsey Number of Graphs with Bounded Treewidth	10
Planar Turán Number of the 6-Cycle	10
Large Book-Cycle Ramsey Numbers	8
Sprinkling a Few Random Edges Doubles the Power	8
Closing Gaps in Asymptotic Fair Division	8
Spectral Radius on Linear $r$-Graphs without Expanded $K_{r+1}$	7
A Note on the Erdös Distinct Subset Sums Problem	7
An Irrational Lagrangian Density of a Single Hypergraph	7
Parameterized Pre-Coloring Extension and List Coloring Problems	7
Graph Classes and Forbidden Patterns on Three Vertices	7
Small Strong Blocking Sets by Concatenation	7
Linear Kernels for Edge Deletion Problems to Immersion-Closed Graph Classes	7
The Price of Connectivity in Fair Division	6
Large Induced Matchings in Random Graphs	6
Feedback Vertex Set and Even Cycle Transversal for $H$-Free Graphs: Finding Large Block Graphs	6
Entropy Inequalities for Sums in Prime Cyclic Groups	6
Shortest Reconfiguration of Perfect Matchings via Alternating Cycles	6
Nearly Perfect Matchings in Uniform Hypergraphs	6
On the Existence of Paradoxical Motions of Generically Rigid Graphs on the Sphere	6

A General Framework for Hypergraph Coloring	5
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
Perfect Matching Index versus Circular Flow Number of a Cubic Graph	5
IC-Planar Graphs Are 6-Choosable	5
Approximability of Monotone Submodular Function Maximization under Cardinality and Matroid Constraints in the Streaming Model	5
Target Set Selection in Dense Graph Classes	5
Ample Completions of Oriented Matroids and Complexes of Uniform Oriented Matroids	5
Fairly Allocating Many Goods with Few Queries	5
On Discrete Truthful Heterogeneous Two-Facility Location	5
Euclidean Steiner Spanners: Light and Sparse	5
A Note on Color-Bias Hamilton Cycles in Dense Graphs	5
The Power of the Weisfeiler--Leman Algorithm to Decompose Graphs	5
Treewidth versus Clique Number. I. Graph Classes with a Forbidden Structure	5
Rainbow Hamilton Cycles in Randomly Colored Randomly Perturbed Dense Graphs	5
The Ising Antiferromagnet and Max Cut on Random Regular Graphs	5
Total Positivity from the Exponential Riordan Arrays	5
Rainbow Odd Cycles	5
An Approximation Algorithm for Fully Planar Edge-Disjoint Paths	4
Self-Dual Maps I: Antipodality	4
Structured Codes of Graphs	4
$K_2$-Hamiltonian Graphs: I	4
Repeated Patterns in Proper Colorings	4
Parameterized Approximation Schemes for Steiner Trees with Small Number of Steiner Vertices	4
On the Length of Monotone Paths in Polyhedra	4
Bounding the Cop Number of a Graph by Its Genus	4
Finding Branch-Decompositions of Matroids, Hypergraphs, and More	4
Ramsey Numbers Involving Large Books	4
Clean Clutters and Dyadic Fractional Packings	4
Kernelization of Graph Hamiltonicity: Proper $H$-Graphs	4
Tournaments and Bipartite Tournaments without Vertex Disjoint Cycles of Different Lengths	4
The Recognition Problem of Graph Search Trees	4
Enumerating Integer Points in Polytopes with Bounded Subdeterminants	4
Rainbow Perfect Matchings for 4-Uniform Hypergraphs	4
Semidefinite Programming and Ramsey Numbers	4
Pure Pairs VI: Excluding an Ordered Tree	4
Effective Poset Inequalities	4
A Mélange of Diameter Helly-Type Theorems	4
Invariant Chains in Algebra and Discrete Geometry	4
Lower Bounds on Sparse Spanners, Emulators, and Diameter-Reducing Shortcuts	4
List Coloring of Two Matroids through Reduction to Partition Matroids	4
Marked Graphs and the Chromatic Symmetric Function	4
Improved Bounds on Sizes of Generalized Caps in $AG(n,q)$	4
Improved Bounds for the Excluded-Minor Approximation of Treedepth	4
Lower Bounds for Max-Cut in $H$-Free Graphs via Semidefinite Programming	4
Fuglede’s Conjecture Holds in \(\boldsymbol{\mathbb{Z}_{p}\times \mathbb{Z}_{p^{n}}}\)	4
Tomescu's Graph Coloring Conjecture for $\ell$-Connected Graphs	3
Faster Approximation Algorithms for Computing Shortest Cycles on Weighted Graphs	3
Recoloring Planar Graphs of Girth at Least Five	3
Bounds for the Twin-Width of Graphs	3

Bipartite Independence Number in Graphs with Bounded Maximum Degree	3
Partial Permutation and Alternating Sign Matrix Polytopes	3
Circular \({\boldsymbol{(4-\epsilon )}}\) -Coloring of Some Classes of Signed Graphs	3
Splitting Necklaces, with Constraints	3
Exponential Sums with Sparse Polynomials over Finite Fields	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
Hitting Time of Edge Disjoint Hamilton Cycles in Random Subgraph Processes on Dense Base Graphs	3
Revisiting and Improving Upper Bounds for Identifying Codes	3
Atomicity and Well Quasi-Order for Consecutive Orderings on Words and Permutations	3
An Improved Approximation Algorithm for the Matching Augmentation Problem	3
Understanding Popular Matchings via Stable Matchings	3
Tight Gaps in the Cycle Spectrum of 3-Connected Planar Graphs	3
A Spectral Erdős-Sós Theorem	3
When Do Gomory--Hu Subtrees Exist?	3
Identifiability of Graphs with Small Color Classes by the Weisfeiler--Leman Algorithm	3
The Complexity of Approximating the Complex-Valued Ising Model on Bounded Degree Graphs	3
Square Coloring Planar Graphs with Automatic Discharging	3
Tropical Linear Regression and Mean Payoff Games: Or, How to Measure the Distance to Equilibria	3
Fractional Chromatic Number, Maximum Degree, and Girth	3
Packing Signatures in Signed Graphs	3
Regular Graphs with Few Longest Cycles	3
Complexity Dichotomy for List-5-Coloring with a Forbidden Induced Subgraph	3
Line Transversals in Families of Connected Sets in the Plane	3
Lower and Upper Bounds on the Randomness Complexity of Private Computations of AND	3
An Improved Bound for the Rigidity of Linearly Constrained Frameworks	3
The Cut Metric for Probability Distributions	2
Constructing Clustering Transformations	2
On Packing Dijoins in Digraphs and Weighted Digraphs	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
Ramsey Goodness of Clique Versus Paths in Random Graphs	2
A Note on Small Weight Codewords of Projective Geometric Codes and on the Smallest Sets of Even Type	2
Small Doubling in Groups with Moderate Torsion	2
Rigidity of Random Subgraphs and Eigenvalues of Stiffness Matrices	2
Globally Rigid Augmentation of Rigid Graphs	2
Exchange Distance of Basis Pairs in Split Matroids	2
Localized Codegree Conditions for Tight Hamilton Cycles in 3-Uniform Hypergraphs	2
Improved NP-Hardness of Approximation for Orthogonality Dimension and Minrank	2
Lower Bounds for Maximum Weighted Cut	2
Geometric Criteria for Realizability of Tensegrities in Higher Dimensions	2
Parity-Unimodality and a Cyclic Sieving Phenomenon for Necklaces	2
Automatic Generation of FPTASes for Stochastic Monotone Dynamic Programs Made Easier	2
The Multivariate Schwartz--Zippel Lemma	2
2-Modular Matrices	2
Extending Drawings of Complete Graphs into Arrangements of Pseudocircles	2
The Generalized Rainbow Turán Problem for Cycles	2
Circularly Compatible Ones, $D$-Circularity, and Proper Circular-Arc Bigraphs	2
Towards Lower Bounds on the Depth of ReLU Neural Networks	2
On the Largest Common Subtree of Random Leaf-Labeled Binary Trees	2
Relative Turán Problems for Uniform Hypergraphs	2
Constructing Partial MDS Codes from Reducible Algebraic Curves	2
The Effect of Adding Randomly Weighted Edges	2
Pairwise Disjoint Perfect Matchings in r-Edge-Connected r-Regular Graphs	2
Letter Graphs and Geometric Grid Classes of Permutations	2
Degenerate Turán Densities of Sparse Hypergraphs II: A Solution to the Brown-Erdős-Sós Problem for Every Uniformity	2
Refinement on Spectral Turán’s Theorem	2
A Degree Sequence Strengthening of the Vertex Degree Threshold for a Perfect Matching in 3-Uniform Hypergraphs	2
The Uniformity Conjecture in Additive Combinatorics	2
Parameterized Complexity of Conflict-Free Graph Coloring	2
Lossless Prioritized Embeddings	2
Sublinear Separators in Intersection Graphs of Convex Shapes	2
Symmetric Layer-Rainbow Colorations of Cubes	2
Computing the Tandem Duplication Distance is NP-Hard	2
Erdös--Hajnal Properties for Powers of Sparse Graphs	2
Highly Connected Subgraphs with Large Chromatic Number	2
Number of Hamiltonian Cycles in Planar Triangulations	2
On the Gamma-Vector of Symmetric Edge Polytopes	2
A Spectral Independence View on Hard Spheres via Block Dynamics	2
A Quantitative Helly-Type Theorem: Containment in a Homothet	2
Perfect Matching and Hamilton Tight Cycle Decomposition of Complete $n$-Balanced $r$-Partite $k$-Uniform Hypergraphs	2
Gonality Sequences of Graphs	2
Lattice Size of Plane Convex Bodies	2
Bridge-Depth Characterizes which Minor-Closed Structural Parameterizations of Vertex Cover Admit a Polynomial Kernel	2
Boundary \({\boldsymbol{H^\ast}}\) -Polynomials of Rational Polytopes	2
On Sequential Basis Exchange in Matroids	2
Orientation of Fitch Graphs and Reconciliation-Free Inference of Horizontal Gene Transfer in Gene Trees	2
Tight Cycle Relaxations for the Cut Polytope	2

On Vietoris–Rips Complexes (with Scale 3) of Hypercube Graphs	2
Efficient Linear and Affine Codes for Correcting Insertions/Deletions	2
Counting Weighted Independent Sets beyond the Permanent	2
Tight Probability Bounds with Pairwise Independence	2
Notes on Hazard-Free Circuits	2
Market Pricing for Matroid Rank Valuations	2
Expected Number of Induced Subtrees Shared by Two Independent Copies of a Random Tree	2
Strengthening a Theorem of Meyniel	2
Nontrivial t-Intersecting Families for Vector Spaces	2
Perfect Matchings in the Semirandom Graph Process	2
Algorithmic Applications of Tree-Cut Width	2
Nondegenerate Neural Codes and Obstructions to Closed-Convexity	2
On Covering Numbers, Young Diagrams, and the Local Dimension of Posets	2
Percolation on Random Graphs with a Fixed Degree Sequence	2
A Structure Theorem for Rooted Binary Phylogenetic Networks and Its Implications for Tree-Based Networks	2
On Dyadic Fractional Packings of $T$-Joins	2
$K_4$-Subdivisions Have the Edge-Erdös--Pósa Property	2
On the Minimum Number of Arcs in \(\boldsymbol{k}\)-Dicritical Oriented Graphs	1
On a Conjecture of Nagy on Extremal Densities	1
Which is the Worst-Case Nash Equilibrium?	1
The Number of Cliques in Graphs Covered by Long Cycles	1
On Treewidth and Stable Marriage: Parameterized Algorithms and Hardness Results (Complete Characterization)	1
On the Highly Connected Dyadic, Near-Regular, and Sixth-Root-of-Unity Matroids	1
On Induced Paths, Holes, and Trees in Random Graphs	1
How to Secure Matchings against Edge Failures	1
On Discrete LOG-Brunn--Minkowski Type Inequalities	1
The 9-Connected Excluded Minors for the Class of Quasi-graphic Matroids	1
A Strengthening on Odd Cycles in Graphs of Given Chromatic Number	1
Upper Bounds on Mixing Time of Finite Markov Chains	1
Strong Cocomparability Graphs and Slash-Free Orderings of Matrices	1
Concepts of Dimension for Convex Geometries	1
Minimal Ramsey Graphs with Many Vertices of Small Degree	1
A Stability Result on Matchings in 3-Uniform Hypergraphs	1
Counting Linear Extensions of Posets with Determinants of Hook Lengths	1
Cubic Graphs with No Short Cycle Covers	1
Cyclic Matroids	1
Vertex Partitions into an Independent Set and a Forest with Each Component Small	1
Closing the Random Graph Gap in Tuza's Conjecture through the Online Triangle Packing Process	1
Disjoint Cycles with Length Constraints in Digraphs of Large Connectivity or Large Minimum Degree	1
Quasirandom-Forcing Orientations of Cycles	1
Left-Cut-Percolation and Induced-Sidorenko Bigraphs	1
Counting Homomorphisms to $K_4$-Minor-Free Graphs, Modulo 2	1
Constant-Ratio Approximation for Robust Bin Packing with Budgeted Uncertainty	1
Saturation Problems about Forbidden 0-1 Submatrices	1
A Fixed-Parameter Tractable Algorithm for Elimination Distance to Bounded Degree Graphs	1
Majorization and Minimal Energy on Spheres	1
Self-Dual Maps II: Links and Symmetry	1
On the Query Complexity of Estimating the Distance to Hereditary Graph Properties	1
The Natural Matroid of an Integer Polymatroid	1
Orientation Ramsey Thresholds for Cycles and Cliques	1
Two-Colorings of Normed Spaces without Long Monochromatic Unit Arithmetic Progressions	1
Tropical Complementarity Problems and Nash Equilibria	1
Equidistributions around Special Kinds of Descents and Excedances	1
On the Column Number and Forbidden Submatrices for \(\Delta\)-Modular Matrices	1
Completing and Extending Shellings of Vertex Decomposable Complexes	1
A 3/2-Approximation for the Metric Many-Visits Path TSP	1
Eigenpolytope Universality and Graphical Designs	1
Isomorphism Testing Parameterized by Genus and Beyond	1
The Phase Transition of Discrepancy in Random Hypergraphs	1
Faster 3-Coloring of Small-Diameter Graphs	1
Cayley Sums and Minkowski Sums of Lattice Polytopes	1
A Polynomial-Time Algorithm to Determine (Almost) Hamiltonicity of Dense Regular Graphs	1
Topological Bounds for Graph Representations over Any Field	1
A Tight Lower Bound for Edge-Disjoint Paths on Planar DAGs	1
Metric Dimension Parameterized by Feedback Vertex Set and Other Structural Parameters	1
Grundy Distinguishes Treewidth from Pathwidth	1
The Spectrum of Triangle-Free Graphs	1
Greedy Causal Discovery Is Geometric	1
The Equivariant Inverse Kazhdan--Lusztig Polynomials of Uniform Matroids	1
Rank-Metric Codes, Semifields, and the Average Critical Problem	1
Matroid Intersection under Restricted Oracles	1
Partial Reflections and Globally Linked Pairs in Rigid Graphs	1
Sublinear Longest Path Transversals	1
Inequalities on Projected Volumes	1
Geometry of the Minimal Solutions of a Linear Diophantine Equation	1
Shallow Minors, Graph Products, and Beyond-Planar Graphs	1
The Lower Bound Theorem for $d$-Polytopes with $2{d}+1$ Vertices	1
Frameworks with Coordinated Edge Motions	1
On Connected Components with Many Edges	1
Counterexamples to a Conjecture of Harris on Hall Ratio	1
Shadows of 3-Uniform Hypergraphs under a Minimum Degree Condition	1
Normality of the Kimura 3-Parameter Model	1
A Stability Result of the Pósa Lemma	1
Maker-Breaker Games on Randomly Perturbed Graphs	1
On the Vanishing of Discrete Singular Cubical Homology for Graphs	1
Ramsey Equivalence for Asymmetric Pairs of Graphs	1
Further Exploiting c-Closure for FPT Algorithms and Kernels for Domination Problems	1
Disjoint Cycles in a Digraph with Partial Degree	1
Packing and Covering Induced Subdivisions	1
The Strong Fractional Choice Number and the Strong Fractional Paint Number of Graphs	1
Inverse Problems for Discrete Heat Equations and Random Walks for a Class of Graphs	1
Heroes in Orientations of Chordal Graphs	1
Minimizing the Number of Edges in $K_{(s,t)}$-Saturated Bipartite Graphs	1
A Linear Fixed Parameter Tractable Algorithm for Connected Pathwidth	1
Intertwining Connectivities for Vertex-Minors and Pivot-Minors	1