1. Approximation algorithms for NP-complete problems on planar graphs;Baker;J. ACM,1994
2. W. Brehaut, An Efficient Outerplanarity Algorithm, in: Proceedings of the 8th South-Eastern Conference on Combinatorics, Graph Theory, and Computing, 1977, pp. 99–113.
3. On the k-structure ratio in planar and outerplanar graphs;Călinescu;Discrete Math. Theor. Comput. Sci.,2008
4. A better approximation algorithm for finding planar subgraphs;Călinescu;J. Algorithms,1998
5. A new approximation algorithm for finding heavy planar subgraphs;Călinescu;Algorithmica,2003