Algorithms and Complexity Group


Klaus Jansen and Lars Rohwedder
A Note on the Integrality Gap of the Configuration LP for Restricted Santa Claus
Information Processing Letters, 2020

Klaus Jansen and Lars Rohwedder
A Quasi-Polynomial Approximation for the Restricted Assignment Problem
SIAM Journal on Computing, 2020

Klaus Jansen, Alexandra Lassota, and Lars Rohwedder
Near-Linear Time Algorithm for N-Fold ILPs via Color Coding
SIAM Journal on Discrete Mathematics, 2020

Klaus Jansen, Marten Maack, and Roberto Solis-Oba
Structural Parameters for Scheduling with Assignment Restrictions
Theoretical Computer Science, 2020

Klaus Jansen and Kim Manuel Klein
About the Structure of the Integer Cone and its Application to Bin Packing
Mathematics of Operations Research, 2020

Klaus Jansen, Kim Manuel Klein, and Josè Verschae
Closing the Gap for Makespan Scheduling via Sparsification Techniques
Mathematics of Operations Research, 2020

Sören Henning, Klaus Jansen, Malin Rau, and Lars Schmarje
Complexity and inapproximability results for parallel task scheduling and strip packing
Theory of Computing System 64(1), pp 120--140, 2020

Sebastian Berndt, Klaus Jansen, and Kim-Manuel Klein
Fully Dynamic Bin Packing Revisited
Mathematical Programming, 179(1), pp 109-155, January 11, 2020

Gálvez Waldo, Fabrizio Grandoni, Afrouz Jabal Ameli, Klaus Jansen, Arindam Khan and Malin Rau
A Tight (3/2+\varepsilon) Approximation for Skewed Strip Packing (APPROX 2020)
August 17 - 19, 2020

Klaus Jansen, Alexandra Lassota, and Marten Maack
Approximation algorithms for scheduling with class constraints (SPAA 2020)
Virtual Event, USA, pp 349-357, July 2020

Klaus Jansen and Marten Maack
Inapproximability results for scheduling with interval and resource restrictions (STACS 2020)
Montpellier, Frankreich, LIPIcs 154, 5:1-5:18