{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,9]],"date-time":"2025-10-09T01:13:52Z","timestamp":1759972432027,"version":"build-2065373602"},"reference-count":29,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T00:00:00Z","timestamp":1761955200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T00:00:00Z","timestamp":1761955200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T00:00:00Z","timestamp":1761955200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T00:00:00Z","timestamp":1761955200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T00:00:00Z","timestamp":1761955200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T00:00:00Z","timestamp":1761955200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T00:00:00Z","timestamp":1761955200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2025,11]]},"DOI":"10.1016\/j.tcs.2025.115501","type":"journal-article","created":{"date-parts":[[2025,8,7]],"date-time":"2025-08-07T15:12:37Z","timestamp":1754579557000},"page":"115501","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["On time-travel planning in dynamic graphs"],"prefix":"10.1016","volume":"1054","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0612-5616","authenticated-orcid":false,"given":"Quentin","family":"Bramas","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1809-7723","authenticated-orcid":false,"given":"Jean-Romain","family":"Luttringer","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0948-7172","authenticated-orcid":false,"given":"S\u00e9bastien","family":"Tixeuil","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.tcs.2025.115501_br0010","series-title":"International Symposium on Stabilizing, Safety, and Security of Distributed Systems","first-page":"99","article-title":"Treasure hunt in graph using pebbles","author":"Bhattacharya","year":"2022"},{"key":"10.1016\/j.tcs.2025.115501_br0020","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1016\/j.tcs.2021.04.003","article-title":"An improved lower bound for competitive graph exploration","volume":"868","author":"Birx","year":"2021","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"10.1016\/j.tcs.2025.115501_br0030","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3588437","article-title":"Almost-optimal deterministic treasure hunt in unweighted graphs","volume":"19","author":"Bouchard","year":"2023","journal-title":"ACM Trans. Algorithms"},{"key":"10.1016\/j.tcs.2025.115501_br0040","series-title":"Stabilization, Safety, and Security of Distributed Systems - 25th International Symposium, SSS 2023, Jersey City, NJ, USA, October 2-4, 2023, Proceedings","first-page":"466","article-title":"Offline constrained backward time travel planning","volume":"vol. 14310","author":"Bramas","year":"2023"},{"key":"10.1016\/j.tcs.2025.115501_br0050","series-title":"3rd Symposium on Algorithmic Foundations of Dynamic Networks","first-page":"7:1","article-title":"Online space-time travel planning in dynamic graphs","volume":"vol. 292","author":"Bramas","year":"2024"},{"key":"10.1016\/j.tcs.2025.115501_br0060","doi-asserted-by":"crossref","first-page":"176","DOI":"10.1016\/j.tcs.2020.06.007","article-title":"Online graph exploration on a restricted graph class: optimal solutions for tadpole graphs","volume":"839","author":"Brandt","year":"2020","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"10.1016\/j.tcs.2025.115501_br0070","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. Comput. Sci."},{"issue":"4","key":"10.1016\/j.tcs.2025.115501_br0080","doi-asserted-by":"crossref","first-page":"499","DOI":"10.1142\/S0129054115500288","article-title":"Shortest, fastest, and foremost broadcast in dynamic networks","volume":"26","author":"Casteigts","year":"2015","journal-title":"Int. J. Found. Comput. Sci."},{"issue":"5","key":"10.1016\/j.tcs.2025.115501_br0090","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 Emerg. Distrib. Syst."},{"issue":"9","key":"10.1016\/j.tcs.2025.115501_br0100","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.tcs.2025.115501_br0110","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.jcss.2021.04.004","article-title":"Temporal cliques admit sparse spanners","volume":"121","author":"Casteigts","year":"2021","journal-title":"J. Comput. Syst. Sci."},{"key":"10.1016\/j.tcs.2025.115501_br0120","series-title":"Network, IEEE, vol. 12","first-page":"64","article-title":"An overview of qos routing for the next generation high-speed networks: problems and solutions","author":"Chen","year":"1998"},{"key":"10.1016\/j.tcs.2025.115501_br0130","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1016\/j.ic.2014.12.005","article-title":"Fast collaborative graph exploration","volume":"243","author":"Dereniowski","year":"2015","journal-title":"Inf. Comput."},{"key":"10.1016\/j.tcs.2025.115501_br0140","doi-asserted-by":"crossref","first-page":"70","DOI":"10.1016\/j.tcs.2018.03.006","article-title":"A general lower bound for collaborative tree exploration","volume":"811","author":"Disser","year":"2020","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/j.tcs.2025.115501_br0150","series-title":"Quatri\u00e8mes Rencontres Francophones sur les Aspects Algorithmiques des T\u00e9l\u00e9communications (ALGOTEL 2002)","first-page":"155","article-title":"On models and algorithms for dynamic communication networks: the case for evolving graphs","author":"Ferreira","year":"2002"},{"key":"10.1016\/j.tcs.2025.115501_br0160","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1016\/j.tcs.2015.11.017","article-title":"Lower and upper competitive bounds for online directed graph exploration","volume":"655","author":"Foerster","year":"2016","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/j.tcs.2025.115501_br0170","doi-asserted-by":"crossref","DOI":"10.1016\/j.ipl.2021.106096","article-title":"Online graph exploration on trees, unicyclic graphs and cactus graphs","volume":"168","author":"Fritsch","year":"2021","journal-title":"Inf. Process. Lett."},{"year":"1990","series-title":"Computers and Intractability; a Guide to the Theory of NP-Completeness","author":"Garey","key":"10.1016\/j.tcs.2025.115501_br0180"},{"issue":"17","key":"10.1016\/j.tcs.2025.115501_br0190","doi-asserted-by":"crossref","first-page":"3081","DOI":"10.1016\/j.comnet.2010.05.017","article-title":"A survey on multi-constrained optimal path computation: exact and approximate algorithms","volume":"54","author":"Garroppo","year":"2010","journal-title":"Comput. Netw."},{"issue":"1","key":"10.1016\/j.tcs.2025.115501_br0200","doi-asserted-by":"crossref","first-page":"388","DOI":"10.1109\/COMST.2017.2749760","article-title":"Unicast qos routing algorithms for sdn: a comprehensive survey and performance evaluation","volume":"20","author":"Guck","year":"2018","journal-title":"IEEE Commun. Surv. Tutor."},{"key":"10.1016\/j.tcs.2025.115501_br0210","series-title":"Structural Information and Communication Complexity","first-page":"328","article-title":"Treasure hunt with advice","author":"Komm","year":"2015"},{"key":"10.1016\/j.tcs.2025.115501_br0220","series-title":"4th Symposium on Algorithmic Foundations of Dynamic Networks","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"},{"key":"10.1016\/j.tcs.2025.115501_br0230","series-title":"41st IEEE International Conference on Distributed Computing Systems","first-page":"987","article-title":"Black hole search in dynamic rings","author":"Di Luna","year":"2021"},{"key":"10.1016\/j.tcs.2025.115501_br0240","unstructured":"George Pal, The time machine, 1960."},{"key":"10.1016\/j.tcs.2025.115501_br0250","unstructured":"Anthony Russo, Joe Russo, Avengers: Endgame, 2019."},{"year":"2016","series-title":"Handbook of Graph Theory, Combinatorial Optimization, and Algorithms","author":"Thulasiraman","key":"10.1016\/j.tcs.2025.115501_br0260"},{"key":"10.1016\/j.tcs.2025.115501_br0270","series-title":"Structural Information and Communication Complexity - 29th International Colloquium, SIROCCO 2022, Paderborn, Germany, June 27-29, 2022, Proceedings","first-page":"283","article-title":"Foremost non-stop journey arrival in linear time","volume":"vol. 13298","author":"Villacis-Llobet","year":"2022"},{"issue":"7","key":"10.1016\/j.tcs.2025.115501_br0280","doi-asserted-by":"crossref","first-page":"1228","DOI":"10.1109\/49.536364","article-title":"Quality-of-service routing for supporting multimedia applications","volume":"14","author":"Wang","year":"1996","journal-title":"IEEE J. Sel. Areas Commun."},{"key":"10.1016\/j.tcs.2025.115501_br0290","unstructured":"Robert Zemeckis, Back to the future, 1985."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397525004396?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397525004396?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,9]],"date-time":"2025-10-09T00:04:09Z","timestamp":1759968249000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397525004396"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,11]]},"references-count":29,"alternative-id":["S0304397525004396"],"URL":"https:\/\/doi.org\/10.1016\/j.tcs.2025.115501","relation":{},"ISSN":["0304-3975"],"issn-type":[{"type":"print","value":"0304-3975"}],"subject":[],"published":{"date-parts":[[2025,11]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"On time-travel planning in dynamic graphs","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.tcs.2025.115501","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2025 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"115501"}}