SIAM Journal on Discrete Mathematics

Article	Citations
Graphs of Degree at Least \({3}\) with Minimum Algebraic Connectivity	19
Clean Clutters and Dyadic Fractional Packings	15
On the Turán Number of Generalized Theta Graphs	14
Approximability of Monotone Submodular Function Maximization under Cardinality and Matroid Constraints in the Streaming Model	13
Cayley Sums and Minkowski Sums of Lattice Polytopes	11
Rock Extensions with Linear Diameters	11
Dividing a Graphical Cake	10
Concepts of Dimension for Convex Geometries	10
On Bipartite Graph Realizations of a Single Degree Sequence	9
On Perles’ Configuration	9
Topology of Cut Complexes of Graphs	8
Fractionally Subadditive Maximization under an Incremental Knapsack Constraint with Applications to Incremental Flows	7
Isomorphism Testing Parameterized by Genus and Beyond	7
A Quantitative Helly-Type Theorem: Containment in a Homothet	6
Strong Cocomparability Graphs and Slash-Free Orderings of Matrices	6
Excluding a Clique or a Biclique in Graphs of Bounded Induced Matching Treewidth	6
Pure Pairs. IX. Transversal Trees	6
The Lower Bound Theorem for $d$-Polytopes with $2{d}+1$ Vertices	6
On Powers of Hamilton Cycles in Ramsey–Turán Theory	6
Topology of Cut Complexes II	5
Degrees of Interior Polynomials and Parking Function Enumerators	5
Pure Pairs VI: Excluding an Ordered Tree	5
Rapid Mixing of the Switch Markov Chain for 2-Class Joint Degree Matrices	5
On the Weisfeiler–Leman Dimension of Permutation Graphs	5
On the Size of Matchings in 1-Planar Graph with High Minimum Degree	5

Letter Graphs and Geometric Grid Classes of Permutations	5
Tuza’s Conjecture for Binary Geometries	5
Matchings, Relaxed Popularity, and Optimality	5
Cycle Saturation in Random Graphs	4
The Success Probability in Levine’s Hat Problem, and Independent Sets in Graphs	4
Online Spanners in Metric Spaces	4
Modules in Robinson Spaces	4
Odd Paths, Cycles, and \(T\)-Joins: Connections and Algorithms	4
Reconfiguration of Digraph Homomorphisms	4
When Do Gomory--Hu Subtrees Exist?	4
Bridge-Depth Characterizes which Minor-Closed Structural Parameterizations of Vertex Cover Admit a Polynomial Kernel	4
On Density of \(\boldsymbol{\mathbb{Z}_3}\) -Flow-Critical Graphs	4
Two-Colorings of Normed Spaces without Long Monochromatic Unit Arithmetic Progressions	4
Decomposing Random Permutations into Order-Isomorphic Subpermutations	4
Robust Factorizations and Colorings of Tensor Graphs	4
Tangles and Hierarchical Clustering	4
Additive Energy of Polynomial Images	4
On Packing Dijoins in Digraphs and Weighted Digraphs	4
The Multivariate Schwartz--Zippel Lemma	4
Extremal Problems for Hypergraph Blowups of Trees	4
Coloring Tournaments with Few Colors: Algorithms and Complexity	4
Matroids on Eight Elements with the Half-Plane Property and Related Concepts	4
Inverse Problems for Discrete Heat Equations and Random Walks for a Class of Graphs	3
Planarity via Spanning Tree Number: A Linear-Algebraic Criterion	3
Packing Signatures in Signed Graphs	3
On the Stability of the Graph Independence Number	3
Partial Reflections and Globally Linked Pairs in Rigid Graphs	3
Decompositions of \(q\)-Matroids Using Cyclic Flats	3
Acyclic Colorings of Graphs with Obstructions	3
Efficient Linear and Affine Codes for Correcting Insertions/Deletions	3
The Threshold of Symmetry in Random Graphs with Specified Degree Sequences	3
Classification of Finite Highly Regular Vertex-Colored Graphs	3
The Ramsey Number for 4-Uniform Tight Cycles	3
A Sublinear Bound on the Page Number of Upward Planar Graphs	3
Maximizing Line Subgraphs of Diameter at Most t	3
Twin-Width of Subdivisions of Multigraphs	3
The Spectrum of Triangle-Free Graphs	3
Parameterized Complexity for Finding a Perfect Phylogeny from Mixed Tumor Samples	3
Bounding the Number of Edges of Matchstick Graphs	3
On Multicolor Ramsey Numbers of Triple System Paths of Length 3	3
Posets and Spaces of $k$-Noncrossing RNA Structures	3
A $\frac{4}{3}$-Approximation Algorithm for the Minimum 2-Edge Connected Multisubgraph Problem in the Half-Integral Case	3
Reconstructibility of Matroid Polytopes	3
A Precise Condition for Independent Transversals in Bipartite Covers	3
Nonuniform Degrees and Rainbow Versions of the Caccetta–Häggkvist Conjecture	3
On Ordered Ramsey Numbers of Tripartite 3-Uniform Hypergraphs	3
The Rainbow Saturation Number Is Linear	3
Circular \({\boldsymbol{(4-\epsilon )}}\) -Coloring of Some Classes of Signed Graphs	3
Planarity and Genus of Sparse Random Bipartite Graphs	3
On the PoA Conjecture: Trees versus Biconnected Components	3

