@InProceedings{hlineny_et_al:LIPIcs.SoCG.2016.42,
author = {Hlinen\'{y}, Petr and Dern\'{a}r, Marek},
title = {{Crossing Number is Hard for Kernelization}},
booktitle = {32nd International Symposium on Computational Geometry (SoCG 2016)},
pages = {42:1--42:10},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-009-5},
ISSN = {1868-8969},
year = {2016},
volume = {51},
editor = {Fekete, S\'{a}ndor and Lubiw, Anna},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2016.42},
URN = {urn:nbn:de:0030-drops-59347},
doi = {10.4230/LIPIcs.SoCG.2016.42},
annote = {Keywords: crossing number; tile crossing number; parameterized complexity; polynomial kernel; cross-composition}
}