Two algorithms for maintaining order in a list
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
A data structure for dynamic trees
Journal of Computer and System Sciences
The cell probe complexity of dynamic data structures
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
On-line graph algorithms with SPQR-trees
Proceedings of the seventeenth international colloquium on Automata, languages and programming
Lower bounds for the union-find and the split-find problem on pointer machines
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
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
On-line maintenance of the four-components of a graph (extended abstract)
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
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
An O(m log n)-time algorithm for the maximal planar subgraph problem
SIAM Journal on Computing
Separator based sparsification for dynamic planar graph algorithms
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Maintenance of a minimum spanning forest in a dynamic planar graph
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
New techniques for the union-find problem
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
Data structures for weighted matching and nearest common ancestors with linking
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
Journal of the ACM (JACM)
Design of Dynamic Data Structures
Design of Dynamic Data Structures
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
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
A graph-planarization algorithm and its application to random graphs
Proceedings of the 17th Symposium of Research Institute of Electric Communication on Graph Theory and Algorithms
An analysis of some heuristics for the maximum planar subgraph problem
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
A new approximation algorithm for the planar augmentation problem
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Maintaining Center and Median in Dynamic Trees
SWAT '00 Proceedings of the 7th Scandinavian Workshop on Algorithm Theory
Maintaining information in fully dynamic trees with top trees
ACM Transactions on Algorithms (TALG)
Testing planarity of partially embedded graphs
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
COCOON'06 Proceedings of the 12th annual international conference on Computing and Combinatorics
A branch-and-cut approach to the crossing number problem
Discrete Optimization
| Hi-index | 0.00 |