default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRandom Structures and Algorithms, Volume 61
Volume 61, Number 1, August 2022
- Matas Sileikis
, Lutz Warnke:
Counting extensions revisited. 3-30 - Olivier Bodini, Antoine Genitrini, Bernhard Gittenberger, Isabella Larcher, Mehdi Naima:
Compaction for two models of logarithmic-depth trees: Analysis and experiments. 31-61 - Greg Bodwin, Santosh S. Vempala:
A unified view of graph regularity via matrix decompositions. 62-83 - Alice Contat:
Sharpness of the phase transition for parking on random trees. 84-100 - Hiêp Hàn, Jie Han, Patrick Morris:
Factors and loose Hamilton cycles in sparse pseudo-random hypergraphs. 101-125 - Svante Janson, Gregory B. Sorkin:
Successive minimum spanning trees. 126-172 - Ross J. Kang, Tom Kelly:
Colorings, transversals, and local sparsity. 173-192 - Gourab Ray, Yinon Spinka:
Finitary codings for gradient models and a new graphical representation for the six-vertex model. 193-232
Volume 61, Number 2, September 2022
- Jeff D. Kahn, Jinyoung Park:
Tuza's conjecture for random graphs. 235-249 - Frank Ball, Tom Britton:
Epidemics on networks with preventive rewiring. 250-297 - Jacob W. Cooper, Daniel Král', Ander Lamaison, Samuel Mohr:
Quasirandom Latin squares. 298-308 - Henry-Louis de Kergorlay, Ulrike Tillmann, Oliver Vipond:
Random Čech complexes on manifolds with boundary. 309-352 - Brett Kolesnik:
Large deviations of the greedy independent set algorithm on sparse random graphs. 353-363 - Andrew Newman:
Doubly random polytopes. 364-382 - Jakub Przybylo:
A generalization of Faudree-Lehel conjecture holds almost surely for random graphs. 383-396 - Benedikt Stufler:
A branching process approach to level-k phylogenetic networks. 397-421
Volume 61, Number 3, October 2022
- Felix Joos, Marcus Kühn:
Fractional cycle decompositions in hypergraphs. 425-443 - Yahav Alon, Michael Krivelevich, Eyal Lubetzky:
Cycle lengths in sparse random graphs. 444-461 - Chinmoy Bhattacharjee:
Gaussian approximation for rooted edges in a random minimal directed spanning tree. 462-492 - Tom Bohman, Xizhi Liu, Dhruv Mubayi:
Independent sets in hypergraphs omitting an intersection. 493-519 - Anna M. Brandenberger, Luc Devroye, Marcel K. Goh:
Root estimation in Galton-Watson trees. 520-542 - Elahe Zohoorian Azad, Philippe Chassaing:
Asymptotic behavior of some factorizations of random words. 543-572 - Shyam Narayanan:
Three-wise independent random walks can be slightly unbounded. 573-598 - Naomi Lindenstrauss, Michel Talagrand:
What is the satisfiability threshold of random balanced Boolean expressions? 599-615
Volume 61, Number 4, December 2022
- Oliver Riordan:
Random cliques in random graphs and sharp thresholds for F $$ F $$ -factors. 619-637 - Prateek Bhakta, Sarah Miracle, Dana Randall, Amanda Pascoe Streib:
Mixing times of Markov chains for self-organizing lists and biased permutations. 638-665 - Nemanja Draganic, Stefan Glock, Michael Krivelevich:
The largest hole in sparse random graphs. 666-677 - Weiming Feng, Heng Guo, Yitong Yin:
Perfect sampling from spatial mixing. 678-709 - Keith Frankston, Jeff Kahn, Jinyoung Park:
On a problem of M. Talagrand. 710-723 - Fotis Iliopoulos, Alistair Sinclair:
Efficiently list-edge coloring multigraphs asymptotically optimally. 724-753 - Lyuben Lichev, Dieter Mitsche:
On the modularity of 3-regular random graphs and random graphs with given degree sequences. 754-802 - Grégory Miermont, Sanchayan Sen:
On breadth-first constructions of scaling limits of random graphs and random unicellular maps. 803-843 - Samantha Petti, Santosh S. Vempala:
Approximating sparse graphs: The random overlapping communities model. 844-908
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 2024-11-21 20:32 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:
