Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.
Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.
Hajo Broersma, Petr A. Golovach, Viresh Patel. Tight complexity bounds for FPT subgraph problems parameterized by the clique-width. Theoretical Computer Science, 485:69-84, 2013. [doi]
Abstract is missing.