{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,2]],"date-time":"2025-08-02T14:48:00Z","timestamp":1754146080471,"version":"3.41.2"},"publisher-location":"Cham","reference-count":14,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031987397","type":"print"},{"value":"9783031987403","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025]]},"DOI":"10.1007\/978-3-031-98740-3_28","type":"book-chapter","created":{"date-parts":[[2025,7,17]],"date-time":"2025-07-17T23:48:41Z","timestamp":1752796121000},"page":"391-404","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Bicriteria FPT-Approximation Algorithms for\u00a0Vertex Deletion to\u00a0Bounded Degeneracy Graphs"],"prefix":"10.1007","author":[{"given":"Tanmay","family":"Inamdar","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lawqueen","family":"Kanesh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R.","family":"Krithika","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Harshil","family":"Mittal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Saket","family":"Saurabh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,7,18]]},"reference":[{"issue":"3","key":"28_CR1","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1016\/0168-0072(94)00034-Z","volume":"73","author":"KR Abrahamson","year":"1995","unstructured":"Abrahamson, K.R., Downey, R.G., Fellows, M.R.: Fixed-parameter tractability and completeness IV: on completeness for W[P] and PSPACE analogues. Ann. Pure Appl. Log. 73(3), 235\u2013276 (1995). https:\/\/doi.org\/10.1016\/0168-0072(94)00034-Z","journal-title":"Ann. Pure Appl. Log."},{"issue":"4","key":"28_CR2","doi-asserted-by":"publisher","first-page":"544","DOI":"10.1007\/S00453-008-9204-0","volume":"54","author":"N Alon","year":"2009","unstructured":"Alon, N., Gutner, S.: Linear time algorithms for finding a dominating set of fixed size in degenerated graphs. Algorithmica 54(4), 544\u2013556 (2009). https:\/\/doi.org\/10.1007\/S00453-008-9204-0","journal-title":"Algorithmica"},{"key":"28_CR3","doi-asserted-by":"publisher","unstructured":"Bar-Yehuda, R., Bendel, K., Freund, A., Rawitz, D.: Local ratio: a unified framework for approximation algorithms. In memoriam: Shimon even 1935-2004. ACM Comput. Surv. 36(4), 422\u2013463 (2004). https:\/\/doi.org\/10.1145\/1041680.1041683","DOI":"10.1145\/1041680.1041683"},{"key":"28_CR4","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1613\/JAIR.638","volume":"12","author":"A Becker","year":"2000","unstructured":"Becker, A., Bar-Yehuda, R., Geiger, D.: Randomized algorithms for the loop cutset problem. J. Artif. Intell. Res. 12, 219\u2013234 (2000). https:\/\/doi.org\/10.1613\/JAIR.638","journal-title":"J. Artif. Intell. Res."},{"key":"28_CR5","unstructured":"Cai, L., Kloks, T.: Parameterized tractability of some (efficient) y-domination variants for planar graphs and t-degenerate graphs. In: Proceedings International Computer Symposium 2000 (2000)"},{"key":"28_CR6","doi-asserted-by":"publisher","unstructured":"Cygan, M., et al.: Parameterized Algorithms. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-21275-3","DOI":"10.1007\/978-3-319-21275-3"},{"key":"28_CR7","doi-asserted-by":"publisher","unstructured":"Demaine, E.D., et al.: Structural rounding: approximation algorithms for graphs near an algorithmically tractable class. In: 27th Annual European Symposium on Algorithms, ESA 2019. LIPIcs, vol.\u00a0144, pp. 37:1\u201337:15. Leibniz-Zentrum f\u00fcr Informatik (2019). https:\/\/doi.org\/10.4230\/LIPIcs.ESA.2019.37","DOI":"10.4230\/LIPIcs.ESA.2019.37"},{"key":"28_CR8","doi-asserted-by":"crossref","unstructured":"Diestel, R.: Graph Theory, Graduate Texts in Mathematics, 4th edn., vol.\u00a0173. Springer (2012)","DOI":"10.1007\/978-3-662-53622-3_7"},{"key":"28_CR9","doi-asserted-by":"publisher","unstructured":"Fomin, F.V., Lokshtanov, D., Misra, N., Saurabh, S.: Planar f-deletion: approximation, kernelization and optimal FPT algorithms. In: 53rd Annual IEEE Symposium on Foundations of Computer Science, FOCS 2012, pp. 470\u2013479. IEEE Computer Society (2012). https:\/\/doi.org\/10.1109\/FOCS.2012.62","DOI":"10.1109\/FOCS.2012.62"},{"key":"28_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/978-3-540-92248-3_18","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"PA Golovach","year":"2008","unstructured":"Golovach, P.A., Villanger, Y.: Parameterized complexity for domination problems on degenerate graphs. In: Broersma, H., Erlebach, T., Friedetzky, T., Paulusma, D. (eds.) WG 2008. LNCS, vol. 5344, pp. 195\u2013205. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-92248-3_18"},{"issue":"8","key":"28_CR11","doi-asserted-by":"publisher","first-page":"1243","DOI":"10.1007\/S00224-021-10045-W","volume":"65","author":"J Luo","year":"2021","unstructured":"Luo, J., Molter, H., Such\u00fd, O.: A parameterized complexity view on collapsing k-cores. Theory Comput. Syst. 65(8), 1243\u20131282 (2021). https:\/\/doi.org\/10.1007\/S00224-021-10045-W","journal-title":"Theory Comput. Syst."},{"issue":"34\u201336","key":"28_CR12","doi-asserted-by":"publisher","first-page":"3181","DOI":"10.1016\/j.tcs.2010.05.015","volume":"411","author":"L Mathieson","year":"2010","unstructured":"Mathieson, L.: The parameterized complexity of editing graphs for bounded degeneracy. Theor. Comput. Sci. 411(34\u201336), 3181\u20133187 (2010). https:\/\/doi.org\/10.1016\/j.tcs.2010.05.015","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"28_CR13","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1145\/2402.322385","volume":"30","author":"DW Matula","year":"1983","unstructured":"Matula, D.W., Beck, L.L.: Smallest-last ordering and clustering and graph coloring algorithms. J. ACM 30(3), 417\u2013427 (1983). https:\/\/doi.org\/10.1145\/2402.322385","journal-title":"J. ACM"},{"key":"28_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-642-33293-7_3","volume-title":"Parameterized and Exact Computation","author":"M Pilipczuk","year":"2012","unstructured":"Pilipczuk, M., Pilipczuk, M.: Finding a maximum induced degenerate subgraph faster than 2$$^{n}$$. In: Thilikos, D.M., Woeginger, G.J. (eds.) IPEC 2012. LNCS, vol. 7535, pp. 3\u201312. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-33293-7_3"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-98740-3_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,17]],"date-time":"2025-07-17T23:48:42Z","timestamp":1752796122000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-98740-3_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031987397","9783031987403"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-98740-3_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"18 July 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IWOCA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Combinatorial Algorithms","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Bozeman, MT","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 July 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 July 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"36","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iwoca2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.cs.montana.edu\/bhz\/iwoca2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}