Research
I design efficient algorithms for discrete problems and prove intractability results. My research focuses on combinatorial counting problems (including approximate counting and sampling), algebraic graph algorithms, and parameterized and fine-grained complexity.
Example: Network Dynamics
Teaching
I teach in a student-centered way and put an emphasis on carefully crafted exercises and assignments. My approach is inspired by alternative grading methods, particularly the Grading for Growth philosophy. I am working on Algo-Learn, a self-assessment e-learning platform for undergraduate courses in algorithms and data structures, in which exercises are generated and graded programmatically.
Curriculum Vitae
I have been an Associate Professor at IT University of Copenhagen since 2019, and was additionally Professor at Goethe University Frankfurt from 2020 to 2025. Before that, I was Independent Research Group Leader at Saarland University (2014–2019) and Research Fellow at the Simons Institute at UC Berkeley (2015–2016), and Postdoc at UW–Madison (2011–2013) and Université Paris Diderot (2013–2014). I obtained my PhD at Humboldt University of Berlin in 2011, under the supervision of Martin Grohe.