Stefan Weltge

Hi! I'm a professor of discrete mathematics at the Technical University of Munich.

My research interests include combinatorial optimization, linear & integer programming, and polyhedral combinatorics.

Some of my work that I particularly like:
Integer programs with bounded subdeterminants and two nonzeros per row, Journal of the ACM 2024, FOCS 2021 (with S. Fiorini, G. Joret, Y. Yuditsky)

Binary scalar products, Journal of Combinatorial Theory B 2022 (with A. Kupavskii)

Lifting linear extension complexity bounds to the mixed-integer setting, SODA 2018 (with A. Cevallos, R. Zenklusen)

A short proof that the extension complexity of the correlation polytope grows exponentially, Discrete & Computational Geometry 2015 (with V. Kaibel)

See DBLP for my other publications.

PC member at IPCO 2026, IPCO 2023, MIP 2022, ISCO 2022, ISCO 2020, ISCO 2018

I have a PhD in mathematics from the University of Magdeburg.

I spent two years as a postdoc at ETH Zurich.

As a student, I worked at the Fraunhofer IFF and the Zuse Institute Berlin.

TUM Supervisory Award 2022

Summer school speaker at IPCO 2022

Best Introductory Course, Mathematics, TUM, 2021/22
Best Advanced Course, Mathematics, TUM, 2020/21
Best Advanced Course, Mathematics, TUM, 2019

Best Lecturer, Electrical and Computer Engineering, TUM, 2019

Best Dissertation Award, University of Magdeburg, 2016

Prof. Dr. Stefan Weltge
Department of Mathematics
Technische Universität München
Boltzmannstraße 3
D-85748 Garching

Office: MI 02.04.040