{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T23:07:45Z","timestamp":1782947265488,"version":"3.54.5"},"reference-count":33,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,6,26]],"date-time":"2026-06-26T00:00:00Z","timestamp":1782432000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100000266","name":"Engineering and Physical Sciences Research Council","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100000266","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2026,9]]},"DOI":"10.1016\/j.tcs.2026.116138","type":"journal-article","created":{"date-parts":[[2026,6,29]],"date-time":"2026-06-29T15:33:59Z","timestamp":1782747239000},"page":"116138","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Reachability in temporal graphs under perturbation"],"prefix":"10.1016","volume":"1083","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0266-3292","authenticated-orcid":false,"given":"Jessica","family":"Enright","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3322-0176","authenticated-orcid":false,"given":"Laura","family":"Larios-Jones","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5299-3073","authenticated-orcid":false,"given":"Kitty","family":"Meeks","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0040-2088","authenticated-orcid":false,"given":"William","family":"Pettersson","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/j.tcs.2026.116138_bib0001","series-title":"A Journey through Dynamic Networks (with Excursions)","author":"Casteigts","year":"2018"},{"key":"10.1016\/j.tcs.2026.116138_bib0002","doi-asserted-by":"crossref","unstructured":"A. Deligkas, M. D\u00f6ring, E. Eiben, T.-L. Goldsmith, G. Skretas, Being an influencer is hard: the complexity of influence maximization in temporal graphs with a fixed source, 2023, arXiv: 2303.11703[cs].","DOI":"10.65109\/HWQC2949"},{"key":"10.1016\/j.tcs.2026.116138_bib0003","unstructured":"S.D. Hand, J. Enright, K. Meeks, Making life more confusing for firefighters, 2022, Conference Name: 11th International Conference on Fun with Algorithms (FUN 2022) ISBN: 9783959772327 ISSN: 1868\u20138969 Meeting Name: 11th International Conference on Fun with Algorithms (FUN 2022) Place: Sicily, Italy, https:\/\/eprints.gla.ac.uk\/269008\/."},{"key":"10.1016\/j.tcs.2026.116138_bib0004","doi-asserted-by":"crossref","DOI":"10.1016\/j.jcss.2025.103701","article-title":"Temporal reachability dominating sets: contagion in temporal graphs","volume":"155","author":"Kutner","year":"2026","journal-title":"J. Comput. Syst. Sci."},{"issue":"1776","key":"10.1016\/j.tcs.2026.116138_bib0005","doi-asserted-by":"crossref","DOI":"10.1098\/rstb.2018.0264","article-title":"Analysing livestock network data for infectious disease control: an argument for routine data collection in emerging economies","volume":"374","author":"Chaters","year":"2019","journal-title":"Philos. Trans. R. Soc. B: Biol. Sci."},{"key":"10.1016\/j.tcs.2026.116138_bib0006","doi-asserted-by":"crossref","unstructured":"A. Myall, R.L. Peach, Y. Wan, S. Mookerjee, E. Jauneikaite, F. Bolt, J. Price, F. Davies, A.Y. Wei\u00dfe, A. Holmes, M. Barahona, Characterising contact in disease outbreaks via a network model of spatial-temporal proximity, 2021, Pages: 2021.04.07.21254497, 10.1101\/2021.04.07.21254497.","DOI":"10.1101\/2021.04.07.21254497"},{"issue":"4","key":"10.1016\/j.tcs.2026.116138_bib0007","doi-asserted-by":"crossref","DOI":"10.1103\/PhysRevE.71.046119","article-title":"Network reachability of real-world contact sequences","volume":"71","author":"Holme","year":"2005","journal-title":"Phys. Rev. E"},{"key":"10.1016\/j.tcs.2026.116138_bib0008","doi-asserted-by":"crossref","DOI":"10.1098\/rsos.180719","article-title":"Contact chains of cattle farms in great britain","volume":"6","author":"Fielding","year":"2019","journal-title":"R. Soc. Open Sci."},{"key":"10.1016\/j.tcs.2026.116138_bib0009","doi-asserted-by":"crossref","unstructured":"D. Kempe, J. Kleinberg, A. Kumar, Connectivity and inference problems for temporal networks 64 (4) 820\u2013842. 10.1006\/jcss.2002.1829.","DOI":"10.1006\/jcss.2002.1829"},{"key":"10.1016\/j.tcs.2026.116138_bib0010","doi-asserted-by":"crossref","unstructured":"A. Deligkas, I. Potapov, Optimizing reachability sets in temporal graphs by delaying 285, 104890. 10.1016\/j.ic.2022.104890.","DOI":"10.1016\/j.ic.2022.104890"},{"key":"10.1016\/j.tcs.2026.116138_bib0011","series-title":"Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence","first-page":"5333","article-title":"Minimizing reachability times on temporal graphs via shifting labels","author":"Deligkas","year":"2023"},{"key":"10.1016\/j.tcs.2026.116138_bib0012","unstructured":"H. Molter, M. Renken, P. Zschoche, Temporal reachability minimization: delaying vs. deleting, in: F. Bonchi, S.J. Puglisi (Eds.), 46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021), vol. 202 of Leibniz International Proceedings in Informatics (LIPIcs), Schloss Dagstuhl\u2013Leibniz-Zentrum f\u00fcr Informatik, pp. 76:1\u201376:15. 10.4230\/LIPIcs.MFCS.2021.76."},{"key":"10.1016\/j.tcs.2026.116138_bib0013","unstructured":"J. Enright, K. Meeks, G.B. Mertzios, V. Zamaraev, Deleting edges to restrict the size of an epidemic in temporal networks 11960\u201377. 10.1016\/j.jcss.2021.01.007."},{"key":"10.1016\/j.tcs.2026.116138_bib0014","unstructured":"J. Enright, K. Meeks, F. Skerman, Assigning times to minimise reachability in temporal graphs 115169\u2013186. 10.1016\/j.jcss.2020.08.001."},{"key":"10.1016\/j.tcs.2026.116138_bib0015","unstructured":"E. F\u00fcchsle, H. Molter, R. Niedermeier, M. Renken, Delay-robust routes in temporal graphs: 39th international symposium on theoretical aspects of computer science, STACS 202210.4230\/LIPIcs.STACS.2022.30."},{"key":"10.1016\/j.tcs.2026.116138_bib0016","doi-asserted-by":"crossref","unstructured":"S. Baswana, K. Choudhary, L. Roditty, Fault tolerant subgraph for single source reachability: generic and optimal, in: Proceedings of the Forty-Eighth Annual ACM Symposium on Theory of Computing, STOC \u201916, Association for Computing Machinery, pp. 509\u2013518. 10.1145\/2897518.2897648.","DOI":"10.1145\/2897518.2897648"},{"key":"10.1016\/j.tcs.2026.116138_bib0017","doi-asserted-by":"crossref","unstructured":"D. Bil\u00f2, G. D\u2019Angelo, L. Gual\u00e0, S. Leucci, M. Rossi, Blackout-tolerant temporal spanners, in: T. Erlebach, M. Segal (Eds.), Algorithmics of Wireless Networks, Lecture Notes in Computer Science, Springer International Publishing, pp. 31\u201344. 10.1007\/978-3-031-22050-0_3.","DOI":"10.1007\/978-3-031-22050-0_3"},{"key":"10.1016\/j.tcs.2026.116138_bib0018","doi-asserted-by":"crossref","unstructured":"A. Casteigts, S. Dubois, F. Petit, J.M. Robson, Robustness: a new form of heredity motivated by dynamic networks 806, 429\u2013445. 10.1016\/j.tcs.2019.08.008.","DOI":"10.1016\/j.tcs.2019.08.008"},{"key":"10.1016\/j.tcs.2026.116138_bib0019","doi-asserted-by":"crossref","unstructured":"M. Dinitz, R. Krauthgamer, Fault-tolerant spanners: better and simpler, in: Proceedings of the 30th Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, PODC \u201911, Association for Computing Machinery, pp. 169\u2013178. 10.1145\/1993806.1993830.","DOI":"10.1145\/1993806.1993830"},{"key":"10.1016\/j.tcs.2026.116138_bib0020","unstructured":"S. Dubois, L. Feuilloley, F. Petit, M. Rabie, When should you wait before updating? - Toward a robustness refinement, in: D. Doty, P. Spirakis (Eds.), 2nd Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2023), vol. 257 of Leibniz International Proceedings in Informatics (LIPIcs), Schloss Dagstuhl\u2013Leibniz-Zentrum f\u00fcr Informatik, pp. 7:1\u20137:15. 10.4230\/LIPIcs.SAND.2023.7."},{"key":"10.1016\/j.tcs.2026.116138_bib0021","unstructured":"W. Lochet, D. Lokshtanov, P. Misra, S. Saurabh, R. Sharma, M. Zehavi, Fault tolerant subgraphs with applications in kernelization, in: T. Vidick (Ed.), 11th Innovations in Theoretical Computer Science Conference (ITCS 2020), vol. 151 of Leibniz International Proceedings in Informatics (LIPIcs), Schloss Dagstuhl\u2013Leibniz-Zentrum fuer Informatik, pp. 47:1\u201347:22. 10.4230\/LIPIcs.ITCS.2020.47."},{"key":"10.1016\/j.tcs.2026.116138_bib0022","series-title":"30th Annual European Symposium on Algorithms (ESA 2022)","first-page":"49:1","article-title":"Learning-augmented query policies for minimum spanning tree with uncertainty","volume":"vol. 244","author":"Erlebach","year":"2022"},{"key":"10.1016\/j.tcs.2026.116138_bib0023","doi-asserted-by":"crossref","unstructured":"T. Erlebach, M. Hoffmann, Minimum spanning tree verification under uncertainty, in: D. Kratsch, I. Todinca (Eds.), Graph-Theoretic Concepts in Computer Science, Lecture Notes in Computer Science, Springer International Publishing, pp. 164\u2013175. 10.1007\/978-3-319-12340-0_14.","DOI":"10.1007\/978-3-319-12340-0_14"},{"key":"10.1016\/j.tcs.2026.116138_bib0024","unstructured":"T. Erlebach, M. Hoffmann, D. Krizanc, M. Mihal\u2019\u00e1k, R. Raman, Computing minimum spanning trees with uncertainty10.48550\/arXiv.0802.2855."},{"key":"10.1016\/j.tcs.2026.116138_bib0025","doi-asserted-by":"crossref","unstructured":"T. Erlebach, M. Hoffmann, M.S. de Lima, Round-competitive algorithms for uncertainty problems with parallel queries 85 (2) 406\u2013443. 10.1007\/s00453-022-01035-6.","DOI":"10.1007\/s00453-022-01035-6"},{"key":"10.1016\/j.tcs.2026.116138_bib0026","doi-asserted-by":"crossref","unstructured":"G.B. Mertzios, O. Michail, P.G. Spirakis, Temporal network optimization subject to connectivity constraints 81 (4) 1416\u20131449. 10.1007\/s00453-018-0478-6.","DOI":"10.1007\/s00453-018-0478-6"},{"issue":"02","key":"10.1016\/j.tcs.2026.116138_bib0027","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":"Xuan","year":"2003","journal-title":"Int. J. Found. Comput. Sci."},{"issue":"9","key":"10.1016\/j.tcs.2026.116138_bib0028","doi-asserted-by":"crossref","first-page":"721","DOI":"10.14778\/2732939.2732945","article-title":"Path problems in temporal graphs","volume":"7","author":"Wu","year":"2014","journal-title":"Proc. VLDB Endow."},{"key":"10.1016\/j.tcs.2026.116138_bib0029","series-title":"Proceedings of the Twenty-ninth Annual ACM Symposium on Theory of Computing","first-page":"475","article-title":"A sub-constant error-probability low-degree test, and a sub-constant error-probability PCP characterization of NP","author":"Raz","year":"1997"},{"key":"10.1016\/j.tcs.2026.116138_bib0030","series-title":"Parameterized Algorithms","author":"Cygan","year":"2015"},{"key":"10.1016\/j.tcs.2026.116138_bib0031","series-title":"The Algorithm Design Manual","author":"Skiena","year":"2008"},{"key":"10.1016\/j.tcs.2026.116138_bib0032","doi-asserted-by":"crossref","unstructured":"K. Dudzi\u0144ski, S. Walukiewicz, Exact methods for the knapsack problem and its generalizations 28 (1) 3\u201321. 10.1016\/0377-2217(87)90165-2.","DOI":"10.1016\/0377-2217(87)90165-2"},{"key":"10.1016\/j.tcs.2026.116138_bib0033","doi-asserted-by":"crossref","unstructured":"H.L. Bodlaender, A linear-time algorithm for finding tree-decompositions of small treewidth 25(6) 1305\u20131317. 10.1137\/S0097539793251219.","DOI":"10.1137\/S0097539793251219"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397526003671?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397526003671?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T21:59:25Z","timestamp":1782943165000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397526003671"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,9]]},"references-count":33,"alternative-id":["S0304397526003671"],"URL":"https:\/\/doi.org\/10.1016\/j.tcs.2026.116138","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2026,9]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Reachability in temporal graphs under perturbation","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.tcs.2026.116138","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 The Author(s). Published by Elsevier B.V.","name":"copyright","label":"Copyright"}],"article-number":"116138"}}