Parameterized Lower Bounds and Dichotomy Results for the NP-completeness of H-free Edge Modification Problems

N. R. Aravind, R. B. Sandeep, Naveen Sivadasan. Parameterized Lower Bounds and Dichotomy Results for the NP-completeness of H-free Edge Modification Problems. In Evangelos Kranakis, Gonzalo Navarro, Edgar Chávez, editors, LATIN 2016: Theoretical Informatics - 12th Latin American Symposium, Ensenada, Mexico, April 11-15, 2016, Proceedings. Volume 9644 of Lecture Notes in Computer Science, pages 82-95, Springer, 2016. [doi]

Abstract

Abstract is missing.