Edge-skeletons in arrangements with applications
Algorithmica
A Linear time algorithm for computing the Voronoi diagram of a convex polygon
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
The concave least-weight subsequence problem revisited
Journal of Algorithms
A linear time algorithm for finding all farthest neighbors in a convex polygon
Information Processing Letters
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
Comparison-sorting and selecting in totally monotone matrices
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
On some geometric selection and optimization problems via sorted matrices
Computational Geometry: Theory and Applications
| Hi-index | 0.00 |