{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,28]],"date-time":"2026-05-28T15:04:32Z","timestamp":1779980672854,"version":"3.53.1"},"reference-count":15,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"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,7]]},"DOI":"10.1016\/j.tcs.2026.116019","type":"journal-article","created":{"date-parts":[[2026,5,15]],"date-time":"2026-05-15T15:29:43Z","timestamp":1778858983000},"page":"116019","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Bicriteria FPT-approximation algorithms for vertex deletion to bounded degeneracy graphs"],"prefix":"10.1016","volume":"1079","author":[{"given":"Tanmay","family":"Inamdar","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Lawqueen","family":"Kanesh","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5319-7981","authenticated-orcid":false,"given":"R.","family":"Krithika","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Harshil","family":"Mittal","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Saket","family":"Saurabh","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/j.tcs.2026.116019_bib0001","article-title":"Graph Theory, 4th Edition","volume":"173","author":"Diestel","year":"2012"},{"issue":"3","key":"10.1016\/j.tcs.2026.116019_bib0002","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1145\/2402.322385","article-title":"Smallest-last ordering and clustering and graph coloring algorithms","volume":"30","author":"Matula","year":"1983","journal-title":"J. ACM"},{"issue":"4","key":"10.1016\/j.tcs.2026.116019_bib0003","doi-asserted-by":"crossref","first-page":"544","DOI":"10.1007\/s00453-008-9204-0","article-title":"Linear time algorithms for finding a dominating set of fixed size in degenerated graphs","volume":"54","author":"Alon","year":"2009","journal-title":"Algorithmica"},{"key":"10.1016\/j.tcs.2026.116019_bib0004","series-title":"Proceedings International Computer Symposium 2000","article-title":"Parameterized tractability of some (Efficient) Y-domination variants for planar graphs and t-degenerate graphs","author":"Cai","year":"2000"},{"key":"10.1016\/j.tcs.2026.116019_bib0005","series-title":"Graph-Theoretic Concepts in Computer Science, 34th International Workshop, WG 2008","first-page":"195","article-title":"Parameterized complexity for domination problems on degenerate graphs","volume":"5344","author":"Golovach","year":"2008"},{"issue":"3","key":"10.1016\/j.tcs.2026.116019_bib0006","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1016\/0168-0072(94)00034-Z","article-title":"Fixed-parameter tractability and completeness IV: on completeness for W[P] and PSPACE analogues","volume":"73","author":"Abrahamson","year":"1995","journal-title":"Ann. Pure Appl. Log."},{"issue":"34\u201336","key":"10.1016\/j.tcs.2026.116019_bib0007","doi-asserted-by":"crossref","first-page":"3181","DOI":"10.1016\/j.tcs.2010.05.015","article-title":"The parameterized complexity of editing graphs for bounded degeneracy","volume":"411","author":"Mathieson","year":"2010","journal-title":"Theor. Comput. Sci."},{"issue":"8","key":"10.1016\/j.tcs.2026.116019_bib0008","doi-asserted-by":"crossref","first-page":"1243","DOI":"10.1007\/s00224-021-10045-w","article-title":"A parameterized complexity view on collapsing k-cores","volume":"65","author":"Luo","year":"2021","journal-title":"Theory Comput. Syst."},{"key":"10.1016\/j.tcs.2026.116019_bib0009","series-title":"Parameterized and Exact Computation - 7th International Symposium, IPEC 2012","first-page":"3","article-title":"Finding a maximum induced degenerate subgraph faster than 2n","volume":"7535","author":"Pilipczuk","year":"2012"},{"key":"10.1016\/j.tcs.2026.116019_bib0010","series-title":"27th Annual European Symposium on Algorithms, ESA 2019","first-page":"37:1","article-title":"Structural rounding: approximation algorithms for graphs near an algorithmically tractable class","volume":"144","author":"Demaine","year":"2019"},{"key":"10.1016\/j.tcs.2026.116019_bib0011","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1613\/jair.638","article-title":"Randomized algorithms for the loop cutset problem","volume":"12","author":"Becker","year":"2000","journal-title":"J. Artif. Intell. Res."},{"key":"10.1016\/j.tcs.2026.116019_bib0012","series-title":"Parameterized Algorithms","author":"Cygan","year":"2015"},{"issue":"4","key":"10.1016\/j.tcs.2026.116019_bib0013","doi-asserted-by":"crossref","first-page":"422","DOI":"10.1145\/1041680.1041683","article-title":"Local ratio: a unified framework for approximation algorithms. In memoriam: Shimon even 1935\u20132004","volume":"36","author":"Bar-Yehuda","year":"2004","journal-title":"ACM Comput. Surv."},{"key":"10.1016\/j.tcs.2026.116019_bib0014","series-title":"53rd Annual IEEE Symposium on Foundations of Computer Science, FOCS 2012","first-page":"470","article-title":"Planar F-deletion: approximation, kernelization and optimal FPT algorithms","author":"Fomin","year":"2012"},{"key":"10.1016\/j.tcs.2026.116019_bib0015","series-title":"Matroid Theory","author":"Oxley","year":"1992"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397526002690?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397526002690?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,5,28]],"date-time":"2026-05-28T14:24:24Z","timestamp":1779978264000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397526002690"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,7]]},"references-count":15,"alternative-id":["S0304397526002690"],"URL":"https:\/\/doi.org\/10.1016\/j.tcs.2026.116019","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2026,7]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Bicriteria FPT-approximation algorithms for vertex deletion to bounded degeneracy graphs","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.tcs.2026.116019","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":"116019"}}