In: 12th International Symposium on Parameterized and Exact Computation, IPEC 2017 Schloss Dagstuhl Leibniz-Zentrum für Informatik, Dagstuhl, pp. 7:1-7:13.
Generalized Feedback Vertex set problems on bounded-treewidth graphs: Chordality is the key to single-exponential parameterized algorithms
In: 29th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2018 Society for Industrial and Applied Mathematics (SIAM), Philadelphia (PA), pp. 2357-2376.
Algorithms based on ∗-algebras, and their applications to isomorphism of polynomials with one secret, group isomorphism, and polynomial identity testing
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