Schmid, Andreas Algorithms and Complexity, MPI for Informatics, Max Planck Society;
Schmid, A. (2014). 2-Walks in 3-Connected Planar Graphs are Polynomial Time Computable. Master Thesis, Universität des Saarlandes, Saarbrücken.