I am a postdoctoral researcher in combinatorial optimization at the Optimization Research Group of the RPTU in Kaiserslautern. My research is mainly concerned with machine scheduling and, more recently, optimization in public transport.
Between 2016 and 2021, I did my PhD in the COGA Group at TU Berlin under the supervision of Martin Skutella. Afterwards, I worked one year in the Optimization Division of the Fraunhofer Institute for Industrial Mathematics.
This winter semester I give a lecture on Algorithmic Game Theory. More information is provided on the OpenOlat course page. The password is the RPTU math standard password.
In the winter semester 2023/24 I am giving a lecture on Algorithmic Game Theory.
In the past I was involved in the following courses.
First course on algorithms and programming for math bachelor students.
Topics: running time, number representations, binary search, graphs, sorting, Gaussian elimination, spanning trees, matroids, dynamic programming, introduction to programming
Second course on algorithms and programming for math bachelor students.
Topics: data structures, Huffman codes, shortest paths, Turing machines, computability, complexity, object orientation
Introductory course for math bachelor and master students.
Topics: Simplex algorithm, LP duality, paths and trees, maximum flows, min-cost flows, maximum bipartite matchings, stable matchings, ellipsoid method, large-scale linear programming, sensitivity analysis
Advanced course for math bachelor and master students.
Topics: Branchings and arborescences, maximum matchings, minimum-cost perfect matchings, T-joins, matroids, total unimodularity, total dual integrality, Gomory-Chvátal cutting planes, branch-and-bound algorithm, Lagrangian dual, subgradient method