default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRandom Structures and Algorithms, Volume 53
Volume 53, Number 1, August 2018
- Issue information. 1-2
- Boris G. Pittel:
Counting strongly connected (k1, k2)-directed cores. 3-14 - Nicolas Broutin, Cécile Mailler
:
And/or trees: A local limit point of view. 15-58 - Ewan Davies, Matthew Jenssen, Will Perkins, Barnaby Roberts:
Extremes of the internal energy of the Potts model on cubic graphs. 59-75 - Pu Gao, Michael Molloy:
The stripping process can be slow: Part I. 76-139 - Annika Heckel:
The chromatic number of dense random graphs. 140-182
Volume 53, Number 2, September 2018
- Issue information. 183-184
- Béla Bollobás, Oliver Riordan:
Counting dense connected hypergraphs via the probabilistic method. 185-220 - Jacob van den Berg, Stein Andreas Bethuelsen:
Stochastic domination in space-time for the contact process. 221-237 - Oliver Cooley, Mihyun Kang, Christoph Koch:
The size of the giant high-order component in random hypergraphs. 238-288 - Ronen Eldan, Mohit Singh:
Efficient algorithms for discrepancy minimization in convex sets. 289-307 - Nicolas Fraiman, Dieter Mitsche:
The diameter of inhomogeneous random graphs. 308-326 - Alan M. Frieze, Wesley Pegden:
Online purchasing under uncertainty. 327-351 - Richard Mycroft, Tássio Naia:
Unavoidable trees in tournaments. 352-385
Volume 53, Number 3, October 2018
- Issue information. 387-388
- Ágnes Backhausz, Balázs Szegedy:
On large-girth regular graphs and random processes on trees. 389-416 - Harry Crane, Stephen Desalvo, Sergi Elizalde:
The probability of avoiding consecutive patterns in the Mallows distribution. 417-447 - Cyril Marzouk:
Scaling limits of random bipartite planar maps with a prescribed degree sequence. 448-503 - Subhabrata Sen:
Optimization on sparse random hypergraphs and spin glasses. 504-536 - Benedikt Stufler:
Gibbs partitions: The convergent case. 537-558
Volume 53, Number 4, December 2018
Issue Information
- Issue information. 559-560
- Colin Cooper, Andrew McDowell, Tomasz Radzik, Nicolas Rivera, Takeharu Shiraga:
Dispersion processes. 561-585 - Alan M. Frieze, Wesley Pegden:
A note on dispersing particles on a line. 586-591 - Asaf Ferber, Matthew Kwan, Benny Sudakov:
Counting Hamilton cycles in sparse random directed graphs. 592-603 - Asaf Ferber, Rajko Nenadov:
Spanning universality in random graphs. 604-637 - Frederik Garbe, Richard Mycroft, Andrew McDowell:
Contagious sets in a degree-proportional bootstrap percolation process. 638-651 - Pawel Hitczenko, Amanda Lohss:
Probabilistic consequences of some polynomial recurrences. 652-666 - Dániel Korándi, Frank Mousset, Rajko Nenadov, Nemanja Skoric, Benny Sudakov:
Monochromatic cycle covers in random graphs. 667-691 - Michael Krivelevich, Matthew Kwan, Po-Shen Loh, Benny Sudakov:
The random k-matching-free process. 692-716 - Tobias Müller, Marc Noy:
The first order convergence law fails for random perfect graphs. 717-727 - Nemanja Skoric, Angelika Steger, Milos Trujic:
Local resilience of an almost spanning k-cycle in random graphs. 728-751
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-09 23:27 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:
