Algorithms and Complexity Group

2019

Klaus Jansen and Kim-Manuel Klein
A Robust AFPTAS for Online Bin Packing with Polynomial Migration
SIAM Journal on Discrete Mathematics 3(4), pp 2062-2091, October 2019

Klaus Jansen and Malin Rau
Improved Approximation for two Dimensional Strip Packing with Polynomial Bounded Width
Theoretical Computer Science (789), pp 34-49, October 2019

Max Bannach and Sebastian Berndt
Practical Access to Dynamic Programming on Tree Decompositions
Algorithms 12(8), pp 172, August 2019

Klaus Jansen, Marten Maack, and Malin Rau
Approximation Schemes for Machine Scheduling with Resource (In-)dependent Processing Times
ACM Transaction on Algorithms 15(3), pp 1-28, July 2019

Klaus Jansen and Marten Maack
An EPTAS for Scheduling on Unrelated Machines of Few Different Types
Algorithmica, pp 1-31, May 2019

Sören Henning, Klaus Jansen, Malin Rau, and Lars Schmarje
Complexity and Inapproximability Results for Parallel Task Scheduling and Strip Packing
Theory of Computing Systems, pp 1-21, February 2019

Sebastian Berndt, Valentin Dreismann, Kilian Grage, Klaus Jansen and Ingmar Knof
Robust Online Algorithms for Certain Dynamic Packing Problems (WAOA 2019)
Munich, Germany, September 12 - 13, 2019

Marin Bougeret, Klaus Jansen, Michael Poss and Lars Rohwedder
Approximation Results for Makespan Minimization with Budgeted Uncertainty (WAOA 2019)
Munich, Germany, September 12 - 13, 2019

Klaus Jansen and Malin Rau
Closing the Gap for Pseudo-Polynomial Strip Packing (ESA 2019)
Munich, Germany, September 09 - 11, 2019

Sebastian Berndt, Leah Epstein, Klaus Jansen, Asaf Levin, Marten Maack, Lars Rohwedder
Online Bin Covering with Limited Migration (ESA 2019)
Munich, Germany, September 09 - 11, 2019

Klaus Jansen and Malin Rau
Linear Time Algorithms for Multiple Cluster Scheduling and Multiple Strip Packing (EURO-PAR 2019)
Göttingen, Germany, August 26 - 30, 2019

Max Bannach and Sebastian Berndt
Positive-Instance Driven Dynamic Programming for Graph Searching (WADS 2019)
Edmonton, Canada, August 05 - 07, 2019

Klaus Jansen and Lars Rohwedder
Local search breaks 1.75 for Graph Balancing (ICALP 2019)
Patras, Greece, July 08 - 12, 2019

Klaus Jansen, Alexandra Lassota, and Lars Rohwedder
Near-Linear Time Algorithm for n-fold ILPs via Color Coding (ICALP 2019)
Patras, Greece, July 08 - 12, 2019

Max Deppert and Klaus Jansen
Near-Linear Approximation Algorithms for Scheduling Problems with Batch Setup Times (SPAA 2019)
Phoenix, USA, June 22 - 24, 2019

Kilian Grage,  Klaus Jansen, and Kim-Manuel Klein
An EPTAS for machine scheduling with bag-constraints (SPAA 2019)
Phoenix, USA, June 22 - 24, 2019

Janka Chlebikova, Clément Dallard, and Niklas Paulsen
Complexity of scheduling for DARP with Soft Ride Times (CIAC 2019)
Rome, Italy, May 27 - 29, 2019

Klaus Jansen, Kim-Manuel Klein, Marten Maack, and Malin Rau
Empowering the Configuration-IP – New PTAS Results for Scheduling with Setups Times (ITCS 2019)
San Diego, USA, January 10 - 12, 2019

Klaus Jansen and Lars Rohwedder
On Integer Programming and Convolution (ITCS 2019)
San Diego, USA, January 10 - 12, 2019