In this seminar we will discuss selected topics in Discrete Optimization.The main focus is on classical and recent research papers in the field of Combinatorial Optimization.

Es werden klassische Algorithmen aus verschiedenen Anwendungsbereichen vorgestellt. In die diskrete Wahrscheinlichkeitstheorie wird eingeführt und das Konzept randomisierter Algorithmen an verschiedenen Beispielen vorgestellt.

Advanced design and analysis methods for algorithms and data structures: Random(ized) Search Trees, Point Location, Minimum Cut, Linear Programming, Randomized Algebraic Algorithms (matchings), Probabilistically Checkable Proofs (introduction).

Students present current or classical results from theoretical computer science.

Presentation of recent publications in theoretical computer science, including results by diploma, masters and doctoral candidates.