scientific article; zbMATH DE number 7650231

DOI10.4230/LIPICS.IPEC.2019.23MaRDI QIDQ5875557zbMATH OpenFDO

Authors Jana Novotná, Karolina Okrasa, Michał Pilipczuk, Paweł Rzążewski, Erik Jan van Leeuwen, Bartosz Walczak

Publication date 3 February 2023

Full work available at URL https://doi.org/10.4230/LIPICS.IPEC.2019.23

zbMATH Keywords

\(P_t\)-free graphsfeedback vertex setstring graphssubexponential algorithm

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Parameterized complexity, tractability and kernelization (68Q27) Algorithms in computer science (68Wxx)

Recommendations

• Subexponential-time algorithms for finding large induced sparse subgraphs
• Planar induced subgraphs of sparse graphs
• Planar induced subgraphs of sparse graphs
• Large induced subgraphs via triangulations and CMSO
• Finding induced subgraphs via minimal triangulations

Cited in

(6)

• Subexponential-time algorithms for finding large induced sparse subgraphs
• Large Induced Subgraphs via Triangulations and CMSO
• Planar induced subgraphs of sparse graphs
• Large induced subgraphs via triangulations and CMSO
• scientific article; zbMATH DE number 7651174 (Why is no real title available?)
• Quasipolynomiality of the Smallest Missing Induced Subgraph

This page was built for publication:

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