Efficient algorithms for geometric optimization
ACM Computing Surveys (CSUR)
Random sampling in geometric optimization: new insights and applications
Proceedings of the sixteenth annual symposium on Computational geometry
Algorithms for minimum volume enclosing simplex in R3
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
Learning fixed-dimension linear thresholds from fragmented data
Information and Computation
Explicit and implicit enforcing: randomized optimization
Computational Discrete Mathematics
Combinatorial Linear Programming: Geometry Can Help
RANDOM '98 Proceedings of the Second International Workshop on Randomization and Approximation Techniques in Computer Science
Finding the Sink Takes Some Time
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Output-sensitive cell enumeration in hyperplane arrangements
Nordic Journal of Computing
Violator spaces: structure and algorithms
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Violator spaces: Structure and algorithms
Discrete Applied Mathematics
Clarkson's algorithm for violator spaces
Computational Geometry: Theory and Applications
Unique sink orientations of grids
IPCO'05 Proceedings of the 11th international conference on Integer Programming and Combinatorial Optimization
A distributed simplex algorithm for degenerate linear programs and multi-agent assignments
Automatica (Journal of IFAC)
The 2-center problem in three dimensions
Computational Geometry: Theory and Applications
| Hi-index | 0.00 |