In: 41st International Symposium on Mathematical Foundations of Computer Science, MFCS 2016 Schloss Dagstuhl Leibniz-Zentrum für Informatik, Dagstuhl, pp. 21:1-21:14. ISSN 1868-8969
In: 8th International Conference on Fun with Algorithms, FUN 2016 Leibniz International Proceedings in Informatics, LIPIcs (49) Schloss Dagstuhl Leibniz-Zentrum für Informatik, Dagstuhl, pp. 4:1-4:17. ISSN 1868-8969
Hanabi is NP-complete, even for cheaters who look at their cards
In: 32nd International Symposium on Computational Geometry (SoCG 2016) Leibniz International Proceedings in Informatics (LIPIcs) (51) Schloss Dagstuhl Leibniz-Zentrum für Informatik, Dagstuhl, pp. 52.1-52.16. ISSN 1868-8969
Peeling and nibbling the cactus: Subexponential-time algorithms for counting triangulations and related problems