1. Dijkstra, E.W.: A Note on Two Problems in Connexion with Graphs. Numerische Mathematik 1, 269–271 (1959)
2. Hart, P., Nilsson, N., Raphael, B.: A formal basis for the heuristic determination of minimum cost paths. IEEE Transact. on Syst. Sci. and Cybernetics 4 (1968)
3. Goldberg, A.V., Harrelson, C.: Computing the Shortest Path: A* Search Meets Graph Theory. In: Proceedings of the 16th Annual ACM–SIAM Symposium on Discrete Algorithms (SODA 2005). SIAM (2005)
4. Lauther, U.: Slow preprocessing of graphs for extremely fast shortest path calculations. In: Workshop on Computational Integer Programming at ZIB (1997)
5. Lauther, U.: An extremely fast, exact algorithm for finding shortest paths in static networks with geographical background. Geoinformation und Mobilität—von der Forschung zur praktischen Anwendung 22, 219–230 (2004)