SIAM Journal on Discrete Mathematics

Article	Citations
Faster 3-Coloring of Small-Diameter Graphs	17
On Dyadic Fractional Packings of $T$-Joins	13
Clean Clutters and Dyadic Fractional Packings	11
Euclidean Steiner Spanners: Light and Sparse	10
The Extremality of 2-Partite Turán Graphs with Respect to the Number of Colorings	8
Quasirandom-Forcing Orientations of Cycles	7
Parameterized Counting and Cayley Graph Expanders	7
Approximability of Monotone Submodular Function Maximization under Cardinality and Matroid Constraints in the Streaming Model	7
2-Modular Matrices	6
Multiplicative Properties of Hilbert Cubes	6
Symmetric Layer-Rainbow Colorations of Cubes	6
Hamiltonian Cycles in 4-Connected Planar and Projective Planar Triangulations with Few 4-Separators	6
Revisiting and Improving Upper Bounds for Identifying Codes	5
A Menger-Type Theorem for Two Induced Paths	5
Sumsets in the Hypercube	5
On the Chromatic Number of Random Regular Hypergraphs	5
The Strong Fractional Choice Number and the Strong Fractional Paint Number of Graphs	5
Nontrivial t-Intersecting Families for Vector Spaces	5
Lossless Prioritized Embeddings	5
Don’t Roll the Dice, Ask Twice: The Two-Query Distortion of Matching Problems and Beyond	4
Rapid Mixing of \({\boldsymbol{k}}\)-Class Biased Permutations	4
Pathwidth vs Cocircumference	4
Rainbow Saturation for Complete Graphs	4
Concepts of Dimension for Convex Geometries	4
Fractionally Subadditive Maximization under an Incremental Knapsack Constraint with Applications to Incremental Flows	4

Rainbow Bases in Matroids	4
Some Cubic Time Regularity Algorithms for Triple Systems	4
List-3-Coloring Ordered Graphs with a Forbidden Induced Subgraph	4
Topology of Cut Complexes of Graphs	4
Pure Pairs. IX. Transversal Trees	4
Invertibility of Digraphs and Tournaments	4
Canonical Theorems for Colored Integers with Respect to Some Linear Combinations	4
On the Turán Number of Generalized Theta Graphs	3
A Linear Bound for the Colin de Verdière Parameter \(\boldsymbol{\mu }\) for Graphs Embedded on Surfaces	3
The Early Evolution of the Random Graph Process in Planar Graphs and Related Classes	3
On the Parameterized Complexity of Counting Small-Sized Minimum \(\boldsymbol{(S,T)}\)-Cuts	3
Hanani--Tutte and Hierarchical Partial Planarity	3
Effective Poset Inequalities	3
Isomorphism Testing Parameterized by Genus and Beyond	3
On Powers of Hamilton Cycles in Ramsey–Turán Theory	3
Phase Transitions for the Minimizers of the \(p\)-Frame Potentials in \(\mathbb{R}^{2}\)	3
Large Rainbow Cliques in Randomly Perturbed Dense Graphs	3
Spanning Trees at the Connectivity Threshold	3
On the Gamma-Vector of Symmetric Edge Polytopes	3
A Note on Infinite Antichain Density	3
A Water-Filling Primal-Dual Algorithm for Approximating NonLinear Covering Problems	3
Algorithmic Applications of Tree-Cut Width	3
Cyclic Matroids	3
Rapid Mixing of the Switch Markov Chain for 2-Class Joint Degree Matrices	2
On Density of \(\boldsymbol{\mathbb{Z}_3}\) -Flow-Critical Graphs	2
Ideal Membership Problem over 3-Element CSPs with Dual Discriminator Polymorphism	2
Optimal Adjacency Labels for Subgraphs of Cartesian Products	2
Completing and Extending Shellings of Vertex Decomposable Complexes	2
Eigenpolytope Universality and Graphical Designs	2
Extending Dekking’s Construction of an Infinite Binary Word Avoiding Abelian 4-Powers	2
Further Exploiting c-Closure for FPT Algorithms and Kernels for Domination Problems	2
Shadows of 3-Uniform Hypergraphs under a Minimum Degree Condition	2
Refined List Version of Hadwiger’s Conjecture	2
A Stability Result of the Pósa Lemma	2
Expected Number of Induced Subtrees Shared by Two Independent Copies of a Random Tree	2
Improved NP-Hardness of Approximation for Orthogonality Dimension and Minrank	2
Constant-Ratio Approximation for Robust Bin Packing with Budgeted Uncertainty	2
Strong Cocomparability Graphs and Slash-Free Orderings of Matrices	2
Online Assortment and Market Segmentation under Bertrand Competition with Set-Dependent Revenues	2
A Note on Seminormality of Cut Polytopes	2
Unavoidable Induced Subgraphs of Large 2-Connected Graphs	2
Cycle Saturation in Random Graphs	2
Fuglede’s Conjecture Holds in \(\boldsymbol{\mathbb{Z}_{p}\times \mathbb{Z}_{p^{n}}}\)	2
Maximum Number of Symmetric Extensions in Random Graphs	2
Cayley Sums and Minkowski Sums of Lattice Polytopes	2
Edge-Connectivity Augmentation of Simple Graphs	2
The Main Zero-Sum Constants over \({\boldsymbol{D}}\) 2n \({\boldsymbol{\times C_2}}\)	2
Rock Extensions with Linear Diameters	2
Approximation Algorithms for the Random Field Ising Model	2
Ramsey Equivalence for Asymmetric Pairs of Graphs	2

