Simplified O(n) algorithms for planar graph embedding, Kuratowski subgraph isolation and related problems (2001)

by J Boyer