602 AN O(mlogn)-TIME ALGORITHM FOR THE MAXIMAL PLANAR SUBGRAPH PROBLEM
J. Cai, X. Han, R. Tarjan, April 1992
Based on a new version of Hopcroft and Tarjan's planarity testing algorithm, we develop an O(mlogn)-time algorithm to find a maximal planar subgraph. 603 COUNTING EMBEDDINGS OF PLANAR GRAPHS USING DFS TREES