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.
Stefan Weltge
Some of my work that I particularly like:
Binary scalar products, Journal of Combinatorial Theory B 2022 (with A. Kupavskii)

Integer programs with bounded subdeterminants and two nonzeros per row, FOCS 2021 (with S. Fiorini, G. Joret, Y. Yuditsky)

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.
Mathematical Programming Meritorious Service Award 2022
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
Stefan Weltge
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 as well as at the Zuse Institute Berlin.
Prof. Dr. Stefan Weltge
Department of Mathematics
Technische Universität München
Boltzmannstraße 3
D-85748 Garching
Office: MI 02.04.040
I am fortunate to receive funding from DFG in terms of an Individual Grant (NextGen) and as part of our PhD Program AdONE.
PhD students:
Ina Seidel (2019–2023), Stefan Kober (2019–2023), Soroush Fatemianaraki, Jamico Schade, Andreas Hagn, Felix Buld
PC member at IPCO 2023, MIP 2022, ISCO 2022, ISCO 2020, ISCO 2018