Fibonacci heaps and their uses in improved network optimization algorithms
Journal of the ACM (JACM)
Fast algorithms for shortest paths in planar graphs, with applications
SIAM Journal on Computing
On finding lowest common ancestors: simplification and parallelization
SIAM Journal on Computing
Space-efficient message routing in c-decomposable networks
SIAM Journal on Computing
Introduction to algorithms
Planar graph decomposition and all pairs shortest paths
Journal of the ACM (JACM)
The design and analysis of algorithms
The design and analysis of algorithms
Matrix searching with the shortest path metric
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Faster shortest-path algorithms for planar graphs
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Using cellular graph embeddings in solving all pairs shortest paths problems
Journal of Algorithms
Shortest path queries among weighted obstacles in the rectilinear plane
Proceedings of the eleventh annual symposium on Computational geometry
Effective graph clustering for path queries in digital map databases
CIKM '96 Proceedings of the fifth international conference on Information and knowledge management
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Path Computation Algorithms for Advanced Traveller Information System (ATIS)
Proceedings of the Ninth International Conference on Data Engineering
Shortest Path Queries in Digraphs of Small Treewidth
ICALP '95 Proceedings of the 22nd International Colloquium on Automata, Languages and Programming
Planar Spanners and Approximate Shortest Path Queries among Obstacles in the Plane
ESA '96 Proceedings of the Fourth Annual European Symposium on Algorithms
Query optimization for navigation in geographic information systems
Query optimization for navigation in geographic information systems
Short path queries in planar graphs in constant time
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Compact oracles for reachability and approximate distances in planar digraphs
Journal of the ACM (JACM)
Many distances in planar graphs
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Oracles for bounded-length shortest paths in planar graphs
ACM Transactions on Algorithms (TALG)
Linear-space approximate distance oracles for planar, bounded-genus and minor-free graphs
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Improved distance queries in planar graphs
WADS'11 Proceedings of the 12th international conference on Algorithms and data structures
Exact distance oracles for planar graphs
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Submatrix maximum queries in Monge matrices and Monge partial matrices, and their applications
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
External data structures for shortest path queries on planar digraphs
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Shortest-path queries in static networks
ACM Computing Surveys (CSUR)
| Hi-index | 0.00 |