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: Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms Society for Industrial and Applied Mathematics (SIAM), Philadelphia, pp. 642-661.
An exact characterization of tractable demand patterns for maximum disjoint path problems