Peter Allen, Christoph Koch 0008, Olaf Parczyk, Yury Person. Finding Tight Hamilton Cycles in Random Hypergraphs Faster. In Michael A. Bender, Martin Farach-Colton, Miguel A. Mosteiro, editors, LATIN 2018: Theoretical Informatics - 13th Latin American Symposium, Buenos Aires, Argentina, April 16-19, 2018, Proceedings. Volume 10807 of Lecture Notes in Computer Science, pages 28-36, Springer, 2018. [doi]
@inproceedings{AllenKPP18,
title = {Finding Tight Hamilton Cycles in Random Hypergraphs Faster},
author = {Peter Allen and Christoph Koch 0008 and Olaf Parczyk and Yury Person},
year = {2018},
doi = {10.1007/978-3-319-77404-6_3},
url = {https://doi.org/10.1007/978-3-319-77404-6_3},
researchr = {https://researchr.org/publication/AllenKPP18},
cites = {0},
citedby = {0},
pages = {28-36},
booktitle = {LATIN 2018: Theoretical Informatics - 13th Latin American Symposium, Buenos Aires, Argentina, April 16-19, 2018, Proceedings},
editor = {Michael A. Bender and Martin Farach-Colton and Miguel A. Mosteiro},
volume = {10807},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-319-77404-6},
}