In: Proceedings of the CoNLL SIGMORPHON 2018 Shared Task: Universal Morphological Reinflection Association for Computational Linguistics, Stroudsburg (PA), pp. 121-126.
BME-HAS System for CoNLL–SIGMORPHON 2018 Shared Task: Universal Morphological Reinflection
In: 29th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2018 Society for Industrial and Applied Mathematics (SIAM), Philadelphia (PA), pp. 2801-2820.
Covering a tree with rooted subtrees -parameterized and approximation algorithms
In: 43rd International Symposium on Mathematical Foundations of Computer Science, MFCS 2018 Schloss Dagstuhl Leibniz-Zentrum für Informatik, Dagstuhl, pp. 53:1-53:15.
Conflict Free Feedback Vertex Set: A Parameterized Dichotomy
In: 16th Scandinavian Symposium and Workshops on Algorithm Theory, SWAT 2018 Leibniz International Proceedings in Informatics, LIPIcs (101) Schloss Dagstuhl Leibniz-Zentrum für Informatik, Dagstuhl, pp. 191-1913. ISSN 1868-8969
The parameterized hardness of the k-center problem in transportation networks