@InProceedings{gunda_et_al:LIPIcs.APPROX/RANDOM.2020.51,
author = {Gunda, Spoorthy and Jain, Pallavi and Lokshtanov, Daniel and Saurabh, Saket and Tale, Prafullkumar},
title = {{On the Parameterized Approximability of Contraction to Classes of Chordal Graphs}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2020)},
pages = {51:1--51:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-164-1},
ISSN = {1868-8969},
year = {2020},
volume = {176},
editor = {Byrka, Jaros{\l}aw and Meka, Raghu},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2020.51},
URN = {urn:nbn:de:0030-drops-126545},
doi = {10.4230/LIPIcs.APPROX/RANDOM.2020.51},
annote = {Keywords: Graph Contraction, FPT-Approximation, Inapproximability, Lossy Kernels}
}