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 2021-08-01 to 2025-08-01.)

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
Rock Extensions with Linear Diameters	13
Concepts of Dimension for Convex Geometries	11
Cayley Sums and Minkowski Sums of Lattice Polytopes	11
Dividing a Graphical Cake	11
On Perles’ Configuration	10
On Bipartite Graph Realizations of a Single Degree Sequence	10
Fractionally Subadditive Maximization under an Incremental Knapsack Constraint with Applications to Incremental Flows	8
Topology of Cut Complexes of Graphs	8
On Powers of Hamilton Cycles in Ramsey–Turán Theory	7
Isomorphism Testing Parameterized by Genus and Beyond	7
The Lower Bound Theorem for $d$-Polytopes with $2{d}+1$ Vertices	6
Strong Cocomparability Graphs and Slash-Free Orderings of Matrices	6
Topology of Cut Complexes II	6
A Quantitative Helly-Type Theorem: Containment in a Homothet	6
Pure Pairs. IX. Transversal Trees	6
Letter Graphs and Geometric Grid Classes of Permutations	6
Excluding a Clique or a Biclique in Graphs of Bounded Induced Matching Treewidth	6
Weaver’s Discrepancy for Gaussian Random Vectors	6
Pure Pairs VI: Excluding an Ordered Tree	5
The Success Probability in Levine’s Hat Problem, and Independent Sets in Graphs	5
Additive Energy of Polynomial Images	5

Online Spanners in Metric Spaces	5
On the Size of Matchings in 1-Planar Graph with High Minimum Degree	5
Matchings, Relaxed Popularity, and Optimality	5
On Density of $\boldsymbol{\mathbb{Z}_3}$ -Flow-Critical Graphs	5
Bridge-Depth Characterizes which Minor-Closed Structural Parameterizations of Vertex Cover Admit a Polynomial Kernel	5
Tuza’s Conjecture for Binary Geometries	5
Degrees of Interior Polynomials and Parking Function Enumerators	5
On the Weisfeiler–Leman Dimension of Permutation Graphs	5
Modules in Robinson Spaces	5
On Packing Dijoins in Digraphs and Weighted Digraphs	4
Robust Factorizations and Colorings of Tensor Graphs	4
Cycle Saturation in Random Graphs	4
Parameterized Complexity for Finding a Perfect Phylogeny from Mixed Tumor Samples	4
The Tropical Critical Points of an Affine Matroid	4
Twin-Width of Subdivisions of Multigraphs	4
Odd Paths, Cycles, and $T$-Joins: Connections and Algorithms	4
When Do Gomory--Hu Subtrees Exist?	4
Turán Densities for Small Hypercubes	4
Rapid Mixing of the Switch Markov Chain for 2-Class Joint Degree Matrices	4
Tangles and Hierarchical Clustering	4
Planarity and Genus of Sparse Random Bipartite Graphs	4
Packing Signatures in Signed Graphs	4
Reconfiguration of Digraph Homomorphisms	4
Extremal Problems for Hypergraph Blowups of Trees	4
The Multivariate Schwartz--Zippel Lemma	4
Two-Colorings of Normed Spaces without Long Monochromatic Unit Arithmetic Progressions	4
Coloring Tournaments with Few Colors: Algorithms and Complexity	4
Matroids on Eight Elements with the Half-Plane Property and Related Concepts	4
The Spectrum of Triangle-Free Graphs	4
Circular ${\boldsymbol{(4-\epsilon )}}$ -Coloring of Some Classes of Signed Graphs	4
Decomposing Random Permutations into Order-Isomorphic Subpermutations	4
Approximating Submodular ${k}$-Partition via Principal Partition Sequence	3
Longest Cycle above Erdős–Gallai Bound	3
On the Stability of the Graph Independence Number	3
Inverse Problems for Discrete Heat Equations and Random Walks for a Class of Graphs	3
Efficient Linear and Affine Codes for Correcting Insertions/Deletions	3
Short Rank-Metric Codes and Scattered Subspaces	3
Highly Connected Subgraphs with Large Chromatic Number	3
The $\chi$-Ramsey Problem for Triangle-Free Graphs	3
Posets and Spaces of $k$-Noncrossing RNA Structures	3
Decompositions of $q$-Matroids Using Cyclic Flats	3
The Ramsey Number for 4-Uniform Tight Cycles	3
Classification of Finite Highly Regular Vertex-Colored Graphs	3
The Rainbow Saturation Number Is Linear	3
A Sublinear Bound on the Page Number of Upward Planar Graphs	3
Planarity via Spanning Tree Number: A Linear-Algebraic Criterion	3
Nonuniform Degrees and Rainbow Versions of the Caccetta–Häggkvist Conjecture	3
M-Convexity of Vexillary Grothendieck Polynomials via Bubbling	3
The Power of the Weisfeiler--Leman Algorithm to Decompose Graphs	3
Shape Enumerators of Self-Dual NRT Codes over Finite Fields	3

