DOI10.4230/LIPIcs.IPEC.2018.2MaRDI QIDQ5009462
Ignasi Sau, Dimitrios M. Thilikos, Julien Baste
Publication date: 4 August 2021
zbMATH Keywords
dynamic programming; treewidth; parameterized complexity; graph minors; exponential time hypothesis; topological minors; hitting minors
Mathematics Subject Classification ID
68Q25: Analysis of algorithms and problem complexity
68Wxx: Algorithms in computer science