A. Berger, M. Grimmer, and M. Mller-hannemann, Fully Dynamic Speed-Up Techniques for Multi-criteria Shortest Path Searches in Time-Dependent Networks, 9th Int. Symposium on Experimental Algorithms (SEA'10), pp.35-46, 2010.
DOI : 10.1007/978-3-642-13193-6_4

E. Berrettini, G. D. Angelo, and D. Delling, Arc-flags in dynamic graphs, Proc. of the 9th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems, 2009.

G. D. Angelo, D. Frigioni, and C. Vitale, Dynamic arc-flags in road networks, 10th Int. Symp. on Exp. Algorithms (SEA2011), pp.88-99, 2011.
URL : https://hal.archives-ouvertes.fr/hal-00644054

D. Delling, A. V. Goldberg, T. Pajor, and R. F. Werneck, Customizable Route Planning, Proc. 10th Int. Symposium on Experimental Algorithms (SEA'11), pp.376-387, 2011.
DOI : 10.1007/978-3-642-20662-7_32
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.661.6474

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 Work. on Exp. Algorithms (WEA'07), pp.52-65, 2007.
DOI : 10.1007/978-3-540-72845-0_5

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

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 Algorithms (ESA'06), pp.804-816, 2006.

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

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

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