{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T09:02:21Z","timestamp":1743152541858,"version":"3.40.3"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030242886"},{"type":"electronic","value":"9783030242893"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-24289-3_9","type":"book-chapter","created":{"date-parts":[[2019,6,28]],"date-time":"2019-06-28T11:03:03Z","timestamp":1561719783000},"page":"103-117","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Dynamic Public Transit Labeling"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7833-9520","authenticated-orcid":false,"given":"Mattia","family":"D\u2019Emidio","sequence":"first","affiliation":[]},{"given":"Imran","family":"Khan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,6,29]]},"reference":[{"doi-asserted-by":"crossref","unstructured":"Akiba, T., Iwata, Y., Yoshida, Y.: Dynamic and historical shortest-path distance queries on large evolving networks by pruned landmark labeling. In: Proceedings of 23rd International World Wide Web Conference (WWW 14), pp. 237\u2013248. ACM (2014)","key":"9_CR1","DOI":"10.1145\/2566486.2568007"},{"key":"9_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/978-3-319-49487-6_2","volume-title":"Algorithm Engineering","author":"H Bast","year":"2016","unstructured":"Bast, H., et al.: Route planning in transportation networks. In: Kliemann, L., Sanders, P. (eds.) Algorithm Engineering. LNCS, vol. 9220, pp. 19\u201380. Springer, Cham (2016). \n                      https:\/\/doi.org\/10.1007\/978-3-319-49487-6_2"},{"doi-asserted-by":"crossref","unstructured":"Cheng, J., Huang, S., Wu, H., Fu, A.W.C.: Tf-label: a topological-folding labeling scheme for reachability querying in a large graph. In: Proceedings of 2013 ACM SIGMOD International Conference on Management of Data (SIGMOD 2013), pp. 193\u2013204. ACM (2013)","key":"9_CR3","DOI":"10.1145\/2463676.2465286"},{"unstructured":"Cicerone, S., D\u2019Emidio, M., Frigioni, D.: On mining distances in large-scale dynamic graphs. In: Aldini, A., Bernardo, M., (eds.) Proceedings of the 19th Italian Conference on Theoretical Computer Science, Urbino, Italy. CEUR Workshop Proceedings, vol. 2243, pp. 77\u201381. CEUR-WS.org, 18\u201320 September 2018. \n                      http:\/\/ceur-ws.org\/Vol-2243\/paper6.pdf","key":"9_CR4"},{"unstructured":"Cionini, A., D\u2019Angelo, G., D\u2019Emidio, M., Frigioni, D., Giannakopoulou, K., Paraskevopoulos, A., Zaroliagis, C.D.: Engineering graph-based models for dynamic timetable information systems. In: Proceedings of 14th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS14) (2014)","key":"9_CR5"},{"key":"9_CR6","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1016\/j.jda.2017.09.001","volume":"46\u201347","author":"A Cionini","year":"2017","unstructured":"Cionini, A., D\u2019Angelo, G., D\u2019Emidio, M., Frigioni, D., Giannakopoulou, K., Paraskevopoulos, A., Zaroliagis, C.D.: Engineering graph-based models for dynamic timetable information systems. J. Discrete Algorithms 46\u201347, 40\u201358 (2017)","journal-title":"J. Discrete Algorithms"},{"issue":"5","key":"9_CR7","doi-asserted-by":"publisher","first-page":"1338","DOI":"10.1137\/S0097539702403098","volume":"32","author":"E Cohen","year":"2003","unstructured":"Cohen, E., Halperin, E., Kaplan, H., Zwick, U.: Reachability and distance queries via 2-hop labels. SIAM J. Comput. 32(5), 1338\u20131355 (2003)","journal-title":"SIAM J. Comput."},{"key":"9_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/978-3-319-44543-4_9","volume-title":"Combinatorial Algorithms","author":"G D\u2019Angelo","year":"2016","unstructured":"D\u2019Angelo, G., D\u2019Emidio, M., Frigioni, D.: Distance queries in large-scale fully dynamic complex networks. In: M\u00e4kinen, V., Puglisi, S.J., Salmela, L. (eds.) IWOCA 2016. LNCS, vol. 9843, pp. 109\u2013121. Springer, Cham (2016). \n                      https:\/\/doi.org\/10.1007\/978-3-319-44543-4_9"},{"issue":"3","key":"9_CR9","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1002\/net.21542","volume":"63","author":"Gianlorenzo D'Angelo","year":"2014","unstructured":"D\u2019Angelo, G., D\u2019Emidio, M., Frigioni, D.: Fully dynamic update of arc-flags. Networks 63(3), 243\u2013259 (2014). \n                      https:\/\/doi.org\/10.1002\/net.21542","journal-title":"Networks"},{"issue":"1","key":"9_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3299901","volume":"24","author":"Gianlorenzo D'angelo","year":"2019","unstructured":"D\u2019Angelo, G., D\u2019Emidio, M., Frigioni, D.: Fully dynamic 2-hop cover labeling. ACM J. Exp. Algorithmics 24(1), 1.6:1\u20131.6:36 (2019). \n                      https:\/\/doi.org\/10.1145\/3299901","journal-title":"Journal of Experimental Algorithmics"},{"key":"9_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1007\/978-3-319-20086-6_21","volume-title":"Experimental Algorithms","author":"D Delling","year":"2015","unstructured":"Delling, D., Dibbelt, J., Pajor, T., Werneck, R.F.: Public transit labeling. In: Bampis, E. (ed.) SEA 2015. LNCS, vol. 9125, pp. 273\u2013285. Springer, Cham (2015). \n                      https:\/\/doi.org\/10.1007\/978-3-319-20086-6_21"},{"issue":"2","key":"9_CR12","doi-asserted-by":"publisher","first-page":"566","DOI":"10.1287\/trsc.2014.0579","volume":"51","author":"D Delling","year":"2017","unstructured":"Delling, D., Goldberg, A.V., Pajor, T., Werneck, R.F.: Customizable route planning in road networks. Transp. Sci. 51(2), 566\u2013591 (2017). \n                      https:\/\/doi.org\/10.1287\/trsc.2014.0579","journal-title":"Transp. Sci."},{"issue":"3","key":"9_CR13","doi-asserted-by":"publisher","first-page":"591","DOI":"10.1287\/trsc.2014.0534","volume":"49","author":"D Delling","year":"2015","unstructured":"Delling, D., Pajor, T., Werneck, R.F.: Round-based public transit routing. Transp. Sci. 49(3), 591\u2013604 (2015)","journal-title":"Transp. Sci."},{"issue":"1","key":"9_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3274661","volume":"23","author":"Julian Dibbelt","year":"2018","unstructured":"Dibbelt, J., Pajor, T., Strasser, B., Wagner, D.: Connection scan algorithm. ACM J. Exp. Algorithmics 23, 1.7:1\u20131.7:56 (2018)","journal-title":"Journal of Experimental Algorithmics"},{"key":"9_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1227161.1227166","volume":"12","author":"Evangelia Pyrga","year":"2008","unstructured":"Pyrga, E., Schulz, F., Wagner, D., Zaroliagis, C.: Efficient models for timetable information in public transportation systems. ACM J. Exp. Algorithmics 12(2.4), 1\u201339 (2008)","journal-title":"Journal of Experimental Algorithmics"},{"issue":"5","key":"9_CR16","doi-asserted-by":"publisher","first-page":"915","DOI":"10.1007\/s11280-016-0421-1","volume":"20","author":"Y Qin","year":"2017","unstructured":"Qin, Y., Sheng, Q.Z., Falkner, N.J.G., Yao, L., Parkinson, S.: Efficient computation of distance labeling for decremental updates in large dynamic graphs. World Wide Web 20(5), 915\u2013937 (2017)","journal-title":"World Wide Web"},{"doi-asserted-by":"crossref","unstructured":"Wang, S., Lin, W., Yang, Y., Xiao, X., Zhou, S.: Efficient route planning on public transportation networks: a labelling approach. In: Proceedings of 2015 ACM International Conference on Management of Data (SIGMOD 2015), pp. 967\u2013982. ACM (2015)","key":"9_CR17","DOI":"10.1145\/2723372.2749456"},{"doi-asserted-by":"crossref","unstructured":"Yano, Y., Akiba, T., Iwata, Y., Yoshida, Y.: Fast and scalable reachability queries on graphs by pruned labeling with landmarks and paths. In: Proceedings of 22nd ACM International Conference on Information & Knowledge Management (CIKM 2013), pp. 1601\u20131606. ACM (2013)","key":"9_CR18","DOI":"10.1145\/2505515.2505724"},{"doi-asserted-by":"crossref","unstructured":"Zhu, A.D., Lin, W., Wang, S., Xiao, X.: Reachability queries on large dynamic graphs: a total order approach. In: Proceedings of 2014 ACM SIGMOD International Conference on Management of Data (SIGMOD 2014), pp. 1323\u20131334. ACM (2014)","key":"9_CR19","DOI":"10.1145\/2588555.2612181"}],"container-title":["Lecture Notes in Computer Science","Computational Science and Its Applications \u2013 ICCSA 2019"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-24289-3_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,28]],"date-time":"2019-06-28T15:21:16Z","timestamp":1561735276000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-24289-3_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030242886","9783030242893"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-24289-3_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"29 June 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICCSA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Computational Science and Its Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Saint Petersburg","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Russia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 July 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 July 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iccsa2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.iccsa.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}