pdfformat: 

@InProceedings{hlinen_et_al:LIPIcs:2016:5934, author = {Petr Hlinen{\'y} and Marek Dern{\'a}r}, title = {{Crossing Number is Hard for Kernelization}}, booktitle = {32nd International Symposium on Computational Geometry (SoCG 2016)}, pages = {42:142:10}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783959770095}, ISSN = {18688969}, year = {2016}, volume = {51}, editor = {S{\'a}ndor Fekete and Anna Lubiw}, publisher = {Schloss DagstuhlLeibnizZentrum fuer Informatik}, address = {Dagstuhl, Germany}, URL = {http://drops.dagstuhl.de/opus/volltexte/2016/5934}, URN = {urn:nbn:de:0030drops59347}, doi = {10.4230/LIPIcs.SoCG.2016.42}, annote = {Keywords: crossing number; tile crossing number; parameterized complexity; polynomial kernel; crosscomposition} }
Keywords:  crossing number; tile crossing number; parameterized complexity; polynomial kernel; crosscomposition  
Seminar:  32nd International Symposium on Computational Geometry (SoCG 2016)  
Issue date:  2016  
Date of publication:  2016 