Generating and counting Hamilton cycles in random regular graphs

Permutation Pseudographs and Contiguity

Combinatorics, Probability and Computing

Hamiltonian decompositions of random bipartite regular graphs

Journal of Combinatorial Theory Series B

3-star factors in random d-regular graphs

European Journal of Combinatorics - Special issue on extremal and probabilistic combinatorics

Approximately Counting Embeddings into Random Graphs

APPROX '08 / RANDOM '08 Proceedings of the 11th international workshop, APPROX 2008, and 12th international workshop, RANDOM 2008 on Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques

An improved fully polynomial randomized approximation scheme (FPRAS) for counting the number of Hamiltonian cycles in dense digraphs

Theoretical Computer Science

Consecutive ones property and PQ-trees for multisets: Hardness of counting their orderings

Information and Computation