Published in: LIPIcs, Volume 248, 33rd International Symposium on Algorithms and Computation (ISAAC 2022)
Tatiana Belova and Ivan Bliznets. Hardness of Approximation for H-Free Edge Modification Problems: Towards a Dichotomy. In 33rd International Symposium on Algorithms and Computation (ISAAC 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 248, pp. 24:1-24:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{belova_et_al:LIPIcs.ISAAC.2022.24, author = {Belova, Tatiana and Bliznets, Ivan}, title = {{Hardness of Approximation for H-Free Edge Modification Problems: Towards a Dichotomy}}, booktitle = {33rd International Symposium on Algorithms and Computation (ISAAC 2022)}, pages = {24:1--24:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-258-7}, ISSN = {1868-8969}, year = {2022}, volume = {248}, editor = {Bae, Sang Won and Park, Heejin}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2022.24}, URN = {urn:nbn:de:0030-drops-173097}, doi = {10.4230/LIPIcs.ISAAC.2022.24}, annote = {Keywords: Parameterized complexity, Hardness of approximation, Edge modification problems} }
Feedback for Dagstuhl Publishing