I. Abraham, D. Delling, A. Fiat, A. V. Goldberg, R. Fonseca et al., VC-Dimension and Shortest Path Algorithms, Proc. of the 38th International Colloquium on Automata, Languages and Programming (ICALP), pp.690-699, 2011.
DOI : 10.1137/1116025

I. Abraham, A. Fiat, A. V. Goldberg, R. Fonseca, and F. Werneck, Highway dimension, shortest paths, and provably efficient algorithms, Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp.782-793, 2010.

. Agresti, Analysis of Ordinal Categorical Data. Probability and Statistics, 2010.

H. Bast, Car or Public Transport???Two Worlds, Proceedings of the 8th Symposium on Experimental Algorithms (SEA), pp.355-367, 2009.
DOI : 10.1007/11427186_13

H. Bast, E. Carlsson, A. Eigenwillig, R. Geisberger, C. Harrelson et al., Fast Routing in Very Large Public Transportation Networks Using Transfer Patterns, Proceedings of the 18th annual European conference on Algorithms (ESA): Part I, pp.290-301, 2010.
DOI : 10.1007/978-3-642-15775-2_25

H. Bast, S. Funke, D. Matijevic, P. Sanders, and D. Schultes, In Transit to Constant Time Shortest-Path Queries in Road Networks, Proceedings of the 9th Workshop on Algorithm Engineering and Experiments (ALENEX). SIAM, 2007.
DOI : 10.1137/1.9781611972870.5

A. Berger, D. Delling, A. Gebhardt, and M. Müller-hannemann, Accelerating time-dependent multi-criteria timetable information is harder than expected, Proceedings of the 9th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS)

A. Berger, A. Gebhardt, M. Müller-hannemann, and M. Ostrowski, Stochastic delay prediction in large train network, Proceedings of the 9th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS), pp.100-111, 2011.

D. Delling, B. Katz, and T. Pajor, Parallel computation of best connections in public transportation networks, ACM Journal on Experimental Algorithmics, vol.17, 2012.

D. Delling, T. Pajor, and R. F. Werneck, Round-based public transit routing, Proceedings of the 14th Workshop on Algorithm Engineering and Experiments (ALENEX), pp.130-140, 2012.
DOI : 10.1287/trsc.2014.0534
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.652.775

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

J. Dibbelt, T. Pajor, B. Strasser, and D. Wagner, Intriguingly Simple and Fast Transit Routing, Proceedings of the 12th Symposium on Experimental Algorithms (SEA), pp.43-54, 2013.
DOI : 10.1007/978-3-642-38527-8_6
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.651.5037

Y. Disser, M. Müller, ?. Hannemann, and M. Schnee, Multi-criteria Shortest Paths in Time-Dependent Train Networks, Proceedings of the 7th Workshop on Experimental Algorithms (WEA), pp.347-361, 2008.
DOI : 10.1007/978-3-540-68552-4_26

R. Geisberger, Contraction of Timetable Networks with Realistic Transfers, Proceedings of the 9th Symposium on Experimental Algorithms (SEA), pp.71-82, 2010.
DOI : 10.1007/978-3-642-13193-6_7

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), pp.319-333, 2008.
DOI : 10.1007/978-3-540-68552-4_24

M. Goerigk, M. Knoth, ?. Müller, M. Hannemann, A. Schmidt et al., The price of robustness in timetable information, Proceedings of the 9th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS), pp.76-87, 2011.

V. Andrew and . Goldberg, The hub labeling algorithm, Proceedings of the 12th Symposium on Experimental Algorithms (SEA), p.4, 2013.

A. V. Goldberg, H. Kaplan, and R. F. Werneck, *: Efficient Point-to-Point Shortest Path Algorithms, Proceedings of the 8th Workshop on Algorithm Engineering and Experiments (ALENEX), pp.129-143, 2006.
DOI : 10.1137/1.9781611972863.13
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.65.521

R. J. Gutman, Reach-based routing: A new approach to shortest path algorithms optimized for road networks, Lars Arge, Giuseppe F. Italiano, and Robert Sedgewick, AT M O S ' 1 3

T. Hunter, R. Herring, P. Abbeel, and A. Bayen, Path and travel time inference from GPS probe vehicle data, Advances in Neural Information Processing Systems 21. Nips Foundation, 2009.

E. Jenelius and H. N. Koutsopoulos, Travel time estimation for urban road networks using low frequency probe vehicle data, Transportation Research Part B: Methodological, vol.53, issue.0, pp.64-81, 2013.
DOI : 10.1016/j.trb.2013.03.008

. Kendall, A NEW MEASURE OF RANK CORRELATION, Biometrika, vol.30, issue.1-2, pp.81-89, 1938.
DOI : 10.1093/biomet/30.1-2.81

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

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

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

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

Y. Yuan, X. Zheng, G. Xie, and . Sun, Driving with knowledge from the physical world, Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining, KDD '11, pp.316-324, 2011.
DOI : 10.1145/2020408.2020462