{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,12]],"date-time":"2025-11-12T00:40:51Z","timestamp":1762908051435,"version":"3.45.0"},"publisher-location":"Cham","reference-count":35,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031929342"},{"type":"electronic","value":"9783031929359"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"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":[[2025]]},"DOI":"10.1007\/978-3-031-92935-9_6","type":"book-chapter","created":{"date-parts":[[2025,5,17]],"date-time":"2025-05-17T04:07:17Z","timestamp":1747454837000},"page":"87-103","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Disjoint Temporal Walks Under Waiting Time Constraints"],"prefix":"10.1007","author":[{"given":"Allen","family":"Ibiapina","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Raul","family":"Lopes","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrea","family":"Marino","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ana","family":"Silva","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,5,18]]},"reference":[{"issue":"1","key":"6_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s41109-020-00311-0","volume":"5","author":"M Bentert","year":"2020","unstructured":"Bentert, M., Himmel, A.-S., Nichterlein, A., Niedermeier, R.: Efficient computation of optimal temporal walks under waiting-time constraints. Appl. Netw. Sci. 5(1), 1\u201326 (2020). https:\/\/doi.org\/10.1007\/s41109-020-00311-0","journal-title":"Appl. Netw. Sci."},{"issue":"3","key":"6_CR2","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1002\/(SICI)1097-0037(199610)28:3<125::AID-NET1>3.0.CO;2-P","volume":"28","author":"KA Berman","year":"1996","unstructured":"Berman, K.A.: Vulnerability of scheduled networks and a generalization of Menger\u2019s Theorem. Netw.: Int. J. 28(3), 125\u2013134 (1996)","journal-title":"Netw.: Int. J."},{"key":"6_CR3","unstructured":"Brunelli, F.: Algorithmic aspects of reachability in temporal graphs. (Aspects algorithmiques de l\u2019atteignabilit\u00e9 dans les graphes). Ph.D. thesis, Paris Cit\u00e9 University, France (2023)"},{"key":"6_CR4","unstructured":"Brunelli, F., Viennot, L.: Minimum-cost temporal walks under waiting-time constraints in linear time. CoRR abs\/2211.12136 (2022)"},{"key":"6_CR5","unstructured":"Brunelli, F., Viennot, L.: Computing temporal reachability under waiting-time constraints in linear time. In: 2nd Symposium on Algorithmic Foundations of Dynamic Networks, SAND 2023. LIPIcs, vol.\u00a0257, pp. 4:1\u20134:11 (2023)"},{"key":"6_CR6","unstructured":"Casteigts, A., Corsini, T., Hocquard, H., Labourel, A.: Robustness of distances and diameter in a fragile network. In: 1st Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2022). Leibniz International Proceedings in Informatics (LIPIcs), vol.\u00a0221, pp. 9:1\u20139:16 (2022)"},{"key":"6_CR7","unstructured":"Casteigts, A., Himmel, A., Molter, H., Zschoche, P.: Finding temporal paths under waiting time constraints. In: 31st International Symposium on Algorithms and Computation, ISAAC 2020. LIPIcs, vol.\u00a0181, pp. 30:1\u201330:18 (2020)"},{"issue":"9","key":"6_CR8","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)","journal-title":"Algorithmica"},{"key":"6_CR9","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-21275-3","volume-title":"Parameterized Algorithms","author":"M Cygan","year":"2015","unstructured":"Cygan, M., Fomin, F.V., Kowalik, L., Lokshtanov, D., Marx, D.: Parameterized Algorithms. Springer, Cham (2015)"},{"key":"6_CR10","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1016\/j.dam.2020.12.010","volume":"292","author":"A Darmann","year":"2021","unstructured":"Darmann, A., D\u00f6cker, J.: On simplified np-complete variants of monotone 3-sat. Discret. Appl. Math. 292, 45\u201358 (2021)","journal-title":"Discret. Appl. Math."},{"key":"6_CR11","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1016\/0304-3975(80)90009-2","volume":"10","author":"S Fortune","year":"1980","unstructured":"Fortune, S., Hopcroft, J.E., Wyllie, J.: The directed subgraph homeomorphism problem. Theoret. Comput. Sci. 10, 111\u2013121 (1980)","journal-title":"Theoret. Comput. Sci."},{"key":"6_CR12","unstructured":"F\u00fcchsle, E., Molter, H., Niedermeier, R., Renken, M.: Delay-robust routes in temporal graphs. In: 39th International Symposium on Theoretical Aspects of Computer Science, STACS 2022. LIPIcs, vol.\u00a0219, pp. 30:1\u201330:15 (2022)"},{"key":"6_CR13","unstructured":"F\u00fcchsle, E., Molter, H., Niedermeier, R., Renken, M.: Temporal connectivity: coping with foreseen and unforeseen delays. In: 1st Symposium on Algorithmic Foundations of Dynamic Networks, SAND 2022. LIPIcs, vol.\u00a0221, pp. 17:1\u201317:17 (2022)"},{"issue":"9","key":"6_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1140\/epjb\/e2015-60657-4","volume":"88","author":"P Holme","year":"2015","unstructured":"Holme, P.: Modern temporal network theory: a colloquium. Eur. Phys. J. B 88(9), 1\u201330 (2015). https:\/\/doi.org\/10.1140\/epjb\/e2015-60657-4","journal-title":"Eur. Phys. J. B"},{"key":"6_CR15","unstructured":"Ibiapina, A., Lopes, R., Marino, A., Silva, A.: Menger\u2019s theorem for temporal paths (not walks). CoRR abs\/2206.15251 (2022)"},{"key":"6_CR16","doi-asserted-by":"crossref","unstructured":"Ibiapina, A., Silva, A.: Snapshot disjointness in temporal graphs. arXiv preprint arXiv:2302.06653 (2023)","DOI":"10.1016\/j.tcs.2024.114690"},{"key":"6_CR17","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2023.103467","volume":"139","author":"A Ibiapina","year":"2024","unstructured":"Ibiapina, A., Silva, A.: Mengerian graphs: characterization and recognition. J. Comput. Syst. Sci. 139, 103467 (2024)","journal-title":"J. Comput. Syst. Sci."},{"issue":"1","key":"6_CR18","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1002\/net.1975.5.1.45","volume":"5","author":"RM Karp","year":"1975","unstructured":"Karp, R.M.: On the computational complexity of combinatorial problems. Networks 5(1), 45\u201368 (1975)","journal-title":"Networks"},{"key":"6_CR19","doi-asserted-by":"publisher","first-page":"820","DOI":"10.1006\/jcss.2002.1829","volume":"64","author":"D Kempe","year":"2002","unstructured":"Kempe, D., Kleinberg, J., Kumar, A.: Connectivity and inference problems for temporal networks. J. Comput. Syst. Sci. 64, 820\u2013842 (2002)","journal-title":"J. Comput. Syst. Sci."},{"issue":"1","key":"6_CR20","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10458-022-09583-5","volume":"37","author":"N Klobas","year":"2023","unstructured":"Klobas, N., Mertzios, G.B., Molter, H., Niedermeier, R., Zschoche, P.: Interference-free walks in time: temporally disjoint paths. Auton. Agents Multi Agent Syst. 37(1), 1 (2023)","journal-title":"Auton. Agents Multi Agent Syst."},{"key":"6_CR21","doi-asserted-by":"crossref","unstructured":"Kunz, P., Molter, H., Zehavi, M.: In which graph structures can we efficiently find temporally disjoint paths and walks? In: IJCAI, pp. 180\u2013188. ijcai.org (2023)","DOI":"10.24963\/ijcai.2023\/21"},{"issue":"1","key":"6_CR22","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s13278-018-0537-7","volume":"8","author":"M Latapy","year":"2018","unstructured":"Latapy, M., Viard, T., Magnien, C.: Stream graphs and link streams for the modeling of interactions over time. Soc. Netw. Anal. Min. 8(1), 1\u201329 (2018). https:\/\/doi.org\/10.1007\/s13278-018-0537-7","journal-title":"Soc. Netw. Anal. Min."},{"key":"6_CR23","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.jcss.2023.01.004","volume":"135","author":"N Maack","year":"2023","unstructured":"Maack, N., Molter, H., Niedermeier, R., Renken, M.: On finding separators in temporal split and permutation graphs. J. Comput. Syst. Sci. 135, 1\u201314 (2023)","journal-title":"J. Comput. Syst. Sci."},{"key":"6_CR24","unstructured":"Marino, A., Silva, A.: Paths and Connectivity in Temporal Graphs. Editora do IMPA, 1 edn. (2023)"},{"issue":"1","key":"6_CR25","doi-asserted-by":"publisher","first-page":"96","DOI":"10.4064\/fm-10-1-96-115","volume":"10","author":"K Menger","year":"1927","unstructured":"Menger, K.: Zur allgemeinen kurventheorie. Fundam. Math. 10(1), 96\u2013115 (1927)","journal-title":"Fundam. Math."},{"issue":"4","key":"6_CR26","doi-asserted-by":"publisher","first-page":"1416","DOI":"10.1007\/s00453-018-0478-6","volume":"81","author":"GB Mertzios","year":"2019","unstructured":"Mertzios, G.B., Michail, O., Spirakis, P.G.: Temporal network optimization subject to connectivity constraints. Algorithmica 81(4), 1416\u20131449 (2019)","journal-title":"Algorithmica"},{"issue":"4","key":"6_CR27","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1080\/15427951.2016.1177801","volume":"12","author":"O Michail","year":"2016","unstructured":"Michail, O.: An introduction to temporal graphs: an algorithmic perspective. Internet Math. 12(4), 239\u2013280 (2016)","journal-title":"Internet Math."},{"key":"6_CR28","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2021.106229","volume":"175","author":"H Molter","year":"2022","unstructured":"Molter, H.: The complexity of finding temporal separators under waiting time constraints. Inf. Process. Lett. 175, 106229 (2022)","journal-title":"Inf. Process. Lett."},{"key":"6_CR29","doi-asserted-by":"crossref","unstructured":"Nicosia, V., Tang, J., Mascolo, C., Musolesi, M., Russo, G., Latora, V.: Graph metrics for temporal networks. In: Temporal networks, pp. 15\u201340. Springer (2013)","DOI":"10.1007\/978-3-642-36461-7_2"},{"key":"6_CR30","doi-asserted-by":"crossref","unstructured":"Robertson, N., Seymour, P.D.: Graph minors. XIII. The disjoint paths problem. J. Comb. Theory, Ser. B 63(1), 65\u2013110 (1995)","DOI":"10.1006\/jctb.1995.1006"},{"key":"6_CR31","doi-asserted-by":"crossref","unstructured":"Stern, R.: Multi-agent path finding\u2013an overview. In: Artificial Intelligence: 5th RAAI Summer School, Dolgoprudny, Russia, July 4\u20137, 2019, Tutorial Lectures, pp. 96\u2013115 (2019)","DOI":"10.1007\/978-3-030-33274-7_6"},{"key":"6_CR32","unstructured":"Stern, R., et\u00a0al.: Multi-agent pathfinding: definitions, variants, and benchmarks. In: Twelfth Annual Symposium on Combinatorial Search (2019)"},{"key":"6_CR33","unstructured":"Thejaswi, S., Gionis, A.: Restless reachability in temporal graphs. CoRR abs\/2010.08423 (2020)"},{"key":"6_CR34","unstructured":"Zschoche, P.: Restless temporal path parameterized above lower bounds. In: 40th International Symposium on Theoretical Aspects of Computer Science, STACS 2023. LIPIcs, vol.\u00a0254, pp. 55:1\u201355:16 (2023)"},{"key":"6_CR35","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1016\/j.jcss.2019.07.006","volume":"107","author":"P Zschoche","year":"2020","unstructured":"Zschoche, P., Fluschnik, T., Molter, H., Niedermeier, R.: The complexity of finding small separators in temporal graphs. J. Comput. Syst. Sci. 107, 72\u201392 (2020)","journal-title":"J. Comput. Syst. Sci."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Complexity"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-92935-9_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,12]],"date-time":"2025-11-12T00:37:21Z","timestamp":1762907841000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-92935-9_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031929342","9783031929359"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-92935-9_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"18 May 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CIAC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Algorithms and Complexity","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Rome","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 June 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 June 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ciac2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/easyconferences.eu\/ciac2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}