On a Conjecture of Feige for Discrete Log-Concave Distributions	3
The Threshold of Symmetry in Random Graphs with Specified Degree Sequences	3
A Proof of the 3/4-Conjecture for the Total Domination Game	3
Orientation of Fitch Graphs and Reconciliation-Free Inference of Horizontal Gene Transfer in Gene Trees	3
On Multicolor Ramsey Numbers of Triple System Paths of Length 3	3
A Precise Condition for Independent Transversals in Bipartite Covers	3
On the PoA Conjecture: Trees versus Biconnected Components	3
On Ordered Ramsey Numbers of Tripartite 3-Uniform Hypergraphs	3
Reconstructibility of Matroid Polytopes	3
Maximizing Line Subgraphs of Diameter at Most t	3
Self-Dual Maps I: Antipodality	3
A Stability Result for $\boldsymbol{C}_{\boldsymbol{2k+1}}$-Free Graphs	3
Computing Paths of Large Rank in Planar Frameworks Deterministically	3
Acyclic Colorings of Graphs with Obstructions	3
Tropical Linear Regression and Mean Payoff Games: Or, How to Measure the Distance to Equilibria	3
A $\frac{4}{3}$-Approximation Algorithm for the Minimum 2-Edge Connected Multisubgraph Problem in the Half-Integral Case	3
Bounding the Number of Edges of Matchstick Graphs	3
Partial Reflections and Globally Linked Pairs in Rigid Graphs	3
Effective Poset Inequalities	2
Product Structure Extension of the Alon–Seymour–Thomas Theorem	2
Ideal Membership Problem over 3-Element CSPs with Dual Discriminator Polymorphism	2
Chip-Firing and Critical Groups of Signed Graphs	2
Greedy Causal Discovery Is Geometric	2
NP-Hardness of Computing PL Geometric Category in Dimension 2	2
Obviously Strategy-Proof Mechanisms without Money for Scheduling	2
On Hop-Constrained Steiner Trees in Tree-Like Metrics	2
On Discrete LOG-Brunn--Minkowski Type Inequalities	2
Poincaré Polynomials of Odd Diagram Classes	2
Adapting the Directed Grid Theorem into an FPT Algorithm	2
Constant Congestion Brambles in Directed Graphs	2
Simple Codes and Sparse Recovery with Fast Decoding	2
Seymour and Woodall’s Conjecture Holds for Graphs with Independence Number Two	2
Heroes in Orientations of Chordal Graphs	2
Further Exploiting c-Closure for FPT Algorithms and Kernels for Domination Problems	2
Graphs with Large Girth and Chromatic Number are Hard for Nullstellensatz	2
Kinetic Geodesic Voronoi Diagrams in a Simple Polygon	2
Improved NP-Hardness of Approximation for Orthogonality Dimension and Minrank	2
Corrigendum: Orthogonal Tree-Decompositions of Graphs	2
Hitting Weighted Even Cycles in Planar Graphs	2
Convex Characters, Algorithms, and Matchings	2
Structured Codes of Graphs	2
EMSO(FO$^2$) 0-1 Law Fails for All Dense Random Graphs	2
Globally Rigid Augmentation of Rigid Graphs	2
Cliques, Chromatic Number, and Independent Sets in the Semi-random Process	2
Tight Probability Bounds with Pairwise Independence	2
Extremal Problem for Matchings and Rainbow Matchings on Direct Products	2
Dirac’s Theorem for Linear Hypergraphs	2
The Strong Fractional Choice Number and the Strong Fractional Paint Number of Graphs	2
Upper Bounds on Mixing Time of Finite Markov Chains	2
Disjoint Cycles with Length Constraints in Digraphs of Large Connectivity or Large Minimum Degree	2
2-Modular Matrices	2
Left-Cut-Percolation and Induced-Sidorenko Bigraphs	2
Canonical Theorems for Colored Integers with Respect to Some Linear Combinations	2
Bounding and Computing Obstacle Numbers of Graphs	2
On Covering Segments with Unit Intervals	2
The Fractional Chromatic Number of $\boldsymbol{K_{\Delta }}$-Free Graphs	2
A Kneser-Type Theorem for Restricted Sumsets	2
Combinatorial Generation via Permutation Languages. V. Acyclic Orientations	2
On Ramsey Size-Linear Graphs and Related Questions	2
Tree-Degenerate Graphs and Nested Dependent Random Choice	2
The Treewidth and Pathwidth of Graph Unions	2
Crux and Long Cycles in Graphs	2
On the Ramsey–Turán Problem for 4-Cliques	2
Extremal Graph Realizations and Graph Laplacian Eigenvalues	2
Invertibility of Digraphs and Tournaments	2
Stable Approximation Algorithms for Dominating Set and Independent Set	2
Revisiting and Improving Upper Bounds for Identifying Codes	2
The Overfullness of Graphs with Small Minimum Degree and Large Maximum Degree	2
Distances between Realizations of Order Types	2
Edge-Connectivity Augmentation of Simple Graphs	2
Disjoint Cycles in a Digraph with Partial Degree	2
Matroid Intersection under Restricted Oracles	2
Rainbow Perfect Matchings for 4-Uniform Hypergraphs	2

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
Rock Extensions with Linear Diameters	13
Concepts of Dimension for Convex Geometries	11
Cayley Sums and Minkowski Sums of Lattice Polytopes	11
Dividing a Graphical Cake	11
On Perles’ Configuration	10
On Bipartite Graph Realizations of a Single Degree Sequence	10
Fractionally Subadditive Maximization under an Incremental Knapsack Constraint with Applications to Incremental Flows	8
Topology of Cut Complexes of Graphs	8
On Powers of Hamilton Cycles in Ramsey–Turán Theory	7
Isomorphism Testing Parameterized by Genus and Beyond	7
The Lower Bound Theorem for $d$-Polytopes with $2{d}+1$ Vertices	6
Strong Cocomparability Graphs and Slash-Free Orderings of Matrices	6
Topology of Cut Complexes II	6
A Quantitative Helly-Type Theorem: Containment in a Homothet	6
Pure Pairs. IX. Transversal Trees	6
Letter Graphs and Geometric Grid Classes of Permutations	6
Excluding a Clique or a Biclique in Graphs of Bounded Induced Matching Treewidth	6
Weaver’s Discrepancy for Gaussian Random Vectors	6
Pure Pairs VI: Excluding an Ordered Tree	5
The Success Probability in Levine’s Hat Problem, and Independent Sets in Graphs	5
Additive Energy of Polynomial Images	5