Markus is a PhD student at TU Vienna, Austria as well as the University of Potsdam, Germany. He is advised by Stefan Woltran and co-advised by Torsten Schaub. His research interests revolve around the graph parameter treewidth and runtime lower bounds as well as complexity analysis involving treewidth. Markus analyzes problems related to Boolean Satisfiability and richer formalisms such as quantified Boolean Formulas, Answer Set Programming, and many more formalisms and problems relevant to AI.
Markus received his BS in Software Engineering at TU Vienna in 2013; and his MS in Computational Intelligence at TU Vienna in 2015.
Markus participated in the winning team of the LP/CP Programming Contest 2018 and he received the Viennese prize for outstanding Master's thesis in 2016.
He helped in the organization of several workshops, competitions and conferences.
- Satisfiability: Theory, Practice, and Beyond, Spring 2021. Visiting Graduate Student.