In: 24th Annual European Symposium on Algorithms (ESA 2016) Leibniz International Proceedings in Informatics (LIPIcs) (57) Schloss Dagstuhl Leibniz-Zentrum für Informatik, Dagstuhl, pp. 33:1-33:17. ISSN 1868-8969
Counting Matchings with k Unmatched Vertices in Planar Graphs
In: 41st International Symposium on Mathematical Foundations of Computer Science, MFCS 2016 Leibniz International Proceedings in Informatics (LIPIcs) (58) Schloss Dagstuhl Leibniz-Zentrum für Informatik, Dagstuhl, pp. 34:1-34:14. ISSN 1868-8969
A Single-Exponential Fixed-Parameter Algorithm for Distance-Hereditary Vertex Deletion
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
In: 10th ACM Conference on Recommender Systems, RecSys 2016 RecSys 2016 - Proceedings of the 10th ACM Conference on Recommender Systems ACM Press, New York, pp. 425-426.
In: Proceedings of the 1st Workshop on Evaluating Vector-Space Representations for NLP Association for Computational Linguistics, Stroudsburg, pp. 83-89.
Evaluating multi-sense embeddings for semantic resolution monolingually and in word translation
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