Journal Article
Weak and strong versions of the 1-2-3 conjecture uniform hypergraphs
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
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