Forschungsinstitut für Diskrete Mathematik

Graduate Seminar on Discrete Optimization (S4C1)

Summer 2008


Selected Topics in Combinatorial Optimization


Class hours: Mondays 14:15-15:45. Approval talks: Mondays 16:00-17:30

The talks in this seminar will present selected chapters of the book "Combinatorial Optimization - Polyhedra and Efficiency" (Springer, Berlin, 2003) by Alexander Schrijver.
Number Approval talk Talk Name Topic Mentoring
1 31.3.
14:15
7.4. Gregor Weckbecker Partially ordered sets and path coverings (14.1-14.7) Markus Struzyna
2 31.3. 14.4. Moritz Drexl Bipartite edge covers and edge coloring (19, 20.1-20.7) Christian Schulte
3 7.4. 21.4. Benjamin Bolten Transversals (22.1-22.6, 23.1-23.3) Markus Struzyna
4 14.4. 28.4. Carlos Mingorance Lopez Biconnectors and bibranchings (54) Christoph Bartoschek
5 21.4. 5.5. Tim Fischbach Directed cuts and strong connectors (55.1-55.5, 57.1-57.4) Christian Schulte
6 28.4. 19.5. Simon Wedeking Matching forests (59) Jens Maßberg
7 5.5. 26.5. Levin Keller Graph orientation (61) Stephan Held
8 19.5. 2.6. Nico Beckers Network Synthesis (62) Stephan Held
9 26.5. 9.6. Simon Pyro Fractional cliques and colouring (64.4-64.8) Christoph Bartoschek
10 2.6. 16.6. Thomas Löbbe Stable sets in perfect and claw-free graphs (67.1, 67.2, 69.2, 69.3) Jens Maßberg
11 9.6. 23.6. Hendrik Guhlich Disjoint T-paths (73) Dirk Müller
12 16.6. 30.6. Jens Humrich Weakly bipartite graphs (75.1-75.6) Christian Schulte
13 23.6. 7.7. Lea Conen Disjoint paths on surfaces (76.1-76.6) Dirk Müller
14 30.6. 14.7. Julia Funke Ideal hypergraphs (77.1-77.7, 78.1-78.4) Ulrich Brenner
15 14.7.
16:15
Leonhard Schneider Perfect, balanced and unimodular hypergraphs (82.1-82.5, 83.1-83.3) Ulrich Brenner

Prerequisites:

Vordiplom and at least one (preferably more) lecture course in the field of Discrete Mathematics or Mathematical Optimization.

Prof. Dr. B. Korte,
Prof. Dr. J. Vygen,
Prof. Dr. S. Hougardy,
Jun.Prof. Dr. T. Nieberg,
Dr. U. Brenner