{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,14]],"date-time":"2026-06-14T18:55:06Z","timestamp":1781463306126,"version":"3.54.1"},"reference-count":39,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100001659","name":"German Research Foundation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000781","name":"European Research Council","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100000781","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003977","name":"Israel Science Foundation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100003977","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000781","name":"European Research Council","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100000781","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2026,10]]},"DOI":"10.1016\/j.dam.2026.04.048","type":"journal-article","created":{"date-parts":[[2026,5,18]],"date-time":"2026-05-18T10:48:32Z","timestamp":1779101312000},"page":"258-276","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Temporal connectivity: Coping with foreseen and unforeseen delays"],"prefix":"10.1016","volume":"391","author":[{"given":"Eugen","family":"F\u00fcchsle","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Hendrik","family":"Molter","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Rolf","family":"Niedermeier","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Malte","family":"Renken","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/j.dam.2026.04.048_b1","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1016\/j.jcss.2019.02.003","article-title":"Temporal flows in temporal networks","volume":"103","author":"Akrida","year":"2019","journal-title":"J. Comput. Syst. Sci."},{"key":"10.1016\/j.dam.2026.04.048_b2","series-title":"Computational Complexity: A Modern Approach","author":"Arora","year":"2009"},{"key":"10.1016\/j.dam.2026.04.048_b3","doi-asserted-by":"crossref","DOI":"10.1016\/j.tcs.2024.114757","article-title":"Temporally connected components","volume":"1013","author":"Balev","year":"2024","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/j.dam.2026.04.048_b4","series-title":"Canadian traveller problems in temporal graphs","author":"Bellitto","year":"2024"},{"issue":"1","key":"10.1016\/j.dam.2026.04.048_b5","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1007\/s41109-020-00311-0","article-title":"Efficient computation of optimal temporal walks under waiting-time constraints","volume":"5","author":"Bentert","year":"2020","journal-title":"Appl. Netw. Sci."},{"issue":"3","key":"10.1016\/j.dam.2026.04.048_b6","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1002\/(SICI)1097-0037(199610)28:3<125::AID-NET1>3.0.CO;2-P","article-title":"Vulnerability of scheduled networks and a generalization of Menger\u2019s theorem","volume":"28","author":"Berman","year":"1996","journal-title":"Networks"},{"issue":"02","key":"10.1016\/j.dam.2026.04.048_b7","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1142\/S0129054103001728","article-title":"Computing shortest, fastest, and foremost journeys in dynamic networks","volume":"14","author":"Bui-Xuan","year":"2003","journal-title":"Int. J. Found Cs"},{"issue":"2","key":"10.1016\/j.dam.2026.04.048_b8","doi-asserted-by":"crossref","first-page":"160","DOI":"10.1017\/nws.2024.5","article-title":"Algorithmic aspects of temporal betweenness","volume":"12","author":"Bu\u00df","year":"2024","journal-title":"Netw. Sci."},{"issue":"5","key":"10.1016\/j.dam.2026.04.048_b9","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1080\/17445760.2012.668546","article-title":"Time-varying graphs and dynamic networks","volume":"27","author":"Casteigts","year":"2012","journal-title":"Int. J. Parallel Emergent"},{"issue":"9","key":"10.1016\/j.dam.2026.04.048_b10","doi-asserted-by":"crossref","first-page":"2754","DOI":"10.1007\/s00453-021-00831-w","article-title":"Finding temporal paths under waiting time constraints","volume":"83","author":"Casteigts","year":"2021","journal-title":"Algorithmica"},{"key":"10.1016\/j.dam.2026.04.048_b11","series-title":"Proceedings of the 49th International Symposium on Mathematical Foundations of Computer Science (MFCS)","first-page":"38:1","article-title":"Algorithms and complexity for path covers of temporal DAGs","volume":"Vol. 306","author":"Chakraborty","year":"2024"},{"issue":"3","key":"10.1016\/j.dam.2026.04.048_b12","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3728631","article-title":"Maximum flow and minimum-cost flow in almost-linear time","volume":"72","author":"Chen","year":"2025","journal-title":"J. ACM"},{"issue":"Part B","key":"10.1016\/j.dam.2026.04.048_b13","article-title":"Optimizing reachability sets in temporal graphs by delaying","volume":"285","author":"Deligkas","year":"2022","journal-title":"Inform. and Comput."},{"issue":"4","key":"10.1016\/j.dam.2026.04.048_b14","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1109\/TIT.1956.1056816","article-title":"A note on the maximum flow through a network","volume":"2","author":"Elias","year":"1956","journal-title":"IRE Trans. Inf. Theory"},{"key":"10.1016\/j.dam.2026.04.048_b15","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1016\/j.jcss.2021.01.007","article-title":"Deleting edges to restrict the size of an epidemic in temporal networks","volume":"119","author":"Enright","year":"2021","journal-title":"J. Comput. Syst. Sci."},{"issue":"5","key":"10.1016\/j.dam.2026.04.048_b16","doi-asserted-by":"crossref","first-page":"736","DOI":"10.1007\/s00453-025-01301-3","article-title":"Counting temporal paths","volume":"87","author":"Enright","year":"2025","journal-title":"Algorithmica"},{"key":"10.1016\/j.dam.2026.04.048_b17","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1016\/j.jcss.2020.08.001","article-title":"Assigning times to minimise reachability in temporal graphs","volume":"115","author":"Enright","year":"2021","journal-title":"J. Comput. Syst. Sci."},{"key":"10.1016\/j.dam.2026.04.048_b18","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.jcss.2021.01.005","article-title":"On temporal graph exploration","volume":"119","author":"Erlebach","year":"2021","journal-title":"J. Comput. Syst. Sci."},{"key":"10.1016\/j.dam.2026.04.048_b19","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1016\/j.tcs.2019.03.031","article-title":"Temporal graph classes: A view through temporal separators","volume":"806","author":"Fluschnik","year":"2020","journal-title":"Tcs"},{"key":"10.1016\/j.dam.2026.04.048_b20","doi-asserted-by":"crossref","first-page":"399","DOI":"10.4153\/CJM-1956-045-5","article-title":"Maximal flow through a network","volume":"8","author":"Ford","year":"1956","journal-title":"Can. Math."},{"issue":"3","key":"10.1016\/j.dam.2026.04.048_b21","doi-asserted-by":"crossref","first-page":"419","DOI":"10.1287\/opre.6.3.419","article-title":"Constructing maximal dynamic flows from static flows","volume":"6","author":"Ford\u00a0Jr.","year":"1958","journal-title":"Oper. Res."},{"key":"10.1016\/j.dam.2026.04.048_b22","series-title":"Proceedings of the 39th International Symposium on Theoretical Aspects of Computer Science","first-page":"30:1","article-title":"Delay-robust routes in temporal graphs","volume":"Vol. 219","author":"F\u00fcchsle","year":"2022"},{"key":"10.1016\/j.dam.2026.04.048_b23","series-title":"Proceedings of the 1st Symposium on Algorithmic Foundations of Dynamic Networks (SAND)","first-page":"17:1","article-title":"Temporal connectivity: Coping with foreseen and unforeseen delays","volume":"Vol. 221","author":"F\u00fcchsle","year":"2022"},{"issue":"9","key":"10.1016\/j.dam.2026.04.048_b24","doi-asserted-by":"crossref","first-page":"234","DOI":"10.1140\/epjb\/e2015-60657-4","article-title":"Modern temporal network theory: a colloquium","volume":"88","author":"Holme","year":"2015","journal-title":"Eur. Phys. J. B"},{"key":"10.1016\/j.dam.2026.04.048_b25","series-title":"Temporal Network Theory","year":"2019"},{"issue":"4","key":"10.1016\/j.dam.2026.04.048_b26","doi-asserted-by":"crossref","first-page":"820","DOI":"10.1006\/jcss.2002.1829","article-title":"Connectivity and inference problems for temporal networks","volume":"64","author":"Kempe","year":"2002","journal-title":"J. Comput. Syst. Sci."},{"issue":"1","key":"10.1016\/j.dam.2026.04.048_b27","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10458-022-09583-5","article-title":"Interference-free walks in time: temporally disjoint paths","volume":"37","author":"Klobas","year":"2023","journal-title":"Auton. Agents Multi-Agent Syst."},{"key":"10.1016\/j.dam.2026.04.048_b28","series-title":"Proceedings of the 32nd International Joint Conference on Artificial Intelligence (IJCAI)","first-page":"180","article-title":"In which graph structures can we efficiently find temporally disjoint paths and walks?","author":"Kunz","year":"2023"},{"key":"10.1016\/j.dam.2026.04.048_b29","series-title":"Proceedings of the 4th Symposium on Algorithmic Foundations of Dynamic Networks (SAND)","first-page":"7:1","article-title":"Better late, then? The hardness of choosing delays to meet passenger demands in temporal graphs","volume":"Vol. 330","author":"Kutner","year":"2025"},{"issue":"1","key":"10.1016\/j.dam.2026.04.048_b30","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1007\/s13278-018-0537-7","article-title":"Stream graphs and link streams for the modeling of interactions over time","volume":"8","author":"Latapy","year":"2018","journal-title":"Soc. Netw. Anal. Mining"},{"issue":"4","key":"10.1016\/j.dam.2026.04.048_b31","doi-asserted-by":"crossref","first-page":"701","DOI":"10.1007\/s10878-013-9614-z","article-title":"Generalized Canadian traveller problems","volume":"29","author":"Liao","year":"2015","journal-title":"J. Comb. Optim."},{"issue":"4","key":"10.1016\/j.dam.2026.04.048_b32","doi-asserted-by":"crossref","first-page":"1416","DOI":"10.1007\/s00453-018-0478-6","article-title":"Temporal network optimization subject to connectivity constraints","volume":"81","author":"Mertzios","year":"2019","journal-title":"Algorithmica"},{"key":"10.1016\/j.dam.2026.04.048_b33","doi-asserted-by":"crossref","DOI":"10.1016\/j.jcss.2024.103549","article-title":"Temporal reachability minimization: Delaying vs. deleting","volume":"144","author":"Molter","year":"2024","journal-title":"J. Comput. System Sci."},{"issue":"1","key":"10.1016\/j.dam.2026.04.048_b34","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1016\/0304-3975(91)90263-2","article-title":"Shortest paths without a map","volume":"84","author":"Papadimitriou","year":"1991","journal-title":"Theoret. Comput. Sci."},{"issue":"1","key":"10.1016\/j.dam.2026.04.048_b35","first-page":"1","article-title":"Computation and analysis of temporal betweenness in a knowledge mobilization network","volume":"4","author":"Rad","year":"2017","journal-title":"Comp. Soc. Net."},{"issue":"3","key":"10.1016\/j.dam.2026.04.048_b36","doi-asserted-by":"crossref","first-page":"173","DOI":"10.7155\/jgaa.00619","article-title":"Towards classifying the polynomial-time solvability of temporal betweenness centrality","volume":"27","author":"Rymar","year":"2023","journal-title":"J. Graph Algorithms Appl."},{"key":"10.1016\/j.dam.2026.04.048_b37","series-title":"Combinatorial Game Theory","author":"Siegel","year":"2013"},{"issue":"11","key":"10.1016\/j.dam.2026.04.048_b38","doi-asserted-by":"crossref","first-page":"2927","DOI":"10.1109\/TKDE.2016.2594065","article-title":"Efficient algorithms for temporal path computation","volume":"28","author":"Wu","year":"2016","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"10.1016\/j.dam.2026.04.048_b39","doi-asserted-by":"crossref","first-page":"72","DOI":"10.1016\/j.jcss.2019.07.006","article-title":"The complexity of finding small separators in temporal graphs","volume":"107","author":"Zschoche","year":"2020","journal-title":"J. Comput. Syst. Sci."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X26002751?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X26002751?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,6,14]],"date-time":"2026-06-14T18:07:59Z","timestamp":1781460479000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X26002751"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,10]]},"references-count":39,"alternative-id":["S0166218X26002751"],"URL":"https:\/\/doi.org\/10.1016\/j.dam.2026.04.048","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2026,10]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Temporal connectivity: Coping with foreseen and unforeseen delays","name":"articletitle","label":"Article Title"},{"value":"Discrete Applied Mathematics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.dam.2026.04.048","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}]}}