Hajo Broersma, Petr A. Golovach, Viresh Patel. Tight Complexity Bounds for FPT Subgraph Problems Parameterized by Clique-Width. In Dániel Marx, Peter Rossmanith, editors, Parameterized and Exact Computation - 6th International Symposium, IPEC 2011, Saarbrücken, Germany, September 6-8, 2011. Revised Selected Papers. Volume 7112 of Lecture Notes in Computer Science, pages 207-218, Springer, 2011. [doi]
Abstract is missing.