"Subexponential-Time Algorithms for Finding Large Induced Sparse Subgraphs."

Jana Novotná et al. (2019)
a service of Schloss Dagstuhl - Leibniz Center for Informatics