Nonplanar vertex deletion: maximum degree thresholds for NP/Max SNP-hardness and a ::::I::::-approximation for finding maximum planar induced subgraphs

Luerbio Faria, Celina M. Herrera de Figueiredo, Sylvain Gravier, Candido F. X. Mendonça, Jorge Stolfi. Nonplanar vertex deletion: maximum degree thresholds for NP/Max SNP-hardness and a ::::I::::-approximation for finding maximum planar induced subgraphs. Electronic Notes in Discrete Mathematics, 18:121-126, 2004. [doi]

@article{FariaFGMS04,
  title = {Nonplanar vertex deletion: maximum degree thresholds for NP/Max SNP-hardness and a ::::I::::-approximation for finding maximum planar induced subgraphs},
  author = {Luerbio Faria and Celina M. Herrera de Figueiredo and Sylvain Gravier and Candido F. X. Mendonça and Jorge Stolfi},
  year = {2004},
  doi = {10.1016/j.endm.2004.06.019},
  url = {http://dx.doi.org/10.1016/j.endm.2004.06.019},
  researchr = {https://researchr.org/publication/FariaFGMS04},
  cites = {0},
  citedby = {0},
  journal = {Electronic Notes in Discrete Mathematics},
  volume = {18},
  pages = {121-126},
}