I'm Cornelius, and in my professional life, I do research in theoretical computer science.
I study algorithms for hard problems in the parameterized setting, as well as the algebraic foundations arising from the methods employed to solve them.
This includes problems as diverse as finding a longest path in a network, finding a spanning tree with few leaves, or solving integral linear programs with special structure.
Some of these questions lead to questions about the complexity of the wedge product on vector spaces and the multiplication map of certain apolar algebras.
Until that, I worked on my PhD (Dr. rer. nat.) at Saarland University, where my advisor was Holger Dell. During that time, I spent a semester as a visiting graduate student at the Simons Institute at UC Berkeley.
Long before that, I was born in (the magnificient Bavarian city of) Regensburg.