Journal: Random Struct. Algorithms

Volume 32, Issue 4

401 -- 439Colin Cooper, Alan M. Frieze. The cover time of the giant component of a random graph
440 -- 462William M. Y. Goh, Pawel Hitczenko. Random partitions with restricted part sizes
463 -- 472Béla Bollobás, Oliver Riordan. Percolation on dual lattices with ::::k::::-fold symmetry
473 -- 493Oded Goldreich, Dana Ron. Approximating average parameters of graphs
494 -- 518Nicolas Broutin, Luc Devroye, E. McLeish, M. de la Salle. The height of increasing trees
519 -- 534Abraham Flaxman. A spectral technique for random satisfiable 3CNF formulas

Volume 32, Issue 3

263 -- 273Nicholas Georgiou, Malgorzata Kuchta, Michal Morayne, Jaroslaw Niemiec. On a universal best choice algorithm for partially ordered sets
274 -- 289Alex Brodsky, Shlomo Hoory. Simple permutations mix even better
290 -- 306Benny Sudakov, Jan Vondrák. How many random edges make a dense hypergraph non-2-colorable?
307 -- 333Petros Drineas, Ravi Kannan, Michael W. Mahoney. Sampling subproblems of heterogeneous Max-Cut problems and approximation algorithms
334 -- 345Zeev Dvir, Ran Raz. Analyzing linear mergers
346 -- 374Guan-Yu Chen, Laurent Saloff-Coste. The cutoff phenomenon for randomized riffle shuffles
375 -- 399Magnus Bordewich, Martin E. Dyer, Marek Karpinski. Path coupling using stopping times and counting independent sets and colorings in hypergraphs

Volume 32, Issue 2

125 -- 156Mathew D. Penrose, Andrew R. Wade. Limit theory for the random on-line nearest-neighbor graph
157 -- 180Manuel Bodirsky, Clemens Gröpl, Mihyun Kang. Generating unlabeled connected cubic planar graphs uniformly at random
181 -- 204Bhupendra Gupta, Srikanth K. Iyer, D. Manjunath. Topological properties of the one dimensional exponential random geometric graph
205 -- 222Michel Dekking, Károly Simon. On the size of the algebraic difference of two random Cantor sets
223 -- 235Tom Bohman, Alan M. Frieze, Benny Sudakov. The game chromatic number of random graphs
236 -- 261Stefanie Gerke, Dirk Schlatter, Angelika Steger, Anusch Taraz. The random planar graph process

Volume 32, Issue 1

1 -- 19Fan Chung Graham, Ronald L. Graham. Quasi-random graphs with given degree sequences
20 -- 37Mihalis Beis, William Duckworth, Michele Zito. Packing vertices and edges in random regular graphs
38 -- 48Zhicheng Gao, Nicholas C. Wormald. Distribution of subgraphs of random regular graphs
49 -- 70Michael Ben-Or, Don Coppersmith, Michael Luby, Ronitt Rubinfeld. Non-abelian homomorphism testing, and distributions close to their self-convolutions
71 -- 87Omer Angel, Itai Benjamini, Eran Ofek, Udi Wieder. Routing complexity of faulty networks
88 -- 100Demetres Christofides, Klas Markström. Expansion properties of random Cayley graphs and vertex transitive graphs via matrix martingales
101 -- 114Itai Benjamini, Simi Haber, Michael Krivelevich, Eyal Lubetzky. The isoperimetric constant of the random graph process
115 -- 124David Kravitz. On an online random k-SAT model