The content of this page is only available in German. Please go to German version of this page.

Contact

Lehre an der TU Darmstadt

Semester Veranstaltung Position Dozent
Sommersemester 2017 Discrete Optimization Stud. Hilfskraft Prof. Dr. Yann Disser
Wintersemester 2019/2020 Combinatorial Optimation Assistent Prof. Dr. Yann Disser
Sommersemester 2020 Algorithmic Discrete Mathematics Assistent PD Dr. Andreas Paffenholz

Vorträge

  • Mightiness of Optimization Algorithms, Research Colloquium der Graduiertenschule Computational Engineering der TU Darmstadt, August 2017.
  • A subexponential lower bound for Zadeh's pivot rule, Seminar der Arbeitsgruppe Optimierung der TU Darmstadt, Juni 2018.
  • On Friedmann's subexponential Lower Bound for Zadeh's pivot rule, ISMP 2018, Juli 2018
  • On Friedmann's subexponential Lower Bound for Zadeh's pivot rule, Research Colloquium der Graduiertenschule Computational Engineering der TU Darmstadt, Oktober 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 der Arbeitsgruppe Optimierung der 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, Verteidigung der gleichnamigen Dissertation, Oktober 2020.

Publikationen

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.