Dynamic algorithms for shortest paths in planar graphs

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

Journal of Experimental Algorithmics (JEA)

On the all-pairs Euclidean short path problem

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

New dynamic algorithms for shortest path tree computation

IEEE/ACM Transactions on Networking (TON)

New dynamic SPT algorithm based on a ball-and-string model

IEEE/ACM Transactions on Networking (TON)

Incremental FO(+,

ICDT '99 Proceedings of the 7th International Conference on Database Theory

Lifelong planning A*

Artificial Intelligence

Incremental heuristic search in AI

AI Magazine

Incremental maintenance of shortest distance and transitive closure in first-order logic and SQL

ACM Transactions on Database Systems (TODS)

Improved distance queries in planar graphs

WADS'11 Proceedings of the 12th international conference on Algorithms and data structures

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