External Links

Cite Key

Statistics

  • References: 0
  • Cited by: 0
  • Reviews: 0
  • Bibliographies: 0

PDF

Researchr

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.

Tight Complexity Bounds for FPT Subgraph Problems Parameterized by Clique-Width

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]

Authors

Hajo Broersma

This author has not been identified. Look up 'Hajo Broersma' in Google

Petr A. Golovach

This author has not been identified. Look up 'Petr A. Golovach' in Google

Viresh Patel

This author has not been identified. Look up 'Viresh Patel' in Google
runs on