Journals in DBLP

Random Struct. Algorithms
2006, volume: 28, number: 2

1. Brendan Nagle, Vojtech Rödl, Mathias Schacht
   The counting lemma for regular k-uniform hypergraphs. [Citation Graph (0, 0)][DBLP]
   Random Struct. Algorithms, 2006, v:28, n:2, pp:113-179 [Journal]
   
2. Vojtech Rödl, Jozef Skokan
   Applications of the regularity lemma for uniform hypergraphs. [Citation Graph (0, 0)][DBLP]
   Random Struct. Algorithms, 2006, v:28, n:2, pp:180-194 [Journal]
   
3. Tom Bohman, Jeong Han Kim
   A phase transition for avoiding a giant component. [Citation Graph (0, 0)][DBLP]
   Random Struct. Algorithms, 2006, v:28, n:2, pp:195-214 [Journal]
   
4. Malwina J. Luczak, Tomasz Luczak
   The phase transition in the cluster-scaled model of a random graph. [Citation Graph (0, 0)][DBLP]
   Random Struct. Algorithms, 2006, v:28, n:2, pp:215-246 [Journal]