Thomas Kesselheim

Thomas Kesselheim is a Professor for Theoretical Computer Science at the University of Bonn, Department of Computer Science (Institute V). He is based in room 2.058 at Friedrich-Hirzebruch-Allee 8, D-53115 Bonn, Germany. His contact email is thomas.kesselheim@uni-bonn.de and he holds virtual office hours via Zoom (Meeting ID: 685 2407 0922, Passcode: 305903).

Professor Kesselheim's research focuses on Online Algorithms, Algorithmic Game Theory, and Algorithms and Uncertainty. His work examines how algorithms perform in environments with strategic participants such as internet service providers, cloud infrastructure markets, and advertising platforms. Key research areas include congestion games, price of anarchy, mechanism design, revenue maximization, and optimization under incomplete information.

His teaching portfolio spans multiple semesters with courses including Randomized Algorithms & Probabilistic Analysis, Algorithmic Game Theory, and Algorithms and Uncertainty. He regularly offers specialized seminars on Online Algorithms and Optimization under Uncertainty where students explore cutting-edge topics like online stochastic matching and combinatorial auctions via posted prices.

Professor Kesselheim's career trajectory shows steady progression from PhD studies at RWTH Aachen University through postdoctoral positions at Cornell University and Max Planck Institute for Informatics, a fellowship at the Simons Institute for the Theory of Computing, a Junior Professorship at TU Dortmund, and his current professorship at the University of Bonn since April 2018.

He actively supervises labs and seminars where students implement and evaluate algorithms for optimization under uncertainty, focusing on both theoretical guarantees and practical performance. His research group participates in joint research seminars with other groups at the University of Bonn, discussing topics in computational geometry and algorithm design.