Mehlhorn, Kurt Algorithms and Complexity, MPI for Informatics, Max Planck Society;
Yap, Chee-Keng Algorithms and Complexity, MPI for Informatics, Max Planck Society;
Mehlhorn, K., & Yap, C.-K. (1991). Constructive Whitney-Graustein theorem, or how to untangle closed planar curves. SIAM Journal on Computing, 20, 603-621.