Jump to content Jump to search

Daniel Schmidt

born Plümpe. I am a Lecturer/Academic Teacher in the group of Prof. Dr. Gunnar Klau.

Teaching

I am involved in the following lectures:

  • Algorithms and Datastructures
  • C-Programming for Algorithms and Data Structures
  • Graphalgorithms I
  • Approximationalgorithms

Additionally, I offer a seminar on the design and analysis of algorithms.

Please see my german page for further details.

Thesis supervision

If you are interested in the analysis of algorithms, I may supervises your thesis. Please see further details on my german page.

Interests

  • Theoretical analysis of algorithms, approximationalgorithms in particular
  • efficient implementations of algorithms, algorithm analysis driven by experiments
  • (integer) linear programming and combinatorial optimization
  • robust optimization

for

  • network design problems
  • clustering problems
  • network flow problems

Awards

  • Nomination for the HHU teaching award 2023
  • Track B Best Paper Award at the European Symposium on Algorithms (ESA 2018)
    (joint work with François Margot and Bernd Zey)
  • Dissertationspreis of the Gesellschaft für Operations Research e.V. (GOR) 2015
  • Best Student Paper Award at the European Symposium on Algorithms (ESA 2012)
    (joint work with Martin Groß, Jan-Philipp W. Kappmeier and Melanie Schmidt)
  • First place in the InformatiCup 2007, student competition of the German Informatics Society (GI)
    (joint work with Martin Groß and Melanie Schmidt)

Former affiliations