Data structures and algorithms 3: multi-dimensional searching and computational geometry
Data structures and algorithms 3: multi-dimensional searching and computational geometry
Data structures and network algorithms
Data structures and network algorithms
Computational geometry: an introduction
Computational geometry: an introduction
Slowing down sorting networks to obtain faster sorting algorithms
Journal of the ACM (JACM)
Optimal algorithms for approximate clustering
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Placing the largest similar copy of a convex polygon among polygonal obstacles
SCG '89 Proceedings of the fifth annual symposium on Computational geometry
SCG '89 Proceedings of the fifth annual symposium on Computational geometry
A new approach to the dynamic maintenance of maximal points in a plane
Discrete & Computational Geometry
Selecting distances in the plane
SCG '90 Proceedings of the sixth annual symposium on Computational geometry
Maintaining the minimal distance of a point set in polylogarithmic time
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
Offline maintenance of planar configurations
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
New techniques for some dynamic closest-point and farthest-point problems
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
Applying Parallel Computation Algorithms in the Design of Serial Algorithms
Journal of the ACM (JACM)
Computating the width of a set
SCG '85 Proceedings of the first annual symposium on Computational geometry
Data collection for the Sloan Digital Sky Survey—a network-flow heuristic
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Faster construction of planar two-centers
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Optimal location of transportation devices
Computational Geometry: Theory and Applications
| Hi-index | 0.00 |