I’m a PhD candidate in the Algorithms and Complexity and Mathematical Modeling groups at Utrecht University. I work with Artem Kaznatcheev. I am broadly interested in graph algorithms, and I have recently been working on the theory of Local Search from a Computational Complexity perspective.
I like all things graph-related, and love combinatorial arguments.
I was teaching full-time at University College Maastricht. Here is a small sample of the courses I was teaching: