A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
Towards exact structural thresholds for parameterized complexity
[article]

2021
*
arXiv
*
pre-print

Parameterized complexity seeks to use input structure to obtain faster algorithms for NP-hard problems. This has been most successful for graphs of low treewidth: Many problems admit fast algorithms relative to treewidth and many of them are optimal under SETH. Fewer such results are known for more general structure such as low clique-width and more restrictive structure such as low deletion distance to a sparse graph class. Despite these successes, such results remain "islands" within the

arXiv:2107.06111v1
fatcat:if7kfrfzsjfudchcbzphxchjpq