Publication:5111863
From MaRDI portal
DOI10.4230/LIPIcs.IPEC.2017.4zbMath1443.68120MaRDI QIDQ5111863
Ignasi Sau, Dimitrios M. Thilikos, Julien Baste
Publication date: 27 May 2020
dynamic programming; treewidth; parameterized complexity; graph minors; exponential time hypothesis; topological minors; hitting minors
68W40: Analysis of algorithms
68R10: Graph theory (including graph drawing) in computer science
05C83: Graph minors
05C85: Graph algorithms (graph-theoretic aspects)
68Q27: Parameterized complexity, tractability and kernelization
