@InProceedings{bliznets_et_al:LIPIcs.APPROX-RANDOM.2016.3,
author = {Bliznets, Ivan and Cygan, Marek and Komosa, Pawel and Pilipczuk, Michal},
title = {{Hardness of Approximation for H-Free Edge Modification Problems}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2016)},
pages = {3:1--3:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-018-7},
ISSN = {1868-8969},
year = {2016},
volume = {60},
editor = {Jansen, Klaus and Mathieu, Claire and Rolim, Jos\'{e} D. P. and Umans, Chris},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2016.3},
URN = {urn:nbn:de:0030-drops-66260},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2016.3},
annote = {Keywords: hardness of approximation, parameterized complexity, kernelization, edge modification problems}
}