SIAM Journal on Discrete Mathematics

Article	Citations
On Powers of Hamilton Cycles in Ramsey–Turán Theory	18
Graphs of Degree at Least \({3}\) with Minimum Algebraic Connectivity	14
A Quantitative Helly-Type Theorem: Containment in a Homothet	13
Strong Cocomparability Graphs and Slash-Free Orderings of Matrices	13
Clean Clutters and Dyadic Fractional Packings	9
Fractionally Subadditive Maximization under an Incremental Knapsack Constraint with Applications to Incremental Flows	8
Approximability of Monotone Submodular Function Maximization under Cardinality and Matroid Constraints in the Streaming Model	8
On the Turán Number of Generalized Theta Graphs	8
Pure Pairs. IX. Transversal Trees	8
Concepts of Dimension for Convex Geometries	7
Cayley Sums and Minkowski Sums of Lattice Polytopes	7
Rock Extensions with Linear Diameters	7
Topology of Cut Complexes of Graphs	6
Isomorphism Testing Parameterized by Genus and Beyond	6
Dividing a Graphical Cake	6
Additive Energy of Polynomial Images	5
Rapid Mixing of the Switch Markov Chain for 2-Class Joint Degree Matrices	5
On Bipartite Graph Realizations of a Single Degree Sequence	5
On Density of \(\boldsymbol{\mathbb{Z}_3}\) -Flow-Critical Graphs	5
Letter Graphs and Geometric Grid Classes of Permutations	5
Cycle Saturation in Random Graphs	5
On Perles’ Configuration	5
Modules in Robinson Spaces	5
The Lower Bound Theorem for $d$-Polytopes with $2{d}+1$ Vertices	5
On the Weisfeiler–Leman Dimension of Permutation Graphs	4

Two-Colorings of Normed Spaces without Long Monochromatic Unit Arithmetic Progressions	4
The Success Probability in Levine’s Hat Problem, and Independent Sets in Graphs	4
The Multivariate Schwartz--Zippel Lemma	4
Decomposing Random Permutations into Order-Isomorphic Subpermutations	4
Tangles and Hierarchical Clustering	4
Tuza’s Conjecture for Binary Geometries	4
Bridge-Depth Characterizes which Minor-Closed Structural Parameterizations of Vertex Cover Admit a Polynomial Kernel	4
Degrees of Interior Polynomials and Parking Function Enumerators	4
Matroids on Eight Elements with the Half-Plane Property and Related Concepts	4
Extremal Problems for Hypergraph Blowups of Trees	4
Robust Factorizations and Colorings of Tensor Graphs	4
On the Size of Matchings in 1-Planar Graph with High Minimum Degree	4
On Packing Dijoins in Digraphs and Weighted Digraphs	4
Pure Pairs VI: Excluding an Ordered Tree	4
Online Spanners in Metric Spaces	4
Parameterized Complexity for Finding a Perfect Phylogeny from Mixed Tumor Samples	4
Odd Paths, Cycles, and \(T\)-Joins: Connections and Algorithms	4
Matchings, Relaxed Popularity, and Optimality	4
On Multicolor Ramsey Numbers of Triple System Paths of Length 3	3
M-Convexity of Vexillary Grothendieck Polynomials via Bubbling	3
The Rainbow Saturation Number Is Linear	3
The Spectrum of Triangle-Free Graphs	3
Reconfiguration of Digraph Homomorphisms	3
Coloring Tournaments with Few Colors: Algorithms and Complexity	3
Packing Signatures in Signed Graphs	3
Partial Reflections and Globally Linked Pairs in Rigid Graphs	3
A $\frac{4}{3}$-Approximation Algorithm for the Minimum 2-Edge Connected Multisubgraph Problem in the Half-Integral Case	3
Planarity via Spanning Tree Number: A Linear-Algebraic Criterion	3
Twin-Width of Subdivisions of Multigraphs	3
The Tropical Critical Points of an Affine Matroid	3
Maximizing Line Subgraphs of Diameter at Most t	3
On Ordered Ramsey Numbers of Tripartite 3-Uniform Hypergraphs	3
On the PoA Conjecture: Trees versus Biconnected Components	3
When Do Gomory--Hu Subtrees Exist?	3
Reconstructibility of Matroid Polytopes	3
Bounding the Number of Edges of Matchstick Graphs	3
Longest Cycle above Erdős–Gallai Bound	3
A Sublinear Bound on the Page Number of Upward Planar Graphs	3
Planarity and Genus of Sparse Random Bipartite Graphs	3
Inverse Problems for Discrete Heat Equations and Random Walks for a Class of Graphs	3
On the Stability of the Graph Independence Number	3
Circular \({\boldsymbol{(4-\epsilon )}}\) -Coloring of Some Classes of Signed Graphs	3
Extremal Problem for Matchings and Rainbow Matchings on Direct Products	2
Orientation of Fitch Graphs and Reconciliation-Free Inference of Horizontal Gene Transfer in Gene Trees	2
A Proof of the 3/4-Conjecture for the Total Domination Game	2
Improved NP-Hardness of Approximation for Orthogonality Dimension and Minrank	2
Edge-Connectivity Augmentation of Simple Graphs	2
Revisiting and Improving Upper Bounds for Identifying Codes	2
Matroid Intersection under Restricted Oracles	2
Effective Poset Inequalities	2

