E. Berrettini, G. D. Angelo, and D. Delling, Arc-flags in dynamic graphs In 9th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, graph n. of regions space AF (B) space AF and RS (B) ratio

F. Bruera, S. Cicerone, G. D. Angelo, G. D. Stefano, and D. Frigioni, Dynamic Multi-level Overlay Graphs for Shortest Paths, Mathematics in Computer Science, vol.1, issue.4, pp.709-736, 2008.
DOI : 10.1007/s11786-007-0023-5

D. Delling, R. Hoffmann, M. Kandyba, and A. Schulze, Chapter 9. Case Studies, Case Studies, pp.389-445, 2010.
DOI : 10.1007/978-3-642-14866-8_9

D. Delling, P. Sanders, D. Schultes, and D. Wagner, Engineering Route Planning Algorithms, Algorithmics of Large and Complex Networks, pp.117-139, 2009.
DOI : 10.1007/978-3-540-39658-1_69

D. Delling and D. Wagner, Landmark-Based Routing in Dynamic Graphs, 6th Workshop on Exp. Alg. (WEA'07), pp.52-65, 2007.
DOI : 10.1007/978-3-540-72845-0_5

E. W. Dijkstra, A note on two problems in connexion with graphs, Numerische Mathematik, vol.4, issue.1, pp.269-271, 1959.
DOI : 10.1007/BF01386390

D. Frigioni, A. Marchetti-spaccamela, and U. Nanni, Fully Dynamic Algorithms for Maintaining Shortest Paths Trees, Journal of Algorithms, vol.34, issue.2, pp.251-281, 2000.
DOI : 10.1006/jagm.1999.1048

A. V. Goldberg and C. Harrelson, Computing the Shortest Path: A* Search Meets Graph Theory, 16th Annual ACM?SIAM Symposium on Discrete Algorithms (SODA'05), pp.156-165, 2005.

M. Hilger, E. Köhler, R. H. Möhring, and H. Schilling, Fast Point-to-Point Shortest Path Computations with Arc-Flags, Shortest Path Computations: Ninth DIMACS Challenge, 2009.

G. Karypis, METIS -A Family of Multilevel Partitioning Algorithms, 2007.

U. Lauther, An extremely fast, exact algorithm for finding shortest paths. Static Networks with Geographical Background, pp.219-230, 2004.

R. H. Möhring, H. Schilling, B. Schütz, D. Wagner, and T. Willhalm, Partitioning graphs to speedup Dijkstra's algorithm, Journal of Experimental Algorithmics, vol.11, issue.2, 2006.
DOI : 10.1145/1187436.1216585

P. Sanders and D. Schultes, Engineering Highway Hierarchies, 14th European Symp. on Alg. (ESA'06), pp.804-816, 2006.

P. Sanders and D. Schultes, Dynamic Highway-Node Routing, 6th Workshop on Exp. Alg. (WEA'07), pp.66-79, 2007.

F. Schulz, D. Wagner, and C. Zaroliagis, Using Multi-level Graphs for Timetable Information in Railway Systems, 4th Workshop on Alg. Eng. and Experiments (ALENEX'02), volume 2409 of LNCS, pp.43-59, 2002.
DOI : 10.1007/3-540-45643-0_4

D. Wagner and T. Willhalm, Geometric Speed-Up Techniques for Finding Shortest Paths in Large Sparse Graphs, 11th European Symp. on Alg. (ESA'03), pp.776-787, 2003.
DOI : 10.1007/978-3-540-39658-1_69

D. Wagner, T. Willhalm, and C. Zaroliagis, Geometric containers for efficient shortest-path computation, Journal of Experimental Algorithmics, vol.10, pp.1-3, 2005.
DOI : 10.1145/1064546.1103378