I'm a postdoctoral researcher at the Institute for Logic, Language and Computation (ILLC) at the University of Amsterdam. My position is funded by a Erwin Schrödinger Fellowship of the Austrian Science Fund.
My research interests include the application of methods from theoretical computer science—in particular methods from (parameterized) complexity theory—to problems in computational logic, artificial intelligence (AI), and knowledge representation & reasoning (KRR).
In one of my current research projects, I investigate judgment aggregation procedures (in the area of computational social choice) using a parameterized complexity perspective. Another aim of this project is to further develop a parameterized complexity framework that takes into account fixed-parameter tractable algorithms with access to a SAT oracle.
Generally, I'm fascinated by all things related to computational complexity—e.g., parameterized complexity theory, the Polynomial Hierarchy (PH), subexponential-time complexity, the Exponential Time Hypothesis (ETH), and (parameterized) compilability.
I wrote my PhD thesis—titled "Parameterized Complexity in the Polynomial Hierarchy"—at the Algorithms and Complexity Group at the Faculty of Informatics of the Technische Universität Wien. I received my PhD in 2016, and my thesis has been nominated for the GI-Dissertationspreis 2016 of the German Informatics Society.
I have an Erdős number of 3.
Most of my publications are also listed at the DBLP Computer Science Bibliography.