Research Institute for Discrete Mathematics

Master's Thesis Seminar

Winter Term 2025/2026


Talks:

Date Name Topic
6.12.2024, 15:15 Uhr - 15:30 Uhr, Konferenzraum Mahmut Yavuz Improved local search in gate sizing (I)
13.12.2024, 14:45 Uhr - 15:00 Uhr, Hörsaal Carola Ley Integrality Gap of Fractional Chromatic Number (I)
13.12.2024, 15:00 Uhr - 15:15 Uhr, Hörsaal Marco Paul Reclik Algorithms for Acyclic Graph Coloring (I)
11.7.2025, 17:15 Uhr - 17:30 Uhr Leonard Weismantel First talk
20.8.2025, 12:30 Uhr - 13:30 Uhr Edgar Perner Uniform Cost-Distance Steiner Trees (III)
11.9.2025, 10:00 Uhr - 10:30 Uhr Marco Paul Reclik Algorithms for Acyclic Graph Coloring (II)
17.9.2025, 12:30 Uhr - 13:30 Uhr Jonas Handwerker Bus Matching among Reuse Units (III)
1.10.2025, 14:15 Uhr - 14:30 Uhr (Poppelsdorfer Allee 24, Seminar Room) Lilian Witters New approaches in connectivity augmentation (I)
1.10.2025, 14:30 Uhr - 14:45 Uhr (Poppelsdorfer Allee 24, Seminar Room) Jakob Gierschmann Fair allocation of chores (I)
1.10.2025, 14:45 Uhr - 15:15 Uhr (Poppelsdorfer Allee 24, Seminar Room) David Čadež The cone of gross substitute valuations (II)
2.10.2025, 14:00 Uhr - 14:30 Uhr Carola Ley Integrality Gap of Fractional Chromatic Number (II)
17.10.2025, 14:00 Uhr - 15:00 Uhr Marco Paul Reclik Algorithms for Acyclic Graph Coloring (III)
14.11.2025, 14:00 Uhr - 15:00 Uhr Carola Ley Integrality Gap of Fractional Chromatic Number (III)
10.12.2025, 12:30 Uhr (Konferenzraum) Moritz Petrich On the 4/3 conjecture (I)
17.12.2025, 16:00 Uhr (Poppelsdorfer Allee 24, seminar room) Miká Kruschel Approximating Distant Paths in Planar Graphs (II)
17.12.2025, 16:35 Uhr (Poppelsdorfer Allee 24, seminar room) Timo Reichert Combining MMS and EFX Guarantees for Fair Division (II)
17.12.2025, 17:10 Uhr (Poppelsdorfer Allee 24, seminar room) Paul Müller Few-Cut fair division: Topological and Algorithmic bounds for Cake-cutting with Entitlements (I)
23.1.2026, 14:15 Uhr - 14:45 Uhr Leonard Weismantel Second talk
23.1.2026, 14:45 Uhr - 15:00 Uhr Milica Šobot Local Search Algorithms (I)


All discrete mathematics lecturers