1. Batz, V., Delling, D., Sanders, P., Vetter, C.: Time-dependent contraction hierarchies. In: Proceedings of the 11th Workshop on Algorithm Engineering and Experiments (ALENEX’09), pp. 97–105. SIAM, New York (2009)
2. Bauer, R., Delling, D.: SHARC: fast and robust unidirectional routing. In: Munro, I., Wagner, D. (eds.) Proceedings of the 10th Workshop on Algorithm Engineering and Experiments (ALENEX’08), pp. 13–26. SIAM, New York (2008)
3. Bauer, R., Delling, D.: SHARC: fast and robust unidirectional routing. ACM J. Exp. Algorithmics 14, 2.4–2.29 (2009). Special Section on Selected Papers from ALENEX 2008
4. Brodal, G., Jacob, R.: Time-dependent networks as models to achieve fast exact time-table queries. In: Proceedings of ATMOS Workshop 2003, pp. 3–15 (2004)
5. Cooke, K., Halsey, E.: The shortest route through a network with time-dependent intermodal transit times. J. Math. Anal. Appl. 14, 493–498 (1966)