Almost optimal set covers in finite VC-dimension: (preliminary version)
SCG '94 Proceedings of the tenth annual symposium on Computational geometry
Computational geometry: a retrospective
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
On point location and motion planning among simplices
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
ACM Computing Surveys (CSUR)
Output-sensitive results on convex hulls, extreme points, and related problems
Proceedings of the eleventh annual symposium on Computational geometry
New lower bounds for Hopcroft's problem
Proceedings of the eleventh annual symposium on Computational geometry
Computing faces in segment and simplex arrangements
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
On computing Voronoi diagrams by divide-prune-and-conquer
Proceedings of the twelfth annual symposium on Computational geometry
Construction of 1-d lower envelopes and applications
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
Space-time tradeoffs for emptiness queries (extended abstract)
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
Time-series similarity problems and well-separated geometric sets
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
Are lower bounds easier over the reals?
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Geometric applications of a randomized optimization technique
Proceedings of the fourteenth annual symposium on Computational geometry
Efficient algorithms for geometric optimization
ACM Computing Surveys (CSUR)
Efficient algorithms for maximum regression depth
SCG '99 Proceedings of the fifteenth annual symposium on Computational geometry
On range reporting, ray shooting and k-level construction
SCG '99 Proceedings of the fifteenth annual symposium on Computational geometry
Output-sensitive construction of polytopes in four dimensions and clipped Voronoi diagrams in three
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
An efficient algorithm for the three-dimensional diameter problem
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Deterministic algorithms for 3-D diameter and some 2-D lower envelopes
Proceedings of the sixteenth annual symposium on Computational geometry
Online point location in planar arrangements and its applications
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Pattern matching for sets of segments
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Notes on computing peaks in k-levels and parametric spanning trees
SCG '01 Proceedings of the seventeenth annual symposium on Computational geometry
Minimax parametric optimization problems and multi-dimensional parametric searching
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Dense point sets have sparse Delaunay triangulations: or "…but not too nasty"
SODA '02 Proceedings of the thirteenth 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
Computing the writhing number of a polygonal knot
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Pseudo-line arrangements: duality, algorithms, and applications
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Reporting intersecting pairs of convex polytopes in two and three dimensions
Computational Geometry: Theory and Applications
Computing homotopic shortest paths in the plane
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Reporting Intersecting Pairs of Polytopes in Two and Three Dimensions
WADS '01 Proceedings of the 7th International Workshop on Algorithms and Data Structures
Maintenance of a Percing Set for Intervals with Applications
ISAAC '00 Proceedings of the 11th International Conference on Algorithms and Computation
Irregularities of Distribution, Derandomization, and Complexity Theory
FST TCS 2000 Proceedings of the 20th Conference on Foundations of Software Technology and Theoretical Computer Science
Improved Deterministic Parallel Padded Sorting
ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms
Translating a Planar Object to Maximize Point Containment
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Time-series similarity problems and well-separated geometric sets
Nordic Journal of Computing
Decomposable multi-parameter matroid optimization problems
Theoretical Computer Science - Latin American theoretical informatics
On counting point-hyperplane incidences
Computational Geometry: Theory and Applications - Special issue: The European workshop on computational geometry -- CG01
Proceedings of the nineteenth annual symposium on Computational geometry
Approximation algorithms for projective clustering
Journal of Algorithms
An optimal randomized algorithm for maximum Tukey depth
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
A note on point location in arrangements of hyperplanes
Information Processing Letters
Efficient detection of motion patterns in spatio-temporal data sets
Proceedings of the 12th annual ACM international workshop on Geographic information systems
Computational Geometry: Theory and Applications
Robust shape fitting via peeling and grating coresets
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Colored intersection searching via sparse rectangular matrix multiplication
Proceedings of the twenty-second annual symposium on Computational geometry
Stability versus speed in a computable algebraic model
Theoretical Computer Science - Real numbers and computers
Maximum overlap and minimum convex hull of two convex polyhedra under translations
Computational Geometry: Theory and Applications
Space---Query-Time Tradeoff for Computing the Visibility Polygon
FAW '09 Proceedings of the 3d International Workshop on Frontiers in Algorithmics
Approximate input sensitive algorithms for point pattern matching
Pattern Recognition
A new asymmetric inclusion region for minimum weight triangulation
Journal of Global Optimization
Proceedings of the twenty-sixth annual symposium on Computational geometry
The 2-center problem in three dimensions
Proceedings of the twenty-sixth annual symposium on Computational geometry
Computing similarity between piecewise-linear functions
Proceedings of the twenty-sixth annual symposium on Computational geometry
Algorithms and theory of computation handbook
Improved points approximation algorithms based on simplicial thickness data structures
IWOCA'10 Proceedings of the 21st international conference on Combinatorial algorithms
Computing a center-transversal line
FSTTCS'06 Proceedings of the 26th international conference on Foundations of Software Technology and Theoretical Computer Science
Self-improving algorithms for coordinate-wise maxima
Proceedings of the twenty-eighth annual symposium on Computational geometry
Improved pointer machine and I/O lower bounds for simplex range reporting and related problems
Proceedings of the twenty-eighth annual symposium on Computational geometry
An affine invariant k-nearest neighbor regression estimate
Journal of Multivariate Analysis
Cuttings for disks and axis-aligned rectangles
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
On computing the centroid of the vertices of an arrangement and related problems
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
Space/query-time tradeoff for computing the visibility polygon
Computational Geometry: Theory and Applications
Maximum overlap of convex polytopes under translation
Computational Geometry: Theory and Applications
The 2-center problem in three dimensions
Computational Geometry: Theory and Applications
| Hi-index | 0.00 |