Calinescu, Gruia Algorithms and Complexity, MPI for Informatics, Max Planck Society;
Finkler, Ulrich Algorithms and Complexity, MPI for Informatics, Max Planck Society;
Calinescu, G., Fernandes, C. G., Finkler, U., & Karloff, H. (1996). A better approximation algorithm for finding planar subgraphs. In 7th ACM-SIAM Symposium on Discrete Algorithms (SODA96) (pp. 16-25). New York: acm.