{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,8]],"date-time":"2026-06-08T18:00:06Z","timestamp":1780941606771,"version":"3.54.1"},"reference-count":24,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,6,2]],"date-time":"2026-06-02T00:00:00Z","timestamp":1780358400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2026,8]]},"DOI":"10.1016\/j.tcs.2026.116078","type":"journal-article","created":{"date-parts":[[2026,6,4]],"date-time":"2026-06-04T06:48:41Z","timestamp":1780555721000},"page":"116078","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Temporal connectivity augmentation"],"prefix":"10.1016","volume":"1081","author":[{"ORCID":"https:\/\/orcid.org\/0009-0001-5424-0742","authenticated-orcid":false,"given":"Thomas","family":"Bellitto","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0002-2244-5425","authenticated-orcid":false,"given":"Jules","family":"Bouton-Popper","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6477-8706","authenticated-orcid":false,"given":"Bruno","family":"Escoffier","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/j.tcs.2026.116078_bib0001","series-title":"4th Symposium on Algorithmic Foundations of Dynamic Networks, SAND 2025, June 9-11, 2025, Liverpool, UK","first-page":"3:1","article-title":"Temporal connectivity augmentation","volume":"Vol. 330","author":"Bellitto","year":"2025"},{"key":"10.1016\/j.tcs.2026.116078_bib0002","doi-asserted-by":"crossref","unstructured":"J. Enright, K. Meeks, G. B. Mertzios, V. Zamaraev, Deleting edges to restrict the size of an epidemic in temporal networks, J. Comput. Syst. Sci. 119 (2021) 60\u201377.","DOI":"10.1016\/j.jcss.2021.01.007"},{"key":"10.1016\/j.tcs.2026.116078_bib0003","series-title":"Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing","first-page":"504","article-title":"Connectivity and inference problems for temporal networks","author":"Kempe","year":"2000"},{"key":"10.1016\/j.tcs.2026.116078_bib0004","series-title":"43rd International Colloquium on Automata, Languages, and Programming, ICALP 2016, July 11-15, 2016, Rome, Italy","first-page":"149:1","article-title":"On the size and the approximability of minimum temporally connected subgraphs","volume":"Vol. 55","author":"Axiotis","year":"2016"},{"key":"10.1016\/j.tcs.2026.116078_bib0005","doi-asserted-by":"crossref","unstructured":"E.C. Akrida, L. G\u0105sieniec, G.B. Mertzios, P.G. Spirakis, The complexity of optimal design of temporally connected graphs, Theory Comput. Syst. 61(2017) 907\u2013944.","DOI":"10.1007\/s00224-017-9757-x"},{"key":"10.1016\/j.tcs.2026.116078_bib0006","doi-asserted-by":"crossref","unstructured":"A. Casteigts, J.G. Peters, J. Schoeters, Temporal cliques admit sparse spanners, J. Comput. Syst. Sci. 121 (2021) 1\u201317.","DOI":"10.1016\/j.jcss.2021.04.004"},{"issue":"2","key":"10.1016\/j.tcs.2026.116078_bib0007","doi-asserted-by":"crossref","first-page":"346","DOI":"10.1137\/22M1511916","article-title":"Sharp thresholds in random simple temporal graphs","volume":"53","author":"Casteigts","year":"2024","journal-title":"SIAM J. Comput."},{"key":"10.1016\/j.tcs.2026.116078_bib0008","series-title":"32nd Annual European Symposium on Algorithms, ESA 2024, September 2-4, 2024, Royal Holloway, London, United Kingdom","first-page":"11:1","article-title":"How to reduce temporal cliques to find sparse spanners","volume":"Vol. 308","author":"Angrick","year":"2024"},{"key":"10.1016\/j.tcs.2026.116078_bib0009","series-title":"Ad-Hoc, Mobile, and Wireless Networks: Second International Conference, ADHOC-NOW2003, Montreal, Canada, October 8-10, 2003. Proceedings 2","first-page":"259","article-title":"Complexity of connected components in evolving graphs and the computation of multicast trees in dynamic networks","author":"Bhadra","year":"2003"},{"key":"10.1016\/j.tcs.2026.116078_bib0010","series-title":"Proceedings of the 2004 Joint Workshop on Foundations of Mobile Computing","first-page":"24","article-title":"Connectivity in evolving graph with geometric properties","author":"Jarry","year":"2004"},{"key":"10.1016\/j.tcs.2026.116078_bib0011","series-title":"Proceedings of the Forty-Second ACM Symposium on Theory of Computing","first-page":"513","article-title":"Distributed computation in dynamic networks","author":"Kuhn","year":"2010"},{"key":"10.1016\/j.tcs.2026.116078_bib0012","series-title":"Experimental Robotics: The Eleventh International Symposium","first-page":"117","article-title":"Maintaining connectivity in mobile robot networks","author":"Michael","year":"2009"},{"key":"10.1016\/j.tcs.2026.116078_bib0013","doi-asserted-by":"crossref","unstructured":"A. Casteigts, T. Corsini, W. Sarkar, Simple, strict, proper, happy: a study of reachability in temporal graphs, Theor. Comput. Sci. 991(2024) 114434.","DOI":"10.1016\/j.tcs.2024.114434"},{"key":"10.1016\/j.tcs.2026.116078_bib0014","series-title":"3rd Symposium on Algorithmic Foundations of Dynamic Networks, SAND 2024, Patras, Greece, June 5-7, 2024","first-page":"24:1","article-title":"Brief announcement: the dynamic steiner tree problem: definitions, complexity, algorithms","volume":"Vol. 292","author":"Balev","year":"2024"},{"key":"10.1016\/j.tcs.2026.116078_bib0015","series-title":"International Symposium on Algorithms and Experiments for Wireless Sensor Networks","first-page":"31","article-title":"Blackout-tolerant temporal spanners","author":"Bil\u00f2","year":"2022"},{"key":"10.1016\/j.tcs.2026.116078_bib0016","series-title":"3rd Symposium on Algorithmic Foundations of Dynamic Networks, SAND 2024","first-page":"8:1","article-title":"On inefficiently connecting temporal networks","volume":"Vol.292","author":"Christiann","year":"2024"},{"issue":"9","key":"10.1016\/j.tcs.2026.116078_bib0017","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.116078_bib0018","doi-asserted-by":"crossref","unstructured":"M. Cardei, D.-Z. Du, Improving wireless sensor network lifetime through power aware organization, Wirel. Netw. 11(2005) 333\u2013340.","DOI":"10.1007\/s11276-005-6615-6"},{"issue":"5","key":"10.1016\/j.tcs.2026.116078_bib0019","doi-asserted-by":"crossref","first-page":"960","DOI":"10.1145\/185675.306789","article-title":"On the hardness of approximating minimization problems","volume":"41","author":"Lund","year":"1994","journal-title":"J. ACM"},{"issue":"4","key":"10.1016\/j.tcs.2026.116078_bib0020","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1016\/0012-365X(75)90058-8","article-title":"On the ratio of optimal integral and fractional covers","volume":"13","author":"Lov\u00e1sz","year":"1975","journal-title":"Discret. Math."},{"issue":"1","key":"10.1016\/j.tcs.2026.116078_bib0021","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1006\/jagm.1999.1042","article-title":"Approximation algorithms for directed Steiner problems","volume":"33","author":"Charikar","year":"1999","journal-title":"J. Algorithms"},{"issue":"4","key":"10.1016\/j.tcs.2026.116078_bib0022","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1080\/15427951.2016.1177801","article-title":"An introduction to temporal graphs: an algorithmic perspective","volume":"12","author":"Michail","year":"2016","journal-title":"Internet Math."},{"issue":"2","key":"10.1016\/j.tcs.2026.116078_bib0023","doi-asserted-by":"crossref","first-page":"543","DOI":"10.1137\/S0097539704441241","article-title":"The directed Steiner network problem is tractable for a constant number of terminals","volume":"36","author":"Feldman","year":"2006","journal-title":"SIAM J. Comput."},{"key":"10.1016\/j.tcs.2026.116078_bib0024","series-title":"49th International Symposium on Mathematical Foundations of Computer Science, MFCS 2024, August 26-30, 2024, Bratislava, Slovakia","first-page":"52:1","article-title":"Structural parameters for dense temporal graphs","author":"Enright","year":"2024"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397526003282?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397526003282?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,6,8]],"date-time":"2026-06-08T17:30:01Z","timestamp":1780939801000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397526003282"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,8]]},"references-count":24,"alternative-id":["S0304397526003282"],"URL":"https:\/\/doi.org\/10.1016\/j.tcs.2026.116078","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2026,8]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Temporal connectivity augmentation","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.tcs.2026.116078","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":"116078"}}