{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T13:45:14Z","timestamp":1760708714315},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319079585"},{"type":"electronic","value":"9783319079592"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-07959-2_25","type":"book-chapter","created":{"date-parts":[[2014,6,10]],"date-time":"2014-06-10T12:44:25Z","timestamp":1402404265000},"page":"295-306","source":"Crossref","is-referenced-by-count":6,"title":["Exploiting GPS Data in Public Transport Journey Planners"],"prefix":"10.1007","author":[{"given":"Luca","family":"Allulli","sequence":"first","affiliation":[]},{"given":"Giuseppe F.","family":"Italiano","sequence":"additional","affiliation":[]},{"given":"Federico","family":"Santaroni","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"25_CR1","unstructured":"Agenzia Roma servizi per la Mobilit\u00e0. Muoversi a Roma (2014), \n                    \n                      http:\/\/www.agenziamobilita.roma.it\/servizi\/open-data\/\n                    \n                    \n                   (Online; accessed January 2014)"},{"key":"25_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"690","DOI":"10.1007\/978-3-642-22006-7_58","volume-title":"Automata, Languages and Programming","author":"I. Abraham","year":"2011","unstructured":"Abraham, I., Delling, D., Fiat, A., Goldberg, A.V., Werneck, R.F.F.: VC-dimension and shortest path algorithms. In: Aceto, L., Henzinger, M., Sgall, J. (eds.) ICALP 2011, Part I. LNCS, vol.\u00a06755, pp. 690\u2013699. Springer, Heidelberg (2011)"},{"key":"25_CR3","doi-asserted-by":"crossref","unstructured":"Abraham, I., Fiat, A., Goldberg, A.V., Werneck, R.F.F.: Highway dimension, shortest paths, and provably efficient algorithms. In: SODA 2010, pp. 782\u2013793. SIAM, Philadelphia (2010)","DOI":"10.1137\/1.9781611973075.64"},{"key":"25_CR4","unstructured":"Bast, H., Delling, D., Goldberg, A.V., M\u00fcller-Hannemann, M., Pajor, T., Sanders, P., Wagner, D., Werneck, R.: Route planning in transportation networks. Tech. Rep. MSR-TR-2014-4, Microsoft Research (2014)"},{"key":"25_CR5","doi-asserted-by":"crossref","unstructured":"Bast, H., Funke, S., Matijevic, D., Sanders, P., Schultes, D.: In transit to constant time shortest-path queries in road networks. In: ALENEX 2007. SIAM, Philadelphia (2007)","DOI":"10.1137\/1.9781611972870.5"},{"key":"25_CR6","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 - Two worlds. In: Albers, S., Alt, H., N\u00e4her, S. (eds.) Efficient Algorithms. LNCS, vol.\u00a05760, pp. 355\u2013367. Springer, Heidelberg (2009)"},{"key":"25_CR7","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)"},{"key":"25_CR8","unstructured":"Bast, H., Sternisko, J., Storandt, S.: Delay-robustness of Transfer Patterns in public transportation route planning. In: ATMOS 2013. OASICS, vol.\u00a033, pp. 42\u201354. Schloss Dagstuhl (2013)"},{"key":"25_CR9","first-page":"130","volume-title":"ALENEX 2012","author":"D. Delling","year":"2012","unstructured":"Delling, D., Pajor, T., Werneck, R.F.F.: Round-based public transit routing. In: ALENEX 2012, pp. 130\u2013140. SIAM, Philadelphia (2012)"},{"key":"25_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1007\/978-3-642-38527-8_6","volume-title":"Experimental Algorithms","author":"J. Dibbelt","year":"2013","unstructured":"Dibbelt, J., Pajor, T., Strasser, B., Wagner, D.: Intriguingly simple and fast transit routing. In: Bonifaci, V., Demetrescu, C., Marchetti-Spaccamela, A. (eds.) SEA 2013. LNCS, vol.\u00a07933, pp. 43\u201354. Springer, Heidelberg (2013)"},{"key":"25_CR11","unstructured":"Firmani, D., Italiano, G.F., Laura, L., Santaroni, F.: Is timetabling routing always reliable for public transport? In: ATMOS 2013. OASICS, vol.\u00a033, Schloss Dagstuhl (2013)"},{"key":"25_CR12","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":"25_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/978-3-540-68552-4_24","volume-title":"Experimental Algorithms","author":"R. Geisberger","year":"2008","unstructured":"Geisberger, R., Sanders, P., Schultes, D., Delling, D.: Contraction hierarchies: Faster and simpler hierarchical routing in road networks. In: McGeoch, C.C. (ed.) WEA 2008. LNCS, vol.\u00a05038, pp. 319\u2013333. Springer, Heidelberg (2008)"},{"key":"25_CR14","first-page":"129","volume-title":"ALENEX 2006","author":"A.V. Goldberg","year":"2006","unstructured":"Goldberg, A.V., Kaplan, H., Werneck, R.F.: Reach for A*: Efficient point-to-point shortest path algorithms. In: ALENEX 2006, pp. 129\u2013143. SIAM, Philadelphia (2006)"},{"key":"25_CR15","first-page":"100","volume-title":"ALENEX\/ANALC 2004","author":"R.J. Gutman","year":"2004","unstructured":"Gutman, R.J.: Reach-based routing: A new approach to shortest path algorithms optimized for road networks. In: ALENEX\/ANALC 2004, pp. 100\u2013111. SIAM, Philadelphia (2004)"},{"key":"25_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"568","DOI":"10.1007\/11561071_51","volume-title":"Algorithms \u2013 ESA 2005","author":"P. Sanders","year":"2005","unstructured":"Sanders, P., Schultes, D.: Highway hierarchies hasten exact shortest path queries. In: Brodal, G.S., Leonardi, S. (eds.) ESA 2005. LNCS, vol.\u00a03669, pp. 568\u2013579. Springer, Heidelberg (2005)"}],"container-title":["Lecture Notes in Computer Science","Experimental Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-07959-2_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,26]],"date-time":"2019-05-26T21:31:43Z","timestamp":1558906303000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-07959-2_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319079585","9783319079592"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-07959-2_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}