@InProceedings{bosboom_et_al:LIPIcs.FUN.2018.11,
author = {Bosboom, Jeffrey and Demaine, Erik D. and Rudoy, Mikhail},
title = {{Computational Complexity of Generalized Push Fight}},
booktitle = {9th International Conference on Fun with Algorithms (FUN 2018)},
pages = {11:1--11:21},
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.11},
URN = {urn:nbn:de:0030-drops-88029},
doi = {10.4230/LIPIcs.FUN.2018.11},
annote = {Keywords: board games, hardness, mate-in-one}
}