In: 31st International Symposium on Theoretical Aspects of Computer Science, STACS 2014 Leibniz International Proceedings in Informatics, LIPIcs (25) Schloss Dagstuhl Leibniz-Zentrum für Informatik, Dagstuhl, pp. 397-408.
Generalized Wong sequences and their applications to Edmonds' problems
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