{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T07:10:56Z","timestamp":1775027456865,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642385261","type":"print"},{"value":"9783642385278","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-38527-8_6","type":"book-chapter","created":{"date-parts":[[2013,5,8]],"date-time":"2013-05-08T13:23:02Z","timestamp":1368019382000},"page":"43-54","source":"Crossref","is-referenced-by-count":46,"title":["Intriguingly Simple and Fast Transit Routing"],"prefix":"10.1007","author":[{"given":"Julian","family":"Dibbelt","sequence":"first","affiliation":[]},{"given":"Thomas","family":"Pajor","sequence":"additional","affiliation":[]},{"given":"Ben","family":"Strasser","sequence":"additional","affiliation":[]},{"given":"Dorothea","family":"Wagner","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"6_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1007\/978-3-642-03456-5_24","volume-title":"Efficient Algorithms","author":"H. Bast","year":"2009","unstructured":"Bast, H.: Car or Public Transport \u2013 Two Worlds. In: Albers, S., Alt, H., N\u00e4her, S. (eds.) Efficient Algorithms. LNCS, vol.\u00a05760, pp. 355\u2013367. Springer, Heidelberg (2009)"},{"key":"6_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1007\/978-3-642-15775-2_25","volume-title":"Algorithms \u2013 ESA 2010","author":"H. Bast","year":"2010","unstructured":"Bast, H., Carlsson, E., Eigenwillig, A., Geisberger, R., Harrelson, C., Raychev, V., Viger, F.: Fast Routing in Very Large Public Transportation Networks using Transfer Patterns. In: de Berg, M., Meyer, U. (eds.) ESA 2010, Part I. LNCS, vol.\u00a06346, pp. 290\u2013301. Springer, Heidelberg (2010)"},{"issue":"1","key":"6_CR3","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1002\/net.20382","volume":"57","author":"R. Bauer","year":"2011","unstructured":"Bauer, R., Delling, D., Wagner, D.: Experimental Study on Speed-Up Techniques for Timetable Information Systems. Networks\u00a057(1), 38\u201352 (2011)","journal-title":"Networks"},{"key":"6_CR4","unstructured":"Berger, A., Delling, D., Gebhardt, A., M\u00fcller\u2013Hannemann, M.: Accelerating Time-Dependent Multi-Criteria Timetable Information is Harder Than Expected. In: ATMOS. OpenAccess Series in Informatics (OASIcs) (2009)"},{"key":"6_CR5","unstructured":"Berger, A., Gebhardt, A., M\u00fcller\u2013Hannemann, M., Ostrowski, M.: Stochastic Delay Prediction in Large Train Networks. In: ATMOS, pp. 100\u2013111 (2011)"},{"key":"6_CR6","doi-asserted-by":"crossref","unstructured":"Delling, D., Katz, B., Pajor, T.: Parallel Computation of Best Connections in Public Transportation Networks. ACM JEA (2012) (to appear)","DOI":"10.1145\/2133803.2345678"},{"key":"6_CR7","doi-asserted-by":"crossref","unstructured":"Delling, D., Pajor, T., Werneck, R.F.: Round-Based Public Transit Routing. In: ALENEX, pp. 130\u2013140. SIAM (2012)","DOI":"10.1137\/1.9781611972924.13"},{"key":"6_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/978-3-642-02094-0_7","volume-title":"Algorithmics of Large and Complex Networks","author":"D. Delling","year":"2009","unstructured":"Delling, D., Sanders, P., Schultes, D., Wagner, D.: Engineering Route Planning Algorithms. In: Lerner, J., Wagner, D., Zweig, K.A. (eds.) Algorithmics. LNCS, vol.\u00a05515, pp. 117\u2013139. Springer, Heidelberg (2009)"},{"key":"6_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1007\/978-3-540-68552-4_26","volume-title":"Experimental Algorithms","author":"Y. Disser","year":"2008","unstructured":"Disser, Y., M\u00fcller\u2013Hannemann, M., Schnee, M.: Multi-Criteria Shortest Paths in Time-Dependent Train Networks. In: McGeoch, C.C. (ed.) WEA 2008. LNCS, vol.\u00a05038, pp. 347\u2013361. Springer, Heidelberg (2008)"},{"key":"6_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/978-3-642-13193-6_7","volume-title":"Experimental Algorithms","author":"R. Geisberger","year":"2010","unstructured":"Geisberger, R.: Contraction of Timetable Networks with Realistic Transfers. In: Festa, P. (ed.) SEA 2010. LNCS, vol.\u00a06049, pp. 71\u201382. Springer, Heidelberg (2010)"},{"key":"6_CR11","unstructured":"Goerigk, M., Knoth, M., M\u00fcller\u2013Hannemann, M., Schmidt, M., Sch\u00f6bel, A.: The Price of Robustness in Timetable Information. In: ATMOS, pp. 76\u201387 (2011)"},{"key":"6_CR12","unstructured":"HaCon website (2013), \n                    \n                      http:\/\/www.hacon.de\/hafas\/"},{"key":"6_CR13","unstructured":"London Data Store, \n                    \n                      http:\/\/data.london.gov.uk"},{"key":"6_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/978-3-540-74247-0_3","volume-title":"Algorithmic Methods for Railway Optimization","author":"M. M\u00fcller-Hannemann","year":"2007","unstructured":"M\u00fcller-Hannemann, M., Schulz, F., Wagner, D., Zaroliagis, C.: Timetable Information: Models and Algorithms. In: Geraets, F., Kroon, L.G., Schoebel, A., Wagner, D., Zaroliagis, C.D. (eds.) Railway Optimization 2004. LNCS, vol.\u00a04359, pp. 67\u201390. Springer, Heidelberg (2007)"},{"issue":"2.4","key":"6_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1227161.1227166","volume":"12","author":"E. Pyrga","year":"2008","unstructured":"Pyrga, E., Schulz, F., Wagner, D., Zaroliagis, C.: Efficient Models for Timetable Information in Public Transportation Systems. ACM JEA\u00a012(2.4), 1\u201339 (2008)","journal-title":"ACM JEA"},{"key":"6_CR16","unstructured":"Sommer, C.: Shortest-Path Queries in Static Networks (2012) (submitted), Preprint available at \n                    \n                      http:\/\/www.sommer.jp\/spq-survey.html"}],"container-title":["Lecture Notes in Computer Science","Experimental Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-38527-8_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,12]],"date-time":"2019-05-12T23:43:59Z","timestamp":1557704639000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-38527-8_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642385261","9783642385278"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-38527-8_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013]]}}}