scientific article; zbMATH DE number 7650231

DOI10.4230/LIPIcs.IPEC.2019.23MaRDI QIDQ5875557

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

Publication date: 3 February 2023

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

string graphsfeedback vertex setsubexponential algorithm\(P_t\)-free graphs

Mathematics Subject Classification ID

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

Related Items (2)

Unnamed Item ⋮ Subexponential-time algorithms for finding large induced sparse subgraphs

This page was built for publication: