Algorithms and Complexity Group

2018

Klaus Jansen and Stefan Kraft
A Faster FPTAS for the Unbounded Knapsack Problem
European Journal of Combinatorics (68), pp. 148-174, February, 2018

Sören Henning, Klaus Jansen, Malin Rau, and Lars Schmarje
Complexity and Inapproximability Results for Parallel Task Scheduling and Strip Packing(CSR 2018)
Moscow, Russia, June 6 - 10, 2018

Klaus Jansen and Felix Land
Scheduling Monotone Moldable Jobs in Linear Time(IPDPS 2018)
Vancouver, Canada, May 21 - 25, 2018

Sebastian Berndt and Maciej Liśkiewicz
On the Gold Standard for Security of Universal Steganography(EUROCRYPT 2018)
Tel Aviv, Israel, April 29 - May 3, 2018

Klaus Jansen and Lars Rohwedder
Compact LP Relaxations for Allocation Problems(SOSA 2018)
New Orleans, USA, January 7 - 10, 2018