Discrepancy and &egr; approximations for bounded VC-dimension
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Randomized algorithms
Average-case ray shooting and minimum weight triangulations
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
Approximate nearest neighbors: towards removing the curse of dimensionality
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Efficient search for approximate nearest neighbor in high dimensional spaces
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Computing Many Faces in Arrangements of Lines and Segments
SIAM Journal on Computing
Handbook of discrete and computational geometry
Fast hierarchical clustering and other applications of dynamic closest pairs
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Dimensionality reduction techniques for proximity problems
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Lectures on Proof Verification and Approximation Algorithms. (the book grow out of a Dagstuhl Seminar, April 21-25, 1997)
On Spanning Trees with Low Crossing Numbers
Data Structures and Efficient Algorithms, Final Report on the DFG Special Joint Initiative
Online point location in planar arrangements and its applications
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
On approximating the depth and related problems
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Biobjective evolutionary and heuristic algorithms for intersection of geometric graphs
Proceedings of the 8th annual conference on Genetic and evolutionary computation
| Hi-index | 0.00 |