{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,9]],"date-time":"2025-10-09T06:43:00Z","timestamp":1759992180094,"version":"3.40.3"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031442735"},{"type":"electronic","value":"9783031442742"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-44274-2_35","type":"book-chapter","created":{"date-parts":[[2023,9,30]],"date-time":"2023-09-30T01:02:06Z","timestamp":1696035726000},"page":"466-480","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Offline Constrained Backward Time Travel Planning"],"prefix":"10.1007","author":[{"given":"Quentin","family":"Bramas","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jean-Romain","family":"Luttringer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S\u00e9bastien","family":"Tixeuil","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,9,30]]},"reference":[{"issue":"4","key":"35_CR1","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). https:\/\/doi.org\/10.1142\/S0129054115500288","journal-title":"Int. J. Found. Comput. Sci."},{"issue":"5","key":"35_CR2","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1080\/17445760.2012.668546","volume":"27","author":"A Casteigts","year":"2012","unstructured":"Casteigts, A., Flocchini, P., Quattrociocchi, W., Santoro, N.: Time-varying graphs and dynamic networks. Int. J. Parallel Emergent Distrib. Syst. 27(5), 387\u2013408 (2012). https:\/\/doi.org\/10.1080\/17445760.2012.668546","journal-title":"Int. J. Parallel Emergent Distrib. Syst."},{"issue":"9","key":"35_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., Molter, H., Zschoche, P.: Finding temporal paths under waiting time constraints. Algorithmica 83(9), 2754\u20132802 (2021). https:\/\/doi.org\/10.1007\/s00453-021-00831-w","journal-title":"Algorithmica"},{"key":"35_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.jcss.2021.04.004","volume":"121","author":"A Casteigts","year":"2021","unstructured":"Casteigts, A., Peters, J.G., Schoeters, J.: Temporal cliques admit sparse spanners. J. Comput. Syst. Sci. 121, 1\u201317 (2021). https:\/\/doi.org\/10.1016\/j.jcss.2021.04.004","journal-title":"J. Comput. Syst. Sci."},{"key":"35_CR5","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1109\/65.752646","volume":"12","author":"S Chen","year":"1998","unstructured":"Chen, S., Nahrstedt, K.: An overview of QoS routing for the next generation high-speed networks: problems and solutions. IEEE Netw. 12, 64\u201379 (1998). https:\/\/doi.org\/10.1109\/65.752646","journal-title":"IEEE Netw."},{"key":"35_CR6","unstructured":"Ferreira, A.: On models and algorithms for dynamic communication networks: the case for evolving graphs. In: Quatri\u00e8mes Rencontres Francophones sur les Aspects Algorithmiques des T\u00e9l\u00e9communications (ALGOTEL 2002), M\u00e8ze, France, pp. 155\u2013161. INRIA Press (2002)"},{"key":"35_CR7","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., San Francisco (1990)"},{"issue":"17","key":"35_CR8","doi-asserted-by":"publisher","first-page":"3081","DOI":"10.1016\/j.comnet.2010.05.017","volume":"54","author":"RG Garroppo","year":"2010","unstructured":"Garroppo, R.G., Giordano, S., Tavanti, L.: A survey on multi-constrained optimal path computation: exact and approximate algorithms. Comput. Netw. 54(17), 3081\u20133107 (2010). https:\/\/doi.org\/10.1016\/j.comnet.2010.05.017","journal-title":"Comput. Netw."},{"issue":"1","key":"35_CR9","doi-asserted-by":"publisher","first-page":"388","DOI":"10.1109\/COMST.2017.2749760","volume":"20","author":"JW Guck","year":"2018","unstructured":"Guck, J.W., Van Bemten, A., Reisslein, M., Kellerer, W.: Unicast QoS routing algorithms for SDN: a comprehensive survey and performance evaluation. IEEE Commun. Surv. Tutor. 20(1), 388\u2013415 (2018). https:\/\/doi.org\/10.1109\/COMST.2017.2749760","journal-title":"IEEE Commun. Surv. Tutor."},{"key":"35_CR10","doi-asserted-by":"publisher","unstructured":"Luna, G.A.D., Flocchini, P., Prencipe, G., Santoro, N.: Black hole search in dynamic rings. In: 41st IEEE International Conference on Distributed Computing Systems, ICDCS 2021, Washington DC, USA, 7\u201310 July 2021, pp. 987\u2013997. IEEE (2021). https:\/\/doi.org\/10.1109\/ICDCS51616.2021.00098","DOI":"10.1109\/ICDCS51616.2021.00098"},{"key":"35_CR11","unstructured":"Pal, G.: The time machine (1960)"},{"key":"35_CR12","unstructured":"Russo, A., Russo, J.: Avengers: Endgame (2019)"},{"key":"35_CR13","doi-asserted-by":"crossref","unstructured":"Thulasiraman, K., Arumugam, S., Brandst\u00e4dt, A., Nishizeki, T.: Handbook of Graph Theory, Combinatorial Optimization, and Algorithms (2016)","DOI":"10.1201\/b19163"},{"key":"35_CR14","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1007\/978-3-031-09993-9_16","volume-title":"Structural Information and Communication Complexity, SIROCCO 2022","author":"J Villacis-Llobet","year":"2022","unstructured":"Villacis-Llobet, J., Bui-Xuan, B.M., Potop-Butucaru, M.: Foremost non-stop journey arrival in linear time. In: Parter, M. (ed.) SIROCCO 2022. LNCS, vol. 13298, pp. 283\u2013301. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-09993-9_16"},{"issue":"7","key":"35_CR15","doi-asserted-by":"publisher","first-page":"1228","DOI":"10.1109\/49.536364","volume":"14","author":"Z Wang","year":"1996","unstructured":"Wang, Z., Crowcroft, J.: Quality-of-service routing for supporting multimedia applications. IEEE J. Sel. Areas Commun. 14(7), 1228\u20131234 (1996). https:\/\/doi.org\/10.1109\/49.536364","journal-title":"IEEE J. Sel. Areas Commun."},{"key":"35_CR16","unstructured":"Zemeckis, R.: Back to the future (1985)"}],"container-title":["Lecture Notes in Computer Science","Stabilization, Safety, and Security of Distributed Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-44274-2_35","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,8]],"date-time":"2024-03-08T01:06:06Z","timestamp":1709859966000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-44274-2_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031442735","9783031442742"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-44274-2_35","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"30 September 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SSS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Stabilizing, Safety, and Security of Distributed Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Jersey City, NJ","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 October 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 October 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sss2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.cs.bgu.ac.il\/~SSS2023","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"78","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"32","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"8","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"41% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"5","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4 invited papers","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}