The chair of Theoretical Computer Science and Theorem Proving is proud to announce that Dr. Jan Johannsen has been awarded a habilitation from the Faculty of Mathematics, Informatics, and Statistics of the LMU for a thesis with the topic "The Complexity of Propositional Resolution Proofs and Clause Learning SAT Solvers." Congratulations! The thesis was reviewed by Prof. Jasmin Blanchette (LMU), Prof. Martina Seidl (JKU Linz), and Prof. Olaf Beyersdorff (Friedrich-Schiller-Universität Jena).