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 Finding Regular Induced Subgraphs

Hannes Moser, Dimitrios M. Thilikos. Parameterized Complexity of Finding Regular Induced Subgraphs. In Hajo Broersma, Stefan S. Dantchev, Matthew Johnson 0002, Stefan Szeider, editors, Algorithms and Complexity in Durham 2006 - Proceedings of the Second ACiD Workshop, 18-20 September 2006, Durham, UK. Volume 7 of Texts in Algorithmics, pages 107-118, King s College, London, 2006.

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.

runs on