Computational geometry: an introduction
Computational geometry: an introduction
A data structure for dynamic trees
Journal of Computer and System Sciences
Fully dynamic point location in a monotone subdivision
SIAM Journal on Computing
Computing Euclidean maximum spanning trees
SCG '88 Proceedings of the fourth annual symposium on Computational geometry
Clustering algorithms based on minimum and maximum spanning trees
SCG '88 Proceedings of the fourth annual symposium on Computational geometry
Skip lists: a probabilistic alternative to balanced trees
Communications of the ACM
Dynamic trees and dynamic point location
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Dynamization of the trapezoid method for planar point location (extended abstract)
SCG '91 Proceedings of the seventh annual symposium on Computational geometry
Randomized multidimensional search trees (extended abstract): dynamic sampling
SCG '91 Proceedings of the seventh annual symposium on Computational geometry
Euclidean minimum spanning trees and bichromatic closest pairs
Discrete & Computational Geometry
Small-dimensional linear programming and convex hulls made easy
Discrete & Computational Geometry
Randomized multidimensional search trees: lazy balancing and dynamic shuffling (extended abstract)
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Dynamic maintenance of geometric structures made easy
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Dynamic three-dimensional linear programming
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Dynamic point location in general subdivisions
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
Maintenance of a minimum spanning forest in a dynamic plane graph
Journal of Algorithms
Incremental topological flipping works for regular triangulations
SCG '92 Proceedings of the eighth annual symposium on Computational geometry
Off-line dynamic maintenance of the width of a planar point set
Computational Geometry: Theory and Applications
Helly theorems and generalized linear programming
SCG '93 Proceedings of the ninth annual symposium on Computational geometry
On Maintaining the Width and Diameter of a Planar Point-Set Online
ISA '91 Proceedings of the 2nd International Symposium on Algorithms
An empirical study of dynamic graph algorithms
Journal of Experimental Algorithmics (JEA)
Average case analysis of dynamic graph algorithms
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
An empirical study of dynamic graph algorithms
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Dynamic algorithms for approximating interdistances
Nordic Journal of Computing
Dynamic algorithms for approximating interdistances
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Self-adjusting computation with Delta ML
AFP'08 Proceedings of the 6th international conference on Advanced functional programming
Hi-index | 0.00 |