OOIR: Observatory of International Research

Papers

(The TQCC of SIAM Journal on Discrete Mathematics is 3. 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 2022-08-01 to 2026-08-01.)

Article	Citations
Cayley Sums and Minkowski Sums of Lattice Polytopes	29
On Powers of Hamilton Cycles in Ramsey–Turán Theory	25
Pure Pairs. IX. Transversal Trees	20
Strong Cocomparability Graphs and Slash-Free Orderings of Matrices	19
On Bipartite Graph Realizations of a Single Degree Sequence	16
On Perles’ Configuration	15
Rock Extensions with Linear Diameters	14
Reconstructing Almost All of a Point Set in $\boldsymbol{\mathbb{R}}$ ^d from Randomly Revealed P	13
Isomorphism Testing Parameterized by Genus and Beyond	13
Monotonic Decompositions of Submodular Set Functions	11
Upward and Rectilinear Planarity are W[1]-Hard Parameterized by Treewidth	10
Concepts of Dimension for Convex Geometries	10
Topology of Cut Complexes of Graphs	9
Fractionally Subadditive Maximization under an Incremental Knapsack Constraint with Applications to Incremental Flows	9
On the Turán Number of Generalized Theta Graphs	8
Turán Densities for Small Hypercubes	8
On the Weisfeiler–Leman Dimension of Permutation Graphs	8
Dividing a Graphical Cake	8
On Density of $\boldsymbol{\mathbb{Z}_3}$ -Flow-Critical Graphs	8
Graphs of Degree at Least ${3}$ with Minimum Algebraic Connectivity	8
Excluding a Clique or a Biclique in Graphs of Bounded Induced Matching Treewidth	8
Tuza’s Conjecture for Binary Geometries	8
Transversal Hamilton Paths and Cycles	8
Additive Energy of Polynomial Images	7
Degrees of Interior Polynomials and Parking Function Enumerators	7

Cycle Saturation in Random Graphs	7
Bridge-Depth Characterizes which Minor-Closed Structural Parameterizations of Vertex Cover Admit a Polynomial Kernel	7
Weaver’s Discrepancy for Gaussian Random Vectors	7
Two-Colorings of Normed Spaces without Long Monochromatic Unit Arithmetic Progressions	6
On Packing Dijoins in Digraphs and Weighted Digraphs	6
The Lower Bound Theorem for $d$-Polytopes with $2{d}+1$ Vertices	6
The Success Probability in Levine’s Hat Problem, and Independent Sets in Graphs	6
Bootstrap Percolation on the High-Dimensional Hamming Graph	6
Online Spanners in Metric Spaces	6
On the Size of Matchings in 1-Planar Graph with High Minimum Degree	6
Matchings, Relaxed Popularity, and Optimality	6
Topology of Cut Complexes II	6
Circular ${\boldsymbol{(4-\epsilon )}}$ -Coloring of Some Classes of Signed Graphs	5
The Rainbow Saturation Number Is Linear	5
Twin-Width of Subdivisions of Multigraphs	5
Extremal Problems for Hypergraph Blowups of Trees	5
Coloring Tournaments with Few Colors: Algorithms and Complexity	5
Asymptotic Fair Division: Chores Are Easier Than Goods	5
Letter Graphs and Geometric Grid Classes of Permutations	5
Matroids on Eight Elements with the Half-Plane Property and Related Concepts	5
Planarity via Spanning Tree Number: A Linear-Algebraic Criterion	5
The Tropical Critical Points of an Affine Matroid	5
The Spectrum of Triangle-Free Graphs	5
Robust Factorizations and Colorings of Tensor Graphs	5
Reconfiguration of Digraph Homomorphisms	5
Decomposing Random Permutations into Order-Isomorphic Subpermutations	5
Tangles and Hierarchical Clustering	5
Longest Cycle above Erdős–Gallai Bound	5
Partial Reflections and Globally Linked Pairs in Rigid Graphs	5
On the PoA Conjecture: Trees versus Biconnected Components	5
Limit Profile for the Transpose Top-2 with Random Shuffle	5
Odd Paths, Cycles, and $T$-Joins: Connections and Algorithms	5
Parameterized Complexity for Finding a Perfect Phylogeny from Mixed Tumor Samples	5
Modules in Robinson Spaces	5
Binary Cyclic Transversal Polytopes	5
M-Convexity of Vexillary Grothendieck Polynomials via Bubbling	4
Adapting the Directed Grid Theorem into an FPT Algorithm	4
Orientation of Fitch Graphs and Reconciliation-Free Inference of Horizontal Gene Transfer in Gene Trees	4
Protecting the Connectivity of a Graph Under Nonuniform Edge Failures	4
On a Conjecture of Feige for Discrete Log-Concave Distributions	4
Computing Paths of Large Rank in Planar Frameworks Deterministically	4
Kinetic Geodesic Voronoi Diagrams in a Simple Polygon	4
Shape Enumerators of Self-Dual NRT Codes over Finite Fields	4
Tropical Linear Regression and Mean Payoff Games: Or, How to Measure the Distance to Equilibria	4
Efficient Linear and Affine Codes for Correcting Insertions/Deletions	4
A Sublinear Bound on the Page Number of Upward Planar Graphs	4
A Precise Condition for Independent Transversals in Bipartite Covers	4
The Threshold of Symmetry in Random Graphs with Specified Degree Sequences	4
Induced Subgraphs and Tree Decompositions XIX: Thetas and Forests	4
Nonuniform Degrees and Rainbow Versions of the Caccetta–Häggkvist Conjecture	4

