@InProceedings{koana_et_al:LIPIcs.ISAAC.2021.35,
author = {Koana, Tomohiro and Komusiewicz, Christian and Sommer, Frank},
title = {{Essentially Tight Kernels For (Weakly) Closed Graphs}},
booktitle = {32nd International Symposium on Algorithms and Computation (ISAAC 2021)},
pages = {35:1--35:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-214-3},
ISSN = {1868-8969},
year = {2021},
volume = {212},
editor = {Ahn, Hee-Kap and Sadakane, Kunihiko},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2021.35},
URN = {urn:nbn:de:0030-drops-154681},
doi = {10.4230/LIPIcs.ISAAC.2021.35},
annote = {Keywords: Fixed-parameter tractability, kernelization, c-closure, weak \gamma-closure, Independent Set, Induced Matching, Connected Vertex Cover, Ramsey numbers, Dominating Set}
}