@InProceedings{barbay_et_al:LIPIcs.FUN.2021.23,
author = {Barbay, J\'{e}r\'{e}my and Subercaseaux, Bernardo},
title = {{The Computational Complexity of Evil Hangman}},
booktitle = {10th International Conference on Fun with Algorithms (FUN 2021)},
pages = {23:1--23:12},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-145-0},
ISSN = {1868-8969},
year = {2020},
volume = {157},
editor = {Farach-Colton, Martin and Prencipe, Giuseppe and Uehara, Ryuhei},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FUN.2021.23},
URN = {urn:nbn:de:0030-drops-127840},
doi = {10.4230/LIPIcs.FUN.2021.23},
annote = {Keywords: combinatorial game theory, computational complexity, decidability, hangman}
}