Fixed-dimensional linear programming queries made easy
Proceedings of the twelfth annual symposium on Computational geometry
Improvements on bottleneck matching and related problems using geometry
Proceedings of the twelfth annual symposium on Computational geometry
On the complexity of the union of fat objects in the plane
SCG '97 Proceedings of the thirteenth 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)
The complexity of the union of (&agr;, &bgr;)-covered objects
SCG '99 Proceedings of the fifteenth annual symposium on Computational geometry
Optimal placement of convex polygons to maximize point containment
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
The Anatomy of a Geometric Algorithm
GD '99 Proceedings of the 7th International Symposium on Graph Drawing
Smallest Color-Spanning Objects
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
Translating a Planar Object to Maximize Point Containment
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Placing an abnoxious facility in geometric networks
Nordic Journal of Computing
Covering points with a polygon
Computational Geometry: Theory and Applications
Polynomial kernels for hard problems on disk graphs
SWAT'10 Proceedings of the 12th Scandinavian conference on Algorithm Theory
Optimal placement of convex polygons to maximize point containment
Computational Geometry: Theory and Applications
Minimum-area enclosing triangle with a fixed angle
Computational Geometry: Theory and Applications
Offset polygon and annulus placement problems
Computational Geometry: Theory and Applications
| Hi-index | 0.00 |