Bremen-Hamburg Workshop 2025
Bremen-Hamburg Colloquium on ACO on December 10, 2025
This is a one-day meeting on topics around algorithms, combinatorics and optimization. It will start on Wednesday, December 10, at 11 am at the University of Bremen in room MZH 5600 (Bibliothekstrasse 5, 28359 Bremen).
We provide coffee and tea starting at 10:30 am. The scientific part begins at 11 am and ends around 6 pm. A light lunch will be provided. At 6 pm we go to the Italian Restaurant "Bellini im TRESOR" close to the University, Universit?tsallee 14, 28359 Bremen, and is at your own expense.
Academic organization
The workshop takes place in room MZH 5600 (Bibliothekstrasse 5, 28359 Bremen).
| 10:30 | Coffee and Registration | |
| 11:00 | Welcome | |
| 11:05 | The power of two oracles for matroid optimization | Nicole Megow |
| 11:30 | 9/4-approximation for feedback vertex sets in quasi-transitive digraphs | Ebrahim Ghorbani |
| 11:55 | Lunch | |
| 13:25 | On Approximation of Constraint Satisfaction Problems | Michel Sénégas |
| 13:50 | Algorithms for the Online Leader Selection Problem | Karolina Tammemaa |
| 14:15 | The ProofBench Initiative: towards a trustworthy benchmark for advanced mathematics | Nathan Bowler |
| 14:40 | Coffee | |
| 15:00 | Lazy Cops and Robbers on the Triangular Grid | Bruno Borchardt |
| 15:25 | Firefighting is hard | Torben Schürenberg |
| 15:50 | Coffee | |
| 16:05 | Elimination Distance | Nicole Schirrmacher |
| 16:30 | On directed pathwidth, jungles, and cliquewidth of h-semicomplete digraphs | Raul Lopez |
| 16:55 | Coffee | |
| 17:10 | Improved approximation algorithms for (variants of) the minimum sum of radii problem | Moritz Buchem |
| 17:35 | Bin Packing Polygons | Tim Gerlach |
| 18:00 | Closing & Walk to Restaurant Bellini |
Local organization: Daniel Schmand and group. Involved groups in Bremen: Nicole Megow and Sebastian Siebertz.

![[Translate to English:]](/fileadmin/user_upload/fachbereiche/fb3/infcon/CSLog/CSLog.png)