Wahlström, Magnus Algorithms and Complexity, MPI for Informatics, Max Planck Society;
http://drops.dagstuhl.de/opus/volltexte/2012/3878/ (beliebiger Volltext)
Lokshtanov, D., Saurabh, S., & Wahlström, M. (2012). Subexponential Parameterized Odd Cycle Transversal on Planar Graphs. In D. D'Souza, T. Kavitha, & J. Radhakrishna (Eds.), 32nd International Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2012) (pp. 424-434). Dagstuhl: Schloss Dagstuhl/ Leibniz-Zentrum für Informatik. doi:10.4230/LIPIcs.FSTTCS.2012.424.