Fast algorithms for finding nearest common ancestors
SIAM Journal on Computing
Worst-case Analysis of Set Union Algorithms
Journal of the ACM (JACM)
A topological approach to dynamic graph connectivity
Information Processing Letters
On-line graph algorithms with SPQR-trees
Proceedings of the seventeenth international colloquium on Automata, languages and programming
Maintaining biconnected components of dynamic planar graphs (extended abstract)
Proceedings of the 18th international colloquium on Automata, languages and programming
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Fully dynamic planarity testing (extended abstract)
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Biconnectivity approximations and graph carvings
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
A categorized bibliography on incremental computation
POPL '93 Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Biconnectivity approximations and graph carvings
Journal of the ACM (JACM)
On certificates and lookahead in dynamic graph problems
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Implementation an Experimental Evaluation of Graph Connectivity Algorithms Using LEDA
WAE '99 Proceedings of the 3rd International Workshop on Algorithm Engineering
Hi-index | 0.00 |