Approximations and optimal geometric divide-and-conquer
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Counting circular arc intersections
SCG '91 Proceedings of the seventh annual symposium on Computational geometry
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Almost optimal set covers in finite VC-dimension: (preliminary version)
SCG '94 Proceedings of the tenth annual symposium on Computational geometry
Efficient NC algorithms for set cover with applications to learning and geometry
Proceedings of the 30th IEEE symposium on Foundations of computer science
Computational geometry: a retrospective
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
ACM Computing Surveys (CSUR)
Paul Erdös (1913-996): his influence on the theory of computing
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Approximation algorithms for layered manufacturing
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Motorcycle graphs and straight skeletons
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Fast Range Searching with Delaunay Triangulations
Geoinformatica
Irregularities of Distribution, Derandomization, and Complexity Theory
FST TCS 2000 Proceedings of the 20th Conference on Foundations of Software Technology and Theoretical Computer Science
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Proceedings of the nineteenth annual symposium on Computational geometry
Detecting cuts in sensor networks
ACM Transactions on Sensor Networks (TOSN)
Space---Query-Time Tradeoff for Computing the Visibility Polygon
FAW '09 Proceedings of the 3d International Workshop on Frontiers in Algorithmics
A dynamic data structure for 3-D convex hulls and 2-D nearest neighbor queries
Journal of the ACM (JACM)
A center transversal theorem for hyperplanes and applications to graph drawing
Proceedings of the twenty-seventh annual symposium on Computational geometry
A simple framework for the generalized nearest neighbor problem
SWAT'12 Proceedings of the 13th Scandinavian conference on Algorithm Theory
| Hi-index | 0.00 |