The Tropical Critical Points of an Affine Matroid	3
The $\chi$-Ramsey Problem for Triangle-Free Graphs	3
Tropical Linear Regression and Mean Payoff Games: Or, How to Measure the Distance to Equilibria	3
M-Convexity of Vexillary Grothendieck Polynomials via Bubbling	3
Orientation of Fitch Graphs and Reconciliation-Free Inference of Horizontal Gene Transfer in Gene Trees	3
Approximating Submodular \({k}\)-Partition via Principal Partition Sequence	3
Longest Cycle above Erdős–Gallai Bound	3
Bounding and Computing Obstacle Numbers of Graphs	2
The Strong Fractional Choice Number and the Strong Fractional Paint Number of Graphs	2
Improved NP-Hardness of Approximation for Orthogonality Dimension and Minrank	2
Corrigendum: Orthogonal Tree-Decompositions of Graphs	2
Rainbow Perfect Matchings for 4-Uniform Hypergraphs	2
Matroid Intersection under Restricted Oracles	2
Disjoint Cycles with Length Constraints in Digraphs of Large Connectivity or Large Minimum Degree	2
Seymour and Woodall’s Conjecture Holds for Graphs with Independence Number Two	2
Ideal Membership Problem over 3-Element CSPs with Dual Discriminator Polymorphism	2
Adapting the Directed Grid Theorem into an FPT Algorithm	2
On Ramsey Size-Linear Graphs and Related Questions	2
Kinetic Geodesic Voronoi Diagrams in a Simple Polygon	2
Short Rank-Metric Codes and Scattered Subspaces	2
Cliques, Chromatic Number, and Independent Sets in the Semi-random Process	2
A Proof of the 3/4-Conjecture for the Total Domination Game	2
Revisiting and Improving Upper Bounds for Identifying Codes	2
Self-Dual Maps I: Antipodality	2
Heroes in Orientations of Chordal Graphs	2
The Fractional Chromatic Number of \(\boldsymbol{K_{\Delta }}\)-Free Graphs	2
EMSO(FO$^2$) 0-1 Law Fails for All Dense Random Graphs	2
Canonical Theorems for Colored Integers with Respect to Some Linear Combinations	2
Greedy Causal Discovery Is Geometric	2
Edge-Connectivity Augmentation of Simple Graphs	2
Invertibility of Digraphs and Tournaments	2
A Kneser-Type Theorem for Restricted Sumsets	2
Highly Connected Subgraphs with Large Chromatic Number	2
Shape Enumerators of Self-Dual NRT Codes over Finite Fields	2
On the Ramsey–Turán Problem for 4-Cliques	2
On a Conjecture of Feige for Discrete Log-Concave Distributions	2
The Power of the Weisfeiler--Leman Algorithm to Decompose Graphs	2
On Discrete LOG-Brunn--Minkowski Type Inequalities	2
Upper Bounds on Mixing Time of Finite Markov Chains	2
On Covering Segments with Unit Intervals	2
The Treewidth and Pathwidth of Graph Unions	2
Further Exploiting c-Closure for FPT Algorithms and Kernels for Domination Problems	2
Extremal Problem for Matchings and Rainbow Matchings on Direct Products	2
2-Modular Matrices	2
Convex Characters, Algorithms, and Matchings	2
Effective Poset Inequalities	2
A Stability Result for \(\boldsymbol{C}_{\boldsymbol{2k+1}}\)-Free Graphs	2
Obviously Strategy-Proof Mechanisms without Money for Scheduling	2
Computing Paths of Large Rank in Planar Frameworks Deterministically	2
On the Minimum Number of Arcs in \(\boldsymbol{k}\)-Dicritical Oriented Graphs	1
Left-Cut-Percolation and Induced-Sidorenko Bigraphs	1
On the Turán Number of Edge Blow-Ups of Cliques	1
Nontrivial t-Intersecting Families for Vector Spaces	1
A Tight Lower Bound for Edge-Disjoint Paths on Planar DAGs	1
Extremal Graph Realizations and Graph Laplacian Eigenvalues	1
Rank-Metric Codes, Semifields, and the Average Critical Problem	1
A Small Maximal Sidon Set in ${\mathbb{Z}}_2^n$	1
Bounds on Maximum Weight Directed Cut	1
Tight Probability Bounds with Pairwise Independence	1
Strengthening a Theorem of Meyniel	1
Quasirandom-Forcing Orientations of Cycles	1
Dyadic Packing of Dijoins	1
Tree-Degenerate Graphs and Nested Dependent Random Choice	1
The Phase Transition of Discrepancy in Random Hypergraphs	1
Euclidean Steiner Spanners: Light and Sparse	1
Feedback Vertex Set and Even Cycle Transversal for $H$-Free Graphs: Finding Large Block Graphs	1
Hitting Weighted Even Cycles in Planar Graphs	1
Metric Dimension Parameterized by Feedback Vertex Set and Other Structural Parameters	1
The Early Evolution of the Random Graph Process in Planar Graphs and Related Classes	1
Digraphs and Variable Degeneracy	1
Pfaffian Pairs and Parities: Counting on Linear Matroid Intersection and Parity Problems	1
Taming Graphs with No Large Creatures and Skinny Ladders	1
Algorithmic Applications of Tree-Cut Width	1
Reconstructing a Point Set from a Random Subset of Its Pairwise Distances	1
On Cliques in Three-Dimensional Dense Point-Line Arrangements	1
Sárközy’s Theorem in Various Finite Field Settings	1
The Generalized Rainbow Turán Problem for Cycles	1
Constant Congestion Brambles in Directed Graphs	1
Phase Transitions of Structured Codes of Graphs	1
Solving the Maximum Popular Matching Problem with Matroid Constraints	1

