Applications of parametric searching in geometric optimization
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
Diameter, width, closest line pair, and parametric searching
SCG '92 Proceedings of the eighth annual symposium on Computational geometry
An expander-based approach to geometric optimization
SCG '93 Proceedings of the ninth annual symposium on Computational geometry
ACM Computing Surveys (CSUR)
Efficient randomized algorithms for some geometric optimization problems
Proceedings of the eleventh annual symposium on Computational geometry
Fixed-dimensional linear programming queries made easy
Proceedings of the twelfth annual symposium on Computational geometry
Approximating monotone polygonal curves using the uniform metric
Proceedings of the twelfth annual symposium on Computational geometry
Geometric applications of a randomized optimization technique
Proceedings of the fourteenth annual symposium on Computational geometry
On enumerating and selecting distances
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
Efficient randomized algorithms for the repeated median line estimator
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Efficient approximation and optimization algorithms for computational metrology
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Time Responsive External Data Structures for Moving Points
WADS '01 Proceedings of the 7th International Workshop on Algorithms and Data Structures
Journal of Computer and System Sciences - Special issue on PODS 2000
Counting and representing intersections among triangles in three dimensions
SCG '04 Proceedings of the twentieth annual symposium on Computational geometry
Proximity problems on line segments spanned by points
Computational Geometry: Theory and Applications
A practical approximation algorithm for the LMS line estimator
Computational Statistics & Data Analysis
Randomized algorithm for the sum selection problem
Theoretical Computer Science
Proximity problems on line segments spanned by points
Computational Geometry: Theory and Applications
Counting and representing intersections among triangles in three dimensions
Computational Geometry: Theory and Applications
Optimal Randomized Algorithm for the Density Selection Problem
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Geodesic Fréchet distance inside a simple polygon
ACM Transactions on Algorithms (TALG)
Counting inversions, offline orthogonal range counting, and related problems
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Some variations on constrained minimum enclosing circle problem
COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part I
The frechet distance revisited and extended
Proceedings of the twenty-seventh annual symposium on Computational geometry
Piecewise-linear approximations of uncertain functions
WADS'11 Proceedings of the 12th international conference on Algorithms and data structures
Randomized algorithm for the sum selection problem
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
In-place randomized slope selection
CIAC'06 Proceedings of the 6th Italian conference on Algorithms and Complexity
Equipartitions of measures by 2-fans
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
Some variations on constrained minimum enclosing circle problem
Journal of Combinatorial Optimization
The fréchet distance revisited and extended
ACM Transactions on Algorithms (TALG)
Hi-index | 0.89 |