OOIR: Observatory of International Research

Papers

(The TQCC of SIAM Journal on Discrete Mathematics is 2. 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 2020-05-01 to 2024-05-01.)

Article	Citations
Three Combinatorial Perspectives on Minimal Codes	14
Improved Randomized Algorithm for k-Submodular Function Maximization	13
BCH Codes with Minimum Distance Proportional to Code Length	11
Crux and Long Cycles in Graphs	8
A Proof of Brouwer's Toughness Conjecture	8
Large Book-Cycle Ramsey Numbers	8
The Size Ramsey Number of Graphs with Bounded Treewidth	8
A General Family of MSRD Codes and PMDS Codes with Smaller Field Sizes from Extended Moore Matrices	8
Sprinkling a Few Random Edges Doubles the Power	8
A Note on the Erdös Distinct Subset Sums Problem	7
Closing Gaps in Asymptotic Fair Division	7
An Irrational Lagrangian Density of a Single Hypergraph	6
On the Existence of Paradoxical Motions of Generically Rigid Graphs on the Sphere	6
Large Induced Matchings in Random Graphs	6
Planar Turán Number of the 6-Cycle	6
Parameterized Pre-Coloring Extension and List Coloring Problems	6
Treewidth versus Clique Number. I. Graph Classes with a Forbidden Structure	5
Ample Completions of Oriented Matroids and Complexes of Uniform Oriented Matroids	5
Nearly Perfect Matchings in Uniform Hypergraphs	5
Approximability of Monotone Submodular Function Maximization under Cardinality and Matroid Constraints in the Streaming Model	5
Graph Classes and Forbidden Patterns on Three Vertices	5
Small Strong Blocking Sets by Concatenation	5
Perfect Matching Index versus Circular Flow Number of a Cubic Graph	5
Rainbow Odd Cycles	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
Total Positivity from the Exponential Riordan Arrays	5
Entropy Inequalities for Sums in Prime Cyclic Groups	4
A Mélange of Diameter Helly-Type Theorems	4
A General Framework for Hypergraph Coloring	4
The Power of the Weisfeiler--Leman Algorithm to Decompose Graphs	4
Feedback Vertex Set and Even Cycle Transversal for $H$-Free Graphs: Finding Large Block Graphs	4
List Coloring of Two Matroids through Reduction to Partition Matroids	4
Rainbow Hamilton Cycles in Randomly Colored Randomly Perturbed Dense Graphs	4
Spectral Radius on Linear $r$-Graphs without Expanded $K_{r+1}$	4
Lower Bounds for Max-Cut in $H$-Free Graphs via Semidefinite Programming	4
A Note on Color-Bias Hamilton Cycles in Dense Graphs	4
Ramsey Numbers Involving Large Books	4
Kernelization of Graph Hamiltonicity: Proper $H$-Graphs	4
Shortest Reconfiguration of Perfect Matchings via Alternating Cycles	4
Linear Kernels for Edge Deletion Problems to Immersion-Closed Graph Classes	4
Enumerating Integer Points in Polytopes with Bounded Subdeterminants	4
Improved Bounds for the Excluded-Minor Approximation of Treedepth	4
Rainbow Perfect Matchings for 4-Uniform Hypergraphs	4
On Discrete Truthful Heterogeneous Two-Facility Location	4
An Approximation Algorithm for Fully Planar Edge-Disjoint Paths	4
Clean Clutters and Dyadic Fractional Packings	4
Target Set Selection in Dense Graph Classes	4
Tournaments and Bipartite Tournaments without Vertex Disjoint Cycles of Different Lengths	4
$K_2$-Hamiltonian Graphs: I	4
The Recognition Problem of Graph Search Trees	4
Bounding the Cop Number of a Graph by Its Genus	4
Fairly Allocating Many Goods with Few Queries	4
Improved Bounds on Sizes of Generalized Caps in $AG(n,q)$	3
On the Length of Monotone Paths in Polyhedra	3
Faces of Root Polytopes	3
Fuglede’s Conjecture Holds in $\boldsymbol{\mathbb{Z}_{p}\times \mathbb{Z}_{p^{n}}}$	3
Faster Approximation Algorithms for Computing Shortest Cycles on Weighted Graphs	3
Bipartite Independence Number in Graphs with Bounded Maximum Degree	3
Repeated Patterns in Proper Colorings	3
On Lattice Width of Lattice-Free Polyhedra and Height of Hilbert Bases	3
Exploiting $c$-Closure in Kernelization Algorithms for Graph Problems	3
The Ising Antiferromagnet and Max Cut on Random Regular Graphs	3
IC-Planar Graphs Are 6-Choosable	3
Euclidean Steiner Spanners: Light and Sparse	3
The Complexity of Approximating the Complex-Valued Ising Model on Bounded Degree Graphs	3
Structured Codes of Graphs	3
Lower Bounds on Sparse Spanners, Emulators, and Diameter-Reducing Shortcuts	3
Parameterized Approximation Schemes for Steiner Trees with Small Number of Steiner Vertices	3
An Improved Bound for the Rigidity of Linearly Constrained Frameworks	3
Lower and Upper Bounds on the Randomness Complexity of Private Computations of AND	3
Pure Pairs VI: Excluding an Ordered Tree	3
Fractional Chromatic Number, Maximum Degree, and Girth	3
Revisiting and Improving Upper Bounds for Identifying Codes	3
The Price of Connectivity in Fair Division	3