Three Combinatorial Perspectives on Minimal Codes	2
Stochastic Probing with Increasing Precision	2
Square Coloring Planar Graphs with Automatic Discharging	2
The Degrees of Regular Polytopes of Type [4, 4, 4]	2
Elimination Distances, Blocking Sets, and Kernels for Vertex Cover	2
On Connected Components with Many Edges	2
Dividing a Graphical Cake	2
Which is the Worst-Case Nash Equilibrium?	2
Graphs of Degree at Least \({3}\) with Minimum Algebraic Connectivity	2
Grundy Distinguishes Treewidth from Pathwidth	2
On Isomorphism-Invariant Antistochastic Properties of Random Graphs	2
Anti-Ramsey Number of Matchings in 3-Uniform Hypergraphs	2
A Stability Result on Matchings in 3-Uniform Hypergraphs	2
Functors on Relational Structures Which Admit Both Left and Right Adjoints	2
Matroid Intersection under Restricted Oracles	2
A Quantitative Helly-Type Theorem: Containment in a Homothet	2
Recoloring Planar Graphs of Girth at Least Five	2
Counting and Cutting Rich Lenses in Arrangements of Circles	2
Refinement on Spectral Turán’s Theorem	1
Hamiltonian Cycle Parameterized by Treedepth in Single Exponential Time and Polynomial Space	1
Cliques, Chromatic Number, and Independent Sets in the Semi-random Process	1
The Natural Matroid of an Integer Polymatroid	1
Computational Complexity of Biased Diffusion-Limited Aggregation	1
Unified Greedy Approximability beyond Submodular Maximization	1
A Note on Small Weight Codewords of Projective Geometric Codes and on the Smallest Sets of Even Type	1
Solving the Maximum Popular Matching Problem with Matroid Constraints	1
Convex Characters, Algorithms, and Matchings	1
Random Necklaces Require Fewer Cuts	1
Bridge-Depth Characterizes which Minor-Closed Structural Parameterizations of Vertex Cover Admit a Polynomial Kernel	1
The Treewidth and Pathwidth of Graph Unions	1
The Generalized Rainbow Turán Problem for Cycles	1
On the Largest Common Subtree of Random Leaf-Labeled Binary Trees	1
A Fixed-Parameter Tractable Algorithm for Elimination Distance to Bounded Degree Graphs	1
On \({\boldsymbol q}\)-Counting of Noncrossing Chains and Parking Functions	1
On the Size of Matchings in 1-Planar Graph with High Minimum Degree	1
Brillouin Zones of Integer Lattices and Their Perturbations	1
Bernoulli Factories for Flow-Based Polytopes	1
Maximum Weight Codewords of a Linear Rank-Metric Code	1
Two-Colorings of Normed Spaces without Long Monochromatic Unit Arithmetic Progressions	1
Exploiting $c$-Closure in Kernelization Algorithms for Graph Problems	1
Search-Space Reduction via Essential Vertices	1
A Complete Multipartite Basis for the Chromatic Symmetric Function	1
The \(s\)-Weak Order and \(s\)-Permutahedra I: Combinatorics and Lattice Structure	1
Edges Not Covered by Monochromatic Bipartite Graph	1
The Lower Bound Theorem for $d$-Polytopes with $2{d}+1$ Vertices	1
Heroes in Orientations of Chordal Graphs	1
On Treewidth and Stable Marriage: Parameterized Algorithms and Hardness Results (Complete Characterization)	1
Self-Dual Maps II: Links and Symmetry	1
Exchange Distance of Basis Pairs in Split Matroids	1
Parameterized Complexity for Finding a Perfect Phylogeny from Mixed Tumor Samples	1
Rank-Metric Codes, Semifields, and the Average Critical Problem	1
Extremal Problem for Matchings and Rainbow Matchings on Direct Products	1
Pure Pairs VI: Excluding an Ordered Tree	1
On Weighted Graph Separation Problems and Flow Augmentation	1
The Profile Polytope of Nontrivial Intersecting Families	1
On the Turán Number of Edge Blow-Ups of Cliques	1
The Spectrum of the Grigoriev–Laurent Pseudomoments	1
Bonds Intersecting Long Paths in \(k\) -Connected Graphs	1
A General Family of MSRD Codes and PMDS Codes with Smaller Field Sizes from Extended Moore Matrices	1
Tuza’s Conjecture for Binary Geometries	1
Rainbow Spanning Trees in Randomly Colored \(\boldsymbol{G}_{\boldsymbol{k}-\boldsymbol{out}}\)	1
Expanders on Matrices over a Finite Chain Ring, II	1
Graph Limits and Spectral Extremal Problems for Graphs	1
Robust Factorizations and Colorings of Tensor Graphs	1
Group Connectivity in 3-Edge-Connected Signed Graphs	1
Online Spanners in Metric Spaces	1
Metric Dimension Parameterized by Feedback Vertex Set and Other Structural Parameters	1
Computational Complexity of Minimal Trap Spaces in Boolean Networks	1
On Vietoris–Rips Complexes (with Scale 3) of Hypercube Graphs	1
A Polynomial-Time Algorithm to Determine (Almost) Hamiltonicity of Dense Regular Graphs	1
On the Generalized Turán Problem for Odd Cycles	1
The Fractional Chromatic Number of \(\boldsymbol{K_{\Delta }}\)-Free Graphs	1
On Discrete LOG-Brunn--Minkowski Type Inequalities	1
Greedy Causal Discovery Is Geometric	1
On Induced Paths, Holes, and Trees in Random Graphs	1
The Success Probability in Levine’s Hat Problem, and Independent Sets in Graphs	1
Marked Graphs and the Chromatic Symmetric Function	1
Hypergraph Horn Functions	1
Rigidity of Random Subgraphs and Eigenvalues of Stiffness Matrices	1
Tiling Edge-Ordered Graphs with Monotone Paths and Other Structures	1

