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
Fully dynamic planarity testing (extended abstract)
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Planar separators and parallel polygon triangulation (preliminary version)
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Maintenance of a minimum spanning forest in a dynamic plane graph
Journal of Algorithms
Fully Dynamic 2-Edge-Connectivity in Planar Graphs
SWAT '92 Proceedings of the Third Scandinavian Workshop on Algorithm Theory
A Dynamic Data Structure for Planar Graph Embedding (Extended Abstract)
ICALP '88 Proceedings of the 15th International Colloquium on Automata, Languages and Programming
Efficient Algorithms for Graphic Intersection and Parity (Extended Abstract)
Proceedings of the 12th Colloquium on Automata, Languages and Programming
Improved data structures for fully dynamic biconnectivity
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Alpha-algorithms for incremental planarity testing (preliminary version)
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Randomized dynamic graph algorithms with polylogarithmic time per operation
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
An empirical study of dynamic graph algorithms
Journal of Experimental Algorithmics (JEA)
An empirical study of dynamic graph algorithms
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Experimental analysis of dynamic minimum spanning tree algorithms
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Dynamic two-connectivity with backtracking
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Maintaining Dynamic Minimum Spanning Trees: An Experimental Study
ALENEX '02 Revised Papers from the 4th International Workshop on Algorithm Engineering and Experiments
Dynamic plane transitive closure
ESA'07 Proceedings of the 15th annual European conference on Algorithms
| Hi-index | 0.00 |