Colin Cooper, Alan M. Frieze The Size of the Largest Strongly Connected Component of a Random Digraph with a Given Degree Sequence. [Citation Graph (0, 0)][DBLP] Combinatorics, Probability & Computing, 2004, v:13, n:3, pp:319-337 [Journal]

Steven N. Evans Embedding a Markov Chain into a Random Walk on a Permutation Group. [Citation Graph (0, 0)][DBLP] Combinatorics, Probability & Computing, 2004, v:13, n:3, pp:339-351 [Journal]

Daniela Kühn, Deryk Osthus Subdivisions of K_{r+2} in Graphs of Average Degree at Least r+epsilon and Large but Constant Girth. [Citation Graph (0, 0)][DBLP] Combinatorics, Probability & Computing, 2004, v:13, n:3, pp:361-371 [Journal]

Gregory L. McColm Threshold Functions for Random Graphs on a Line Segment. [Citation Graph (0, 0)][DBLP] Combinatorics, Probability & Computing, 2004, v:13, n:3, pp:373-387 [Journal]

Shakhar Smorodinsky, Micha Sharir Selecting Points that are Heavily Covered by Pseudo-Circles, Spheres or Rectangles. [Citation Graph (0, 0)][DBLP] Combinatorics, Probability & Computing, 2004, v:13, n:3, pp:389-411 [Journal]