I. Abraham, A. Fiat, A. V. Goldberg, and R. F. Werneck, Highway Dimension, Shortest Paths, and Provably Efficient Algorithms, Proceedings of the 21st Annual ACM?SIAM Symposium on Discrete Algorithms (SODA'10), pp.782-793, 2010.
DOI : 10.1137/1.9781611973075.64
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.193.5501

N. Alon, D. Moshkovitz, and S. Safra, -restrictions, ACM Transactions on Algorithms, vol.2, issue.2, pp.153-177, 2006.
DOI : 10.1145/1150334.1150336
URL : https://hal.archives-ouvertes.fr/halshs-00480214

G. Ausiello, P. Crescenzi, G. Gambosi, V. Kann, and A. Marchetti-spaccamela, Complexity and Approximation - Combinatorial Optimization Problems and Their Approximability Properties, 2002.

R. Bauer, T. Columbus, B. Katz, M. Krug, and D. Wagner, Preprocessing Speed-Up Techniques Is Hard, Proceedings of the 7th Conference on Algorithms and Complexity (CIAC'10), pp.359-370, 2010.
DOI : 10.1007/978-3-642-13073-1_32
URL : https://publikationen.bibliothek.kit.edu/1000016080/1978704

R. Bauer, G. D. Angelo, D. Delling, and D. Wagner, The Shortcut Problem ??? Complexity and Approximation, Proceedings of the 35th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM'09), pp.105-116, 2009.
DOI : 10.1007/978-3-540-70918-3_3

R. Bauer and D. Delling, SHARC, Proceedings of the 10th Workshop on Algorithm Engineering and Experiments (ALENEX'08), pp.13-26, 2008.
DOI : 10.1145/1498698.1537599

R. Bauer and D. Delling, SHARC, Journal of Experimental Algorithmics, vol.14, issue.24, pp.1-29, 2008.
DOI : 10.1145/1498698.1537599

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

E. Brunel, D. Delling, A. Gemsa, and D. Wagner, Space-Efficient SHARC-Routing, Proceedings of the 9th International Symposium on Experimental Algorithms (SEA'10), pp.47-58, 2010.
DOI : 10.1007/978-3-642-13193-6_5

D. Delling, Engineering and Augmenting Route Planning Algorithms, Fakultät für Informatik, 2009.

R. Geisberger, P. Sanders, D. Schultes, and D. Delling, Contraction Hierarchies: Faster and Simpler Hierarchical Routing in Road Networks, Proceedings of the 7th Workshop on Experimental Algorithms (WEA'08), pp.319-333, 2008.
DOI : 10.1007/978-3-540-68552-4_24

A. V. Goldberg, H. Kaplan, and R. F. Werneck, *: Efficient Point-to-Point Shortest Path Algorithms, ALENEX'06, pp.129-143
DOI : 10.1137/1.9781611972863.13
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.65.521

A. V. Goldberg, H. Kaplan, and R. F. Werneck, Better Landmarks Within Reach, Demetrescu [12], pp.38-51
DOI : 10.1007/978-3-540-72845-0_4
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.125.5754

A. V. Goldberg, H. Kaplan, and R. F. Werneck, Reach for A*: Shortest Path Algorithms with Preprocessing The Shortest Path Problem: Ninth DIMACS Implementation Challenge, pp.93-139, 2009.

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

W. Hoeffding, Probability inequalities for sums of bounded random variables, Journal of the American Statistical Association, vol.58, issue.301, pp.713-721, 1963.

M. Holzer, Engineering Planar-Separator and Shortest-Path Algorithms, Karlsruhe Institute of Technology (KIT) -Department of Informatics, 2008.
DOI : 10.1145/1498698.1571635
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.423.4950

M. Holzer, F. Schulz, and D. Wagner, Engineering Multi-Level Overlay Graphs for Shortest-Path Queries, ALENEX'06 [2], pp.156-170
DOI : 10.1137/1.9781611972863.15

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

P. Sanders and D. Schultes, Highway Hierarchies Hasten Exact Shortest Path Queries, Proceedings of the 13th Annual European Symposium on Algorithms (ESA'05), pp.568-579, 2005.
DOI : 10.1007/11561071_51

P. Sanders and D. Schultes, Engineering Highway Hierarchies, Proceedings of the 14th Annual European Symposium on Algorithms (ESA'06), pp.804-816, 2006.
DOI : 10.1007/11841036_71
URL : http://algo2.iti.kit.edu/documents/routeplanning/hhJournalSubmit.pdf

P. Sanders and D. Schultes, Engineering Fast Route Planning Algorithms, Demetrescu [12], pp.23-36
DOI : 10.1007/978-3-540-72845-0_2
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.85.4223

D. Schultes and P. Sanders, Dynamic Highway-Node Routing, Demetrescu [12], pp.66-79
DOI : 10.1007/978-3-540-72845-0_6
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.87.7469

F. Schulz, Timetable Information and Shortest Paths, Fakultät für Informatik, 2005.

F. Schulz, D. Wagner, and K. Weihe, Dijkstra's algorithm on-line, Journal of Experimental Algorithmics, vol.5, issue.12, pp.1-23, 2000.
DOI : 10.1145/351827.384254

F. Schulz, D. Wagner, and C. Zaroliagis, Using Multi-level Graphs for Timetable Information in Railway Systems, Proceedings of the 4th Workshop on Algorithm Engineering and Experiments, pp.43-59, 2002.
DOI : 10.1007/3-540-45643-0_4

A. Schumm, Heuristic Algorithms for the Shortcut Problem, Karlsruhe Institute of Technology, 2009.

D. Wagner and T. Willhalm, Speed-Up Techniques for Shortest-Path Computations, Proceedings of the 24th International Symposium on Theoretical Aspects of Computer Science (STACS'07), pp.23-36, 2007.
DOI : 10.1007/978-3-540-70918-3_3