RESEARCH SEMINAR

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: Thursday, 11:00 am


Upcoming talks

December 11, 2019
2:00 pm
Veerle Tan-Timmermans (RWTH Aachen University)
Matroid Bases with Cardinality Constraints on the Intersection
Show abstract
January 30, 2020 Giorgio Lucarelli (Grenoble INP)


Past talks

December 5, 2019 Marc Goerigk (University of Siegen)
Two-Stage Robust Combinatorial Problems
Show abstract
November 14, 2019 Sebastian Siebertz (University of Bremen)
An introduction to nowhere dense graph classes
Show abstract
November 7, 2019 Lukas Nölke (University of Bremen)
Online Matching on the Line with Recourse
Show abstract
October 30, 2019 Franziska Eberle (University of Bremen)
Interval scheduling with a rechargeable resource
Show abstract
October 24, 2019 Nicole Megow (University of Bremen)
Optimization with Explorable Uncertainty
Show abstract
September 9, 2019 Miriam Schlöter (ETH Zurich)
Constructing lattice-free gradient polyhedra
Show abstract
August 29, 2019 Yeliz Sandikci (University of Bremen)
Erweiterungen von partiellen Graphfärbungen: Algorithmen und Komplexität
August 21, 2019 Jens Schlöter (University of Bremen)
Conditional Directed Acyclic Graphs: On the Complexity of Computing the Worst-Case Execution Time
Show abstract
May 7, 2019 Victor Verdugo (London School of Economics)
Prophets and Optimal Auctions
Show abstract
April 10, 2019 Ulrich Pferschy (University of Graz)
On the Incremental Knapsack Problem
Show abstract
March 13, 2019 Jens Schlöter (University of Bremen)
Computing the Worst-Case Execution Time of a Conditional DAG Task
Show abstract
March 6, 2019 Ruben Hoeksma (University of Bremen)
Network congestion games are robust to variable demand
Show abstract
February 27, 2019 Łukasz Jeż (University of Wrocław)
A ϕ-Competitive Algorithm for Scheduling Packets with Deadlines
Show abstract
February 20, 2019 Bertrand Simon (University of Bremen)
Minimizing I/Os in Out-of-Core Task Tree Scheduling
Show abstract
February 11, 2019 Tobias Hahn (University of Bremen)
Algorithms for scheduling with mandatory suspensions: worst-case and empirical analysis
December 13, 2018 Claus Gwiggner (Universität Hamburg)
A Priori Sequencing with Uncertain Release Dates
Show abstract
October 25, 2018
Thomas Weise (Hefei University )
Automating Scientific Work in Optimization
Show abstract
October 18, 2018 Martin Böhm (University of Bremen)
Online Bin Stretching: Algorithms and Computer Lower Bounds
Show abstract
September 11, 2018 Leen Stougie (CWI Amsterdam)
A Decomposition Theory For Vertex Enumeration of Convex Polyhedra
Show abstract
September 10, 2018 Klaus Heeger (University of Bonn)
A 10/7-Approximation for 2-Connected Spanning Subgraphs
Show abstract
September 3, 2018 Franziska Eberle (University of Bremen)
New Results on Throughput Maximization
Show abstract
July 17, 2018 Adrian Fessel (University of Bremen)
Topological Dynamics of Physarum polycephalum Transport Networks
Show abstract
July 10, 2018 Sigrid Knust (Osnabrück University)
Synchronous flow shop scheduling problems
Show abstract
May 15, 2018 Bertrand Simon (ENS de Lyon)
Task graph scheduling on modern computing platforms
Show abstract
April 24, 2018 Viktor Bindewald (TU Dortmund)
Robust Bipartite Matchings - Hedging Against Edge Failures
Show abstract
April 10, 2018 Franziska Eberle (University of Bremen)
On Index Policies in Stochastic Scheduling
Show abstract
March 15, 2018 Katrin Casel (Trier University)
Resolving Conflicts for Lower-Bounded Clustering
Show abstract
December 19, 2017 Ruben Hoeksma (University of Bremen)
A PTAS for TSP on hyperplanes
Show abstract
December 12, 2017 Syamantak Das (University of Bremen)
Surviving in Low-Treewidth Graphs
Show abstract
December 5, 2017 Nicole Megow (University of Bremen)
Banff 2017: Approximation Algorithms and the Hardness of Approximation
November 29, 2017 Thomas Schneider (University of Bremen)
The Taming of the Expressive: Foundations for Efficient Reasoning in Complex Modal and Description Logics
Show abstract
November 21, 2017 Rolf Drechsler (University of Bremen)
Design and Verification of Cyber-Physical Systems – Challenges and Recent Developments
Show abstract
October 24, 2017 Tobias Mömke (University of Bremen)
Maximum Scatter TSP in Doubling Metrics
Show abstract
October 17, 2017 Ruben Hoeksma (University of Bremen)
Optimal Threshold Strategies and Posted Price Mechanisms for Random Arrivals
Show abstract
October 10, 2017 Dmitry Feichtner-Kozlov (University of Bremen)
Cheeger Graphs
Show abstract
August 29, 2017 Antonios Antoniadis (Max-Planck-Institut für Informatik)
A Tight Lower Bound for Online Convex Optimization with Switching Costs
Show abstract
August 29, 2017 Peter Kling (Universität Hamburg)
Multiprocessor Scheduling with a Shareable Resource
Show abstract
June 28, 2017 Jan Hackfeld (TU Berlin)
Space-optimal 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)
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 Nowhere-Zero Flow Problems
December 21, 2016 Felix Fischer (University of Glasgow)
Truthful Outcomes from Non-Truthful 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