@InProceedings{chen_et_al:LIPIcs.IPEC.2018.15,
author = {Chen, Hubie and Jansen, Bart M. P. and Pieterse, Astrid},
title = {{Best-Case and Worst-Case Sparsifiability of Boolean CSPs}},
booktitle = {13th International Symposium on Parameterized and Exact Computation (IPEC 2018)},
pages = {15:1--15:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-084-2},
ISSN = {1868-8969},
year = {2019},
volume = {115},
editor = {Paul, Christophe and Pilipczuk, Michal},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2018.15},
URN = {urn:nbn:de:0030-drops-102169},
doi = {10.4230/LIPIcs.IPEC.2018.15},
annote = {Keywords: constraint satisfaction problems, kernelization, sparsification, lower bounds}
}