Journal Article
Efficient Algorithms for Three-Dimensional Axial and Planar Random Assignment Problems
Efficient Algorithms for Three-Dimensional Axial and Planar Random Assignment Problems
A note on the vacant set of random walks on the hypercube and other regular graphs of high degree
Cover Time of a Random Graph With a Degree Sequence II: Allowing Vertices of Degree Two
Random structures and algorithms
The Height of Random k-Trees and Related Branching Processes