Get started
Award

JA 612 /14-2

Funded outputs count: 8
Funder award ID: JA 612 /14-2
OpenAlex ID: G27876216
Closing the Gap for Makespan Scheduling via Sparsification Techniques
2020 · Klaus Jansen, Kim-Manuel Klein, et al. · Mathematics of Operations Research · 67
PDF
Improved approximation for two dimensional Strip Packing with polynomial bounded width
2019 · Klaus Jansen, Malin Rau · Theoretical Computer Science · 6
PDF
Approximation Schemes for Machine Scheduling with Resource (In-)dependent Processing Times
2019 · Klaus Jansen, Marten Maack, et al. · ACM Transactions on Algorithms · 12
Complexity and Inapproximability Results for Parallel Task Scheduling and Strip Packing
2019 · Sören Henning, Klaus Jansen, et al. · Theory of Computing Systems · 20
Fully dynamic bin packing revisited
2018 · Sebastian Berndt, Klaus Jansen, et al. · Mathematical Programming · 49
PDF
Complexity and Inapproximability Results for Parallel Task Scheduling and Strip Packing
2017 · Henning, Sören, Jansen, Klaus, et al. · arXiv (Cornell University) · 1
PDF
Improved approximation for two dimensional strip packing with polynomial bounded width
2016 · Jansen, Klaus, Rau, Malin · arXiv (Cornell University) · 3
PDF
A Faster FPTAS for the Unbounded Knapsack Problem
2016 · Klaus Jansen, Stefan E. J. Kraft · Lecture notes in computer science · 19
PDF
Year
Topic