![[Translate to English:]](/fileadmin/user_upload/fachbereiche/fb3/infcon/CSLog/CSLog.png)
Bremen-Hamburg Initiative on Algorithms, Combinatorics and Optimization
About the Initiative
The initiative aims to connect researchers from Bremen and Hamburg working in the fields of algorithms, combinatorics, and optimization, providing an inclusive platform for exchanging ideas, exploring new developments, and discussing interesting open problems in these fields. Co-founded in 2018 by Petra Berenbrink from University of Hamburg and Nicole Megow from University of Bremen, the initiative hosted several meetings involving the groups of Peter Kling, Matthias Mnich, Mathias Schacht, Daniel Schmand, Sebastian Siebertz, and Anusch Taraz took place in Hamburg and Bremen prior to the pandemic. In 2024, the initiative is being revitalized welcoming many new participants.
Bremen-Hamburg Colloquium on ACO on December 2, 2024
This is a one-day meeting on topics around algorithms, combinatorics and optimization. It will start on Monday, December 2nd, at 10 am at the University of Bremen in room MZH 5500 (Bibliothekstrasse 5, 28359 Bremen).
We provide coffee and tea starting at 10:00am. The scientific part begins at 10:30am and ends around 5:30pm. For lunch there will be a soup, bread, tapas, and beverages. At 5:30 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 5500 (Bibliothekstrasse 5 28359 Bremen).
| 10:00-10:30 | Arrival + Coffee and Tea Get-Together | |
| 10:30-10:45 | Welcome | |
| 10:45-11:15 | Advances in Algorithmic Meta Theorems | Sebastian Siebertz (Universität Bremen) |
| 11:15-11:45 | Noisy Linear Group Testing: Exact Thresholds and Efficient Algorithms | Lukas Hintze (Universität Hamburg) |
| 11:45-12:15 | Infinite-domain CSPs | Davide Perinti (TU Hamburg) |
| 12:15-13:30 | Lunch | |
| 13:30-14:00 | Deterministic Impartial Selection with Weights | Maximilian Stahlberg (TU Hamburg) |
| 14:00-14:30 | Improved Approximations for Vector Bin Packing via Iterative Randomized Rounding | Matthias Mnich (TU Hamburg) |
| 14:30-15:00 | Coffee Break | |
| 15:00-15:30 | Online Algorithms, Algorithmic Game Theory and Beyond | Daniel Schmand (Universität Bremen) |
| 15:30-16:00 | An elementary bound for the directed grid theorem | Irene Muzi (Universität Hamburg) |
| 16:00-16:30 | Coffee Break | |
| 16:30-17:00 | Combinatorial Optimization with Uncertainty in the Input | Nicole Megow (Universität Bremen) |
| 17:00 | Closing and short discussion about future plans | |
| ~17:30 | Dinner |
Local organization: Nicole Megow and group. For questions, please contact Moritz Buchem and Felix Hommelsheim. Involved groups in Bremen: Daniel Schmand and Sebastian Siebertz.