Generating triangulations at random
ACM Transactions on Modeling and Computer Simulation (TOMACS)
Generating random spanning trees more quickly than the cover time
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
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
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
Limiting the spread of misinformation in social networks
Proceedings of the 20th international conference on World wide web
Chip-firing games, potential theory on graphs, and spanning trees
Journal of Combinatorial Theory Series A
Hi-index | 0.00 |