@InProceedings{jansen_et_al:LIPIcs.IPEC.2023.29,
author = {Jansen, Bart M. P. and Roy, Shivesh K.},
title = {{Sunflowers Meet Sparsity: A Linear-Vertex Kernel for Weighted Clique-Packing on Sparse Graphs}},
booktitle = {18th International Symposium on Parameterized and Exact Computation (IPEC 2023)},
pages = {29:1--29:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-305-8},
ISSN = {1868-8969},
year = {2023},
volume = {285},
editor = {Misra, Neeldhara and Wahlstr\"{o}m, Magnus},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2023.29},
URN = {urn:nbn:de:0030-drops-194488},
doi = {10.4230/LIPIcs.IPEC.2023.29},
annote = {Keywords: kernelization, weighted problems, graph packing, sunflower lemma, bounded expansion, nowhere dense}
}