Broersma, Hajo
Golovach, Petr A.
Patel, Viresh
This article is maintained by: Elsevier
Article Title: Tight complexity bounds for FPT subgraph problems parameterized by the clique-width
Journal Title: Theoretical Computer Science
CrossRef DOI link to publisher maintained version: https://doi.org/10.1016/j.tcs.2013.03.008
Content Type: article
Copyright: Copyright © 2013 Elsevier B.V. All rights reserved.