{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,17]],"date-time":"2026-07-17T17:09:11Z","timestamp":1784308151267,"version":"3.55.0"},"reference-count":46,"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,7,13]],"date-time":"2026-07-13T00:00:00Z","timestamp":1783900800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/100005156","name":"Alexander von Humboldt Foundation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100005156","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001665","name":"French National Research Agency","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001665","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.116170","type":"journal-article","created":{"date-parts":[[2026,7,10]],"date-time":"2026-07-10T15:39:34Z","timestamp":1783697974000},"page":"116170","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Temporal dominating set and temporal vertex cover under the lens of degree restrictions"],"prefix":"10.1016","volume":"1084","author":[{"ORCID":"https:\/\/orcid.org\/0009-0008-8473-9043","authenticated-orcid":false,"given":"Anton","family":"Herrmann","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0829-7032","authenticated-orcid":false,"given":"Christian","family":"Komusiewicz","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7283-4982","authenticated-orcid":false,"given":"Nils","family":"Morawietz","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4034-525X","authenticated-orcid":false,"given":"Frank","family":"Sommer","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/j.tcs.2026.116170_bib0001","series-title":"On the Complexity of Computing Optimal Dominating Sets in Temporal Graphs","author":"Herrmann","year":"2024"},{"key":"10.1016\/j.tcs.2026.116170_bib0002","unstructured":"P. Holme, J. Saram\u00e4ki, Temporal networks, (2011). http:\/\/arxiv.org\/abs\/1108.1780."},{"issue":"4","key":"10.1016\/j.tcs.2026.116170_bib0003","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":"40-42","key":"10.1016\/j.tcs.2026.116170_bib0004","doi-asserted-by":"crossref","first-page":"3736","DOI":"10.1016\/j.tcs.2010.06.026","article-title":"Improved upper bounds for vertex cover","volume":"411","author":"Chen","year":"2010","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/j.tcs.2026.116170_bib0005","series-title":"Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, (SODA \u201916","first-page":"1152","article-title":"Raising the bar for vertex cover: fixed-parameter tractability above a higher guarantee","author":"Garg","year":"2016"},{"key":"10.1016\/j.tcs.2026.116170_bib0006","series-title":"Proceedings of the 41st International Symposium on Theoretical Aspects of Computer Science (STACS \u201924)","first-page":"40:1","article-title":"A faster algorithm for vertex cover parameterized by solution size","author":"Harris","year":"2024"},{"key":"10.1016\/j.tcs.2026.116170_bib0007","series-title":"Proceedings of the 17th International Symposium on Parameterized and Exact Computation (IPEC \u201922)","first-page":"19:1","article-title":"Vertex cover and feedback vertex set above and below structural guarantees","author":"Kellerhals","year":"2022"},{"issue":"3","key":"10.1016\/j.tcs.2026.116170_bib0008","doi-asserted-by":"crossref","first-page":"1806","DOI":"10.1137\/16M1104585","article-title":"A randomized polynomial kernelization for vertex cover with a smaller parameter","volume":"32","author":"Kratsch","year":"2018","journal-title":"SIAM J. Discret. Math."},{"key":"10.1016\/j.tcs.2026.116170_bib0009","doi-asserted-by":"crossref","DOI":"10.1016\/j.tcs.2024.114870","article-title":"Parameterized approximation algorithms for weighted vertex cover","volume":"1021","author":"Mandal","year":"2024","journal-title":"Theor. Comput. Sci."},{"issue":"8","key":"10.1016\/j.tcs.2026.116170_bib0010","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."},{"key":"10.1016\/j.tcs.2026.116170_bib0011","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.116170_bib0012","series-title":"Parameterized Algorithms","author":"Cygan","year":"2015"},{"key":"10.1016\/j.tcs.2026.116170_bib0013","series-title":"The Design of Approximation Algorithms","author":"Williamson","year":"2011"},{"key":"10.1016\/j.tcs.2026.116170_bib0014","series-title":"A Journey through Dynamic Networks (with Excursions)","author":"Casteigts","year":"2018"},{"key":"10.1016\/j.tcs.2026.116170_bib0015","series-title":"Proceedings of the 6th Annual ACM Symposium on Theory of Computing (STOC \u201974)","first-page":"47","article-title":"Some simplified NP-complete problems","author":"Garey","year":"1974"},{"key":"10.1016\/j.tcs.2026.116170_bib0016","series-title":"Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence (AAAI \u201922)","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.116170_bib0017","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.116170_bib0018","series-title":"Proceedings of the 23rd Italian Conference on Theoretical Computer Science (ICTCS \u201922)","first-page":"1","article-title":"Insights into the complexity of disentangling temporal graphs","author":"Dondi","year":"2022"},{"key":"10.1016\/j.tcs.2026.116170_bib0019","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."},{"key":"10.1016\/j.tcs.2026.116170_bib0020","series-title":"Proceedings of the 18th International Symposium on Parameterized and Exact Computation (IPEC \u201923)","first-page":"12:1","article-title":"An FPT algorithm for temporal graph untangling","volume":"volume 285","author":"Dondi","year":"2023"},{"key":"10.1016\/j.tcs.2026.116170_bib0021","series-title":"Proceedings of the 3rd Symposium on Algorithmic Foundations of Dynamic Networks (SAND \u201924)","first-page":"11:1","article-title":"Partial temporal vertex cover with bounded activity intervals","volume":"volume 292","author":"Dondi","year":"2024"},{"issue":"1","key":"10.1016\/j.tcs.2026.116170_bib0022","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.116170_bib0023","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.116170_bib0024","series-title":"Leveraging Graph Structure to Untangle Temporal Networks Efficiently","author":"Schubert","year":"2023"},{"key":"10.1016\/j.tcs.2026.116170_bib0025","series-title":"Proceedings of the 20th International Symposium on Parameterized and Exact Computation (IPEC \u201925)","first-page":"12:1","article-title":"Timeline problems in temporal graphs: vertex cover vs. dominating set","author":"Herrmann","year":"2025"},{"issue":"2","key":"10.1016\/j.tcs.2026.116170_bib0026","doi-asserted-by":"crossref","first-page":"454","DOI":"10.1007\/s00224-022-10069-w","article-title":"Multistage vertex cover","volume":"66","author":"Fluschnik","year":"2022","journal-title":"Theory Comput. Syst."},{"key":"10.1016\/j.tcs.2026.116170_bib0027","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."},{"key":"10.1016\/j.tcs.2026.116170_bib0028","series-title":"Algorithms for domination problems on temporal graphs","author":"Verheije","year":"2021"},{"issue":"12","key":"10.1016\/j.tcs.2026.116170_bib0029","doi-asserted-by":"crossref","first-page":"7823","DOI":"10.1109\/TSMC.2020.2987163","article-title":"Minimum dominating set of multiplex networks: definition, application, and identification","volume":"51","author":"Zhao","year":"2021","journal-title":"IEEE Trans. Syst. Man Cybern. Syst."},{"key":"10.1016\/j.tcs.2026.116170_bib0030","series-title":"Computational Complexity - A Modern Approach","author":"Arora","year":"2009"},{"key":"10.1016\/j.tcs.2026.116170_bib0031","doi-asserted-by":"crossref","first-page":"543","DOI":"10.7155\/jgaa.00273","article-title":"The h-index of a graph and its application to dynamic subgraph statistics","volume":"16","author":"Eppstein","year":"2012","journal-title":"J. Graph Algorithms Appl."},{"key":"10.1016\/j.tcs.2026.116170_bib0032","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1137\/0608024","article-title":"Complexity of finding embeddings in a k-tree","volume":"8","author":"Arnborg","year":"1987","journal-title":"SIAM J. Alg. Disc. Meth."},{"key":"10.1016\/j.tcs.2026.116170_bib0033","series-title":"Proceedings of the 62nd IEEE Annual Symposium on Foundations of Computer Science (FOCS \u201921)","first-page":"184","article-title":"A single-exponential time 2-approximation algorithm for treewidth","author":"Korhonen","year":"2021"},{"key":"10.1016\/j.tcs.2026.116170_bib0034","series-title":"Proceedings of the 55th Annual ACM Symposium on Theory of Computing, (STOC \u201923)","first-page":"528","article-title":"An improved parameterized algorithm for treewidth","author":"Korhonen","year":"2023"},{"key":"10.1016\/j.tcs.2026.116170_bib0035","series-title":"Proceedings of the 21st Annual Symposium on Foundations of Computer Science (FOCS \u201980)","first-page":"17","article-title":"An O(|V||E|) algorithm for finding maximum matching in general graphs","author":"Micali","year":"1980"},{"key":"10.1016\/j.tcs.2026.116170_bib0036","series-title":"Proceedings of the 18th International Conference and Workshops on Algorithms and Computation (WALCOM \u201924)","first-page":"421","article-title":"On the complexity of list H-packing for sparse graph classes","author":"Gima","year":"2024"},{"key":"10.1016\/j.tcs.2026.116170_bib0037","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/j.tcs.2013.12.013","article-title":"Complexity results for rainbow matchings","volume":"524","author":"Le","year":"2014","journal-title":"Theor. Comput. Sci."},{"issue":"5","key":"10.1016\/j.tcs.2026.116170_bib0038","doi-asserted-by":"crossref","first-page":"783","DOI":"10.1145\/290179.290181","article-title":"Beyond the flow decomposition barrier","volume":"45","author":"Goldberg","year":"1998","journal-title":"J. ACM"},{"issue":"6","key":"10.1016\/j.tcs.2026.116170_bib0039","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1016\/S0020-0190(02)00434-9","article-title":"Computing small partial coverings","volume":"85","author":"Bl\u00e4ser","year":"2003","journal-title":"Inf. Process. Lett."},{"issue":"4","key":"10.1016\/j.tcs.2026.116170_bib0040","doi-asserted-by":"crossref","first-page":"844","DOI":"10.1145\/210332.210337","article-title":"Color-Coding","volume":"42","author":"Alon","year":"1995","journal-title":"J. ACM"},{"key":"10.1016\/j.tcs.2026.116170_bib0041","series-title":"Proceedings of the 36th Annual Symposium on Foundations of Computer Science (FOCS \u201995)","first-page":"182","article-title":"Splitters and near-optimal derandomization","author":"Naor","year":"1995"},{"issue":"3","key":"10.1016\/j.tcs.2026.116170_bib0042","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1002\/jgt.3190200313","article-title":"An induced subgraph characterization of domination perfect graphs","volume":"20","author":"Zverovich","year":"1995","journal-title":"J. Graph Theory"},{"issue":"2","key":"10.1016\/j.tcs.2026.116170_bib0043","doi-asserted-by":"crossref","first-page":"448","DOI":"10.1137\/18M1210459","article-title":"Finding cliques in social networks: a new distribution-free model","volume":"49","author":"Fox","year":"2020","journal-title":"SIAM J. Comput."},{"key":"10.1016\/j.tcs.2026.116170_bib0044","article-title":"Parameterized complexity of temporal connected components: treewidth and k-path graphs","volume":"abs\/2510.05806","author":"Deligkas","year":"2025","journal-title":"CoRR"},{"key":"10.1016\/j.tcs.2026.116170_bib0045","series-title":"Treewidth, Kernels, and Algorithms - Essays Dedicated to Hans L. Bodlaender on the Occasion of His 60th Birthday","first-page":"49","article-title":"As time goes by: reflections on treewidth for temporal graphs","author":"Fluschnik","year":"2020"},{"key":"10.1016\/j.tcs.2026.116170_bib0046","series-title":"Proceedings of the 49th International Symposium on Mathematical Foundations of Computer Science (MFCS \u201924)","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:S0304397526003993?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397526003993?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,7,17]],"date-time":"2026-07-17T17:01:35Z","timestamp":1784307695000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397526003993"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,9]]},"references-count":46,"alternative-id":["S0304397526003993"],"URL":"https:\/\/doi.org\/10.1016\/j.tcs.2026.116170","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":"Temporal dominating set and temporal vertex cover under the lens of degree restrictions","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.tcs.2026.116170","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 The Authors. Published by Elsevier B.V.","name":"copyright","label":"Copyright"}],"article-number":"116170"}}