Data structures and network algorithms
Data structures and network algorithms
A linear algorithm for embedding planar graphs using PQ-trees
Journal of Computer and System Sciences
Self-adjusting binary search trees
Journal of the ACM (JACM)
Optimal point location in a monotone subdivision
SIAM Journal on Computing
A dynamization of the all pairs least cost path problem
Proceedings on STACS 85 2nd annual symposium on theoretical aspects of computer science
A topological approach to dynamic graph connectivity
Information Processing Letters
Amortized efficiency of a path retrieval data structure
Theoretical Computer Science
Finding paths and deleting edges in directed acyclic graphs
Information Processing Letters
Maintenance of transitive closures and transitive reductions of graphs
Proceedings of the International Workshop WG '87 on Graph-theoretic concepts in computer science
A data structure for dynamic trees
Journal of Computer and System Sciences
Use of dynamic trees in a network simplex algorithm for the maximum flow problem
Mathematical Programming: Series A and B
Primitives for the manipulation of general subdivisions and the computation of Voronoi
ACM Transactions on Graphics (TOG)
Incremental algorithms for minimal length paths
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
Journal of the ACM (JACM)
An On-Line Edge-Deletion Problem
Journal of the ACM (JACM)
Dynamic Data Structures for Series Parallel Digraphs (Preliminary Version)
WADS '89 Proceedings of the Workshop on Algorithms and Data Structures
A Dynamic Data Structure for Planar Graph Embedding (Extended Abstract)
ICALP '88 Proceedings of the 15th International Colloquium on Automata, Languages and Programming
Dynamic trees and dynamic point location
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Dynamic expression trees and their applications
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
Fully dynamic planarity testing (extended abstract)
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Dynamic ray shooting and shortest paths via balanced geodesic triangulations
SCG '93 Proceedings of the ninth annual symposium on Computational geometry
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
Incremental algorithms for minimal length paths
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
Efficiency by Incrementalization: An Introduction
Higher-Order and Symbolic Computation
An O(n log n) algorithm for maximum st-flow in a directed planar graph
Journal of the ACM (JACM)
| Hi-index | 0.00 |