A linear algorithm for embedding planar graphs using PQ-trees
Journal of Computer and System Sciences
Random generation of combinatorial structures from a uniform
Theoretical Computer Science
Tilings and patterns
SIAM Journal on Computing
Matrix multiplication via arithmetic progressions
Journal of Symbolic Computation - Special issue on computational algebraic complexity
Introduction to algorithms
Generating random combinatorial objects
Journal of Algorithms
The random walk construction of uniform spanning trees and uniform labelled trees
SIAM Journal on Discrete Mathematics
A new approach to maximum matching in general graphs
Proceedings of the seventeenth international colloquium on Automata, languages and programming
Two algorithms for unranking arborescences
Journal of Algorithms
A matrix for counting paths in acyclic digraphs
Journal of Combinatorial Theory Series A
Exact sampling with coupled Markov chains and applications to statistical mechanics
Proceedings of the seventh international conference on Random structures and algorithms
Generating random spanning trees more quickly than the cover time
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Shuffling biological sequences
Discrete Applied Mathematics - Special volume on computational molecular biology
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Computer Solution of Large Sparse Positive Definite
Computer Solution of Large Sparse Positive Definite
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Markov chain algorithms for planar lattice structures
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Random sampling of large planar maps and convex polyhedra
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Theoretical Computer Science - Special issue: Tilings of the plane
Watermelon uniform random generation with applications
Theoretical Computer Science - Random generation of combinatorial objects and bijective combinatorics
Dissections and trees, with applications to optimal mesh encoding and to random sampling
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Maximum matching in graphs with an excluded minor
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Dissections, orientations, and trees with applications to optimal mesh encoding and random sampling
ACM Transactions on Algorithms (TALG)
Random sampling of plane partitions
Combinatorics, Probability and Computing
Matrix sparsification and nested dissection over arbitrary fields
Journal of the ACM (JACM)
| Hi-index | 0.00 |