On the complexity of unification sequences
Proceedings on Third international conference on logic programming
The set union problem with backtracking
International Colloquium on Automata, Languages and Programming on Automata, languages and programming
On the single-operation worst-case time complexity of the disjoint set union problem
SIAM Journal on Computing
A data structure for dynamic trees
Journal of Computer and System Sciences
Amortized analysis of algorithms for set union with backtracking
SIAM Journal on Computing
On-line graph algorithms with SPQR-trees
Proceedings of the seventeenth 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 algorithms for 2-edge connectivity
SIAM Journal on Computing
Maintaining the 3-edge-connected components of a graph on-line
SIAM Journal on Computing
Maintenance of 2- and 3-edge-connected components of graphs I
Discrete Mathematics - Special issue on combinatorics and algorithms
Separator based sparsification for dynamic planar graph algorithms
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
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
Maintenance of Triconnected Components of Graphs (Extended Abstract)
ICALP '92 Proceedings of the 19th International Colloquium on Automata, Languages and Programming
Fully Dynamic Planarity Testing in Planar Embedded Graphs (Extended Abstract)
ESA '93 Proceedings of the First Annual European Symposium on Algorithms
Algorithms and data structures for dynamic graph problems
Algorithms and data structures for dynamic graph problems
| Hi-index | 0.00 |