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.

On the Hardness of Eliminating Small Induced Subgraphs by Contracting Edges

Daniel Lokshtanov, Neeldhara Misra, Saket Saurabh. On the Hardness of Eliminating Small Induced Subgraphs by Contracting Edges. In Gregory Gutin, Stefan Szeider, editors, Parameterized and Exact Computation - 8th International Symposium, IPEC 2013, Sophia Antipolis, France, September 4-6, 2013, Revised Selected Papers. Volume 8246 of Lecture Notes in Computer Science, pages 243-254, Springer, 2013. [doi]

Authors

Daniel Lokshtanov

This author has not been identified. Look up 'Daniel Lokshtanov' in Google

Neeldhara Misra

This author has not been identified. Look up 'Neeldhara Misra' in Google

Saket Saurabh

This author has not been identified. Look up 'Saket Saurabh' in Google
runs on