pdf-format: |
|
@InProceedings{bodlaender_et_al:LIPIcs:2018:8800, author = {Hans L. Bodlaender and Tom C. van der Zanden}, 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 = {Hiro Ito and Stefano Leonardi and Linda Pagli and Giuseppe Prencipe}, publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik}, address = {Dagstuhl, Germany}, URL = {http://drops.dagstuhl.de/opus/volltexte/2018/8800}, URN = {urn:nbn:de:0030-drops-88001}, doi = {10.4230/LIPIcs.FUN.2018.9}, annote = {Keywords: polyomino packing, exact complexity, exponential time hypothesis} }
Keywords: | polyomino packing, exact complexity, exponential time hypothesis | |
Seminar: | 9th International Conference on Fun with Algorithms (FUN 2018) | |
Issue date: | 2018 | |
Date of publication: | 04.06.2018 |