default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRandom Structures and Algorithms, Volume 32
Volume 32, Number 1, January 2008
- Fan Chung Graham, Ronald L. Graham:
Quasi-random graphs with given degree sequences. 1-19 - Mihalis Beis, William Duckworth, Michele Zito:
Packing vertices and edges in random regular graphs. 20-37 - Zhicheng Gao, Nicholas C. Wormald:
Distribution of subgraphs of random regular graphs. 38-48 - Michael Ben-Or
, Don Coppersmith, Michael Luby, Ronitt Rubinfeld:
Non-abelian homomorphism testing, and distributions close to their self-convolutions. 49-70 - Omer Angel, Itai Benjamini, Eran Ofek, Udi Wieder:
Routing complexity of faulty networks. 71-87 - Demetres Christofides, Klas Markström:
Expansion properties of random Cayley graphs and vertex transitive graphs via matrix martingales. 88-100 - Itai Benjamini, Simi Haber, Michael Krivelevich, Eyal Lubetzky:
The isoperimetric constant of the random graph process. 101-114 - David Kravitz:
On an online random k-SAT model. 115-124
Volume 32, Number 2, March 2008
- Mathew D. Penrose, Andrew R. Wade:
Limit theory for the random on-line nearest-neighbor graph. 125-156 - Manuel Bodirsky, Clemens Gröpl, Mihyun Kang:
Generating unlabeled connected cubic planar graphs uniformly at random. 157-180 - Bhupendra Gupta, Srikanth K. Iyer, D. Manjunath:
Topological properties of the one dimensional exponential random geometric graph. 181-204 - Michel Dekking, Károly Simon:
On the size of the algebraic difference of two random Cantor sets. 205-222 - Tom Bohman, Alan M. Frieze, Benny Sudakov:
The game chromatic number of random graphs. 223-235 - Stefanie Gerke, Dirk Schlatter, Angelika Steger, Anusch Taraz:
The random planar graph process. 236-261
Volume 32, Number 3, May 2008
- Nicholas Georgiou, Malgorzata Kuchta, Michal Morayne, Jaroslaw Niemiec:
On a universal best choice algorithm for partially ordered sets. 263-273 - Alex Brodsky, Shlomo Hoory:
Simple permutations mix even better. 274-289 - Benny Sudakov, Jan Vondrák:
How many random edges make a dense hypergraph non-2-colorable? 290-306 - Petros Drineas, Ravi Kannan, Michael W. Mahoney:
Sampling subproblems of heterogeneous Max-Cut problems and approximation algorithms. 307-333 - Zeev Dvir, Ran Raz:
Analyzing linear mergers. 334-345 - Guan-Yu Chen, Laurent Saloff-Coste:
The cutoff phenomenon for randomized riffle shuffles. 346-374 - Magnus Bordewich, Martin E. Dyer, Marek Karpinski:
Path coupling using stopping times and counting independent sets and colorings in hypergraphs. 375-399
Volume 32, Number 4, July 2008
- Colin Cooper, Alan M. Frieze:
The cover time of the giant component of a random graph. 401-439 - William M. Y. Goh, Pawel Hitczenko:
Random partitions with restricted part sizes. 440-462 - Béla Bollobás, Oliver Riordan:
Percolation on dual lattices with k-fold symmetry. 463-472 - Oded Goldreich, Dana Ron:
Approximating average parameters of graphs. 473-493 - Nicolas Broutin, Luc Devroye, Erin McLeish, M. de la Salle:
The height of increasing trees. 494-518 - Abraham Flaxman:
A spectral technique for random satisfiable 3CNF formulas. 519-534
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-12 01:24 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:
