A subexponential randomized simplex algorithm (extended abstract)
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
A subexponential bound for linear programming
SCG '92 Proceedings of the eighth annual symposium on Computational geometry
A class of convex programs with applications to computational geometry
SCG '92 Proceedings of the eighth annual symposium on Computational geometry
Degenerate convex hulls in high dimensions without extra storage
SCG '92 Proceedings of the eighth annual symposium on Computational geometry
Helly theorems and generalized linear programming
SCG '93 Proceedings of the ninth annual symposium on Computational geometry
On geometric optimization with few violated constraints
SCG '94 Proceedings of the tenth annual symposium on Computational geometry
Bounded boxes, Hausdorff distance, and a new proof of an interesting Helly-type theorem
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
A survey of linear programming in randomized subexponential time
ACM SIGACT News
Output-sensitive results on convex hulls, extreme points, and related problems
Proceedings of the eleventh annual symposium on Computational geometry
Rectilinear and polygonal p-piercing and p-center problems
Proceedings of the twelfth annual symposium on Computational geometry
Fixed-dimensional linear programming queries made easy
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
Efficient algorithms for geometric optimization
ACM Computing Surveys (CSUR)
Computing roundness is easy if the set is almost round
SCG '99 Proceedings of the fifteenth annual symposium on Computational geometry
On linear-time deterministic algorithms for optimization problems in fixed dimension
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Deterministic algorithms for 2-d convex programming and 3-d online linear programming
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Random sampling in geometric optimization: new insights and applications
Proceedings of the sixteenth annual symposium on Computational geometry
Approximating the diameter, width, smallest enclosing cylinder, and minimum-width annulus
Proceedings of the sixteenth annual symposium on Computational geometry
Evaluating the cylindricity of a nominally cylindrical point set
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Randomizing combinatorial algorithms for linear programming when the dimension is moderately high
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Minimax parametric optimization problems and multi-dimensional parametric searching
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
An Optimization Based Robust Identification Algorithm in the Presence of Outliers
Journal of Global Optimization
Efficient algorithms for the minimum diameter bridge problem
Computational Geometry: Theory and Applications - Special issue on Discrete and computational geometry
Efficient Algorithms for the Minimum Diameter Bridge Problem
JCDCG '00 Revised Papers from the Japanese Conference on Discrete and Computational Geometry
Irregularities of Distribution, Derandomization, and Complexity Theory
FST TCS 2000 Proceedings of the 20th Conference on Foundations of Software Technology and Theoretical Computer Science
Enumerating extreme points in higher dimensions
Nordic Journal of Computing
An optimal randomized algorithm for maximum Tukey depth
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Multi-pass geometric algorithms
SCG '05 Proceedings of the twenty-first annual symposium on Computational geometry
Combinatorial structure and randomized subexponential algorithms for infinite games
Theoretical Computer Science
Violator spaces: structure and algorithms
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
An optimal randomized algorithm for d-variate zonoid depth
Computational Geometry: Theory and Applications
Helly-type theorems for approximate covering
Proceedings of the twenty-fourth annual symposium on Computational geometry
Output-sensitive algorithms for Tukey depth and related problems
Statistics and Computing
Violator spaces: Structure and algorithms
Discrete Applied Mathematics
A Meeting Scheduling Problem Respecting Time and Space
AAIM '08 Proceedings of the 4th international conference on Algorithmic Aspects in Information and Management
Improved Binary Space Partition merging
Computer-Aided Design
Inspecting a Set of Strips Optimally
WADS '09 Proceedings of the 11th International Symposium on Algorithms and Data Structures
A meeting scheduling problem respecting time and space
Geoinformatica
Algorithms and theory of computation handbook
Covering points by disjoint boxes with outliers
Computational Geometry: Theory and Applications
Three problems about dynamic convex hulls
Proceedings of the twenty-seventh annual symposium on Computational geometry
No dimension independent core-sets for containment under homothetics
Proceedings of the twenty-seventh annual symposium on Computational geometry
Geometric computations on indecisive points
WADS'11 Proceedings of the 12th international conference on Algorithms and data structures
SIAM Journal on Optimization
Computing a center-transversal line
FSTTCS'06 Proceedings of the 26th international conference on Foundations of Software Technology and Theoretical Computer Science
Covering and piercing disks with two centers
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
Covering and piercing disks with two centers
Computational Geometry: Theory and Applications
Net and prune: a linear time algorithm for euclidean distance problems
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
| Hi-index | 0.00 |