Faster shortest-path algorithms for planar graphs
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
An Efficient Algorithm for Shortest Paths in Vertical and Horizontal Segments
WADS '97 Proceedings of the 5th International Workshop on Algorithms and Data Structures
Approximating Shortest Paths in Arrangements of Lines
Proceedings of the 8th Canadian Conference on Computational Geometry
Computing shortest paths with comparisons and additions
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Topological Peeling and Implementation
ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
An Experimental Study and Comparison of Topological Peeling and Topological Walk
COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
Finding an optimal path without growing the tree
Journal of Algorithms
Approximate distance oracles for graphs with dense clusters
Computational Geometry: Theory and Applications
Embedding point sets into plane graphs of small dilation
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Approximate distance oracles for graphs with dense clusters
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
| Hi-index | 0.00 |