Bremen-Hamburg Workshop on Algorithms, Combinatorics and Optimization, May 2026
from
Monday, 18 May 2026 (09:30)
to
Tuesday, 19 May 2026 (19:30)
Monday, 18 May 2026
09:30
welcome tea/ coffee
09:30 - 10:00
Room: room 09-735
10:00
talk: Lena Scherzer: Approximating Triangle Covers of Polygons
Lena Scherzer: Approximating Triangle Covers of Polygons
10:00 - 10:20
Room: room 09-735
10:20
talk: Janina Reuter: Integer Programs That Look Like Paths
Janina Reuter: Integer Programs That Look Like Paths
10:20 - 10:40
Room: room 09-735
10:40
talk: Daniel Knaack: Higher-Order Fibonacci Numbers and the Generalized Euclidean Algorithm
Daniel Knaack: Higher-Order Fibonacci Numbers and the Generalized Euclidean Algorithm
10:40 - 11:00
Room: room 09-735
11:00
talk: Bart Zondervan: Tight Analysis of Proportional Fairness for Minimizing Weighted Flow Time in Monotone Polytope Scheduling
Bart Zondervan: Tight Analysis of Proportional Fairness for Minimizing Weighted Flow Time in Monotone Polytope Scheduling
11:00 - 11:20
Room: room 09-735
11:20
coffee break
coffee break
11:20 - 11:50
11:50
talk: Linda Kleist: Geometric Embeddability of Complexes is ∃ℝ-complete
Linda Kleist: Geometric Embeddability of Complexes is ∃ℝ-complete
11:50 - 12:10
Room: room 09-735
12:10
talk: Florian Chudigiewitsch: On the Expressive Power of Modification Problems
Florian Chudigiewitsch: On the Expressive Power of Modification Problems
12:10 - 12:30
Room: room 09-735
12:30
talk: Marvin Bergmann: Well-Quasi-Orderings of Logical Structures and Homomorphism Densities
Marvin Bergmann: Well-Quasi-Orderings of Logical Structures and Homomorphism Densities
12:30 - 12:50
Room: room 09-735
12:50
lunch
lunch
12:50 - 14:00
14:00
open problems and group formation
14:00 - 16:00
Room: room 09-735
16:00
working in groups
16:00 - 18:00
18:30
dinner
dinner
18:30 - 21:00
Tuesday, 19 May 2026
09:30
welcome tea/ coffee
09:30 - 10:00
10:00
talk: Lukas Hintze: Efficient Simulation of Population Protocols via Sampling of Sparse Random Multigraphs
Lukas Hintze: Efficient Simulation of Population Protocols via Sampling of Sparse Random Multigraphs
10:00 - 10:20
Room: room 09-735
10:20
talk: Sebastian Siebertz: Advances in Algorithmic Meta-Theorems with Applications to Solution Discovery
Sebastian Siebertz: Advances in Algorithmic Meta-Theorems with Applications to Solution Discovery
10:20 - 10:40
Room: room 09-735
10:40
talk: Matthias Mnich: New algorithms for quasi-random walks
Matthias Mnich: New algorithms for quasi-random walks
10:40 - 11:00
Room: room 09-735
11:00
talk: Gideo Joubert: On Quantum homomorphisms of Relational structures
Gideo Joubert: On Quantum homomorphisms of Relational structures
11:00 - 11:20
Room: room 09-735
11:20
coffee break
11:20 - 11:50
11:50
talk: Sarah Morell: Unsplittable Transshipments
Sarah Morell: Unsplittable Transshipments
11:50 - 12:10
Room: room 09-735
12:10
talk: Matías Azocar Carvajal: Canonical Ramsey theorem for clean intersections
Matías Azocar Carvajal: Canonical Ramsey theorem for clean intersections
12:10 - 12:30
Room: room 09-735
12:30
talk: Thorsten Götte: Voting with Opinion Graphs
Thorsten Götte: Voting with Opinion Graphs
12:30 - 12:50
Room: room 09-735
12:50
lunch
lunch
12:50 - 14:00
14:00
working in groups
14:00 - 15:30
15:30
final get together: further work in groups is possible
further work in groups is possible
15:30 - 16:00