“…There is a large body of work in the theory of parameterized complexity, where F-Deletion for many F's is shown to be in FPT or even admits a polynomial kernel. The list of such F's includes chordal graphs [24,17,3], interval graphs [8,7,4], distance-hereditary graphs [11,19], bipartite graphs [26,22], and graphs with bounded treewidth [14,21].…”