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]
No references recorded for this publication.
No citations of this publication recorded.