A Fixed-Parameter Tractable Algorithm for Elimination Distance to Bounded Degree Graphs	1
Graphs with Large Girth and Chromatic Number are Hard for Nullstellensatz	1
Computational Complexity of Minimal Trap Spaces in Boolean Networks	1
The Excluded Minors for Three Classes of 2-Polymatroids Having Special Types of Natural Matroids	1
Semigroup Intersection Problems in the Heisenberg Groups	1
Disjoint Cycles in a Digraph with Partial Degree	1
Self-Dual Maps II: Links and Symmetry	1
A Property on Monochromatic Copies of Graphs Containing a Triangle	1
Small Cocircuits in Minimally Vertically 4-Connected Matroids	1
Globally Rigid Augmentation of Rigid Graphs	1
Influence of a Set of Variables on a Boolean Function	1
A Stability Result on Matchings in 3-Uniform Hypergraphs	1
Anticoncentration and the Exact Gap-Hamming Problem	1
Crux and Long Cycles in Graphs	1
On \({\boldsymbol q}\)-Counting of Noncrossing Chains and Parking Functions	1
On Isomorphism-Invariant Antistochastic Properties of Random Graphs	1
Kissing Polytopes	1
Structured Codes of Graphs	1
The Smallest Classes of Binary and Ternary Matroids Closed under Direct Sums and Complements	1
Don’t Roll the Dice, Ask Twice: The Two-Query Distortion of Matching Problems and Beyond	1
On Multicolor Ramsey Numbers and Subset Coloring of Hypergraphs	1
Product Structure Extension of the Alon–Seymour–Thomas Theorem	1
Intertwining Connectivities for Vertex-Minors and Pivot-Minors	1
Grundy Distinguishes Treewidth from Pathwidth	1
Matching of Given Sizes in Hypergraphs	1
An Algorithm to Recover Shredded Random Matrices	1
The Discrepancy of Unsatisfiable Matrices and a Lower Bound for the Komlós Conjecture Constant	1
Large Rainbow Cliques in Randomly Perturbed Dense Graphs	1
An Axiomatization of Matroids and Oriented Matroids as Conditional Independence Models	1
The Degrees of Regular Polytopes of Type [4, 4, 4]	1
On Hop-Constrained Steiner Trees in Tree-Like Metrics	1
A General Family of MSRD Codes and PMDS Codes with Smaller Field Sizes from Extended Moore Matrices	1
Rigidity of Random Subgraphs and Eigenvalues of Stiffness Matrices	1
The Overfullness of Graphs with Small Minimum Degree and Large Maximum Degree	1
Hypergraph Horn Functions	1
Regular Graphs with Few Longest Cycles	1
Stable Approximation Algorithms for Dominating Set and Independent Set	1
On Induced Paths, Holes, and Trees in Random Graphs	1
Probability Mass of Rademacher Sums Beyond One Standard Deviation	1
On the Concentration of the Maximum Degree in the Duplication-Divergence Models	1
Dirac’s Theorem for Linear Hypergraphs	1
On Vietoris–Rips Complexes (with Scale 3) of Hypercube Graphs	1
Cops and Robbers on \(\boldsymbol{P_5}\)-Free Graphs	1
Characteristic Dependence of Syzygies of Random Monomial Ideals	1
Poincaré Polynomials of Odd Diagram Classes	1
Brillouin Zones of Integer Lattices and Their Perturbations	1
Anti-Ramsey Number of Matchings in 3-Uniform Hypergraphs	1
Ordered and Colored Subgraph Density Problems	1
NP-Hardness of Computing PL Geometric Category in Dimension 2	1
Computing the Tandem Duplication Distance is NP-Hard	1
Multiplicative Properties of Hilbert Cubes	1
Circuit Decompositions of Binary Matroids	1
Combinatorial Generation via Permutation Languages. V. Acyclic Orientations	1
Exchange Properties of Finite Set-Systems	1
Functors on Relational Structures Which Admit Both Left and Right Adjoints	1
Rank of the Vertex-Edge Incidence Matrix of r-Out Hypergraphs	1
Sample Compression Schemes for Balls in Graphs	1
The Structure of $I_4$-Free and Triangle-Free Binary Matroids	1
Hanani--Tutte and Hierarchical Partial Planarity	1
Hat Guessing Numbers of Strongly Degenerate Graphs	1
Online Assortment and Market Segmentation under Bertrand Competition with Set-Dependent Revenues	1
An Improved Upper Bound for the Ring Loading Problem	1
A Menger-Type Theorem for Two Induced Paths	1
The Power of Filling in Balanced Allocations	1
Chip-Firing and Critical Groups of Signed Graphs	1
Densest Subgraphs of a Dense Erdös–Rényi Graph. Asymptotics, Landscape, and Universality	1
Group Connectivity in 3-Edge-Connected Signed Graphs	1
Simple Codes and Sparse Recovery with Fast Decoding	1
Unavoidable Induced Subgraphs of Large 2-Connected Graphs	1
Boundary \({\boldsymbol{H^\ast}}\) -Polynomials of Rational Polytopes	0
On the Parameterized Complexity of Counting Small-Sized Minimum \(\boldsymbol{(S,T)}\)-Cuts	0
Symmetric Layer-Rainbow Colorations of Cubes	0
Three Combinatorial Perspectives on Minimal Codes	0
Lossless Prioritized Embeddings	0
Which is the Worst-Case Nash Equilibrium?	0
Bonds Intersecting Long Paths in \(k\) -Connected Graphs	0
Shortest Reconfiguration of Perfect Matchings via Alternating Cycles	0
Some Cubic Time Regularity Algorithms for Triple Systems	0
Tiling Edge-Ordered Graphs with Monotone Paths and Other Structures	0
Parameterized Counting and Cayley Graph Expanders	0
Maximum Number of Symmetric Extensions in Random Graphs	0
A Linear Bound for the Colin de Verdière Parameter \(\boldsymbol{\mu }\) for Graphs Embedded on Surfaces	0
Cyclic Matroids	0
On the Turán Number of the Blow-Up of the Hexagon	0
On the Gap Between Hereditary Discrepancy and the Determinant Lower Bound	0
On Generalized Turán Results in Height Two Posets	0
On the Combinatorial Diameters of Parallel and Series Connections	0
Hamiltonian Cycles in 4-Connected Planar and Projective Planar Triangulations with Few 4-Separators	0
Phase Transitions for the Minimizers of the \(p\)-Frame Potentials in \(\mathbb{R}^{2}\)	0
Optimal Adjacency Labels for Subgraphs of Cartesian Products	0
Sumsets in the Hypercube	0
List-3-Coloring Ordered Graphs with a Forbidden Induced Subgraph	0
FPT-Algorithms for the \(\ell\) -Matchoid Problem with a Coverage Objective	0
Treewidth, Circle Graphs, and Circular Drawings	0
Fuglede’s Conjecture Holds in \(\boldsymbol{\mathbb{Z}_{p}\times \mathbb{Z}_{p^{n}}}\)	0