In: 19th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2016 and the 20th International Workshop on Randomization and Computation, RANDOM 2016 Leibniz International Proceedings in Informatics, LIPIcs (60) Schloss Dagstuhl Leibniz-Zentrum für Informatik, Dagstuhl, pp. 5:1-5:12. ISSN 1868-8969
Approximation algorithms for parallel machine scheduling with speed-up resources
In: Proceedings of the Tenth International Conference on Language Resources and Evaluation (LREC 2016) European Language Resources Association (ELRA), Portoroz, pp. 2815-2818.
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: 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: Proceedings of the 1st Workshop on Evaluating Vector-Space Representations for NLP Association for Computational Linguistics, Stroudsburg, pp. 78-82.
Evaluating embeddings on dictionary-based similarity
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