FPT is characterized by useful obstruction sets: Connecting algorithms, kernels, and quasi-orders

Michael R. Fellows, Bart M. P. Jansen. FPT is characterized by useful obstruction sets: Connecting algorithms, kernels, and quasi-orders. TOCT, 6(4):16, 2014. [doi]

Abstract

Abstract is missing.