@InProceedings{garbe_et_al:LIPIcs.STACS.2016.38,
author = {Garbe, Frederik and Mycroft, Richard},
title = {{The Complexity of the Hamilton Cycle Problem in Hypergraphs of High Minimum Codegree}},
booktitle = {33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016)},
pages = {38:1--38:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-001-9},
ISSN = {1868-8969},
year = {2016},
volume = {47},
editor = {Ollinger, Nicolas and Vollmer, Heribert},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2016.38},
URN = {urn:nbn:de:0030-drops-57392},
doi = {10.4230/LIPIcs.STACS.2016.38},
annote = {Keywords: Hamilton cycles, hypergraphs, graph algorithms}
}