Random Structures and Algorithms, Volume 30

Volume 30, Numbers 1-2, January - March 2007

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

Volume 30, Number 3, May 2007

• László Lovász, Santosh Vempala:
  The geometry of logconcave functions and sampling algorithms. 307-358
  Electronic Edition (link) BibTeX
• Remco van der Hofstad, Gerard Hooghiemstra, Piet Van Mieghem:
  The weight of the shortest path tree. 359-379
  Electronic Edition (link) BibTeX
• Hsien-Kuei Hwang:
  Profiles of random trees: Plane-oriented recursive trees. 380-413
  Electronic Edition (link) BibTeX
• Imre Bárány:
  The chance that a convex body is lattice-point free: A relative of Buffon's needle problem. 414-426
  Electronic Edition (link) BibTeX
• Amit Chakrabarti, Subhash Khot:
  Improved lower bounds on the randomized complexity of graph properties. 427-440
  Electronic Edition (link) BibTeX

Volume 30, Number 4, July 2007

• Simi Haber, Michael Krivelevich:
  On fractional K-factors of random graphs. 441-463
  Electronic Edition (link) BibTeX
• József Balogh, Robin Pemantle:
  The Klee-Minty random edge chain moves with linear speed. 464-483
  Electronic Edition (link) BibTeX
• Abraham D. Flaxman, Alan M. Frieze:
  The diameter of randomly perturbed digraphs and some applications. 484-504
  Electronic Edition (link) BibTeX
• Anton Bovier, Irina A. Kurkova:
  Poisson convergence in the restricted k-partitioning problem. 505-531
  Electronic Edition (link) BibTeX
• Surender Baswana, Sandeep Sen:
  A simple and linear time randomized algorithm for computing sparse spanners in weighted graphs. 532-563
  Electronic Edition (link) BibTeX
• Bernard Ycart, Joel Ratsaby:
  The VC dimension of k-uniform random hypergraphs. 564-572
  Electronic Edition (link) BibTeX