Fast algorithms for shortest paths in planar graphs, with applications
SIAM Journal on Computing
On the complexity of covering vertices by faces in a planar graph
SIAM Journal on Computing
On-line graph algorithms with SPQR-trees
Proceedings of the seventeenth international colloquium on Automata, languages and programming
Fully dynamic algorithms for edge connectivity problems
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Maintaining biconnected components of dynamic planar graphs (extended abstract)
Proceedings of the 18th international colloquium on Automata, languages and programming
Ambivalent data structures for dynamic 2-edge-connectivity and k smallest spanning trees
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Maintenance of a minimum spanning forest in a dynamic planar graph
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
Journal of the ACM (JACM)
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
A Dynamic Data Structure for Planar Graph Embedding (Extended Abstract)
ICALP '88 Proceedings of the 15th International Colloquium on Automata, Languages and Programming
Fast Incremental Planarity Testing
ICALP '92 Proceedings of the 19th International Colloquium on Automata, Languages and Programming
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
Fully dynamic planarity testing with applications
Journal of the ACM (JACM)
Reprints from Computing Reviews
ACM SIGACT News
| Hi-index | 0.00 |