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 Proceedings of the 7th Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 16-25). New York, NY: ACM.