Shortest Path Queries in Digraphs of Small Treewidth

Experimental analysis of dynamic algorithms for the single source shortest paths problem

Journal of Experimental Algorithmics (JEA)

Fully dynamic output bounded single source shortest path problem

Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms

Shortest path queries in planar graphs

STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing

Proximity Search in Databases

VLDB '98 Proceedings of the 24rd International Conference on Very Large Data Bases

How to Employ Reverse Search in Distributed Single Source Shortest Paths

SOFSEM '01 Proceedings of the 28th Conference on Current Trends in Theory and Practice of Informatics Piestany: Theory and Practice of Informatics

Fully Dynamic Shortest Paths and Negative Cycles Detection on Digraphs with Arbitrary Arc Weights

ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms

External data structures for shortest path queries on planar digraphs

ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation