Fully dynamic algorithms for edge connectivity problems
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Fully dynamic planarity testing (extended abstract)
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Separator based sparsification for dynamic planar graph algorithms
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Faster shortest-path algorithms for planar graphs
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Sparsification—a technique for speeding up dynamic graph algorithms
Journal of the ACM (JACM)
Fully dynamic planarity testing with applications
Journal of the ACM (JACM)
| Hi-index | 0.00 |