Johannes finished his PhD under the supervision of Stefan Szeider at TU Wien in 2015. His work interests are in parameterized algorithmics and its practical applications, including implementations and evaluations. Johannes works on the understanding of the gap between intractability (strong theoretical evidence) and practical efficient solutions (industrial/structured setting). He considers the Boolean satisfiability problem (SAT), answer-set programming (ASP), related formalisms, and their generalizations to counting.
- Satisfiability: Theory, Practice, and Beyond, Spring 2021. Google Research Fellow.