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)
In: Algorithms – ESA 2013 21st Annual European Symposium, Sophia Antipolis, France, September 2-4, 2013. Proceedings Lecture Notes in Computer Science (8125) Springer-Verlag Wien, Berlin, pp. 313-324.