default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRandom Structures and Algorithms, Volume 35
Volume 35, Number 1, August 2009
- David Conlon
, Jacob Fox, Benny Sudakov:
Ramsey numbers of sparse hypergraphs. 1-14 - Kasper Pedersen:
On systematic scan for sampling H-colorings of the path. 15-41 - Cyril Banderier, Markus Kuba, Alois Panholzer:
Analysis of three graph parameters for random trees. 42-69 - Rasmus Pagh:
Dispersing hash functions. 70-82 - Michael Krivelevich, Balázs Patkós:
Equitable coloring of random graphs. 83-99 - Alexander Gamburd, Shlomo Hoory, Mehrdad Shahshahani, Aner Shalev, Bálint Virág:
On the girth of random Cayley graphs. 100-117 - Peter Hegarty, Steven J. Miller:
When almost all sets are difference dominated. 118-136
Volume 35, Number 2, September 2009
- Gergely Ambrus, Imre Bárány:
Longest convex chains. 137-162 - Charanjit S. Jutla, Anindya C. Patthak, Atri Rudra, David Zuckerman:
Testing low-degree polynomials over prime fields. 163-193 - Fabrice Guillemin, Philippe Robert:
Analysis of Steiner subtrees of random trees for traceroute algorithms. 194-215 - András Pluhár:
Greedy colorings of uniform hypergraphs. 216-221 - Catherine S. Greenhill, Brendan D. McKay:
Random dense bipartite graphs and directed graphs with specified degrees. 222-249 - Elchanan Mossel, Allan Sly:
Rapid mixing of Gibbs sampling on graphs that are sparse on average. 250-270
Volume 35, Number 3, October 2009
- Tomasz Luczak, Taral Guldahl Seierstad:
The critical behavior of random digraphs. 271-293 - Béla Bollobás, Oliver Riordan:
Clique percolation. 294-322 - Louigi Addario-Berry, Nicolas Broutin, Bruce A. Reed:
Critical random graphs and the structure of a minimum spanning tree. 323-347 - Alexandr V. Kostochka, Mohit Kumbhat:
Coloring uniform hypergraphs with few edges. 348-368 - József Balogh, Ryan R. Martin, András Pluhár:
The diameter game. 369-389 - Steven Finch, Pascal Sebah:
Comment on "Volumes spanned by random points in the hypercube". 390-392
Volume 35, Number 4, December 2009
- Tom Bohman, Alan M. Frieze:
Hamilton cycles in 3-out. 393-417 - Gruia Calinescu, Chandra Chekuri, Jan Vondrák:
Disjoint bases in a polymatroid. 418-430 - Heidi Gebauer, Tibor Szabó:
Asymptotic random graph intuition for the biased connectivity game. 431-443 - Nikolaos Fountoulakis, Daniela Kühn, Deryk Osthus:
Minors in random regular graphs. 444-463 - Éric Fusy:
Uniform random sampling of planar graphs in linear time. 464-522
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-13 20:33 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:
