A. [. Arnborg, ]. S. Proskurowskiaro03, and . Arora, Linear time algorithms for NP-hard problems restricted to partial k-trees, Mathematical Programming, pp.11-2443, 1989.
DOI : 10.1016/0166-218X(89)90031-0

G. Borradaile, P. N. Klein, G. Borradaile, C. Mathieu, and P. N. Klein, The Two-Edge Connectivity Survivable Network Problem in Planar Graphs, ICALP '08: Proceedings of the 35th International Colloquium on Automata, Languages and Programming SODA '07: Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms, pp.485-501, 2007.
DOI : 10.1007/978-3-540-70575-8_40

G. Borradaile, P. N. Klein, and D. Pritchard, A polynomial-time approximation scheme for the survivable network problem in planar graphs

G. Borradaile, C. Mathieu, P. N. Klein, E. W. Cabello, . D. Chambersdhm07-]-e et al., Steiner Tree in Planar Graphs: An O(nlogn) Approximation Scheme with Singly-Exponential Dependence on Epsilon, WADS '07: Proceedings of the 10th Workshop on Algorithms and Data Structures SODA '07: Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms SODA '07: Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms, pp.275-286, 2007.
DOI : 10.1007/978-3-540-73951-7_25

R. E. Erickson, C. L. Monma, J. A. Veinott, K. Erickson, and . Whittlesey, Send-and-Split Method for Minimum-Concave-Cost Network Flows, SODA '03: Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms SODA '05: Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms, pp.634-664, 1987.
DOI : 10.1287/moor.12.4.634

M. Henzinger, P. N. Klein, S. Rao, S. N. Subramaniankle06-]-p, and . Klein, Faster Shortest-Path Algorithms for Planar Graphs, STOC '06: Proceedings of the 38th ACM Symposium on Theory of Computing, pp.3-23, 1997.
DOI : 10.1006/jcss.1997.1493

E. Korach, N. [. Solel, P. D. Robertson, . [. Seymour, M. Tazari et al., A faster approximation algorithm for the Steiner problem in graphs [Moh99] B. Mohar. A linear time algorithm for embedding graphs in an arbitrary surface Graph minors. II. Algorithmic aspects of tree-width Shortest paths in linear time on minor-closed graph classes, with an application to Steiner tree approximation, Linear time algorithm for minimum weight Steiner tree in graphs with bounded treewidth. Manuscript Thomassen. Graphs on Surfaces An extended abstract appeared in WG '08: Proceedings of the 34th Workshop on Graph Theoretic Concepts in Computer Science, pp.125-1286, 1986.