I. Abraham, D. Delling, A. V. Goldberg, and R. F. Werneck, Alternative Routes in Road Networks, ACM Journal of Experimental Algorithmics, vol.18, issue.1, pp.1-17, 2013.

R. Bader, J. Dees, R. Geisberger, and P. Sanders, Alternative Route Graphs in Road Networks, International ICST Conference on Theory and Practice of Algorithms in (Computer) Systems (TAPAS'11), pp.21-32, 2011.
DOI : 10.1007/978-3-642-19754-3_5

R. Bauer, D. Delling, P. Sanders, D. Schieferdecker, D. Schultes et al., Combining Hierarchical and Goal-Directed Speed-Up Techniques for Dijkstra's Algorithm, ACM Journal of Experimental Algorithmics, vol.15, issue.23, pp.1-31, 2010.

D. Gianlorenzo, . Angelo, D. Mattia, D. Emidio, C. Frigioni et al., Fully Dynamic Maintenance of Arc-Flags in Road Networks, International Symposium on Experimental Algorithms (SEA'12), pp.135-147, 2012.

D. Delling, A. V. Goldberg, T. Pajor, and R. F. Werneck, Customizable Route Planning, International 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, A. V. Goldberg, I. Razenshteyn, and R. F. Werneck, Graph Partitioning with Natural Cuts, 2011 IEEE International Parallel & Distributed Processing Symposium, pp.1135-1146, 2011.
DOI : 10.1109/IPDPS.2011.108
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.385.1580

D. Delling, M. Holzer, K. Müller, F. Schulz, and D. Wagner, High- Performance Multi-Level Routing, The Shortest Path Problem: Ninth DIMACS Implementation Challenge, pp.73-92, 2009.

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
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.164.8916

D. Delling and R. F. Werneck, Faster Customization of Road Networks, International Symposium on Experimental Algorithms (SEA'13), pp.30-42, 2013.
DOI : 10.1007/978-3-642-38527-8_5

C. Demetrescu, A. V. Goldberg, and D. S. Johnson, The Shortest Path Problem: Ninth DIMACS Implementation Challenge, 2009.

W. Edsger and . Dijkstra, A Note on Two Problems in Connexion with Graphs, Numerische Mathematik, vol.1, pp.269-271, 1959.

D. Eppstein, Finding the k Shortest Paths, Symposium on Foundations of Computer Science (FOCS'94), pp.154-165, 1994.

R. Geisberger, P. Sanders, D. Schultes, and C. Vetter, Exact Routing in Large Road Networks Using Contraction Hierarchies, Transportation Science, vol.46, issue.3, pp.388-404, 2012.
DOI : 10.1287/trsc.1110.0401

R. J. Gutman, Reach-Based Routing: A New Approach to Shortest Path Algorithms Optimized for Road Networks, Workshop on Algorithm Engineering and Experiments, pp.100-111, 2004.

M. Holzer, F. Schulz, and D. Wagner, Engineering Multi-Level Overlay Graphs for Shortest-Path Queries, ACM Journal of Experimental Algorithmics, vol.13, issue.25, pp.1-26, 2008.
DOI : 10.1137/1.9781611972863.15

M. Kobitzsch, An Alternative Approach to Alternative Routes: HiDAR, European Symposium on Algorithms (ESA'13, 2013.
DOI : 10.1007/978-3-642-40450-4_52

D. Luxen and D. Schieferdecker, Candidate Sets for Alternative Routes in Road Networks, International Symposium on Experimental Algorithms (SEA'12), pp.260-270, 2012.

A. Paraskevopoulos and C. Zaroliagis, Improved Alternative Route Planning In Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS'13), OASIcs, 2013.

M. Radermacher, Schnelle Berechnung von Alternativgraphen. Bachelor's thesis, Karlsruhe Institute of Technology, 2012.

D. Schultes and P. Sanders, Dynamic Highway-Node Routing, Workshop on Experimental Algorithms (WEA'07), pp.66-79, 2007.
DOI : 10.1007/978-3-540-72845-0_6
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.87.7469