Fast algorithms for finding nearest common ancestors
SIAM Journal on Computing
Computational geometry: an introduction
Computational geometry: an introduction
There is a planar graph almost as good as the complete graph
SCG '86 Proceedings of the second annual symposium on Computational geometry
Approximation algorithms for shortest path motion planning
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Fast algorithms for shortest paths in planar graphs, with applications
SIAM Journal on Computing
Optimal shortest path queries in a simple polygon
SCG '87 Proceedings of the third annual symposium on Computational geometry
A faster approximation algorithm for the Steiner problem in graphs
Information Processing Letters
On finding lowest common ancestors: simplification and parallelization (extended summary)
VLSI Algorithms and Architectures
There are planar graphs almost as good as the complete graph
Journal of Computer and System Sciences
Planar graph decomposition and all pairs shortest paths
Journal of the ACM (JACM)
Efficient ray shooting and hidden surface removal
SCG '91 Proceedings of the seventh annual symposium on Computational geometry
Ray shooting and other applications of spanning trees with low stabbing number
SIAM Journal on Computing
Parallel rectilinear shortest paths with rectangular obstacles
Computational Geometry: Theory and Applications
Dynamic algorithms for shortest paths in planar graphs
Theoretical Computer Science
Dynamic ray shooting and shortest paths via balanced geodesic triangulations
SCG '93 Proceedings of the ninth annual symposium on Computational geometry
Ray shooting and parametric search
SIAM Journal on Computing
SCG '94 Proceedings of the tenth annual symposium on Computational geometry
On parallel rectilinear obstacle-avoiding paths
Computational Geometry: Theory and Applications
Faster shortest-path algorithms for planar graphs
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
A unified approach to dynamic point location, ray shooting, and shortest paths in planar maps
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Voronoi diagrams based on convex distance functions
SCG '85 Proceedings of the first annual symposium on Computational geometry
Efficient Approximate Shortest-Path Queries Among Isothetic Rectangular Obstacles
WADS '93 Proceedings of the Third Workshop on Algorithms and Data Structures
Shortest path queries among weighted obstacles in the rectilinear plane
Proceedings of the eleventh annual symposium on Computational geometry
Developing algorithms and software for geometric path planning problems
ACM Computing Surveys (CSUR) - Special issue: position statements on strategic directions in computing research
Two-point Euclidean shortest path queries in the plane
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Approximate distance oracles for geometric graphs
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Approximate Distance Oracles Revisited
ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
Compact oracles for reachability and approximate distances in planar digraphs
Journal of the ACM (JACM)
Approximate distance oracles for graphs with dense clusters
Computational Geometry: Theory and Applications
Approximate distance oracles for geometric spanners
ACM Transactions on Algorithms (TALG)
Compact oracles for approximate distances around obstacles in the plane
ESA'07 Proceedings of the 15th annual European conference on Algorithms
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
| Hi-index | 0.00 |