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

Article	Citations
Large deviations of the greedy independent set algorithm on sparse random graphs	18
A simple algorithm for graph reconstruction	8
Threshold for detecting high dimensional geometry in anisotropic random geometric graphs	8
Hydrodynamic limit of the Robinson–Schensted–Knuth algorithm	8
Down‐set thresholds	8
The Erlang weighted tree, a new branching process	7
Small cycle structure for words in conjugation invariant random permutations	6
	6
	6
Note on down‐set thresholds	6
On subgraphs with degrees of prescribed residues in the random graph	6
	6
	6
The hitting time of clique factors	5
Issue Information	5
Subgraph probability of random graphs with specified degrees and applications to chromatic number and connectivity	5
Weight distribution of random linear codes and Krawtchouk polynomials	5
Packing list‐colorings	5
Issue Information	5
Deviation probabilities for arithmetic progressions and other regular discrete structures	5
Issue Information	5
A scaling limit for the length of the longest cycle in a sparse random digraph	4
Majority dynamics on sparse random graphs	4
Galton–Watson games	4
Color‐biased Hamilton cycles in random graphs	4

Dispersion on the Complete Graph	4
A branching process approach to level‐k phylogenetic networks	4
	4
Law of large numbers for Betti numbers of homogeneous and spatially independent random simplicial complexes	4
	4
Independent sets in hypergraphs omitting an intersection	4
Local algorithms for maximum cut and minimum bisection on locally treelike regular graphs of large degree	3
Testing versus estimation of graph properties, revisited	3
Issue Information	3
Almost‐Linear Planted Cliques Elude the Metropolis Process	3
	3
Issue Information	3
Three‐wise independent random walks can be slightly unbounded	3
A Ramsey–Turán theory for tilings in graphs	3
Random Algebraic Graphs and Their Convergence to ErdőS–Rényi	3
Transference for loose Hamilton cycles in random 3‐uniform hypergraphs	3
On Sidorenko's conjecture for determinants and Gaussian Markov random fields	3
	3
	3
The discrepancy of random rectangular matrices	3
The devil's staircase for chip‐firing on random graphs and on graphons	3
The rank of sparse random matrices	2
	2
Issue Information	2
Combinatorial and stochastic properties of ranked tree‐child networks	2
Rainbow subdivisions of cliques	2
Fractional cycle decompositions in hypergraphs	2
Epidemics on networks with preventive rewiring	2
On the Edge‐Density of the Brownian Co‐Graphon and Common Ancestors of Pairs in the CRT	2
Issue Information	2
A generalization of Faudree–Lehel conjecture holds almost surely for random graphs	2
	2
Issue Information	2
	2
Greedy maximal independent sets via local limits	2
Optimal bisections of directed graphs	2
The birth of the strong components	2
A polynomial‐time approximation scheme for the maximal overlap of two independent Erdős–Rényi graphs	2
Hypergraph regularity and random sampling	2
Covering cycles in sparse graphs	2
Asymptotics and statistics on Fishburn matrices: Dimension distribution and a conjecture of Stoimenow	2
Asymptotically Optimal Proper Conflict‐Free Coloring	2
Some remarks on hypergraph matching and the Füredi–Kahn–Seymour conjecture	2
The number of descendants in a random directed acyclic graph	2
Equivalent regular partitions of three‐uniform hypergraphs	2
The square of a Hamilton cycle in randomly perturbed graphs	2
Normal approximation and fourth moment theorems for monochromatic triangles	2
Erasures versus errors in local decoding and property testing	1
Sharpness of the phase transition for parking on random trees	1
	1

Issue Information	1
Frozen 1‐RSB structure of the symmetric Ising perceptron	1
A robust Corrádi–Hajnal theorem	1
Shotgun reconstruction in the hypercube	1
Perfect Matchings and Loose Hamilton Cycles in the Semirandom Hypergraph Model	1
On the clique number of noisy random geometric graphs	1
The infinite limit of separable permutations	1
	1
Upper Bounds for Linear Graph Codes	1
Rainbow trees in uniformly edge‐colored graphs	1
Expansion in supercritical random subgraphs of expanders and its consequences	1
Approximating the distance to monotonicity of Boolean functions	1
	1
Mixing times of Markov chains for self‐organizing lists and biased permutations	1
A lower bound for set‐coloring Ramsey numbers	1
On the rank, Kernel, and core of sparse random graphs	1
On the minimax spherical designs	1
A full characterization of invariant embeddability of unimodular planar graphs	1
Approximating sparse graphs: The random overlapping communities model	1
Perfect sampling from spatial mixing	1
Quasi‐majority functional voting on expander graphs	1
Reconstructing Random Pictures	1
Square percolation and the threshold for quadratic divergence in random right‐angled Coxeter groups	1
Colorings, transversals, and local sparsity	1
Issue Information	1
Cover and hitting times of hyperbolic random graphs	1
Gaussian approximation for rooted edges in a random minimal directed spanning tree	1
A combinatorial proof of Aldous–Broder theorem for general Markov chains	1
Ramsey numbers of cycles in random graphs	1
Uniform chain decompositions and applications	1
Partitioning graphs with linear minimum degree	1
Issue Information	1
Iterated tour partitioning for Euclidean capacitated vehicle routing	1
Issue Information	1
	1
Expansion and flooding in dynamic random networks with node churn	1
Cycle lengths in sparse random graphs	1
Longest and shortest cycles in random planar graphs	1
The Swendsen–Wang dynamics on trees	1
Randomly Twisted Hypercubes: Between Structure and Randomness	1
Random cliques in random graphs and sharp thresholds for F$$ F $$‐factors	1
Natural quasirandomness properties	1
Covering random graphs with monochromatic trees	1
Random triangles in random graphs	1
Random Čech complexes on manifolds with boundary	1
Limit theorems for patterns in ranked tree‐child networks	1
The impact of heterogeneity and geometry on the proof complexity of random satisfiability	1
Counting orientations of random graphs with no directed k‐cycles	1
	1
The asynchronous DeGroot dynamics	1
	1
Spanning cycles in random directed graphs	1