SIAM Journal on Discrete Mathematics

Papers
(The TQCC of SIAM Journal on Discrete Mathematics is 1. The table below lists those papers that are above that threshold based on CrossRef citation counts [max. 250 papers]. The publications cover those that have been published in the past four years, i.e., from 2021-02-01 to 2025-02-01.)
ArticleCitations
Faster 3-Coloring of Small-Diameter Graphs17
On Dyadic Fractional Packings of $T$-Joins13
Clean Clutters and Dyadic Fractional Packings11
Euclidean Steiner Spanners: Light and Sparse10
The Extremality of 2-Partite Turán Graphs with Respect to the Number of Colorings8
Quasirandom-Forcing Orientations of Cycles7
Parameterized Counting and Cayley Graph Expanders7
Approximability of Monotone Submodular Function Maximization under Cardinality and Matroid Constraints in the Streaming Model7
Matroid Intersection under Restricted Oracles6
Multiplicative Properties of Hilbert Cubes6
Symmetric Layer-Rainbow Colorations of Cubes6
Hamiltonian Cycles in 4-Connected Planar and Projective Planar Triangulations with Few 4-Separators6
The Strong Fractional Choice Number and the Strong Fractional Paint Number of Graphs5
A Menger-Type Theorem for Two Induced Paths5
Revisiting and Improving Upper Bounds for Identifying Codes5
On the Chromatic Number of Random Regular Hypergraphs5
Nontrivial t-Intersecting Families for Vector Spaces5
2-Modular Matrices5
Lossless Prioritized Embeddings5
Some Cubic Time Regularity Algorithms for Triple Systems4
Topology of Cut Complexes of Graphs4
Pure Pairs. IX. Transversal Trees4
Invertibility of Digraphs and Tournaments4
Rapid Mixing of \({\boldsymbol{k}}\)-Class Biased Permutations4
Don’t Roll the Dice, Ask Twice: The Two-Query Distortion of Matching Problems and Beyond4
Rainbow Bases in Matroids4
Pathwidth vs Cocircumference4
Concepts of Dimension for Convex Geometries4
Fractionally Subadditive Maximization under an Incremental Knapsack Constraint with Applications to Incremental Flows4
List-3-Coloring Ordered Graphs with a Forbidden Induced Subgraph4
On the Gamma-Vector of Symmetric Edge Polytopes3
A Note on Infinite Antichain Density3
A Water-Filling Primal-Dual Algorithm for Approximating NonLinear Covering Problems3
Algorithmic Applications of Tree-Cut Width3
Cyclic Matroids3
Ramsey Equivalence for Asymmetric Pairs of Graphs3
Canonical Theorems for Colored Integers with Respect to Some Linear Combinations3
Phase Transitions for the Minimizers of the \(p\)-Frame Potentials in \(\mathbb{R}^{2}\)3
On the Parameterized Complexity of Counting Small-Sized Minimum \(\boldsymbol{(S,T)}\)-Cuts3
Hanani--Tutte and Hierarchical Partial Planarity3
Effective Poset Inequalities3
On the Turán Number of Generalized Theta Graphs3
Rainbow Saturation for Complete Graphs3
On Powers of Hamilton Cycles in Ramsey–Turán Theory3
The Early Evolution of the Random Graph Process in Planar Graphs and Related Classes3
Large Rainbow Cliques in Randomly Perturbed Dense Graphs3
Spanning Trees at the Connectivity Threshold3
Fuglede’s Conjecture Holds in \(\boldsymbol{\mathbb{Z}_{p}\times \mathbb{Z}_{p^{n}}}\)2
Graphs of Degree at Least \({3}\) with Minimum Algebraic Connectivity2
A Stability Result of the Pósa Lemma2
On Isomorphism-Invariant Antistochastic Properties of Random Graphs2
The Main Zero-Sum Constants over \({\boldsymbol{D}}\) 2n \({\boldsymbol{\times C_2}}\)2
Approximation Algorithms for the Random Field Ising Model2
Expected Number of Induced Subtrees Shared by Two Independent Copies of a Random Tree2
A Quantitative Helly-Type Theorem: Containment in a Homothet2
Isomorphism Testing Parameterized by Genus and Beyond2
Influence of a Set of Variables on a Boolean Function2
Rigidity of Random Subgraphs and Eigenvalues of Stiffness Matrices2
Unavoidable Induced Subgraphs of Large 2-Connected Graphs2
Bonds Intersecting Long Paths in \(k\) -Connected Graphs2
Improved NP-Hardness of Approximation for Orthogonality Dimension and Minrank2
Completing and Extending Shellings of Vertex Decomposable Complexes2
Which is the Worst-Case Nash Equilibrium?2
Extending Dekking’s Construction of an Infinite Binary Word Avoiding Abelian 4-Powers2
Constant-Ratio Approximation for Robust Bin Packing with Budgeted Uncertainty2
Shadows of 3-Uniform Hypergraphs under a Minimum Degree Condition2
Anti-Ramsey Number of Matchings in 3-Uniform Hypergraphs2
Eigenpolytope Universality and Graphical Designs2
A Stability Result on Matchings in 3-Uniform Hypergraphs2
Recoloring Planar Graphs of Girth at Least Five2
Cayley Sums and Minkowski Sums of Lattice Polytopes2
Strong Cocomparability Graphs and Slash-Free Orderings of Matrices2
Extremal Problem for Matchings and Rainbow Matchings on Direct Products2
Cliques, Chromatic Number, and Independent Sets in the Semi-random Process2
On Connected Components with Many Edges2
Cycle Saturation in Random Graphs2
Optimal Adjacency Labels for Subgraphs of Cartesian Products2
Maximum Number of Symmetric Extensions in Random Graphs2
Functors on Relational Structures Which Admit Both Left and Right Adjoints2
Edge-Connectivity Augmentation of Simple Graphs2
Further Exploiting c-Closure for FPT Algorithms and Kernels for Domination Problems2
Rock Extensions with Linear Diameters2
Refined List Version of Hadwiger’s Conjecture2
A Linear Bound for the Colin de Verdière Parameter \(\boldsymbol{\mu }\) for Graphs Embedded on Surfaces2
Grundy Distinguishes Treewidth from Pathwidth2
Stochastic Probing with Increasing Precision2
Square Coloring Planar Graphs with Automatic Discharging2
The Natural Matroid of an Integer Polymatroid2
On Density of \(\boldsymbol{\mathbb{Z}_3}\) -Flow-Critical Graphs2
Maximum Weight Codewords of a Linear Rank-Metric Code2
Three Combinatorial Perspectives on Minimal Codes2
Dividing a Graphical Cake2
On Weighted Graph Separation Problems and Flow Augmentation1
Frameworks with Coordinated Edge Motions1
EMSO(FO$^2$) 0-1 Law Fails for All Dense Random Graphs1
Phase Transitions of Structured Codes of Graphs1
On the Parameterized Complexity of Deletion to \(\boldsymbol{\mathcal{H}}\)-Free Strong Components1
The Structure of $I_4$-Free and Triangle-Free Binary Matroids1
Counting and Cutting Rich Lenses in Arrangements of Circles1
The Overfullness of Graphs with Small Minimum Degree and Large Maximum Degree1
Counterexamples to a Conjecture of Harris on Hall Ratio1
On Treewidth and Stable Marriage: Parameterized Algorithms and Hardness Results (Complete Characterization)1
On \({\boldsymbol q}\)-Counting of Noncrossing Chains and Parking Functions1
Refinement on Spectral Turán’s Theorem1
Discursive Voter Models on the Supercritical Scale-Free Network1
The Treewidth and Pathwidth of Graph Unions1
The Lower Bound Theorem for $d$-Polytopes with $2{d}+1$ Vertices1
Rainbow Spanning Trees in Randomly Colored \(\boldsymbol{G}_{\boldsymbol{k}-\boldsymbol{out}}\)1
Brillouin Zones of Integer Lattices and Their Perturbations1
On the Size of Matchings in 1-Planar Graph with High Minimum Degree1
Solving the Maximum Popular Matching Problem with Matroid Constraints1
Pure Pairs VI: Excluding an Ordered Tree1
Computational Complexity of Biased Diffusion-Limited Aggregation1
Exchange Distance of Basis Pairs in Split Matroids1
On the Weisfeiler–Leman Dimension of Permutation Graphs1
The Degrees of Regular Polytopes of Type [4, 4, 4]1
On the Turán Number of Edge Blow-Ups of Cliques1
Transversal Hamilton Cycle in Hypergraph Systems1
Modules in Robinson Spaces1
Graph Limits and Spectral Extremal Problems for Graphs1
A Complete Multipartite Basis for the Chromatic Symmetric Function1
Online Ramsey Numbers: Long versus Short Cycles1
Greedy Causal Discovery Is Geometric1
On the Length of Directed Paths in Digraphs1
A 3/2-Approximation for the Metric Many-Visits Path TSP1
On Vietoris–Rips Complexes (with Scale 3) of Hypercube Graphs1
Corrigendum: Orthogonal Tree-Decompositions of Graphs1
On the Largest Common Subtree of Random Leaf-Labeled Binary Trees1
On the Generalized Turán Problem for Odd Cycles1
Stable Approximation Algorithms for the Dynamic Broadcast Range-Assignment Problem1
The Profile Polytope of Nontrivial Intersecting Families1
The Tuza–Vestergaard Theorem1
A Kneser-Type Theorem for Restricted Sumsets1
Strengthening a Theorem of Meyniel1
Tangles and Hierarchical Clustering1
An Improved Upper Bound for the Ring Loading Problem1
The Flow Index of Regular Class I Graphs1
Hypergraph Horn Functions1
Letter Graphs and Geometric Grid Classes of Permutations1
Ideal Membership Problem over 3-Element CSPs with Dual Discriminator Polymorphism1
Bridge-Depth Characterizes which Minor-Closed Structural Parameterizations of Vertex Cover Admit a Polynomial Kernel1
On Packing Dijoins in Digraphs and Weighted Digraphs1
A Note on Seminormality of Cut Polytopes1
On Discrete Truthful Heterogeneous Two-Facility Location1
Rank-Metric Codes, Semifields, and the Average Critical Problem1
Online Assortment and Market Segmentation under Bertrand Competition with Set-Dependent Revenues1
Online Spanners in Metric Spaces1
Colorful Hamilton Cycles in Random Graphs1
The \(s\)-Weak Order and \(s\)-Permutahedra I: Combinatorics and Lattice Structure1
On Ramsey Size-Linear Graphs and Related Questions1
On Covering Segments with Unit Intervals1
Intertwining Connectivities for Vertex-Minors and Pivot-Minors1
Convex Characters, Algorithms, and Matchings1
Coloring Tournaments with Few Colors: Algorithms and Complexity1
Lower Bounds for Maximum Weighted Cut1
A Note on Small Weight Codewords of Projective Geometric Codes and on the Smallest Sets of Even Type1
Robust Factorizations and Colorings of Tensor Graphs1
A General Family of MSRD Codes and PMDS Codes with Smaller Field Sizes from Extended Moore Matrices1
The Spectrum of the Grigoriev–Laurent Pseudomoments1
Bernoulli Factories for Flow-Based Polytopes1
The Success Probability in Levine’s Hat Problem, and Independent Sets in Graphs1
Random Necklaces Require Fewer Cuts1
On Discrete LOG-Brunn--Minkowski Type Inequalities1
A Polynomial-Time Algorithm to Determine (Almost) Hamiltonicity of Dense Regular Graphs1
Exchange Properties of Finite Set-Systems1
Two-Colorings of Normed Spaces without Long Monochromatic Unit Arithmetic Progressions1
The Smallest Classes of Binary and Ternary Matroids Closed under Direct Sums and Complements1
Tiling Edge-Ordered Graphs with Monotone Paths and Other Structures1
Spanning Bipartite Quadrangulations of Triangulations of the Projective Plane1
Elimination Distances, Blocking Sets, and Kernels for Vertex Cover1
Additive Energy of Polynomial Images1
Tuza’s Conjecture for Binary Geometries1
Rapid Mixing of the Switch Markov Chain for 2-Class Joint Degree Matrices1
Search-Space Reduction via Essential Vertices1
Self-Dual Maps II: Links and Symmetry1
On Induced Paths, Holes, and Trees in Random Graphs1
Unified Greedy Approximability beyond Submodular Maximization1
A Fixed-Parameter Tractable Algorithm for Elimination Distance to Bounded Degree Graphs1
Computational Complexity of Minimal Trap Spaces in Boolean Networks1
0.068310022354126