@InProceedings{bodlaender_et_al:LIPIcs.FUN.2018.9,
author = {Bodlaender, Hans L. and van der Zanden, Tom C.},
title = {{On the Exact Complexity of Polyomino Packing}},
booktitle = {9th International Conference on Fun with Algorithms (FUN 2018)},
pages = {9:1--9:10},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-067-5},
ISSN = {1868-8969},
year = {2018},
volume = {100},
editor = {Ito, Hiro and Leonardi, Stefano and Pagli, Linda and Prencipe, Giuseppe},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FUN.2018.9},
URN = {urn:nbn:de:0030-drops-88001},
doi = {10.4230/LIPIcs.FUN.2018.9},
annote = {Keywords: polyomino packing, exact complexity, exponential time hypothesis}
}