default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRandom Structures and Algorithms, Volume 65
Volume 65, Number 1, 2024
- Nemanja Draganic
, Abhishek Methuku, David Munhá Correia, Benny Sudakov:
Cycles with many chords. 3-16 - Igor Kortchemski, Paul Thévenin:
Coupling Bertoin's and Aldous-Pitman's representations of the additive coalescent. 17-45 - Frederik Garbe, Jan Hladký, Gábor Kun, Kristýna Pekárková:
On pattern-avoiding permutons. 46-60 - Peter Allen, Julia Böttcher, Jan Corsten, Ewan Davies, Matthew Jenssen, Patrick Morris, Barnaby Roberts, Jozef Skokan:
A robust Corrádi-Hajnal theorem. 61-130 - Zsolt Bartha, Brett Kolesnik:
Weakly saturated random graphs. 131-148 - Eleanor Archer, Matan Shalev:
The GHP scaling limit of uniform spanning trees of dense graphs. 149-190 - Hadley Black, Iden Kalemaj, Sofya Raskhodnikova:
Isoperimetric inequalities for real-valued functions with applications to monotonicity testing. 191-219 - Jian Ding, Hang Du, Shuyang Gong:
A polynomial-time approximation scheme for the maximal overlap of two independent Erdős-Rényi graphs. 220-257
Volume 65, Number 2, 2024
- Alex Samorodnitsky:
Weight distribution of random linear codes and Krawtchouk polynomials. 261-274 - Annika Heckel, Marc Kaufmann, Noëla Müller, Matija Pasch:
The hitting time of clique factors. 275-312 - Kalina Petrova, Milos Trujic:
Transference for loose Hamilton cycles in random 3-uniform hypergraphs. 313-341 - Julia Böttcher, Olaf Parczyk, Amedeo Sgueglia, Jozef Skokan:
The square of a Hamilton cycle in randomly perturbed graphs. 342-386 - Jean Bertoin, Bastien Mallein:
Reinforced Galton-Watson processes I: Malthusian exponents. 387-410 - Johannes Lengler, Anders Martinsson, Kalina Petrova, Patrick Schnider, Raphael Steiner, Simon Weber, Emo Welzl:
On connectivity in random graph models with limited dependencies. 411-448
Volume 65, Number 3, 2024
- Noga Alon:
Connectivity graph-codes. 451-459 - Asaf Shapira, Nick Kushnir, Lior Gishboliner:
Testing versus estimation of graph properties, revisited. 460-487 - Victor Dubach:
Increasing subsequences of linear size in random permutations and the Robinson-Schensted tableaux of permutons. 488-534 - Richard Montgomery:
Spanning cycles in random directed graphs. 535-575 - Sahar Diskin, Michael Krivelevich:
Expansion in supercritical random subgraphs of expanders and its consequences. 576-600 - Jie Ma, Hehui Wu:
Partitioning graphs with linear minimum degree. 601-609
Volume 65, Number 4, 2024
- Nobutaka Shimizu, Takeharu Shiraga:
Quasi-majority functional voting on expander graphs. 613-643 - Oren Engelberg, Wojciech Samotij, Lutz Warnke:
On the typical structure of graphs not containing a fixed vertex-critical subgraph. 644-702 - Brendan Nagle, Vojtech Rödl, Mathias Schacht:
Equivalent regular partitions of three-uniform hypergraphs. 703-718 - Patrick Demichele, Margalit Glasgow, Alexander Moreira:
On the rank, Kernel, and core of sparse random graphs. 719-793 - Jungho Ahn, Debsoumya Chakraborti, Kevin Hendrey, Donggyu Kim, Sang-il Oum:
Twin-width of random graphs. 794-831 - Geoffrey R. Grimmett, Zhongyang Li:
Percolation critical probabilities of matching lattice-pairs. 832-856 - Dor Elboim, Yuval Peres, Ron Peretz:
The asynchronous DeGroot dynamics. 857-895 - András Mészáros:
Coboundary expansion for the union of determinantal hypertrees. 896-914 - Marcos Kiwi, Markus Schepers, John Sylvester:
Cover and hitting times of hyperbolic random graphs. 915-978
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-12-08 09:52 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
