The Analysis and Design of Approximation Algorithms for the Maximum Induced Planar Subgraph Problem

References

1. K.J. Edwards and G. Farr. Fragmentability of graphs. Journal of Combinatorial Theory (Series B), 82:30-37, 2001.
2. K.J. Edwards and G. Farr. An algorithm for finding large induced planar subgraphs. In P. Mutzel, M. Jünger and S. Leipert, editors, Graph Drawing: 9th Symposium, GD 2001, Lecture Notes in Computer Science 2265, pages 75-83. Springer-Verlag, Berlin, 2002.
3. K.J. Edwards and G. Farr. Planarization and framentability of some classes of graphs. Technical Report 2003/144, School of Computer Science and Software Engineering, Monash University, 2003.
4. M.M. Halldórsson and H.C. Lau. Low-degree partitioning via local search with applications to constraint satisfaction, max cut and colouring. Journal of Graph Algorithms and Applications, 1:1-13, 1997.
5. C. Kuratowski. Sur les problèmes des courbes gauches en topologie. Fundamenta Mathematicae 15:271-283, 1930.
6. J.M. Lewis. The node-deletion problem for hereditary problems is NP-complete. Journal of Computer and System Sciences, 20:219-230, 1980.
7. T. Nishizeki and N. Chiba. Planar Graphs: Theory and Algorithms. Annals of Discrete Mathematics 32. Elsevier Science, Amsterdam, 1988.