


default search action
Klaus Jansen
Person information
- affiliation: Christian-Albrechts-Universität zu Kiel, Algorithmen und Komplexität
Refine list

refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [c167]Max A. Deppert
, Klaus Jansen
:
The Power of Duality: Response Time Analysis meets Integer Programming. RTNS 2024: 37-47 - [c166]Klaus Jansen
, Malin Rau
, Malte Tutas
:
Hardness and Tight Approximations of Demand Strip Packing. SPAA 2024: 479-489 - [c165]Sebastian Bernhard Germann, Klaus Jansen, Felix Ohnesorge, Malte Tutas:
3/2-Dual Approximation for CPU/GPU Scheduling. SEA 2024: 13:1-13:18 - [i76]Kilian Grage, Klaus Jansen:
Convolution and Knapsack in Higher Dimensions. CoRR abs/2403.16117 (2024) - [i75]Klaus Jansen, Malin Rau
, Malte Tutas:
Hardness and Tight Approximations of Demand Strip Packing. CoRR abs/2404.15917 (2024) - [i74]Klaus Jansen, Kai Kahler, Esther Zwanger:
Exact and Approximate High-Multiplicity Scheduling on Identical Machines. CoRR abs/2404.17274 (2024) - [i73]Klaus Jansen, Kai Kahler, Lis Pirotton, Malte Tutas:
Improving the Parameter Dependency for High-Multiplicity Scheduling on Uniform Machines. CoRR abs/2409.04212 (2024) - [i72]Klaus Jansen, Alexandra Lassota, Malte Tutas, Adrian Vetta:
FPT Algorithms using Minimal Parameters for a Generalized Version of Maximin Shares. CoRR abs/2409.04225 (2024) - 2023
- [j111]Waldo Gálvez
, Fabrizio Grandoni
, Afrouz Jabal Ameli
, Klaus Jansen, Arindam Khan, Malin Rau
:
A Tight (3/2+ε )-Approximation for Skewed Strip Packing. Algorithmica 85(10): 3088-3109 (2023) - [j110]Max A. Deppert
, Klaus Jansen, Arindam Khan, Malin Rau
, Malte Tutas:
Peak Demand Minimization via Sliced Strip Packing. Algorithmica 85(12): 3649-3679 (2023) - [j109]Sebastian Berndt, Leah Epstein
, Klaus Jansen, Asaf Levin
, Marten Maack, Lars Rohwedder
:
Online bin covering with limited migration. J. Comput. Syst. Sci. 134: 42-72 (2023) - [j108]Klaus Jansen
, Lars Rohwedder
:
On Integer Programming, Discrepancy, and Convolution. Math. Oper. Res. 48(3): 1481-1495 (2023) - [j107]Klaus Jansen, Kim-Manuel Klein, Alexandra Lassota
:
The double exponential runtime is tight for 2-stage stochastic ILPs. Math. Program. 197(2): 1145-1172 (2023) - [c164]Kilian Grage, Klaus Jansen, Felix Ohnesorge:
Improved Algorithms for Monotone Moldable Job Scheduling Using Compression and Convolution. Euro-Par 2023: 503-517 - [c163]Max A. Deppert, Klaus Jansen, Marten Maack, Simon Pukrop, Malin Rau
:
Scheduling with Many Shared Resources. IPDPS 2023: 413-423 - [c162]Sebastian Berndt, Hauke Brinkop
, Klaus Jansen, Matthias Mnich, Tobias Stamm:
New Support Size Bounds for Integer Programming, Applied to Makespan Minimization on Uniformly Related Machines. ISAAC 2023: 13:1-13:18 - [c161]Hauke Brinkop
, Klaus Jansen
:
Solving Cut-Problems in Quadratic Time for Graphs with Bounded Treewidth. SOFSEM 2023: 33-46 - [c160]Klaus Jansen
, Kai Kahler
:
On the Complexity of Scheduling Problems with a Fixed Number of Parallel Identical Machines. SOFSEM 2023: 192-206 - [e31]Henning Fernau
, Klaus Jansen
:
Fundamentals of Computation Theory - 24th International Symposium, FCT 2023, Trier, Germany, September 18-21, 2023, Proceedings. Lecture Notes in Computer Science 14292, Springer 2023, ISBN 978-3-031-43586-7 [contents] - [i71]Kilian Grage, Klaus Jansen, Felix Ohnesorge:
Improved Algorithms for Monotone Moldable Job Scheduling using Compression and Convolution. CoRR abs/2303.01414 (2023) - [i70]Sebastian Berndt, Hauke Brinkop, Klaus Jansen, Matthias Mnich, Tobias Stamm:
New Support Size Bounds for Integer Programming, Applied to Makespan Minimization on Uniformly Related Machines. CoRR abs/2305.08432 (2023) - 2022
- [j106]Klaus Jansen, Kim-Manuel Klein, Marten Maack
, Malin Rau
:
Empowering the configuration-IP: new PTAS results for scheduling with setup times. Math. Program. 195(1): 367-401 (2022) - [c159]Sebastian Berndt, Max A. Deppert, Klaus Jansen, Lars Rohwedder:
Load Balancing: The Long Road from Theory to Practice. ALENEX 2022: 104-116 - [c158]Klaus Jansen, Arindam Khan, Marvin Lira, K. V. N. Sreenivas:
A PTAS for Packing Hypercubes into a Knapsack. ICALP 2022: 78:1-78:20 - [c157]Thi Huyen Chau Nguyen, Werner Grass
, Klaus Jansen
:
Exact Polynomial Time Algorithm for the Response Time Analysis of Harmonic Tasks. IWOCA 2022: 451-465 - [i69]Klaus Jansen, Kai Kahler:
On the Complexity of Scheduling Problems With a Fixed Number of Identical Machines. CoRR abs/2202.07932 (2022) - [i68]Klaus Jansen, Arindam Khan, Marvin Lira, K. V. N. Sreenivas:
A PTAS for Packing Hypercubes into a Knapsack. CoRR abs/2202.11902 (2022) - [i67]Hauke Brinkop
, Klaus Jansen:
High Multiplicity Scheduling on Uniform Machines in FPT-Time. CoRR abs/2203.01741 (2022) - [i66]Max A. Deppert, Klaus Jansen, Marten Maack, Simon Pukrop, Malin Rau
:
Scheduling with Many Shared Resources. CoRR abs/2210.01523 (2022) - [i65]Max A. Deppert, Klaus Jansen:
The Power of Duality: Response Time Analysis meets Integer Programming. CoRR abs/2210.02361 (2022) - 2021
- [j105]Marin Bougeret
, Klaus Jansen, Michael Poss, Lars Rohwedder
:
Approximation Results for Makespan Minimization with Budgeted Uncertainty. Theory Comput. Syst. 65(6): 903-915 (2021) - [j104]Klaus Jansen, Oliver Sinnen
, Huijun Wang
:
An EPTAS for scheduling fork-join graphs with communication delay. Theor. Comput. Sci. 861: 66-79 (2021) - [c156]Klaus Jansen, Alexandra Lassota
, Marten Maack, Tytus Pikies:
Total Completion Time Minimization for Scheduling with Incompatibility Cliques. ICAPS 2021: 192-200 - [c155]Max A. Deppert, Klaus Jansen, Arindam Khan, Malin Rau
, Malte Tutas:
Peak Demand Minimization via Sliced Strip Packing. APPROX-RANDOM 2021: 21:1-21:24 - [c154]Sebastian Berndt, Kilian Grage, Klaus Jansen, Lukas Johannsen, Maria Kosche:
Robust Online Algorithms for Dynamic Choosing Problems. CiE 2021: 38-49 - [c153]Klaus Jansen, Malin Rau
:
Closing the Gap for Single Resource Constraint Scheduling. ESA 2021: 53:1-53:15 - [c152]Sören Domrös
, Daniel Lucas
, Reinhard von Hanxleden
, Klaus Jansen
:
Revisiting Order-Preserving, Gap-Avoiding Rectangle Packing. VISIGRAPP (Revised Selected Papers) 2021: 183-205 - [c151]Klaus Jansen, Kim-Manuel Klein, Alexandra Lassota:
The Double Exponential Runtime is Tight for 2-Stage Stochastic ILPs. IPCO 2021: 297-310 - [c150]Sören Domrös, Daniel Lucas, Reinhard von Hanxleden, Klaus Jansen:
On Order-preserving, Gap-avoiding Rectangle Packing. VISIGRAPP (3: IVAPP) 2021: 38-49 - [c149]Max A. Deppert, Klaus Jansen, Kim-Manuel Klein:
Fuzzy Simultaneous Congruences. MFCS 2021: 39:1-39:16 - [c148]Sebastian Berndt
, Klaus Jansen, Alexandra Lassota
:
Tightness of Sensitivity and Proximity Bounds for Integer Linear Programs. SOFSEM 2021: 349-360 - [c147]Sebastian Berndt, Klaus Jansen, Kim-Manuel Klein:
New Bounds for the Vertices of the Integer Hull. SOSA 2021: 25-36 - [i64]Hauke Brinkop, Klaus Jansen, Tim Weißenfels:
An optimal FPT algorithm parametrized by treewidth for Weighted-Max-Bisection given a tree decomposition as advice assuming SETH and the hardness of MinConv. CoRR abs/2101.00694 (2021) - [i63]Sebastian Berndt, Kilian Grage, Klaus Jansen, Lukas Johannsen, Maria Kosche:
Robust Online Algorithms for Dynamic Choosing Problems. CoRR abs/2104.09803 (2021) - [i62]Max A. Deppert, Klaus Jansen, Arindam Khan, Malin Rau, Malte Tutas:
Peak Demand Minimization via Sliced Strip Packing. CoRR abs/2105.07219 (2021) - [i61]Klaus Jansen, Malin Rau:
Closing the gap for single resource constraint scheduling. CoRR abs/2107.01613 (2021) - [i60]Sebastian Berndt, Max A. Deppert, Klaus Jansen, Lars Rohwedder:
Load Balancing: The Long Road from Theory to Practice. CoRR abs/2107.13638 (2021) - 2020
- [j103]Klaus Jansen, Lars Rohwedder
:
A note on the integrality gap of the configuration LP for restricted Santa Claus. Inf. Process. Lett. 164: 106025 (2020) - [j102]Klaus Jansen, Kim-Manuel Klein
, José Verschae
:
Closing the Gap for Makespan Scheduling via Sparsification Techniques. Math. Oper. Res. 45(4): 1371-1392 (2020) - [j101]Klaus Jansen, Kim-Manuel Klein
:
About the Structure of the Integer Cone and Its Application to Bin Packing. Math. Oper. Res. 45(4): 1498-1511 (2020) - [j100]Sebastian Berndt
, Klaus Jansen, Kim-Manuel Klein:
Fully dynamic bin packing revisited. Math. Program. 179(1): 109-155 (2020) - [j99]Sören Henning
, Klaus Jansen, Malin Rau
, Lars Schmarje:
Complexity and Inapproximability Results for Parallel Task Scheduling and Strip Packing. Theory Comput. Syst. 64(1): 120-140 (2020) - [j98]Klaus Jansen, Lars Rohwedder
:
A Quasi-Polynomial Approximation for the Restricted Assignment Problem. SIAM J. Comput. 49(6): 1083-1108 (2020) - [j97]Klaus Jansen, Alexandra Lassota
, Lars Rohwedder
:
Near-Linear Time Algorithm for n-Fold ILPs via Color Coding. SIAM J. Discret. Math. 34(4): 2282-2299 (2020) - [j96]Klaus Jansen, Marten Maack, Roberto Solis-Oba:
Structural parameters for scheduling with assignment restrictions. Theor. Comput. Sci. 844: 154-170 (2020) - [c146]Waldo Gálvez
, Fabrizio Grandoni
, Afrouz Jabal Ameli
, Klaus Jansen
, Arindam Khan
, Malin Rau
:
A Tight (3/2+ε) Approximation for Skewed Strip Packing. APPROX-RANDOM 2020: 44:1-44:18 - [c145]Klaus Jansen, Alexandra Lassota
, Marten Maack:
Approximation Algorithms for Scheduling with Class Constraints. SPAA 2020: 349-357 - [c144]Marten Maack
, Klaus Jansen
:
Inapproximability Results for Scheduling with Interval and Resource Restrictions. STACS 2020: 5:1-5:18 - [i59]Max A. Deppert, Klaus Jansen, Kim-Manuel Klein:
Fuzzy Simultaneous Congruences. CoRR abs/2002.07746 (2020) - [i58]Sebastian Berndt, Klaus Jansen, Kim-Manuel Klein:
New Bounds for the Vertices of the Integer Hull. CoRR abs/2006.10847 (2020) - [i57]Klaus Jansen, Kim-Manuel Klein, Alexandra Lassota:
The Double Exponential Runtime is Tight for 2-Stage Stochastic ILPs. CoRR abs/2008.12928 (2020) - [i56]Sebastian Berndt, Klaus Jansen, Alexandra Lassota:
Tightness of Sensitivity and Proximity Bounds for Integer Linear Programs. CoRR abs/2010.09255 (2020) - [i55]Klaus Jansen, Alexandra Lassota, Marten Maack, Tytus Pikies:
Total Completion Time Minimization for Scheduling with Incompatibility Cliques. CoRR abs/2011.06150 (2020)
2010 – 2019
- 2019
- [j95]Klaus Jansen, Marten Maack
:
An EPTAS for Scheduling on Unrelated Machines of Few Different Types. Algorithmica 81(10): 4134-4164 (2019) - [j94]Klaus Jansen, Kim-Manuel Klein:
A Robust AFPTAS for Online Bin Packing with Polynomial Migration. SIAM J. Discret. Math. 33(4): 2062-2091 (2019) - [j93]Klaus Jansen, Marten Maack, Malin Rau
:
Approximation Schemes for Machine Scheduling with Resource (In-)dependent Processing Times. ACM Trans. Algorithms 15(3): 31:1-31:28 (2019) - [j92]Klaus Jansen, Malin Rau
:
Improved approximation for two dimensional Strip Packing with polynomial bounded width. Theor. Comput. Sci. 789: 34-49 (2019) - [c143]Sebastian Berndt, Leah Epstein, Klaus Jansen, Asaf Levin
, Marten Maack, Lars Rohwedder
:
Online Bin Covering with Limited Migration. ESA 2019: 18:1-18:14 - [c142]Klaus Jansen, Malin Rau
:
Closing the Gap for Pseudo-Polynomial Strip Packing. ESA 2019: 62:1-62:14 - [c141]Klaus Jansen, Malin Rau
:
Linear Time Algorithms for Multiple Cluster Scheduling and Multiple Strip Packing. Euro-Par 2019: 103-116 - [c140]Klaus Jansen, Lars Rohwedder
:
Local Search Breaks 1.75 for Graph Balancing. ICALP 2019: 74:1-74:14 - [c139]Klaus Jansen, Alexandra Lassota
, Lars Rohwedder
:
Near-Linear Time Algorithm for n-fold ILPs via Color Coding. ICALP 2019: 75:1-75:13 - [c138]Klaus Jansen, Lars Rohwedder
:
On Integer Programming and Convolution. ITCS 2019: 43:1-43:17 - [c137]Klaus Jansen, Kim-Manuel Klein, Marten Maack, Malin Rau
:
Empowering the Configuration-IP - New PTAS Results for Scheduling with Setups Times. ITCS 2019: 44:1-44:19 - [c136]Klaus Jansen, Marten Maack, Alexander Mäcker:
Scheduling on (Un-)Related Machines with Setup Times. IPDPS 2019: 145-154 - [c135]Kilian Grage, Klaus Jansen, Kim-Manuel Klein:
An EPTAS for Machine Scheduling with Bag-Constraints. SPAA 2019: 135-144 - [c134]Max A. Deppert, Klaus Jansen:
Near-Linear Approximation Algorithms for Scheduling Problems with Batch Setup Times. SPAA 2019: 155-164 - [c133]Sebastian Berndt, Valentin Dreismann, Kilian Grage, Klaus Jansen, Ingmar Knof:
Robust Online Algorithms for Certain Dynamic Packing Problems. WAOA 2019: 43-59 - [c132]Marin Bougeret
, Klaus Jansen, Michael Poss
, Lars Rohwedder
:
Approximation Results for Makespan Minimization with Budgeted Uncertainty. WAOA 2019: 60-71 - [i54]Klaus Jansen, Malin Rau:
Linear Time Algorithms for Multiple Cluster Scheduling and Multiple Strip Packing. CoRR abs/1902.03428 (2019) - [i53]Sebastian Berndt, Leah Epstein, Klaus Jansen, Asaf Levin, Marten Maack, Lars Rohwedder:
Online Bin Covering with Limited Migration. CoRR abs/1904.06543 (2019) - [i52]Sebastian Berndt, Valentin Dreismann, Kilian Grage, Klaus Jansen, Ingmar Knof:
Robust Online Algorithms for Dynamic Problems. CoRR abs/1905.07986 (2019) - [i51]Marin Bougeret
, Klaus Jansen, Michael Poss, Lars Rohwedder:
Approximation results for makespan minimization with budgeted uncertainty. CoRR abs/1905.08592 (2019) - [i50]Marten Maack, Klaus Jansen:
Inapproximability Results for Scheduling with Interval and Resource Restrictions. CoRR abs/1907.03526 (2019) - [i49]Klaus Jansen, Alexandra Lassota, Marten Maack:
Approximation Algorithms for Scheduling with Class Constraints. CoRR abs/1909.11970 (2019) - [i48]Thi Huyen Chau Nguyen, Werner Grass, Klaus Jansen:
Exact Polynomial Time Algorithm for the Response Time Analysis of Harmonic Tasks with Constrained Release Jitter. CoRR abs/1912.01161 (2019) - 2018
- [j91]Klaus Jansen, Kati Land
, Marten Maack:
Estimating the Makespan of the Two-Valued Restricted Assignment Problem. Algorithmica 80(4): 1357-1382 (2018) - [j90]Klaus Jansen, Stefan Erich Julius Kraft:
A faster FPTAS for the Unbounded Knapsack Problem. Eur. J. Comb. 68: 148-174 (2018) - [j89]Jan Clemens Gehrke, Klaus Jansen, Stefan E. J. Kraft, Jakob Schikowski:
A PTAS for Scheduling Unrelated Machines of Few Different Types. Int. J. Found. Comput. Sci. 29(4): 591-621 (2018) - [j88]Lin Chen
, Klaus Jansen, Guochuan Zhang
:
On the optimality of exact and approximation algorithms for scheduling problems. J. Comput. Syst. Sci. 96: 1-32 (2018) - [j87]Cristina Bazgan, Ljiljana Brankovic
, Katrin Casel, Henning Fernau
, Klaus Jansen, Kim-Manuel Klein, Michael Lampis, Mathieu Liedloff, Jérôme Monnot, Vangelis Th. Paschos:
The many facets of upper domination. Theor. Comput. Sci. 717: 2-25 (2018) - [c131]Sören Henning, Klaus Jansen, Malin Rau, Lars Schmarje:
Complexity and Inapproximability Results for Parallel Task Scheduling and Strip Packing. CSR 2018: 169-180 - [c130]Klaus Jansen, Felix Land:
Scheduling Monotone Moldable Jobs in Linear Time. IPDPS 2018: 172-181 - [c129]Klaus Jansen, Lars Rohwedder
:
Compact LP Relaxations for Allocation Problems. SOSA 2018: 11:1-11:19 - [e30]Eric Blais, Klaus Jansen, José D. P. Rolim, David Steurer:
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2018, August 20-22, 2018 - Princeton, NJ, USA. LIPIcs 116, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2018, ISBN 978-3-95977-085-9 [contents] - [i47]Klaus Jansen, Kim-Manuel Klein, Marten Maack, Malin Rau:
Empowering the Configuration-IP - New PTAS Results for Scheduling with Setups Times. CoRR abs/1801.06460 (2018) - [i46]Klaus Jansen, Lars Rohwedder:
On Integer Programming and Convolution. CoRR abs/1803.04744 (2018) - [i45]Klaus Jansen, Lars Rohwedder:
A note on the integrality gap of the configuration LP for restricted Santa Claus. CoRR abs/1807.03626 (2018) - [i44]Klaus Jansen, Marten Maack, Alexander Mäcker:
Scheduling on (Un-)Related Machines with Setup Times. CoRR abs/1809.10428 (2018) - [i43]Max A. Deppert, Klaus Jansen:
Near-Linear Approximation Algorithms for Scheduling Problems with Batch Setup Times. CoRR abs/1810.01223 (2018) - [i42]Kilian Grage, Klaus Jansen, Kim-Manuel Klein:
An EPTAS for machine scheduling with bag-constraints. CoRR abs/1810.07510 (2018) - [i41]Klaus Jansen, Alexandra Lassota, Lars Rohwedder:
Near-Linear Time Algorithm for n-fold ILPs via Color Coding. CoRR abs/1811.00950 (2018) - [i40]Klaus Jansen, Lars Rohwedder:
Local search breaks 1.75 for Graph Balancing. CoRR abs/1811.00955 (2018) - 2017
- [c128]Klaus Jansen, Kim-Manuel Klein, Maria Kosche, Leon Ladewig:
Online Strip Packing with Polynomial Migration. APPROX-RANDOM 2017: 13:1-13:18 - [c127]Klaus Jansen, Lars Rohwedder
:
Structured Instances of Restricted Assignment with Two Processing Times. CALDAM 2017: 230-241 - [c126]Klaus Jansen:
New Algorithmic Results for Bin Packing and Scheduling. CIAC 2017: 10-15 - [c125]Klaus Jansen, Marten Maack, Roberto Solis-Oba:
Structural Parameters for Scheduling with Assignment Restrictions. CIAC 2017: 357-368 - [c124]Klaus Jansen, Lars Rohwedder
:
A Quasi-Polynomial Approximation for the Restricted Assignment Problem. IPCO 2017: 305-316 - [c123]Klaus Jansen, Kim-Manuel Klein
:
About the Structure of the Integer Cone and its Application to Bin Packing. SODA 2017: 1571-1581 - [c122]Klaus Jansen, Lars Rohwedder
:
On the Configuration-LP of the Restricted Assignment Problem. SODA 2017: 2670-2678 - [c121]Klaus Jansen, Marten Maack:
An EPTAS for Scheduling on Unrelated Machines of Few Different Types. WADS 2017: 497-508 - [c120]Klaus Jansen, Malin Rau
:
Improved Approximation for Two Dimensional Strip Packing with Polynomial Bounded Width. WALCOM 2017: 409-420 - [e29]Klaus Jansen, José D. P. Rolim, David Williamson, Santosh S. Vempala:
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2017, August 16-18, 2017, Berkeley, CA, USA. LIPIcs 81, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2017, ISBN 978-3-95977-044-6 [contents] - [e28]Klaus Jansen, Monaldo Mastrolilli:
Approximation and Online Algorithms - 14th International Workshop, WAOA 2016, Aarhus, Denmark, August 25-26, 2016, Revised Selected Papers. Lecture Notes in Computer Science 10138, Springer 2017, ISBN 978-3-319-51740-7 [contents] - [i39]Klaus Jansen, Marten Maack:
An EPTAS for Scheduling on Unrelated Machines of Few Different Types. CoRR abs/1701.03263 (2017) - [i38]Klaus Jansen, Lars Rohwedder:
A Quasi-Polynomial Approximation for the Restricted Assignment Problem. CoRR abs/1701.07208 (2017) - [i37]Klaus Jansen, Marten Maack, Roberto Solis-Oba:
Structural Parameters for Scheduling with Assignment Restrictions. CoRR abs/1701.07242 (2017) - [i36]Sören Henning, Klaus Jansen, Malin Rau
, Lars Schmarje:
Complexity and Inapproximability Results for Parallel Task Scheduling and Strip Packing. CoRR abs/1705.04587 (2017) - [i35]Klaus Jansen, Kim-Manuel Klein, Maria Kosche, Leon Ladewig:
Online Strip Packing with Polynomial Migration. CoRR abs/1706.04939 (2017) - [i34]