A Stability Result for \(\boldsymbol{C}_{\boldsymbol{2k+1}}\)-Free Graphs	2
Bounding and Computing Obstacle Numbers of Graphs	2
Acyclic Colorings of Graphs with Obstructions	2
Computing Paths of Large Rank in Planar Frameworks Deterministically	2
Nonuniform Degrees and Rainbow Versions of the Caccetta–Häggkvist Conjecture	2
Self-Dual Maps I: Antipodality	2
The Ramsey Number for 4-Uniform Tight Cycles	2
Greedy Causal Discovery Is Geometric	2
Tropical Linear Regression and Mean Payoff Games: Or, How to Measure the Distance to Equilibria	2
Classification of Finite Highly Regular Vertex-Colored Graphs	2
Invertibility of Digraphs and Tournaments	2
A Kneser-Type Theorem for Restricted Sumsets	2
Canonical Theorems for Colored Integers with Respect to Some Linear Combinations	2
Adapting the Directed Grid Theorem into an FPT Algorithm	2
Kinetic Geodesic Voronoi Diagrams in a Simple Polygon	2
Highly Connected Subgraphs with Large Chromatic Number	2
Short Rank-Metric Codes and Scattered Subspaces	2
A Precise Condition for Independent Transversals in Bipartite Covers	2
Approximating Submodular \({k}\)-Partition via Principal Partition Sequence	2
Ideal Membership Problem over 3-Element CSPs with Dual Discriminator Polymorphism	2
Decompositions of \(q\)-Matroids Using Cyclic Flats	2
The Threshold of Symmetry in Random Graphs with Specified Degree Sequences	2
On Discrete LOG-Brunn--Minkowski Type Inequalities	2
2-Modular Matrices	2
Further Exploiting c-Closure for FPT Algorithms and Kernels for Domination Problems	2
The Strong Fractional Choice Number and the Strong Fractional Paint Number of Graphs	2
Shape Enumerators of Self-Dual NRT Codes over Finite Fields	2
On a Conjecture of Feige for Discrete Log-Concave Distributions	2
The $\chi$-Ramsey Problem for Triangle-Free Graphs	2
Posets and Spaces of $k$-Noncrossing RNA Structures	2
The Power of the Weisfeiler--Leman Algorithm to Decompose Graphs	2
Efficient Linear and Affine Codes for Correcting Insertions/Deletions	2
On Isomorphism-Invariant Antistochastic Properties of Random Graphs	1
Extremal Graph Realizations and Graph Laplacian Eigenvalues	1
Don’t Roll the Dice, Ask Twice: The Two-Query Distortion of Matching Problems and Beyond	1
On Covering Segments with Unit Intervals	1
Quasirandom-Forcing Orientations of Cycles	1
Pfaffian Pairs and Parities: Counting on Linear Matroid Intersection and Parity Problems	1
Large Rainbow Cliques in Randomly Perturbed Dense Graphs	1
Intertwining Connectivities for Vertex-Minors and Pivot-Minors	1
Hitting Weighted Even Cycles in Planar Graphs	1
Solving the Maximum Popular Matching Problem with Matroid Constraints	1
Rigidity of Random Subgraphs and Eigenvalues of Stiffness Matrices	1
Product Structure Extension of the Alon–Seymour–Thomas Theorem	1
Unavoidable Induced Subgraphs of Large 2-Connected Graphs	1
Anti-Ramsey Number of Matchings in 3-Uniform Hypergraphs	1
The Structure of $I_4$-Free and Triangle-Free Binary Matroids	1
An Algorithm to Recover Shredded Random Matrices	1
An Improved Upper Bound for the Ring Loading Problem	1
Cliques, Chromatic Number, and Independent Sets in the Semi-random Process	1
Computing the Tandem Duplication Distance is NP-Hard	1
On Cliques in Three-Dimensional Dense Point-Line Arrangements	1
Disjoint Cycles with Length Constraints in Digraphs of Large Connectivity or Large Minimum Degree	1
A Tight Lower Bound for Edge-Disjoint Paths on Planar DAGs	1
Cops and Robbers on \(\boldsymbol{P_5}\)-Free Graphs	1
On the Concentration of the Maximum Degree in the Duplication-Divergence Models	1
A Stability Result on Matchings in 3-Uniform Hypergraphs	1
Tight Probability Bounds with Pairwise Independence	1
On the Turán Number of Edge Blow-Ups of Cliques	1
Graphs with Large Girth and Chromatic Number are Hard for Nullstellensatz	1
Influence of a Set of Variables on a Boolean Function	1
Stable Approximation Algorithms for Dominating Set and Independent Set	1
Algorithmic Applications of Tree-Cut Width	1
On Hop-Constrained Steiner Trees in Tree-Like Metrics	1
The Early Evolution of the Random Graph Process in Planar Graphs and Related Classes	1
Functors on Relational Structures Which Admit Both Left and Right Adjoints	1
Brillouin Zones of Integer Lattices and Their Perturbations	1
Structured Codes of Graphs	1
On Vietoris–Rips Complexes (with Scale 3) of Hypercube Graphs	1
A General Family of MSRD Codes and PMDS Codes with Smaller Field Sizes from Extended Moore Matrices	1
NP-Hardness of Computing PL Geometric Category in Dimension 2	1
Self-Dual Maps II: Links and Symmetry	1
EMSO(FO$^2$) 0-1 Law Fails for All Dense Random Graphs	1
Metric Dimension Parameterized by Feedback Vertex Set and Other Structural Parameters	1
Combinatorial Generation via Permutation Languages. V. Acyclic Orientations	1
Online Assortment and Market Segmentation under Bertrand Competition with Set-Dependent Revenues	1
Convex Characters, Algorithms, and Matchings	1
Phase Transitions of Structured Codes of Graphs	1
Probability Mass of Rademacher Sums Beyond One Standard Deviation	1
A Fixed-Parameter Tractable Algorithm for Elimination Distance to Bounded Degree Graphs	1

