Jochen Koenemann

Jochen Koenemann is a Professor & Chair in the Department of Combinatorics & Optimization at the University of Waterloo. He holds a Ph.D. in Algorithms, Combinatorics & Optimization from Carnegie Mellon University (2003) and completed a postdoc at La Sapienza University of Rome (2003-2004). His research focuses on Approximation Algorithms, Algorithmic Game Theory, and Combinatorial Optimization. Notable contributions include work on stable matchings, nucleolus computation, and network design algorithms. He has organized major events like the Hausdorff Summer School and IPCO'17 in Waterloo. Academic leadership roles include chairing conferences and serving on program committees such as EC'18, APPROX'17, and SODA'14.

Teaching highlights include courses on Combinatorial Optimization, Game Theory, and Algorithmic Game Theory. He co-authored an undergraduate textbook on optimization with B. Guenin and L. Tuncel. Current advisees include M. Rundstrom, H. Sun, W. Toth, and M. VanDyk. His work frequently addresses interdisciplinary challenges, such as collaborations with SickKids Hospital on algorithmic solutions for medical applications.

Professional activities include editorial roles and international collaborations. Recent research trends emphasize algorithmic frameworks for game-theoretic problems and improving approximation bounds for classical combinatorial challenges. Awards and recognitions are not explicitly listed, but his extensive program committee participation underscores his academic influence.