Atomicity and Well Quasi-Order for Consecutive Orderings on Words and Permutations	3
Packing Signatures in Signed Graphs	3
When Do Gomory--Hu Subtrees Exist?	3
Tight Probability Bounds with Pairwise Independence	2
Finding Branch-Decompositions of Matroids, Hypergraphs, and More	2
Understanding Popular Matchings via Stable Matchings	2
Splitting Necklaces, with Constraints	2
Localized Codegree Conditions for Tight Hamilton Cycles in 3-Uniform Hypergraphs	2
A Quantitative Helly-Type Theorem: Containment in a Homothet	2
Gonality Sequences of Graphs	2
Nontrivial t-Intersecting Families for Vector Spaces	2
Parity-Unimodality and a Cyclic Sieving Phenomenon for Necklaces	2
Algorithmic Applications of Tree-Cut Width	2
A Spectral Erdős-Sós Theorem	2
On Dyadic Fractional Packings of $T$-Joins	2
Relative Turán Problems for Uniform Hypergraphs	2
Tight Gaps in the Cycle Spectrum of 3-Connected Planar Graphs	2
Self-Dual Maps I: Antipodality	2
Counting Weighted Independent Sets beyond the Permanent	2
Connectivity for Kite-Linked Graphs	2
A Degree Sequence Strengthening of the Vertex Degree Threshold for a Perfect Matching in 3-Uniform Hypergraphs	2
Identifiability of Graphs with Small Color Classes by the Weisfeiler--Leman Algorithm	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
Parameterized Complexity of Conflict-Free Graph Coloring	2
Regular Graphs with Few Longest Cycles	2
Market Pricing for Matroid Rank Valuations	2
Nondegenerate Neural Codes and Obstructions to Closed-Convexity	2
Geometric Criteria for Realizability of Tensegrities in Higher Dimensions	2
The Generalized Rainbow Turán Problem for Cycles	2
Erdös--Hajnal Properties for Powers of Sparse Graphs	2
Number of Hamiltonian Cycles in Planar Triangulations	2
On Covering Numbers, Young Diagrams, and the Local Dimension of Posets	2
The Cut Metric for Probability Distributions	2
Invariant Chains in Algebra and Discrete Geometry	2
Letter Graphs and Geometric Grid Classes of Permutations	2
$K_4$-Subdivisions Have the Edge-Erdös--Pósa Property	2
Digraphs and Variable Degeneracy	2
On the Size of Matchings in 1-Planar Graph with High Minimum Degree	2
Hitting Time of Edge Disjoint Hamilton Cycles in Random Subgraph Processes on Dense Base Graphs	2
Rigidity of Random Subgraphs and Eigenvalues of Stiffness Matrices	2
Partial Permutation and Alternating Sign Matrix Polytopes	2
On the Largest Common Subtree of Random Leaf-Labeled Binary Trees	2
Complexity Dichotomy for List-5-Coloring with a Forbidden Induced Subgraph	2
Bounds for the Twin-Width of Graphs	2
An Improved Approximation Algorithm for the Matching Augmentation Problem	2
Line Transversals in Families of Connected Sets in the Plane	2
Recoloring Planar Graphs of Girth at Least Five	2
A Structure Theorem for Rooted Binary Phylogenetic Networks and Its Implications for Tree-Based Networks	2
Circularly Compatible Ones, $D$-Circularity, and Proper Circular-Arc Bigraphs	2
Sublinear Separators in Intersection Graphs of Convex Shapes	2
Automatic Generation of FPTASes for Stochastic Monotone Dynamic Programs Made Easier	2
Exponential Sums with Sparse Polynomials over Finite Fields	2
Lattice Size of Plane Convex Bodies	2
On Sequential Basis Exchange in Matroids	2
Constructing Clustering Transformations	2
The Effect of Adding Randomly Weighted Edges	2
On Vietoris–Rips Complexes (with Scale 3) of Hypercube Graphs	2
Tight Cycle Relaxations for the Cut Polytope	2
Notes on Hazard-Free Circuits	2