OOIR: Observatory of International Research

Papers

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

Article	Citations
Down‐set thresholds	11
A simple algorithm for graph reconstruction	11
Threshold for detecting high dimensional geometry in anisotropic random geometric graphs	10
Small cycle structure for words in conjugation invariant random permutations	10
Note on down‐set thresholds	9
Issue Information	9
	8
	7
The Erlang weighted tree, a new branching process	7
	7
An Urn Model for Social Dynamics on Networks	7
Weight distribution of random linear codes and Krawtchouk polynomials	6
The hitting time of clique factors	6
Packing list‐colorings	6
Issue Information	6
Dispersion on the Complete Graph	5
Subgraph probability of random graphs with specified degrees and applications to chromatic number and connectivity	5
Majority dynamics on sparse random graphs	5
On subgraphs with degrees of prescribed residues in the random graph	5
In‐and‐Out: Algorithmic Diffusion for Sampling Convex Bodies	4
Issue Information	4
Issue Information	4
Two‐Round Ramsey Games on Random Graphs	4
	4
Testing versus estimation of graph properties, revisited	4

Local algorithms for maximum cut and minimum bisection on locally treelike regular graphs of large degree	4
A Ramsey–Turán theory for tilings in graphs	4
	4
Transference for loose Hamilton cycles in random 3‐uniform hypergraphs	4
Resident Fitness Computation in Linear Time and Other Algorithmic Aspects of Interacting Trajectories	4
On the Random Turán Number of Linear Cycles	4
On Sidorenko's conjecture for determinants and Gaussian Markov random fields	4
On the Edge‐Density of the Brownian Co‐Graphon and Common Ancestors of Pairs in the CRT	3
Tight Distance Query Reconstruction for Trees and Graphs Without Long Induced Cycles	3
Random Algebraic Graphs and Their Convergence to ErdőS–Rényi	3
Almost‐Linear Planted Cliques Elude the Metropolis Process	3
The birth of the strong components	3
Massive Spanning Forests on the Complete Graph: Exact Distribution and Local Limit	3
Fast Construction on a Restricted Budget	3
Greedy maximal independent sets via local limits	3
Separating Path Systems in Complete Graphs	3
Average‐Case Matrix Discrepancy: Satisfiability Bounds	3
	3
The devil's staircase for chip‐firing on random graphs and on graphons	3
The square of a Hamilton cycle in randomly perturbed graphs	3
The number of descendants in a random directed acyclic graph	3
Scaling Limit of Critical Percolation Clusters on Hyperbolic Random Half‐Planar Triangulations and the Associated Random Walks	3
Optimal bisections of directed graphs	3
Rainbow subdivisions of cliques	3
Issue Information	3
Equivalent regular partitions of three‐uniform hypergraphs	3
A polynomial‐time approximation scheme for the maximal overlap of two independent Erdős–Rényi graphs	3
Large Deviations of the Giant Component in Scale‐Free Inhomogeneous Random Graphs	3
New Bounds for Proper h‐Conflict‐Free Colorings	3
Issue Information	2
	2
A lower bound for set‐coloring Ramsey numbers	2
Finding the Root in Random Nearest Neighbor Trees	2
Partitioning graphs with linear minimum degree	2
Is It Easier to Count Communities Than Find Them?	2
Coloring Graphs With Forbidden Almost Bipartite Subgraphs	2
Issue Information	2
Asymptotically Optimal Proper Conflict‐Free Coloring	2
	2
(Random) Trees of Intermediate Volume Growth	2
Robustness of Erdős–Ko–Rado Theorems on Permutations and Perfect Matchings	2
A robust Corrádi–Hajnal theorem	2
A Refined Graph Container Lemma and Applications to the Hard‐Core Model on Bipartite Expanders	2
Counting orientations of random graphs with no directed k‐cycles	2
Spanning cycles in random directed graphs	2
	2
	2
Hypergraph regularity and random sampling	2
Iterated tour partitioning for Euclidean capacitated vehicle routing	2
Cover and hitting times of hyperbolic random graphs	2

Random Lie bracket on sl2(Fp)	2
The impact of heterogeneity and geometry on the proof complexity of random satisfiability	2
The asynchronous DeGroot dynamics	2
Expansion in supercritical random subgraphs of expanders and its consequences	2
The Probability That a Random Graph is Even‐Decomposable	2
On the Replica Symmetric Solution in General Diluted Spin Glasses	2
Fringe Trees for Random Trees With Given Vertex Degrees	2
Issue Information	2
	2