Bicriteria \textsf{FPT}-approximation algorithms for vertex deletion to bounded degeneracy graphs

DOI10.1007/978-3-031-98740-3_28MaRDI QIDQ6876376zbMATH OpenFDO

Authors Tanmay Inamdar, Lawqueen Kanesh, R. Krithika, Harshil Mittal, Saket Saurabh

Publication date 13 January 2026

Full work available at URL https://doi.org/10.1007/978-3-031-98740-3_28

Mathematics Subject Classification ID

Discrete mathematics in relation to computer science (68Rxx) Algorithms in computer science (68Wxx)

Cites work

• \textsc{Planar} \(\mathcal{F}\)-\textsc{deletion}: approximation, kernelization and optimal FPT algorithms
• A parameterized complexity view on collapsing \(k\)-cores
• Finding a maximum induced degenerate subgraph faster than \(2^{n}\)
• Fixed-parameter tractability and completeness. IV: On completeness for W\([\) P\(]\) and PSPACE analogues
• scientific article; zbMATH DE number 1467487 (Why is no real title available?)
• scientific article; zbMATH DE number 7525474 (Why is no real title available?)
• Linear time algorithms for finding a dominating set of fixed size in degenerated graphs
• Parameterized algorithms
• Parameterized Complexity for Domination Problems on Degenerate Graphs
• Smallest-last ordering and clustering and graph coloring algorithms
• The parameterized complexity of editing graphs for bounded degeneracy

This page was built for publication: Bicriteria \textsf{FPT}-approximation algorithms for vertex deletion to bounded degeneracy graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6876376)