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

Article	Citations
Large deviations of the greedy independent set algorithm on sparse random graphs	19
Down‐set thresholds	8
Threshold for detecting high dimensional geometry in anisotropic random geometric graphs	8
The Erlang weighted tree, a new branching process	8
A simple algorithm for graph reconstruction	8
Note on down‐set thresholds	7
	7
	7
Small cycle structure for words in conjugation invariant random permutations	7
Deviation probabilities for arithmetic progressions and other regular discrete structures	6
	6
	6
Issue Information	6
On subgraphs with degrees of prescribed residues in the random graph	6
The hitting time of clique factors	6
Issue Information	6
Weight distribution of random linear codes and Krawtchouk polynomials	5
Subgraph probability of random graphs with specified degrees and applications to chromatic number and connectivity	5
Dispersion on the Complete Graph	5
Packing list‐colorings	5
A branching process approach to level‐k phylogenetic networks	5
	5
Issue Information	5
A scaling limit for the length of the longest cycle in a sparse random digraph	5
Independent sets in hypergraphs omitting an intersection	5

Issue Information	4
	4
Majority dynamics on sparse random graphs	4
On Sidorenko's conjecture for determinants and Gaussian Markov random fields	4
Issue Information	4
Color‐biased Hamilton cycles in random graphs	4
Three‐wise independent random walks can be slightly unbounded	4
Local algorithms for maximum cut and minimum bisection on locally treelike regular graphs of large degree	4
	4
	3
Some remarks on hypergraph matching and the Füredi–Kahn–Seymour conjecture	3
The square of a Hamilton cycle in randomly perturbed graphs	3
Almost‐Linear Planted Cliques Elude the Metropolis Process	3
Random Algebraic Graphs and Their Convergence to ErdőS–Rényi	3
Rainbow subdivisions of cliques	3
A polynomial‐time approximation scheme for the maximal overlap of two independent Erdős–Rényi graphs	3
Issue Information	3
Transference for loose Hamilton cycles in random 3‐uniform hypergraphs	3
A Ramsey–Turán theory for tilings in graphs	3
The devil's staircase for chip‐firing on random graphs and on graphons	3
Equivalent regular partitions of three‐uniform hypergraphs	3
The birth of the strong components	3
Epidemics on networks with preventive rewiring	3
The discrepancy of random rectangular matrices	3
Testing versus estimation of graph properties, revisited	3
Asymptotically Optimal Proper Conflict‐Free Coloring	2
The rank of sparse random matrices	2
Optimal bisections of directed graphs	2
Issue Information	2
	2
Approximating the distance to monotonicity of Boolean functions	2
Iterated tour partitioning for Euclidean capacitated vehicle routing	2
Spanning cycles in random directed graphs	2
Covering cycles in sparse graphs	2
Combinatorial and stochastic properties of ranked tree‐child networks	2
Separating Path Systems in Complete Graphs	2
Greedy maximal independent sets via local limits	2
The number of descendants in a random directed acyclic graph	2
	2
	2
Issue Information	2
A generalization of Faudree–Lehel conjecture holds almost surely for random graphs	2
Issue Information	2
Hypergraph regularity and random sampling	2
On the Edge‐Density of the Brownian Co‐Graphon and Common Ancestors of Pairs in the CRT	2
Fractional cycle decompositions in hypergraphs	2
	2
	2
	2
Mixing times of Markov chains for self‐organizing lists and biased permutations	2

Asymptotics and statistics on Fishburn matrices: Dimension distribution and a conjecture of Stoimenow