Approximation Algorithms and Parameterized Complexity
Videos from BIRS Workshop
Mohammad Taghi Hajiaghayi, University of Maryland at College Park
Monday Nov 30, 2015 09:10 - 10:14
Fixed-Parameter Tractability and Approximability: A Survey of Connections
Valia Mitsou, Hungarian Academy of Sciences
Monday Nov 30, 2015 10:39 - 11:11
Complexity and Approximability of Parameterized CSP
André Nichterlein, Technische Universität Berlin
Monday Nov 30, 2015 11:12 - 11:42
FPT approximation schemes for Shift Bribery
Frits Spieksma, Katholieke Universiteit Leuven
Monday Nov 30, 2015 11:43 - 12:09
Balanced Optimization with vector costs
Stefan Kratsch, University of Bonn
Tuesday Dec 1, 2015 09:12 - 10:07
A brief introduction to kernelization
Michael Fellows, Charles Darwin University
Tuesday Dec 1, 2015 10:37 - 10:57
Using Parameterization to Move Approximation into Problem Legislation
Kati Land, Christian-Albrechts-Universität zu Kiel
Tuesday Dec 1, 2015 10:59 - 11:18
Estimating The Makespan of The Two-Valued Restricted Assignment Problem
Palmo Monaldo Mastrolilli, IDSIA Instituto Dalle Molle di Studi sull'Intelligenza Artificiale
Tuesday Dec 1, 2015 11:19 - 11:55
A Lasserre Lower Bound for the Min-Sum Single Machine Scheduling Problem
Klaus Jansen, University of Kiel
Wednesday Dec 2, 2015 09:32 - 09:58
Lower bounds on the running time for packing and scheduling problems
Felix Land, Christian-Albrechts-Universität zu Kiel
Wednesday Dec 2, 2015 10:32 - 11:02
A Fully Polynomial (3/2 + ∈)-Approximation for Scheduling Monotone Moldable Jobs
Nicole Megow, Technische Universität München
Wednesday Dec 2, 2015 11:45 - 12:16
An O(log m)-Competitive Algorithm for Online Machine Minimization
Guochuan Zhang, Zhejiang University
Thursday Dec 3, 2015 09:31 - 09:59
Packing group items
Matthias Mnich, TU Hamburg
Thursday Dec 3, 2015 10:37 - 11:03
Improved Approximation Algorithm for Minimum Feedback Vertex Sets in Tournaments
Sebastian Berndt, Universität zu Lübeck
Thursday Dec 3, 2015 11:04 - 11:28
Fully Dynamic Bin Packing Revisited
Liming Cai, University of Georgia
Thursday Dec 3, 2015 11:29 - 12:04
Maximum Spanning k-Tree: A Case Study
Frances Rosamond, Charles Darwin University
Thursday Dec 3, 2015 14:02 - 14:03
The FPT wiki
Martin Fürer, The Pennsylvania State University
Friday Dec 4, 2015 09:31 - 10:04
Multi-Clique-Width, a Powerful New Width Parameter
Thomas Erlebach, University of Leicester
Friday Dec 4, 2015 10:31 - 11:01
On Temporal Graph Exploration
