{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,15]],"date-time":"2026-05-15T04:09:47Z","timestamp":1778818187692,"version":"3.51.4"},"reference-count":22,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,4,14]],"date-time":"2026-04-14T00:00:00Z","timestamp":1776124800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100021856","name":"Ministero dell'Universit\u00e0 e della Ricerca","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100021856","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100024370","name":"Ministero dell'Istruzione dell'Universit\u00e0 e della Ricerca","doi-asserted-by":"publisher","award":["2022ME9Z78"],"award-info":[{"award-number":["2022ME9Z78"]}],"id":[{"id":"10.13039\/501100024370","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100024370","name":"Ministero dell'Istruzione dell'Universit\u00e0 e della Ricerca","doi-asserted-by":"publisher","award":["2022TS4Y3N"],"award-info":[{"award-number":["2022TS4Y3N"]}],"id":[{"id":"10.13039\/501100024370","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,6]]},"DOI":"10.1016\/j.tcs.2026.115964","type":"journal-article","created":{"date-parts":[[2026,4,15]],"date-time":"2026-04-15T08:51:28Z","timestamp":1776243088000},"page":"115964","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Partial temporal vertex cover with bounded activity intervals"],"prefix":"10.1016","volume":"1076","author":[{"given":"Riccardo","family":"Dondi","sequence":"first","affiliation":[]},{"given":"Fabrizio","family":"Montecchiani","sequence":"additional","affiliation":[]},{"given":"Giacomo","family":"Ortali","sequence":"additional","affiliation":[]},{"given":"Tommaso","family":"Piselli","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9192-2067","authenticated-orcid":false,"given":"Alessandra","family":"Tappini","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.tcs.2026.115964_bib0001","series-title":"3rd Symposium on Algorithmic Foundations of Dynamic Networks, SAND 2024, June 5\u20137, 2024, Patras, Greece","first-page":"11:1","article-title":"Partial temporal vertex cover with bounded activity intervals","volume":"292","author":"Dondi","year":"2024"},{"issue":"4","key":"10.1016\/j.tcs.2026.115964_bib0002","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":"9","key":"10.1016\/j.tcs.2026.115964_bib0003","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"},{"issue":"4","key":"10.1016\/j.tcs.2026.115964_bib0004","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."},{"key":"10.1016\/j.tcs.2026.115964_bib0005","series-title":"Temporal Network Theory","first-page":"1","article-title":"A map of approaches to temporal networks","author":"Holme","year":"2019"},{"issue":"3","key":"10.1016\/j.tcs.2026.115964_bib0006","doi-asserted-by":"crossref","first-page":"158","DOI":"10.1007\/s42979-021-00593-w","article-title":"Dense sub-networks discovery in temporal networks","volume":"2","author":"Dondi","year":"2021","journal-title":"SN Comput. Sci."},{"key":"10.1016\/j.tcs.2026.115964_bib0007","doi-asserted-by":"crossref","first-page":"108","DOI":"10.1016\/j.jcss.2019.08.002","article-title":"Temporal vertex cover with a sliding time window","volume":"107","author":"Akrida","year":"2020","journal-title":"J. Comput. Syst. Sci."},{"key":"10.1016\/j.tcs.2026.115964_bib0008","first-page":"10193","article-title":"The complexity of temporal vertex cover in small-degree graphs","author":"Hamm","year":"2022"},{"issue":"1","key":"10.1016\/j.tcs.2026.115964_bib0009","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1007\/s10618-020-00717-5","article-title":"The network-untangling problem: from interactions to activity timelines","volume":"35","author":"Rozenshtein","year":"2021","journal-title":"Data Min. Knowl. Discov."},{"key":"10.1016\/j.tcs.2026.115964_bib0010","doi-asserted-by":"crossref","DOI":"10.1016\/j.tcs.2023.114040","article-title":"Untangling temporal graphs of bounded degree","volume":"969","author":"Dondi","year":"2023","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"10.1016\/j.tcs.2026.115964_bib0011","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1007\/s00224-023-10150-y","article-title":"Disentangling the computational complexity of network untangling","volume":"68","author":"Froese","year":"2024","journal-title":"Theory Comput. Syst."},{"key":"10.1016\/j.tcs.2026.115964_bib0012","doi-asserted-by":"crossref","DOI":"10.1016\/j.jcss.2025.103679","article-title":"An FPT algorithm for timeline cover","volume":"154","author":"Dondi","year":"2025","journal-title":"J. Comput. Syst. Sci."},{"issue":"1","key":"10.1016\/j.tcs.2026.115964_bib0013","doi-asserted-by":"crossref","first-page":"609","DOI":"10.1007\/s10479-024-05993-8","article-title":"Exact and approximation algorithms for covering timeline in temporal graphs","volume":"351","author":"Dondi","year":"2025","journal-title":"Ann. Oper. Res."},{"issue":"1","key":"10.1016\/j.tcs.2026.115964_bib0014","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1016\/j.jalgor.2004.04.002","article-title":"Approximation algorithms for partial covering problems","volume":"53","author":"Gandhi","year":"2004","journal-title":"J. Algorith."},{"key":"10.1016\/j.tcs.2026.115964_bib0015","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1007\/s00453-007-9003-z","article-title":"A primal-dual approximation algorithm for partial vertex cover: making educated guesses","volume":"55","author":"Mestre","year":"2009","journal-title":"Algorithmica"},{"key":"10.1016\/j.tcs.2026.115964_bib0016","series-title":"The Design of Approximation Algorithms","author":"Williamson","year":"2011"},{"key":"10.1016\/j.tcs.2026.115964_bib0017","series-title":"Automata, Languages and Programming, 26th International Colloquium, ICALP\u201999, Prague, Czech Republic, July 11\u201315, 1999, Proceedings","first-page":"200","article-title":"On some tighter inapproximability results (extended abstract)","volume":"1644","author":"Berman","year":"1999"},{"key":"10.1016\/j.tcs.2026.115964_bib0018","article-title":"On some tighter inapproximability results","volume":"TR98-029","author":"Berman","year":"1998","journal-title":"Electron. Colloquium Comput. Compl."},{"issue":"8","key":"10.1016\/j.tcs.2026.115964_bib0019","doi-asserted-by":"crossref","first-page":"435","DOI":"10.1016\/j.jcss.2009.04.002","article-title":"Almost 2-SAT is fixed-parameter tractable","volume":"75","author":"Razgon","year":"2009","journal-title":"J. Comput. Syst. Sci."},{"issue":"3","key":"10.1016\/j.tcs.2026.115964_bib0020","doi-asserted-by":"crossref","first-page":"16:1","DOI":"10.1145\/3390887","article-title":"Representative sets and irrelevant vertices: new tools for kernelization","volume":"67","author":"Kratsch","year":"2020","journal-title":"J. ACM"},{"issue":"4","key":"10.1016\/j.tcs.2026.115964_bib0021","doi-asserted-by":"crossref","first-page":"656","DOI":"10.1137\/S0895480192243516","article-title":"New 3\/4-Approximation algorithms for the maximum satisfiability problem","volume":"7","author":"Goemans","year":"1994","journal-title":"SIAM J. Discret. Math."},{"issue":"6","key":"10.1016\/j.tcs.2026.115964_bib0022","doi-asserted-by":"crossref","first-page":"1115","DOI":"10.1145\/227683.227684","article-title":"Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming","volume":"42","author":"Goemans","year":"1995","journal-title":"J. ACM"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397526002239?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397526002239?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,5,15]],"date-time":"2026-05-15T03:23:23Z","timestamp":1778815403000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397526002239"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,6]]},"references-count":22,"alternative-id":["S0304397526002239"],"URL":"https:\/\/doi.org\/10.1016\/j.tcs.2026.115964","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2026,6]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Partial temporal vertex cover with bounded activity intervals","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.tcs.2026.115964","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":"115964"}}