1 | -- | 16 | Colin Cooper, Alan M. Frieze. The cover time of sparse random graphs |
17 | -- | 34 | Tom Bohman, Alan M. Frieze, Ryan Martin, Miklós Ruszinkó, Clifford D. Smyth. Randomly generated intersecting hypergraphs II |
35 | -- | 49 | Svante Janson, Nicholas C. Wormald. Rainbow Hamilton cycles in random regular graphs |
50 | -- | 62 | Svante Janson, Malwina J. Luczak. A simple solution to the ::::k::::-core problem |
63 | -- | 77 | Zdenek Dvorak, Vít Jelínek, Daniel Král, Jan Kyncl, Michael E. Saks. Probabilistic strategies for the partition and plurality problems |
78 | -- | 94 | Manuel Bodirsky, Mihyun Kang, Mike Löffler, Colin McDiarmid. Random cubic planar graphs |
95 | -- | 104 | Jan Vondrák. Shortest-path metric approximation for random subgraphs |
105 | -- | 130 | József Balogh, Boris Pittel, Gelasio Salazar. Large harmonic sets of noncrossing edges for n randomly labeled vertices in convex position |
131 | -- | 167 | Francis Comets, François Delarue, René Schott. Distributed algorithms in an ergodic Markovian environment |
168 | -- | 205 | Ivona Bezáková, Nayantara Bhatnagar, Eric Vigoda. Sampling binary contingency tables with a greedy start |
206 | -- | 225 | Andreas Baltz, Devdatt P. Dubhashi, Anand Srivastav, Libertad Tansini, Sören Werth. Probabilistic analysis for a multiple depot vehicle routing problem |
226 | -- | 256 | Artur Czumaj, Christian Sohler. Sublinear-time approximation algorithms for clustering via random sampling |
257 | -- | 286 | József Balogh, Boris Pittel. Bootstrap percolation on the random regular graph |
287 | -- | 306 | Jennie C. Hansen, Jerzy Jaworski. A cutting process for random mappings |