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.

Parameterized Complexity of Connected Even/Odd Subgraph Problems

Fedor V. Fomin, Petr A. Golovach. Parameterized Complexity of Connected Even/Odd Subgraph Problems. In Christoph Dürr, Thomas Wilke, editors, 29th International Symposium on Theoretical Aspects of Computer Science, STACS 2012, February 29th - March 3rd, 2012, Paris, France. Volume 14 of LIPIcs, pages 432-440, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2012. [doi]

Authors

Fedor V. Fomin

This author has not been identified. Look up 'Fedor V. Fomin' in Google

Petr A. Golovach

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