Resource-constrained geometric network optimization
Proceedings of the fourteenth annual symposium on Computational geometry
Two-point Euclidean shortest path queries in the plane
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
On the continuous Weber and k-median problems (extended abstract)
Proceedings of the sixteenth annual symposium on Computational geometry
Approximate distance oracles for geometric graphs
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Computational geometry column 35
ACM SIGACT News
Approximate Distance Oracles Revisited
ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
Exact and Approximate Distances in Graphs - A Survey
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
Efficient multi-agent path planning
Proceedings of the Eurographic workshop on Computer animation and simulation
Parallel implementation of geometric shortest path algorithms
Parallel Computing - Special issue: High performance computing with geographical data
New results on shortest paths in three dimensions
SCG '04 Proceedings of the twentieth annual symposium on Computational geometry
Tightening: curvature-limiting morphological simplification
Proceedings of the 2005 ACM symposium on Solid and physical modeling
The visibility--voronoi complex and its applications
SCG '05 Proceedings of the twenty-first annual symposium on Computational geometry
Calculating the meeting point of scattered robots on weighted terrain surfaces
CATS '05 Proceedings of the 2005 Australasian symposium on Theory of computing - Volume 41
Planning Tours of Robotic Arms among Partitioned Goals
International Journal of Robotics Research
An optimal-time algorithm for shortest paths on a convex polytope in three dimensions
Proceedings of the twenty-second annual symposium on Computational geometry
Shortest circuits with given homotopy in a constellation
SM '04 Proceedings of the ninth ACM symposium on Solid modeling and applications
The visibility-Voronoi complex and its applications
Computational Geometry: Theory and Applications - Special issue on the 21st European workshop on computational geometry (EWCG 2005)
Approximate distance oracles for graphs with dense clusters
Computational Geometry: Theory and Applications
A PTAS for TSP with neighborhoods among fat regions in the plane
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Flying over a polyhedral terrain
Information Processing Letters
Approximate distance oracles for geometric spanners
ACM Transactions on Algorithms (TALG)
Maximum thick paths in static and dynamic environments
Proceedings of the twenty-fourth annual symposium on Computational geometry
Approximate Euclidean shortest paths amid convex obstacles
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
An O(n5/2logn) algorithm for the Rectilinear Minimum Link-Distance Problem in three dimensions
Computational Geometry: Theory and Applications
The geodesic farthest-site Voronoi diagram in a polygonal domain with holes
Proceedings of the twenty-fifth annual symposium on Computational geometry
Maximum thick paths in static and dynamic environments
Computational Geometry: Theory and Applications
Querying Two Boundary Points for Shortest Paths in a Polygonal Domain
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Proceedings of the twenty-sixth annual symposium on Computational geometry
Algorithms and theory of computation handbook
The geodesic diameter of polygonal domains
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
Approximate distance oracles for graphs with dense clusters
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
Querying two boundary points for shortest paths in a polygonal domain
Computational Geometry: Theory and Applications
Computing shortest heterochromatic monotone routes
Operations Research Letters
A near-optimal algorithm for shortest paths among curved obstacles in the plane
Proceedings of the twenty-ninth annual symposium on Computational geometry
Hi-index | 0.01 |