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: Open Source Intelligence Investigation Advanced Sciences and Technologies for Security Applications Springer, Cham (Svájc), pp. 251-273. ISSN 1613-5113
Identifying Illegal Cartel Activities from Open Sources
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. 16:1-16:54. ISSN 1868-8969
Constant-factor approximations for asymmetric TSP on nearly-embeddable graphs
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. 28:1-28:15. ISSN 1868-8969
Double-Exponential and Triple-Exponential Bounds for Choosability Problems Parameterized by Treewidth.
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