In: 27th Annual ACM-SIAM Symposium on Discrete Algorithms Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms (3) Association for Computing Machinery, Red Hook NY, pp. 1650-1669.
Tight conditional lower bounds for counting perfect matchings on graphs of bounded treewidth, cliquewidth, and genus
In: Proceedings of the Tenth International Conference on Language Resources and Evaluation (LREC 2016) European Language Resources Association (ELRA), Portoroz, pp. 2815-2818.
In: 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016) Leibniz International Proceedings in Informatics (LIPIcs) (55) Schloss Dagstuhl Leibniz-Zentrum für Informatik, Dagstuhl, pp. 27:1-27:14. ISSN 1868-8969
The Complexity Landscape of Fixed-Parameter Directed Steiner Network Problems
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