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: 25th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2014 Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms Association for Computing Machinery, New York, pp. 1782-1801.
Tight bounds for planar strongly connected steiner subgraph with fixed number of terminals (and extensions)