Heroes in Orientations of Chordal Graphs	1
The Phase Transition of Discrepancy in Random Hypergraphs	1
The Excluded Minors for Three Classes of 2-Polymatroids Having Special Types of Natural Matroids	1
The Overfullness of Graphs with Small Minimum Degree and Large Maximum Degree	1
An Axiomatization of Matroids and Oriented Matroids as Conditional Independence Models	1
A Small Maximal Sidon Set in ${\mathbb{Z}}_2^n$	1
Hanani--Tutte and Hierarchical Partial Planarity	1
Poincaré Polynomials of Odd Diagram Classes	1
Rainbow Perfect Matchings for 4-Uniform Hypergraphs	1
Strengthening a Theorem of Meyniel	1
The Fractional Chromatic Number of \(\boldsymbol{K_{\Delta }}\)-Free Graphs	1
Grundy Distinguishes Treewidth from Pathwidth	1
Left-Cut-Percolation and Induced-Sidorenko Bigraphs	1
Multiplicative Properties of Hilbert Cubes	1
Globally Rigid Augmentation of Rigid Graphs	1
Euclidean Steiner Spanners: Light and Sparse	1
A Menger-Type Theorem for Two Induced Paths	1
Hypergraph Horn Functions	1
Crux and Long Cycles in Graphs	1
Nontrivial t-Intersecting Families for Vector Spaces	1
Computational Complexity of Minimal Trap Spaces in Boolean Networks	1
Tree-Degenerate Graphs and Nested Dependent Random Choice	1
On Induced Paths, Holes, and Trees in Random Graphs	1
Disjoint Cycles in a Digraph with Partial Degree	1
Exchange Properties of Finite Set-Systems	1
Sample Compression Schemes for Balls in Graphs	1
Rank-Metric Codes, Semifields, and the Average Critical Problem	1
On Ramsey Size-Linear Graphs and Related Questions	1
The Generalized Rainbow Turán Problem for Cycles	1
Sárközy’s Theorem in Various Finite Field Settings	1
The Degrees of Regular Polytopes of Type [4, 4, 4]	1
Upper Bounds on Mixing Time of Finite Markov Chains	1
The Smallest Classes of Binary and Ternary Matroids Closed under Direct Sums and Complements	1
A Property on Monochromatic Copies of Graphs Containing a Triangle	1
Dyadic Packing of Dijoins	1
Dirac’s Theorem for Linear Hypergraphs	1
The Treewidth and Pathwidth of Graph Unions	1
On \({\boldsymbol q}\)-Counting of Noncrossing Chains and Parking Functions	1
Constant Congestion Brambles in Directed Graphs	1
Simple Codes and Sparse Recovery with Fast Decoding	1
Group Connectivity in 3-Edge-Connected Signed Graphs	1
Corrigendum: Orthogonal Tree-Decompositions of Graphs	1
Bernoulli Factories for Flow-Based Polytopes	0
Excluded $t$-Factors in Bipartite Graphs: Unified Framework for Nonbipartite Matchings, Restricted 2-Matchings, and Matroids	0
On Lattice Width of Lattice-Free Polyhedra and Height of Hilbert Bases	0
On Generalized Turán Results in Height Two Posets	0
On Gupta’s Codensity Conjecture	0
Many Cliques in Bounded-Degree Hypergraphs	0
Which is the Worst-Case Nash Equilibrium?	0
Phase Transitions for the Minimizers of the \(p\)-Frame Potentials in \(\mathbb{R}^{2}\)	0
Fuglede’s Conjecture Holds in \(\boldsymbol{\mathbb{Z}_{p}\times \mathbb{Z}_{p^{n}}}\)	0
Sets Avoiding Six-Term Arithmetic Progressions in $\mathbb{Z}_6^{n}$ are Exponentially Small	0
Treewidth, Circle Graphs, and Circular Drawings	0
An Evans-Style Result for Block Designs	0
Localized Codegree Conditions for Tight Hamilton Cycles in 3-Uniform Hypergraphs	0
On the Parameterized Complexity of Counting Small-Sized Minimum \(\boldsymbol{(S,T)}\)-Cuts	0
On the Length of Directed Paths in Digraphs	0
FPT-Algorithms for the \(\ell\) -Matchoid Problem with a Coverage Objective	0
Discursive Voter Models on the Supercritical Scale-Free Network	0
Cliques in High-Dimensional Geometric Inhomogeneous Random Graphs	0
Colorful Hamilton Cycles in Random Graphs	0
Deletion Formulas for Equivariant Kazhdan–Lusztig Polynomials of Matroids	0
\(\boldsymbol{H}\)-Games Played on Vertex Sets of Random Graphs	0
On the Turán Number of the Blow-Up of the Hexagon	0
Piercing the Chessboard	0
Sumsets in the Hypercube	0
Cyclic Matroids	0
List-3-Coloring Ordered Graphs with a Forbidden Induced Subgraph	0
Optimal Adjacency Labels for Subgraphs of Cartesian Products	0
Node-Connectivity Terminal Backup, Separately Capacitated Multiflow, and Discrete Convexity	0
On the Combinatorial Diameters of Parallel and Series Connections	0
Erratum: More Applications of the \(d\)-Neighbor Equivalence: Acyclicity and Connectivity Constraints	0
A Dual Approach for Dynamic Pricing in Multidemand Markets	0
Shortest Reconfiguration of Perfect Matchings via Alternating Cycles	0
Maximum Number of Symmetric Extensions in Random Graphs	0
Optimal Sets of Questions for Twenty Questions	0
Rainbow Spanning Trees in Randomly Colored \(\boldsymbol{G}_{\boldsymbol{k}-\boldsymbol{out}}\)	0
Off-Diagonal Commonality of Graphs via Entropy	0
Counterexamples to a Conjecture of Harris on Hall Ratio	0
Boundary \({\boldsymbol{H^\ast}}\) -Polynomials of Rational Polytopes	0
A Complete Multipartite Basis for the Chromatic Symmetric Function	0
Spectrahedral Geometry of Graph Sparsifiers	0
The Typical Approximate Structure of Sets with Bounded Sumset	0
Lossless Prioritized Embeddings	0
Parameterized Counting and Cayley Graph Expanders	0
Some Cubic Time Regularity Algorithms for Triple Systems	0
Logarithmic Algorithms for Fair Division Problems	0
Hamiltonian Cycles in 4-Connected Planar and Projective Planar Triangulations with Few 4-Separators	0
A Spectral Moore Bound for Bipartite Semiregular Graphs	0
On the Gap Between Hereditary Discrepancy and the Determinant Lower Bound	0
On Book Crossing Numbers of the Complete Graph	0
Stable Approximation Algorithms for the Dynamic Broadcast Range-Assignment Problem	0
Degenerate Turán Densities of Sparse Hypergraphs II: A Solution to the Brown-Erdős-Sós Problem for Every Uniformity	0
Forbidden Tournaments and the Orientation Completion Problem	0
Geometric Network Creation Games	0