Bicriteria FPT-approximation algorithms for vertex deletion to bounded degeneracy graphs

dc.contributor.author	Inamdar, Tanmay
dc.contributor.author	Kanesh, Lawqueen
dc.contributor.author	Krithika, R.
dc.contributor.author	Mittal, Harshil
dc.contributor.author	Saurabh, Saket
dc.coverage.spatial	United States of America
dc.date.accessioned	2025-08-01T07:02:19Z
dc.date.available	2025-08-01T07:02:19Z
dc.date.issued	2025-07-21
dc.identifier.citation	Inamdar, Tanmay; Kanesh, Lawqueen; Krithika, R.; Mittal, Harshil and Saurabh, Saket, "Bicriteria FPT-approximation algorithms for vertex deletion to bounded degeneracy graphs", in the 36th International Workshop on Combinatorial Algorithms (IWOCA 2025), Bozeman, US, Jul. 21-24, 2025
dc.identifier.uri	https://doi.org/10.1007/978-3-031-98740-3_28
dc.identifier.uri	https://repository.iitgn.ac.in/handle/123456789/11712
dc.description.statementofresponsibility	by Tanmay Inamdar, Lawqueen Kanesh, R. Krithika, Harshil Mittal and Saket Saurabh
dc.language.iso	en_US
dc.publisher	Springer
dc.title	Bicriteria FPT-approximation algorithms for vertex deletion to bounded degeneracy graphs
dc.type	Conference Paper
dc.relation.journal	36th International Workshop on Combinatorial Algorithms (IWOCA 2025)