@InProceedings{kanesh_et_al:LIPIcs.STACS.2022.39,
author = {Kanesh, Lawqueen and Madathil, Jayakrishnan and Roy, Sanjukta and Sahu, Abhishek and Saurabh, Saket},
title = {{Further Exploiting c-Closure for FPT Algorithms and Kernels for Domination Problems}},
booktitle = {39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022)},
pages = {39:1--39:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-222-8},
ISSN = {1868-8969},
year = {2022},
volume = {219},
editor = {Berenbrink, Petra and Monmege, Benjamin},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2022.39},
URN = {urn:nbn:de:0030-drops-158494},
doi = {10.4230/LIPIcs.STACS.2022.39},
annote = {Keywords: c-closed graphs, domination problems, perfect code, connected dominating set, fixed-parameter tractable, polynomial kernel}
}