pith. sign in

Klaus Jansen

Identifiers

  • name variant Klaus Jansen 0.60 · backfill

Papers (29)

  1. A Tight Double-Exponentially Lower Bound for High-Multiplicity Bin Packing cs.CC · 2025 · author #1
  2. Inapproximability Results for Scheduling with Interval and Resource Restrictions cs.CC · 2019 · author #2
  3. Approximation results for makespan minimization with budgeted uncertainty cs.DS · 2019 · author #2
  4. Robust Online Algorithms for Dynamic Problems cs.DS · 2019 · author #4
  5. Online Bin Covering with Limited Migration cs.DS · 2019 · author #3
  6. Linear Time Algorithms for Multiple Cluster Scheduling and Multiple Strip Packing cs.DS · 2019 · author #1
  7. Local search breaks 1.75 for Graph Balancing cs.DS · 2018 · author #1
  8. Near-Linear Time Algorithm for n-fold ILPs via Color Coding cs.DS · 2018 · author #1
  9. An EPTAS for machine scheduling with bag-constraints cs.DS · 2018 · author #2
  10. Near-Linear Approximation Algorithms for Scheduling Problems with Batch Setup Times cs.DS · 2018 · author #2
  11. Scheduling on (Un-)Related Machines with Setup Times cs.DS · 2018 · author #1
  12. A note on the integrality gap of the configuration LP for restricted Santa Claus cs.DS · 2018 · author #1
  13. Empowering the Configuration-IP $-$ New PTAS Results for Scheduling with Setups Times cs.DS · 2018 · author #1
  14. Closing the gap for pseudo-polynomial strip packing cs.DM · 2017 · author #1
  15. Scheduling Monotone Moldable Jobs in Linear Time cs.DS · 2017 · author #1
  16. Online Strip Packing with Polynomial Migration cs.DS · 2017 · author #1
  17. Complexity and Inapproximability Results for Parallel Task Scheduling and Strip Packing cs.CC · 2017 · author #2
  18. Structural Parameters for Scheduling with Assignment Restrictions cs.DS · 2017 · author #1
  19. An EPTAS for Scheduling on Unrelated Machines of Few Different Types cs.DS · 2017 · author #1
  20. On the Configuration-LP of the Restricted Assignment Problem cs.DS · 2016 · author #1
  21. Improved approximation for two dimensional strip packing with polynomial bounded width cs.DS · 2016 · author #1
  22. About the Structure of the Integer Cone and its Application to Bin Packing cs.DS · 2016 · author #1
  23. Closing the Gap for Makespan Scheduling via Sparsification Techniques cs.DS · 2016 · author #1
  24. Algorithmic Aspects of Upper Domination cs.CC · 2015 · author #5
  25. A Faster FPTAS for the Unbounded Knapsack Problem cs.DS · 2015 · author #1
  26. Fully Dynamic Bin Packing Revisited cs.DS · 2014 · author #2
  27. On the optimality of approximation schemes for the classical scheduling problem cs.CC · 2013 · author #2
  28. A Robust AFPTAS for Online Bin Packing with Polynomial Migration cs.DS · 2013 · author #1
  29. Trimming of Graphs, with Application to Point Labeling cs.DM · 2008 · author #3

Mentions

  • 1302.4213 #1 · backfill · confidence 0.70 Klaus Jansen
  • 2512.02691 #1 · arxiv_oai · confidence 0.70 Klaus Jansen
  • 0802.2854 #3 · backfill · confidence 0.70 Klaus Jansen

Frequent Coauthors