Efficient algorithms for geometric optimization
ACM Computing Surveys (CSUR)
Linear programming queries revisited
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
Explicit and implicit enforcing: randomized optimization
Computational Discrete Mathematics
ISAAC '98 Proceedings of the 9th International Symposium 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
The smallest enclosing ball of balls: combinatorial structure and algorithms
Proceedings of the nineteenth annual symposium on Computational geometry
Range counting over multidimensional data streams
SCG '04 Proceedings of the twentieth annual symposium on Computational geometry
Approximating extent measures of points
Journal of the ACM (JACM)
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
Epsilon nets and union complexity
Proceedings of the twenty-fifth annual symposium on Computational geometry
Largest bounding box, smallest diameter, and related problems on imprecise points
Computational Geometry: Theory and Applications
Approximate range searching: The absolute model
Computational Geometry: Theory and Applications
The 2-center problem in three dimensions
Proceedings of the twenty-sixth annual symposium on Computational geometry
Streaming algorithms for extent problems in high dimensions
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Covering points by disjoint boxes with outliers
Computational Geometry: Theory and Applications
Modelling gateway placement in wireless networks: Geometric k-centres of unit disc graphs
Computational Geometry: Theory and Applications
Minimum enclosing circle of a set of fixed points and a mobile point
WALCOM'11 Proceedings of the 5th international conference on WALCOM: algorithms and computation
Comparing distributions and shapes using the kernel distance
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
Explicit Construction of a Small $\epsilon$-Net for Linear Threshold Functions
SIAM Journal on Computing
Unique sink orientations of grids
IPCO'05 Proceedings of the 11th international conference on Integer Programming and Combinatorial Optimization
PODS '12 Proceedings of the 31st symposium on Principles of Database Systems
Approximating low-dimensional coverage problems
Proceedings of the twenty-eighth annual symposium on Computational geometry
Maximum overlap of convex polytopes under translation
Computational Geometry: Theory and Applications
The 2-center problem in three dimensions
Computational Geometry: Theory and Applications
Range counting coresets for uncertain data
Proceedings of the twenty-ninth annual symposium on Computational geometry
Quality and efficiency for kernel density estimates in large data
Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data
ACM Transactions on Database Systems (TODS) - Invited papers issue
Hi-index | 0.00 |