Two algorithms for unranking arborescences

Generating random spanning trees more quickly than the cover time

STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing

How to get an exact sample from a generic Markov chain and sample a random spanning tree from a directed graph, both within the cover time

Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms

Determinant algorithms for random planar structures

SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms

Infinite mixtures of trees

Proceedings of the 24th international conference on Machine learning

An O(log n/ log log n)-approximation algorithm for the asymmetric traveling salesman problem

SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms

Chip-firing games, potential theory on graphs, and spanning trees

Journal of Combinatorial Theory Series A

Linear algebra and sequential importance sampling for network reliability

Proceedings of the Winter Simulation Conference