Before revision:  This also generalizes previous work of ours Gartland and Lokshtanov, FOCS '20 , with an additional factor of \log^2(n) in the exponent, where we provided a quasi-polynomial time algorithm for graphs that exclude a path on k vertices as an induced subgraph-free graphs, and by being applicable to a much wider variety of problems, such as }{\sc{Maximum Weight Induced Forest}} {\sc{Maximum Weight Induced Planar Graph}} .
After revision:  This also generalizes previous work of ours Gartland and Lokshtanov, FOCS '20 , with an additional factor of \log^2(n) in the exponent, where we provided a quasi-polynomial time algorithm for graphs that exclude a path on k vertices as an induced subgraph-free graphs, and by being applicable to a much wider variety of problems, such as }{\sc{Maximum Weight Induced Forest}} or{\sc{Maximum Weight Induced Planar Graph}} .