On the Weisfeiler–Leman Dimension of Permutation Graphs	1
Influence of a Set of Variables on a Boolean Function	1
On Packing Dijoins in Digraphs and Weighted Digraphs	1
On Ramsey Size-Linear Graphs and Related Questions	1
Additive Energy of Polynomial Images	1
Online Ramsey Numbers: Long versus Short Cycles	1
Modules in Robinson Spaces	1
Disjoint Cycles with Length Constraints in Digraphs of Large Connectivity or Large Minimum Degree	1
On Discrete Truthful Heterogeneous Two-Facility Location	1
Intertwining Connectivities for Vertex-Minors and Pivot-Minors	1
Stable Approximation Algorithms for the Dynamic Broadcast Range-Assignment Problem	1
Discursive Voter Models on the Supercritical Scale-Free Network	1
Spanning Bipartite Quadrangulations of Triangulations of the Projective Plane	1
Tangles and Hierarchical Clustering	1
Matroids on Eight Elements with the Half-Plane Property and Related Concepts	1
Phase Transitions of Structured Codes of Graphs	1
Colorful Hamilton Cycles in Random Graphs	1
An Improved Upper Bound for the Ring Loading Problem	1
The Tuza–Vestergaard Theorem	1
A Kneser-Type Theorem for Restricted Sumsets	1
Extremal Problems for Hypergraph Blowups of Trees	1
Transversal Hamilton Cycle in Hypergraph Systems	1
When Do Gomory--Hu Subtrees Exist?	1
Letter Graphs and Geometric Grid Classes of Permutations	1