{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T12:59:48Z","timestamp":1772197188882,"version":"3.50.1"},"reference-count":26,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T00:00:00Z","timestamp":1775001600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T00:00:00Z","timestamp":1775001600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T00:00:00Z","timestamp":1775001600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T00:00:00Z","timestamp":1775001600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T00:00:00Z","timestamp":1775001600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T00:00:00Z","timestamp":1775001600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T00:00:00Z","timestamp":1775001600000},"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":[[2026,4]]},"DOI":"10.1016\/j.tcs.2026.115775","type":"journal-article","created":{"date-parts":[[2026,1,23]],"date-time":"2026-01-23T08:02:20Z","timestamp":1769155340000},"page":"115775","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":1,"special_numbering":"C","title":["Cluster vertex deletion problems on cubic graphs"],"prefix":"10.1016","volume":"1068","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0444-3496","authenticated-orcid":false,"given":"Irena","family":"Rusu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/j.tcs.2026.115775_bib0001","series-title":"Proceedings of the Third Annual International Conference on Computational Molecular Biology","first-page":"33","article-title":"Clustering gene expression patterns","author":"Ben-Dor","year":"1999"},{"issue":"21","key":"10.1016\/j.tcs.2026.115775_bib0002","doi-asserted-by":"crossref","first-page":"12123","DOI":"10.1073\/pnas.2032324100","article-title":"Protein complexes and functional modules in molecular networks","volume":"100","author":"Spirin","year":"2003","journal-title":"Proc. Natl. Acad. Sci."},{"issue":"6794","key":"10.1016\/j.tcs.2026.115775_bib0003","doi-asserted-by":"crossref","first-page":"378","DOI":"10.1038\/35019019","article-title":"Error and attack tolerance of complex networks","volume":"406","author":"Albert","year":"2000","journal-title":"Nature"},{"issue":"1","key":"10.1016\/j.tcs.2026.115775_bib0004","doi-asserted-by":"crossref","first-page":"196","DOI":"10.1007\/s00224-008-9150-x","article-title":"Fixed-parameter algorithms for cluster vertex deletion","volume":"47","author":"H\u00fcffner","year":"2010","journal-title":"Theory Comput. Syst."},{"key":"10.1016\/j.tcs.2026.115775_bib0005","series-title":"Exact Algorithms for s-Club Finding and Related Problems","author":"Sch\u00e4fer","year":"2009"},{"key":"10.1016\/j.tcs.2026.115775_bib0006","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1007\/s00453-004-1090-5","article-title":"Automated generation of search tree algorithms for hard graph modification problems","volume":"39","author":"Gramm","year":"2004","journal-title":"Algorithmica"},{"issue":"6","key":"10.1016\/j.tcs.2026.115775_bib0007","doi-asserted-by":"crossref","first-page":"559","DOI":"10.1016\/S0305-0548(99)00047-7","article-title":"Heuristics for finding k-clubs in an undirected graph","volume":"27","author":"Bourjolly","year":"2000","journal-title":"Comput. Oper. Res."},{"issue":"2","key":"10.1016\/j.tcs.2026.115775_bib0008","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1016\/0022-0000(80)90060-4","article-title":"The node-deletion problem for hereditary properties is NP-complete","volume":"20","author":"Lewis","year":"1980","journal-title":"J. Comput. Syst. Sci."},{"key":"10.1016\/j.tcs.2026.115775_bib0009","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/j.tcs.2018.05.039","article-title":"Vertex deletion problems on chordal graphs","volume":"745","author":"Cao","year":"2018","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/j.tcs.2026.115775_bib0010","doi-asserted-by":"crossref","first-page":"170","DOI":"10.1016\/j.dam.2023.11.048","article-title":"s-club cluster vertex deletion on interval and well-partitioned chordal graphs","volume":"345","author":"Chakraborty","year":"2024","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.tcs.2026.115775_bib0011","series-title":"International Workshop on Combinatorial Algorithms","first-page":"152","article-title":"Algorithms and complexity of s-club cluster vertex deletion","author":"Chakraborty","year":"2021"},{"key":"10.1016\/j.tcs.2026.115775_bib0012","series-title":"International Conference on Theory and Applications of Models of Computation","first-page":"103","article-title":"Analyzing the 3-path vertex cover problem in planar bipartite graphs","author":"Jena","year":"2022"},{"issue":"2","key":"10.1016\/j.tcs.2026.115775_bib0013","doi-asserted-by":"crossref","first-page":"505","DOI":"10.1007\/s00453-023-01144-w","article-title":"On the d-claw vertex deletion problem","volume":"86","author":"Hsieh","year":"2024","journal-title":"Algorithmica"},{"key":"10.1016\/j.tcs.2026.115775_bib0014","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1007\/s00224-015-9631-7","article-title":"A fast branching algorithm for cluster vertex deletion","volume":"58","author":"Boral","year":"2016","journal-title":"Theory Comput. Syst."},{"issue":"4","key":"10.1016\/j.tcs.2026.115775_bib0015","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1016\/0020-0190(96)00050-6","article-title":"Fixed-parameter tractability of graph modification problems for hereditary properties","volume":"58","author":"Cai","year":"1996","journal-title":"Inf. Process. Lett."},{"issue":"2","key":"10.1016\/j.tcs.2026.115775_bib0016","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1007\/s00224-020-10005-w","article-title":"Faster parameterized algorithm for cluster vertex deletion","volume":"65","author":"Tsur","year":"2021","journal-title":"Theory Comput. Syst."},{"key":"10.1016\/j.tcs.2026.115775_bib0017","doi-asserted-by":"crossref","first-page":"90","DOI":"10.1016\/j.tcs.2014.01.019","article-title":"Approximation algorithms for node deletion problems on bipartite graphs with finite forbidden subgraph characterization","volume":"526","author":"Kumar","year":"2014","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/j.tcs.2026.115775_bib0018","doi-asserted-by":"crossref","DOI":"10.1016\/j.tcs.2023.114041","article-title":"On the parameterized complexity of s-club cluster deletion problems","volume":"969","author":"Montecchiani","year":"2023","journal-title":"Theor. Comput. Sci."},{"issue":"12","key":"10.1016\/j.tcs.2026.115775_bib0019","doi-asserted-by":"crossref","first-page":"1189","DOI":"10.1016\/j.dam.2011.04.008","article-title":"Minimum k-path vertex cover","volume":"159","author":"Bre\u0161ar","year":"2011","journal-title":"Discrete Appl. Math."},{"issue":"50","key":"10.1016\/j.tcs.2026.115775_bib0020","doi-asserted-by":"crossref","first-page":"7044","DOI":"10.1016\/j.tcs.2011.09.013","article-title":"A primal\u2013dual approximation algorithm for the vertex cover P3 problem","volume":"412","author":"Tu","year":"2011","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"10.1016\/j.tcs.2026.115775_bib0021","doi-asserted-by":"crossref","first-page":"174","DOI":"10.1016\/0196-6774(86)90002-7","article-title":"Planar 3DM is NP-complete","volume":"7","author":"Dyer","year":"1986","journal-title":"J. Algorithms"},{"key":"10.1016\/j.tcs.2026.115775_bib0022","doi-asserted-by":"crossref","first-page":"250","DOI":"10.1007\/s00224-024-10161-3","article-title":"Complexity of the (connected) cluster vertex deletion problem on H-free graphs","volume":"68","author":"Le","year":"2024","journal-title":"Theory Comput. Syst."},{"issue":"1","key":"10.1016\/j.tcs.2026.115775_bib0023","doi-asserted-by":"crossref","first-page":"271","DOI":"10.4064\/fm-15-1-271-283","article-title":"Sur le probleme des courbes gauches en topologie","volume":"15","author":"Kuratowski","year":"1930","journal-title":"Fundamenta Mathematicae"},{"issue":"13","key":"10.1016\/j.tcs.2026.115775_bib0024","doi-asserted-by":"crossref","first-page":"481","DOI":"10.1016\/j.ipl.2013.04.002","article-title":"The vertex cover P3 problem in cubic graphs","volume":"113","author":"Tu","year":"2013","journal-title":"Inf. Process. Lett."},{"key":"10.1016\/j.tcs.2026.115775_bib0025","first-page":"241","article-title":"On computing the dissociation number and the induced matching number of bipartite graphs","volume":"72","author":"Boliac","year":"2004","journal-title":"Ars Combinatoria"},{"key":"10.1016\/j.tcs.2026.115775_bib0026","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1016\/j.dam.2014.10.033","article-title":"Computational complexity of minimum P4 vertex cover problem for regular and K1,4-free graphs","volume":"184","author":"Devi","year":"2015","journal-title":"Discrete Appl. Math."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397526000344?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397526000344?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T12:06:02Z","timestamp":1772193962000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397526000344"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,4]]},"references-count":26,"alternative-id":["S0304397526000344"],"URL":"https:\/\/doi.org\/10.1016\/j.tcs.2026.115775","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2026,4]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Cluster vertex deletion problems on cubic graphs","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.tcs.2026.115775","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 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":"115775"}}