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-06-01 to 2025-06-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
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
Isomorphism Testing Parameterized by Genus and Beyond	7
Fractionally Subadditive Maximization under an Incremental Knapsack Constraint with Applications to Incremental Flows	7
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
A Quantitative Helly-Type Theorem: Containment in a Homothet	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
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
Cycle Saturation in Random Graphs	4
The Success Probability in Levine’s Hat Problem, and Independent Sets in Graphs	4
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
A Sublinear Bound on the Page Number of Upward Planar Graphs	3
The Ramsey Number for 4-Uniform Tight Cycles	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
On Ordered Ramsey Numbers of Tripartite 3-Uniform Hypergraphs	3
Nonuniform Degrees and Rainbow Versions of the Caccetta–Häggkvist Conjecture	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
Longest Cycle above Erdős–Gallai Bound	3
Approximating Submodular ${k}$-Partition via Principal Partition Sequence	3
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
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
Extremal Problem for Matchings and Rainbow Matchings on Direct Products	2
Further Exploiting c-Closure for FPT Algorithms and Kernels for Domination Problems	2
2-Modular Matrices	2
Effective Poset Inequalities	2
On Ramsey Size-Linear Graphs and Related Questions	2
A Stability Result for $\boldsymbol{C}_{\boldsymbol{2k+1}}$-Free Graphs	2
Cliques, Chromatic Number, and Independent Sets in the Semi-random Process	2
Computing Paths of Large Rank in Planar Frameworks Deterministically	2
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
Disjoint Cycles with Length Constraints in Digraphs of Large Connectivity or Large Minimum Degree	2
Matroid Intersection under Restricted Oracles	2
Ideal Membership Problem over 3-Element CSPs with Dual Discriminator Polymorphism	2
Seymour and Woodall’s Conjecture Holds for Graphs with Independence Number Two	2
Adapting the Directed Grid Theorem into an FPT Algorithm	2
Kinetic Geodesic Voronoi Diagrams in a Simple Polygon	2
A Kneser-Type Theorem for Restricted Sumsets	2
Short Rank-Metric Codes and Scattered Subspaces	2
On the Ramsey–Turán Problem for 4-Cliques	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
Greedy Causal Discovery Is Geometric	2
Canonical Theorems for Colored Integers with Respect to Some Linear Combinations	2
Edge-Connectivity Augmentation of Simple Graphs	2
Invertibility of Digraphs and Tournaments	2
Convex Characters, Algorithms, and Matchings	2
Highly Connected Subgraphs with Large Chromatic Number	2
Obviously Strategy-Proof Mechanisms without Money for Scheduling	2
Shape Enumerators of Self-Dual NRT Codes over Finite Fields	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

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
Isomorphism Testing Parameterized by Genus and Beyond	7
Fractionally Subadditive Maximization under an Incremental Knapsack Constraint with Applications to Incremental Flows	7
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
A Quantitative Helly-Type Theorem: Containment in a Homothet	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