{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,9]],"date-time":"2025-10-09T06:24:37Z","timestamp":1759991077594,"version":"3.40.3"},"publisher-location":"Cham","reference-count":10,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031099922"},{"type":"electronic","value":"9783031099939"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-09993-9_16","type":"book-chapter","created":{"date-parts":[[2022,6,24]],"date-time":"2022-06-24T20:12:42Z","timestamp":1656101562000},"page":"283-301","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Foremost Non-stop Journey Arrival in\u00a0Linear Time"],"prefix":"10.1007","author":[{"given":"Juan","family":"Villacis-Llobet","sequence":"first","affiliation":[]},{"given":"Binh-Minh","family":"Bui-Xuan","sequence":"additional","affiliation":[]},{"given":"Maria","family":"Potop-Butucaru","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,6,25]]},"reference":[{"issue":"2","key":"16_CR1","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1142\/S0129054103001728","volume":"14","author":"BM Bui-Xuan","year":"2003","unstructured":"Bui-Xuan, B.M., Ferreira, A., Jarry, A.: Computing shortest, fastest, and foremost journeys in dynamic networks. Int. J. Found. Comput. Sci. 14(2), 267\u2013285 (2003)","journal-title":"Int. J. Found. Comput. Sci."},{"issue":"4","key":"16_CR2","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1142\/S0129054115500288","volume":"26","author":"A Casteigts","year":"2015","unstructured":"Casteigts, A., Flocchini, P., Mans, B., Santoro, N.: Shortest, fastest, and foremost broadcast in dynamic networks. Int. J. Found. Comput. Sci. 26(4), 499\u2013522 (2015)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"16_CR3","doi-asserted-by":"publisher","first-page":"2754","DOI":"10.1007\/s00453-021-00831-w","volume":"83","author":"A Casteigts","year":"2021","unstructured":"Casteigts, A., Himmel, A.S., Molter, H., Zschoche, P.: Finding temporal paths under waiting time constraints. Algorithmica 83, 2754\u20132802 (2021)","journal-title":"Algorithmica"},{"key":"16_CR4","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms. The MIT Press, Cambridge(1989)"},{"key":"16_CR5","doi-asserted-by":"crossref","unstructured":"Dibbelt, J., Pajor, T., Strasser, B., Wagner, D.: Connection scan algorithm. ACM J. Exp. Algorithm. 23, 1\u201356 (2018)","DOI":"10.1145\/3274661"},{"key":"16_CR6","unstructured":"Dupuy, M., d\u2019Ambrosio, C., Liberti, L.: Optimal paths on the ocean (2021). https:\/\/hal.archives-ouvertes.fr\/hal-03404586"},{"key":"16_CR7","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1016\/0022-0000(85)90014-5","volume":"30","author":"H Gabow","year":"1985","unstructured":"Gabow, H., Tarjan, R.: A linear-time algorithm for a special case of disjoint set union. J. Comput. Syst. Sci. 30, 209\u2013221 (1985)","journal-title":"J. Comput. Syst. Sci."},{"key":"16_CR8","doi-asserted-by":"crossref","unstructured":"Himmel, A.S., Bentert, M., Nichterlein, A., Niedermeier, R.: Efficient computation of optimal temporal walks under waiting-time constraints. In: 8th International Conference on Complex Networks and Their Applications. SCI, vol. 882, pp. 494\u2013506 (2019)","DOI":"10.1007\/978-3-030-36683-4_40"},{"key":"16_CR9","doi-asserted-by":"publisher","unstructured":"Rymar, M., Molter, H., Nichterlein, A., Niedermeier, R.: Towards Classifying the Polynomial-Time Solvability of Temporal Betweenness Centrality. In: Kowalik, \u0141, Pilipczuk, M., Rz\u0105\u017cewski, P. (eds.) WG 2021. LNCS, vol. 12911, pp. 219\u2013231. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-86838-3_17","DOI":"10.1007\/978-3-030-86838-3_17"},{"key":"16_CR10","doi-asserted-by":"crossref","unstructured":"Saram\u00e4ki, J., Kivel\u00e4, M., Karsai, M.: Weighted temporal event graphs. Temporal Network Theory, pp. 107\u2013128 (2019)","DOI":"10.1007\/978-3-030-23495-9_6"}],"container-title":["Lecture Notes in Computer Science","Structural Information and Communication Complexity"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-09993-9_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,24]],"date-time":"2022-06-24T20:14:38Z","timestamp":1656101678000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-09993-9_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031099922","9783031099939"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-09993-9_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"25 June 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SIROCCO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Colloquium on Structural Information and Communication Complexity","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Paderborn","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 June 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 June 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sirocco2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sirocco2022.cs.uni-paderborn.de\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}