Characterizing the easy-to-find subgraphs from the viewpoint of polynomial-time algorithms, kernels, and Turing kernels.

Bart M. P. Jansen, Dniel Marx

Browse the full SODA paper archive.