Lars Rohwedder

Lars Rohwedder is an Associate Professor in the Algorithms Group at the University of Southern Denmark (SDU) in Odense. He previously held positions as an Assistant Professor at Maastricht University (Netherlands) and postdoc researcher at EPFL, Lausanne (Switzerland). He earned his Ph.D. in Computer Science from CAU Kiel (Germany), advised by Klaus Jansen, and is a recipient of the 2019 PhD of the year award from Förderverein der TF of Kiel University.

His research focuses on algorithms for combinatorial optimization, including approximation algorithms, online algorithms, parameterized algorithms, and integer programming. He has contributed to solving scheduling problems, resource allocation, and optimization under uncertainty.

Rohwedder has served on program committees for conferences like MAPSP, SODA, STACS, and ICALP. He is funded by NWO's Open Competition M1 project on quasi-polynomial time algorithms. His teaching includes courses on advanced algorithms, operations management, and optimization at SDU and Maastricht University.

Key achievements include a quasi-polynomial approximation for the restricted assignment problem, FPT algorithms for scheduling, and contributions to the Submodular Santa Claus problem. His work bridges theoretical foundations and practical applications, with a focus on algorithmic efficiency and robustness.