OOIR: Observatory of International Research

Papers

(The TQCC of Random Structures & Algorithms 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 2022-01-01 to 2026-01-01.)

Article	Citations
A simple algorithm for graph reconstruction	11
Down‐set thresholds	10
Note on down‐set thresholds	8
Threshold for detecting high dimensional geometry in anisotropic random geometric graphs	8
Small cycle structure for words in conjugation invariant random permutations	8
Issue Information	7
The Erlang weighted tree, a new branching process	6
Issue Information	6
Weight distribution of random linear codes and Krawtchouk polynomials	6
An Urn Model for Social Dynamics on Networks	6
Issue Information	6
	6
	6
On subgraphs with degrees of prescribed residues in the random graph	6
	6
	5
Packing list‐colorings	5
Majority dynamics on sparse random graphs	5
	5
Subgraph probability of random graphs with specified degrees and applications to chromatic number and connectivity	5
	5
The hitting time of clique factors	5
Dispersion on the Complete Graph	5
Issue Information	4
Local algorithms for maximum cut and minimum bisection on locally treelike regular graphs of large degree	4

	4
Three‐wise independent random walks can be slightly unbounded	4
A Ramsey–Turán theory for tilings in graphs	4
On Sidorenko's conjecture for determinants and Gaussian Markov random fields	4
Testing versus estimation of graph properties, revisited	4
Transference for loose Hamilton cycles in random 3‐uniform hypergraphs	4
Almost‐Linear Planted Cliques Elude the Metropolis Process	4
Issue Information	4
The square of a Hamilton cycle in randomly perturbed graphs	3
Random Algebraic Graphs and Their Convergence to ErdőS–Rényi	3
A polynomial‐time approximation scheme for the maximal overlap of two independent Erdős–Rényi graphs	3
On the Edge‐Density of the Brownian Co‐Graphon and Common Ancestors of Pairs in the CRT	3
Some remarks on hypergraph matching and the Füredi–Kahn–Seymour conjecture	3
Issue Information	3
Equivalent regular partitions of three‐uniform hypergraphs	3
The number of descendants in a random directed acyclic graph	3
Optimal bisections of directed graphs	3
The devil's staircase for chip‐firing on random graphs and on graphons	3
The birth of the strong components	3
Rainbow subdivisions of cliques	3
Average‐Case Matrix Discrepancy: Satisfiability Bounds	3
On the Replica Symmetric Solution in General Diluted Spin Glasses	2
	2
Issue Information	2
Fast Construction on a Restricted Budget	2
Separating Path Systems in Complete Graphs	2
Asymptotics and statistics on Fishburn matrices: Dimension distribution and a conjecture of Stoimenow	2
Mixing times of Markov chains for self‐organizing lists and biased permutations	2
Iterated tour partitioning for Euclidean capacitated vehicle routing	2
The Probability That a Random Graph is Even‐Decomposable	2
Coloring Graphs With Forbidden Almost Bipartite Subgraphs	2
	2
Asymptotically Optimal Proper Conflict‐Free Coloring	2
The rank of sparse random matrices	2
	2
Greedy maximal independent sets via local limits	2
Counting orientations of random graphs with no directed k‐cycles	2
	2
	2
Spanning cycles in random directed graphs	2
Issue Information	2
Hypergraph regularity and random sampling	2
Scaling Limit of Critical Percolation Clusters on Hyperbolic Random Half‐Planar Triangulations and the Associated Random Walks	2
Tight Distance Query Reconstruction for Trees and Graphs Without Long Induced Cycles	2
Fringe Trees for Random Trees With Given Vertex Degrees	2
	2
(Random) Trees of Intermediate Volume Growth	2
On the rank, Kernel, and core of sparse random graphs	1
Perfect sampling from spatial mixing	1
Random Čech complexes on manifolds with boundary	1

On the minimax spherical designs	1
Issue Information	1
Limit theorems for patterns in ranked tree‐child networks	1
Expansion in supercritical random subgraphs of expanders and its consequences	1
Cover and hitting times of hyperbolic random graphs	1
The impact of heterogeneity and geometry on the proof complexity of random satisfiability	1
Natural quasirandomness properties	1
Issue Information	1
Reconstructing Random Pictures	1
Improved Bounds for the Erdős–Rogers (s,s+2)‐Problem	1
	1
Sequentially Constrained Hamilton Cycles in Random Graphs	1
A combinatorial proof of Aldous–Broder theorem for general Markov chains	1
Random cliques in random graphs and sharp thresholds for F$$ F $$‐factors	1
Expansion and flooding in dynamic random networks with node churn	1
Perfect Matchings and Loose Hamilton Cycles in the Semirandom Hypergraph Model	1
A full characterization of invariant embeddability of unimodular planar graphs	1
	1
On the clique number of noisy random geometric graphs	1
A robust Corrádi–Hajnal theorem	1
The asynchronous DeGroot dynamics	1
Partitioning graphs with linear minimum degree	1
Randomly Twisted Hypercubes: Between Structure and Randomness	1
1‐independent percolation on ℤ2×Kn	1
The number of bounded‐degree spanning trees	1
The rank of sparse symmetric matrices over arbitrary fields	1
Approximating sparse graphs: The random overlapping communities model	1
	1
Issue Information	1
Frozen 1‐RSB structure of the symmetric Ising perceptron	1
Quasi‐majority functional voting on expander graphs	1
	1
Upper Bounds for Linear Graph Codes	1
Rainbow trees in uniformly edge‐colored graphs	1
The Swendsen–Wang dynamics on trees	1
Triangle Counting With Local Edge Differential Privacy	1
A lower bound for set‐coloring Ramsey numbers	1
Issue Information	1
Covering random graphs with monochromatic trees	1
Ramsey numbers of cycles in random graphs	1
Matchings on trees and the adjacency matrix: A determinantal viewpoint	1
The “Power of Few” Phenomenon: The Sparse Case	1
Improving the Convergence of Markov Chains via Permutations and Projections	1