I'm a researcher in computational topology with a focus on parameterized complexity. In practice, this means that I spend a lot of my time either designing new algorithms, implementing these algorithms or proving that some algorithm is likely to be as efficient as possible.
- (2022). ETH-Tight Algorithms for Finding Surfaces in Simplicial Complexes of Bounded Treewidth. Leibniz International Proceedings in Informatics. 17:1-17:16.
- (2019). Linear MIM-Width of Trees. Lecture Notes in Computer Science (LNCS). 218-231.