Highlights of Algorithms (engl./dt.)

Master Seminar in Winter 2018/19
4 CP

In this seminar, we will read recent research papers in theoretical computer science, particularly, on recent highlights on efficient algorithms, online and approximation algorithms, scheduling, algorithmic game theory/mechanism design and combinatorial optimization under uncertainty. The papers may be less recent if there is interesting follow-up work. Each student gives a presentation (45 min.) followed by a discussion. These presentations will be given in one or two days at the end of the semester.
Prof. Dr. Nicole Megow (Email)

Kick-off Meeting: November 29, 2018, 9:00-12:00 in MZH 3150
Every participant gives a 5-min presentation on her/his topic. I give some general comments on how to give a (the final) scientific talk.
The actual presentations will be given on January 29 and February 21, 2019.
  • January 29, 2019, MZH 3150
  • 09:30 Jan-Moritz Prade: Applications of Euler’s Formula
  • 09:30 Francisca Azocar: Cayley´s formula for the number of trees
  • 10:30 Jessica Winter: Five-coloring plane graphs
  • 10:30 Lucas Klemmer: A 1.5-Approximation for Path TSP
  • 11:30 Alexander Lindermayr: Max Cut
  • 13:30 Carl Hammann: Two-sided matching with one-sided preferences

  • February 21, 2019
  • 08:15 Anil Olgun: Approximation Algorithms for Distance Constrained Vehicle Routing Problems
  • 08:15 Tereza Hulcová: A Polynomial Time Constant Approximation For Minimizing Total Weighted Flow-time
  • 09:15 Alexander Denker: Timetabling, university classroom assignment
  • 10:30 Marek Wiesner: Timetabling, university classroom assignment
  • 11:30 Tugce Karakus: Multiprocessor Speed Scaling with Precedence Constraints
  • 11:30 Marcel Luttermann: Incentives in Bitcoin Mining
The first meeting with all organizational details and an overview of topics took place on
Thursday, October 18, 2018 at 15:00h in room MZH 3150.