The Research Seminar is a weekly seminar with talks by group members and guests on recent results in combinatorial optimization, algorithm design and related fields. Everyone is very welcome. If you have suggestions for talks or wish to present your own interesting results, or if you would like to subscribe to the list for talk announcements, feel free to send an email to the organizer, Lukas Nölke, or stop by in the 3rd floor of MZH for a cup of coffee.
Usual location: MZH 3150
Usual time: Wednesday 10:30 am
Past talks
June 28, 2017  Jan Hackfeld (TU Berlin)
Spaceoptimal collaborative graph exploration
Show abstract 
June 21, 2017  Ilya Chernykh (Novosibirsk State University)
Open Problems in Open Shop Routing

June 20, 2017  Markus Jablonka (University of Bremen)
Oblivious Deterministic Maximization of Submodular Functions
Show abstract 
May 31, 2017  Tim Güneysu (University of Bremen)
Challenges of Modern Cryptography

May 24, 2017  Franziska Eberle (University of Bremen)
Impressions of Erice 2017: Workshop
Graph Theory, Algorithms and Applications 4th Edition

May 10, 2017  Syamantak Das (University of Bremen)
Online and Approximation Algorithms for Scheduling and Network Design
Show abstract 
May 3, 2017  Nicole Megow (University of Bremen)
Online Resource Minimization
Show abstract 
March 1, 2017  Marek Adamczyk (University of Bremen)
When the Optimum is also Blind: A New Perspective on Universal Optimization
Show abstract 
February 14, 2017  Lukas Nölke (University of Paderborn)
Recent Developments in NowhereZero Flow Problems

December 21, 2016  Felix Fischer (University of Glasgow)
Truthful Outcomes from NonTruthful Position Auctions
Show abstract 
December 7, 2016  Andreas Tönnis (University of Bonn)
Online Algorithms with Random Order

November 29, 2016  Syamantak Das (University of Bremen)
A Colorful Routing Problem on Tree Networks
