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: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2018) Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, Dagstuhl, pp. 1:1-1:15.
Polylogarithmic approximation algorithms for weighted-F-Deletion problems
In: 11th International Symposium on Parameterized and Exact Computation, IPEC 2016 Leibniz International Proceedings in Informatics, LIPIcs (63) Schloss Dagstuhl Leibniz-Zentrum für Informatik, Dagstuhl, pp. 3:1-3:12. ISSN 1868-8969
H-free graphs, Independent Sets, and subexponential-time algorithms