H. Bast, E. Carlsson, A. Eigenwillig, R. Geisberger, and C. Harrelson, Veselin Raychev, and Fabien Viger Fast routing in very large public transportation networks using transfer patterns, Algorithms ? ESA 2010, pp.290-301, 2010.

R. Bauer, D. Delling, and D. Wagner, Experimental study of speed up techniques for timetable information systems, Networks, vol.10, issue.1, pp.38-52, 2011.
DOI : 10.1002/net.20382

J. Boyan and M. Mitzenmacher, Improved results for route planning in stochastic transportation, Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms, pp.895-902, 2001.

J. M. Buhmann, M. Mihalák, R. ?rámek, and P. Widmayer, Robust optimization in the presence of uncertainty, Proceedings of the 4th conference on Innovations in Theoretical Computer Science, ITCS '13, pp.505-514, 2013.
DOI : 10.1145/2422436.2422491

D. Delling, T. Pajor, and D. Wagner, Engineering Time-Expanded Graphs for Faster Timetable Information, Robust and Online Large-Scale Optimization, pp.182-206, 2009.
DOI : 10.1007/978-3-642-05465-5_7

D. Delling, T. Pajor, and R. F. Werneck, Round-based public transit routing. Algorithm Engineering and Experiments (ALENEX), pp.130-140, 2012.

J. Dibbelt, T. Pajor, B. Strasser, and D. Wagner, Intriguingly Simple and Fast Transit Routing, LNCS, vol.7933, pp.43-54, 2013.
DOI : 10.1007/978-3-642-38527-8_6

M. Disser, M. Müller-hannemann, and . Schnee, Multi-criteria Shortest Paths in Time-Dependent Train Networks, Experimental Algorithms, pp.347-361, 2008.
DOI : 10.1007/978-3-540-68552-4_26

. Frank, Shortest Paths in Probabilistic Graphs, Operations Research, vol.17, issue.4, pp.583-599, 1969.
DOI : 10.1287/opre.17.4.583

M. Goerigk, M. Knoth, M. Müller-hannemann, M. Schmidt, and A. Schöbel, The price of robustness in timetable information, 11th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems, pp.76-87, 2011.

M. Müller-hannemann and M. Schnee, Efficient Timetable Information in the Presence of Delays, Robust and Online Large-Scale Optimization, pp.249-272
DOI : 10.1007/978-3-642-05465-5_10

M. Müller-hannemann, F. Schulz, D. Wagner, and C. Zaroliagis, Timetable Information: Models and Algorithms, Algorithmic Methods for Railway Optimization, pp.67-90, 2007.
DOI : 10.1007/978-3-540-74247-0_3

. 13-evdokia-nikolova, A. Jonathan, M. Kelner, M. Brand, and . Mitzenmacher, Stochastic shortest paths via quasi-convex maximization, Algorithms?ESA 2006, pp.552-563, 2006.

E. Pyrga, F. Schulz, D. Wagner, and C. Zaroliagis, Efficient models for timetable information in public transportation systems, Journal of Experimental Algorithmics, vol.12, pp.2-4, 2008.
DOI : 10.1145/1227161.1227166