Teaching at TU Darmstadt

Term Course Position Lecturer
Summer term 2017 Discrete Optimization Student assistant Prof. Dr. Yann Disser
Winter term 2019/2020 Combinatorial Optimization Assistant Prof. Dr. Yann Disser
Summer term 2020 Algorithmic Discrete Mathematics Assistant PD Dr. Andreas Paffenholz

Talks

  • Mightiness of Optimization Algorithms, Research Colloquium of the Graduate School Computational Engineering at TU Darmstadt, August 2017.
  • A subexponential lower bound for Zadeh's pivot rule, Seminar of the Research Group Optimization at TU Darmstadt, June 2018.
  • On Friedmann's subexponential Lower Bound for Zadeh's pivot rule, ISMP 2018, July 2018
  • On Friedmann's subexponential Lower Bound for Zadeh's pivot rule, Research Colloquium of the Graduate School Computational Engineering at TU Darmstadt, October 2018
  • On Friedmann's subexponential Lower Bound for Zadeh's pivot rule, IPCO 2019, Mai 2019
  • An exponential Lower Bound for Zadeh's pivot rule, Seminar of the Research Group Optimization at TU Darmstadt, Januar 2020.
  • An exponential Lower Bound for Zadeh's pivot rule, DMV Jahrestagung 2020, September 2020.
  • The complexity of Zadeh's pivot rule, Defense of the PhD Thesis, October 2020.

Publications

Improved Lower Bounds for Competitive Graph Exploration (A. Birx, Y. Disser, A.V. Hopp and C. Karousatou)
arXiv preprint, available at https://arxiv.org/abs/2002.10958, 2020
An exponential Lower Bound for Zadeh's Pivot Rule (Y. Disser, O. Friedmann and A.V. Hopp)
arXiv preprint, available at https://arxiv.org/abs/1911.01074, 2019.
On Friedmann's Subexponential Lower Bound for Zadeh's Pivot Rule (Y. Disser and A.V. Hopp)
In Proceedings of the 20th Conference on Integer Programming and Combinatorial Optimization (IPCO), pp. 168–180, 2019.