Bounding and Computing Obstacle Numbers of Graphs	4
Short Rank-Metric Codes and Scattered Subspaces	4
On Off-Diagonal F -Ramsey Numbers	4
Hamilton Cycles in Random Digraphs with Minimum Degree at Least One	4
Decompositions of $q$-Matroids Using Cyclic Flats	4
Classification of Finite Highly Regular Vertex-Colored Graphs	4
Packing Signatures in Signed Graphs	4
Approximating Submodular ${k}$-Partition via Principal Partition Sequence	4
Midpoints of Vertex Pairs of Convex Polytopes	4
Highly Connected Subgraphs with Large Chromatic Number	4
Long Induced Paths and Forbidden Patterns: Polylogarithmic Bounds	4
A Proof of the 3/4-Conjecture for the Total Domination Game	4
On Supersaturation for Oddtown and Eventown	4
Acyclic Colorings of Graphs with Obstructions	4
The Ramsey Number for 4-Uniform Tight Cycles	4
On Multicolor Ramsey Numbers of Triple System Paths of Length 3	4
Inverse Problems for Discrete Heat Equations and Random Walks for a Class of Graphs	4
The Fractional Chromatic Number of $\boldsymbol{K_{\Delta }}$-Free Graphs	3
Three Applications of Coverings to Difference Patterns	3
Revisiting and Improving Upper Bounds for Identifying Codes	3
Canonical Theorems for Colored Integers with Respect to Some Linear Combinations	3
Cliques, Chromatic Number, and Independent Sets in the Semi-random Process	3
Corrigendum: Orthogonal Tree-Decompositions of Graphs	3
Extremal Graph Realizations and Graph Laplacian Eigenvalues	3
Stable Approximation Algorithms for Dominating Set and Independent Set	3
Heroes in Orientations of Chordal Graphs	3
Extremal Problem for Matchings and Rainbow Matchings on Direct Products	3
Graphs with Large Girth and Chromatic Number are Hard for Nullstellensatz	3
On Ramsey Size-Linear Graphs and Related Questions	3
Ideal Membership Problem over 3-Element CSPs with Dual Discriminator Polymorphism	3
Invertibility of Digraphs and Tournaments	3
The Treewidth and Pathwidth of Graph Unions	3
Seymour and Woodall’s Conjecture Holds for Graphs with Independence Number Two	3
Improved NP-Hardness of Approximation for Orthogonality Dimension and Minrank	3
Fibonacci Sumsets and the Gonality of Strip Graphs	3
Computing Twin-Width Parameterized by the Feedback Edge Number and Vertex Integrity	3
Greedy Causal Discovery Is Geometric	3
Local Certification of Local Properties: Tight Bounds, Trade-Offs, and New Parameters	3
The Overfullness of Graphs with Small Minimum Degree and Large Maximum Degree	3
On the Ramsey–Turán Problem for 4-Cliques	3
Distances between Realizations of Order Types	3
Unavoidable Cycle-Contraction Minors of Large 2-Connected Graphs	3
Simple Codes and Sparse Recovery with Fast Decoding	3
Matroid Intersection under Restricted Oracles	3
EMSO(FO$^2$) 0-1 Law Fails for All Dense Random Graphs	3
Effective Poset Inequalities	3
Convex Characters, Algorithms, and Matchings	3
Further Exploiting c-Closure for FPT Algorithms and Kernels for Domination Problems	3
The Strong Fractional Choice Number and the Strong Fractional Paint Number of Graphs	3
A Stability Result for $\boldsymbol{C}_{\boldsymbol{2k+1}}$-Free Graphs	3
Obviously Strategy-Proof Mechanisms without Money for Scheduling	3
A Canonical Tree Decomposition for Order Types, and Some Applications	3
Hitting Sets and Colorings of Hypergraphs	3
Twin-Width of Planar Graphs Is at Most 8, and Some Related Bounds	3
Edge-Connectivity Augmentation of Simple Graphs	3
Dirac’s Theorem for Linear Hypergraphs	3
A Kneser-Type Theorem for Restricted Sumsets	3
Upper Bounds on Mixing Time of Finite Markov Chains	3
On the Bit Size of Sum-of-Squares Proofs for Symmetric Formulations	3
Aggregation of Evaluations without Unanimity	3