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: 34th Symposium on Theoretical Aspects of Computer Science (STACS 2017) Leibniz International Proceedings in Informatics, LIPIcs (66) Schloss Dagstuhl Leibniz-Zentrum für Informatik, Dagstuhl, pp. 22:1-22:14. ISSN 1868-8969
Parameterized and approximation results for scheduling with a low rank processing time matrix
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