default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKlaus 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
[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]Klaus Jansen, Felix Land:
Scheduling Monotone Moldable Jobs in Linear Time. CoRR abs/1711.00103 (2017) - [i33]Klaus Jansen, Malin Rau:
Closing the gap for pseudo-polynomial strip packing. CoRR abs/1712.04922 (2017) - 2016
- [j86]Klaus Jansen, Lars Prädel:
New Approximability Results for Two-Dimensional Bin Packing. Algorithmica 74(1): 208-269 (2016) - [j85]Klaus Jansen, Denis Trystram:
Scheduling parallel jobs on heterogeneous platforms. Electron. Notes Discret. Math. 55: 9-12 (2016) - [j84]Klaus Jansen, Stefan Erich Julius Kraft:
An Improved Approximation Scheme for Variable-Sized Bin Packing. Theory Comput. Syst. 59(2): 262-322 (2016) - [j83]Klaus Jansen, Felix Land, Kati Land:
Bounding the Running Time of Algorithms for Scheduling and Packing Problems. SIAM J. Discret. Math. 30(1): 343-366 (2016) - [c119]Cristina Bazgan, Ljiljana Brankovic, Katrin Casel, Henning Fernau, Klaus Jansen, Kim-Manuel Klein, Michael Lampis, Mathieu Liedloff, Jérôme Monnot, Vangelis Th. Paschos:
Algorithmic Aspects of Upper Domination: A Parameterised Perspective. AAIM 2016: 113-124 - [c118]Lin Chen, Klaus Jansen, Wenchang Luo, Guochuan Zhang:
An Efficient PTAS for Parallel Machine Scheduling with Capacity Constraints. COCOA 2016: 608-623 - [c117]Klaus Jansen, Felix Land:
Non-preemptive Scheduling with Setup Times: A PTAS. Euro-Par 2016: 159-170 - [c116]Klaus Jansen, Kim-Manuel Klein, José Verschae:
Closing the Gap for Makespan Scheduling via Sparsification Techniques. ICALP 2016: 72:1-72:13 - [c115]Cristina Bazgan, Ljiljana Brankovic, Katrin Casel, Henning Fernau, Klaus Jansen, Kim-Manuel Klein, Michael Lampis, Mathieu Liedloff, Jérôme Monnot, Vangelis Th. Paschos:
Upper Domination: Complexity and Approximation. IWOCA 2016: 241-252 - [c114]Klaus Jansen, Marten Maack, Malin Rau:
Approximation schemes for machine scheduling with resource (in-)dependent processing times. SODA 2016: 1526-1542 - [c113]Jan Clemens Gehrke, Klaus Jansen, Stefan Erich Julius Kraft, Jakob Schikowski:
A PTAS for Scheduling Unrelated Machines of Few Different Types. SOFSEM 2016: 290-301 - [c112]Klaus Jansen, Felix Land, Maren Kaluza:
Precedence Scheduling with Unit Execution Time is Equivalent to Parametrized Biclique. SOFSEM 2016: 329-343 - [c111]Klaus Jansen, Kati Land, Marten Maack:
Estimating The Makespan of The Two-Valued Restricted Assignment Problem. SWAT 2016: 24:1-24:13 - [e27]Klaus Jansen, Claire Mathieu, José D. P. Rolim, Chris Umans:
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2016, September 7-9, 2016, Paris, France. LIPIcs 60, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2016, ISBN 978-3-95977-018-7 [contents] - [r3]Klaus Jansen:
Efficient Polynomial Time Approximation Scheme for Scheduling Jobs onUniform Processors. Encyclopedia of Algorithms 2016: 624-628 - [i32]Klaus Jansen, Kim-Manuel Klein, José Verschae:
Closing the Gap for Makespan Scheduling via Sparsification Techniques. CoRR abs/1604.07153 (2016) - [i31]Klaus Jansen, Kim-Manuel Klein:
About the Structure of the Integer Cone and its Application to Bin Packing. CoRR abs/1604.07286 (2016) - [i30]Klaus Jansen, Malin Rau:
Improved approximation for two dimensional strip packing with polynomial bounded width. CoRR abs/1610.04430 (2016) - [i29]Klaus Jansen, Lars Rohwedder:
On the Configuration-LP of the Restricted Assignment Problem. CoRR abs/1611.01934 (2016) - 2015
- [j82]Marin Bougeret, Pierre-François Dutot, Denis Trystram, Klaus Jansen, Christina Robenek:
Improved approximation algorithms for scheduling parallel jobs on identical clusters. Theor. Comput. Sci. 600: 70-85 (2015) - [c110]Sebastian Berndt, Klaus Jansen, Kim-Manuel Klein:
Fully Dynamic Bin Packing Revisited . APPROX-RANDOM 2015: 135-151 - [c109]Niklas Paulsen, Florian Diedrich, Klaus Jansen:
Heuristic Approaches to Minimize Tour Duration for the TSP with Multiple Time Windows. ATMOS 2015: 42-55 - [c108]Klaus Jansen, Stefan Erich Julius Kraft:
A Faster FPTAS for the Unbounded Knapsack Problem. IWOCA 2015: 274-286 - [e26]Naveen Garg, Klaus Jansen, Anup Rao, José D. P. Rolim:
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2015, August 24-26, 2015, Princeton, NJ, USA. LIPIcs 40, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2015, ISBN 978-3-939897-89-7 [contents] - [i28]Klaus Jansen, Stefan Erich Julius Kraft:
A Faster FPTAS for the Unbounded Knapsack Problem. CoRR abs/1504.04650 (2015) - [i27]Cristina Bazgan, Ljiljana Brankovic, Katrin Casel, Henning Fernau, Klaus Jansen, Michael Lampis, Mathieu Liedloff, Jérôme Monnot, Vangelis Th. Paschos:
Algorithmic Aspects of Upper Domination. CoRR abs/1506.07260 (2015) - 2014
- [j81]Rolf Harren, Klaus Jansen, Lars Prädel, Rob van Stee:
A (5/3 + ε)-approximation for strip packing. Comput. Geom. 47(2): 248-267 (2014) - [c107]Lin Chen, Klaus Jansen, Guochuan Zhang:
On the optimality of approximation schemes for the classical scheduling problem. SODA 2014: 657-668 - [c106]Klaus Jansen, Lars Prädel:
A New Asymptotic Approximation Algorithm for 3-Dimensional Strip Packing. SOFSEM 2014: 327-338 - [e25]Klaus Jansen, José D. P. Rolim, Nikhil R. Devanur, Cristopher Moore:
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2014, September 4-6, 2014, Barcelona, Spain. LIPIcs 28, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2014, ISBN 978-3-939897-74-3 [contents] - [i26]Sebastian Berndt, Klaus Jansen, Kim-Manuel Klein:
Fully Dynamic Bin Packing Revisited. CoRR abs/1411.0960 (2014) - 2013
- [j80]Rolf Harren, Klaus Jansen, Lars Prädel, Ulrich M. Schwarz, Rob van Stee:
Two for One: Tight Approximation of 2D Bin Packing. Int. J. Found. Comput. Sci. 24(8): 1299-1328 (2013) - [j79]Klaus Jansen, Stefan Kratsch, Dániel Marx, Ildikó Schlotter:
Bin packing with fixed number of bins revisited. J. Comput. Syst. Sci. 79(1): 39-49 (2013) - [c105]Klaus Jansen, Stefan Erich Julius Kraft:
An Improved Knapsack Solver for Column Generation. CSR 2013: 12-23 - [c104]Pierre-François Dutot, Klaus Jansen, Christina Robenek, Denis Trystram:
A (2 + ε)-Approximation for Scheduling Parallel Jobs in Platforms. Euro-Par 2013: 78-89 - [c103]Klaus Jansen, Kim-Manuel Klein:
A Robust AFPTAS for Online Bin Packing with Polynomial Migration, . ICALP (1) 2013: 589-600 - [c102]Klaus Jansen, Lars Prädel:
New Approximability Results for Two-Dimensional Bin Packing. SODA 2013: 919-936 - [c101]Thorsten Ehlers, Klaus Jansen:
Online-Scheduling on Identical Machines with Bounded Migration. SYNASC 2013: 361-366 - [c100]Klaus Jansen, Felix Land, Kati Land:
Bounding the Running Time of Algorithms for Scheduling and Packing Problems. WADS 2013: 439-450 - [e24]Prasad Raghavendra, Sofya Raskhodnikova, Klaus Jansen, José D. P. Rolim:
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques - 16th International Workshop, APPROX 2013, and 17th International Workshop, RANDOM 2013, Berkeley, CA, USA, August 21-23, 2013. Proceedings. Lecture Notes in Computer Science 8096, Springer 2013, ISBN 978-3-642-40327-9 [contents] - [e23]Andreas Brandstädt, Klaus Jansen, Rüdiger Reischuk:
Graph-Theoretic Concepts in Computer Science - 39th International Workshop, WG 2013, Lübeck, Germany, June 19-21, 2013, Revised Papers. Lecture Notes in Computer Science 8165, Springer 2013, ISBN 978-3-642-45042-6 [contents] - [i25]Klaus Jansen, Kim-Manuel Klein:
A Robust AFPTAS for Online Bin Packing with Polynomial Migration. CoRR abs/1302.4213 (2013) - [i24]Lin Chen, Klaus Jansen, Guochuan Zhang:
On the optimality of approximation schemes for the classical scheduling problem. CoRR abs/1310.0398 (2013) - 2012
- [j78]Klaus Jansen, Hu Zhang:
Scheduling malleable tasks with precedence constraints. J. Comput. Syst. Sci. 78(1): 245-259 (2012) - [j77]Klaus Jansen, Roberto Solis-Oba:
Packing Squares with Profits. SIAM J. Discret. Math. 26(1): 263-279 (2012) - [j76]Florian Diedrich, Klaus Jansen, Lars Prädel, Ulrich M. Schwarz, Ola Svensson:
Tight approximation algorithms for scheduling with fixed jobs and nonavailability. ACM Trans. Algorithms 8(3): 27:1-27:15 (2012) - [c99]Rolf Harren, Klaus Jansen, Lars Prädel, Rob van Stee:
A (5/3 + eps)-Approximation for 2D Strip Packing. CTW 2012: 139-142 - [c98]Marin Bougeret, Pierre-François Dutot, Klaus Jansen, Christina Robenek, Denis Trystram:
Tight Approximation for Scheduling Parallel Jobs on Identical Clusters. IPDPS Workshops 2012: 878-885 - [c97]Klaus Jansen, Stefan Erich Julius Kraft:
An Improved Approximation Scheme for Variable-Sized Bin Packing. MFCS 2012: 529-541 - [c96]Klaus Jansen:
A Fast Approximation Scheme for the Multiple Knapsack Problem. SOFSEM 2012: 313-324 - [c95]Klaus Jansen:
A(3/2+ε) approximation algorithm for scheduling moldable and non-moldable parallel tasks. SPAA 2012: 224-235 - [e22]Anupam Gupta, Klaus Jansen, José D. P. Rolim, Rocco A. Servedio:
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques - 15th International Workshop, APPROX 2012, and 16th International Workshop, RANDOM 2012, Cambridge, MA, USA, August 15-17, 2012. Proceedings. Lecture Notes in Computer Science 7408, Springer 2012, ISBN 978-3-642-32511-3 [contents] - 2011
- [j75]Marin Bougeret, Pierre-François Dutot, Klaus Jansen, Christina Robenek, Denis Trystram:
Approximation Algorithms for Multiple Strip Packing and Scheduling Parallel Jobs in Platforms. Discret. Math. Algorithms Appl. 3(4): 553-586 (2011) - [j74]Klaus Jansen, Roberto Solis-Oba:
A simple OPT+1 algorithm for cutting stock under the modified integer round-up property assumption. Inf. Process. Lett. 111(10): 479-482 (2011) - [j73]Klaus Jansen, Roberto Solis-Oba:
A Polynomial Time OPT + 1 Algorithm for the Cutting Stock Problem with a Constant Number of Object Lengths. Math. Oper. Res. 36(4): 743-753 (2011) - [c94]Klaus Jansen, Lars Prädel, Ulrich M. Schwarz, Ola Svensson:
Faster Approximation Algorithms for Scheduling with Fixed Jobs. CATS 2011: 3-10 - [c93]Marin Bougeret, Pierre-François Dutot, Klaus Jansen, Christina Robenek, Denis Trystram:
Scheduling Jobs on Heterogeneous Platforms. COCOON 2011: 271-283 - [c92]Rolf Harren, Klaus Jansen, Lars Prädel, Rob van Stee:
A (5/3 + ε)-Approximation for Strip Packing. WADS 2011: 475-487 - [c91]Klaus Jansen:
Approximation Algorithms for Scheduling and Packing Problems. WAOA 2011: 1-8 - [c90]Klaus Jansen, Christina Robenek:
Scheduling Jobs on Identical and Uniform Processors Revisited. WAOA 2011: 109-122 - [e21]Leslie Ann Goldberg, Klaus Jansen, R. Ravi, José D. P. Rolim:
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques - 14th International Workshop, APPROX 2011, and 15th International Workshop, RANDOM 2011, Princeton, NJ, USA, August 17-19, 2011. Proceedings. Lecture Notes in Computer Science 6845, Springer 2011, ISBN 978-3-642-22934-3 [contents] - [e20]Klaus Jansen, Roberto Solis-Oba:
Approximation and Online Algorithms - 8th International Workshop, WAOA 2010, Liverpool, UK, September 9-10, 2010. Revised Papers. Lecture Notes in Computer Science 6534, Springer 2011, ISBN 978-3-642-18317-1 [contents] - [i23]Klaus Jansen, Claire Mathieu, Hadas Shachnai, Neal E. Young:
Packing and Scheduling Algorithms for Information and Communication Services (Dagstuhl Seminar 11091). Dagstuhl Reports 1(2): 67-93 (2011) - 2010
- [j72]Florian Diedrich, Klaus Jansen, Fanny Pascual, Denis Trystram:
Approximation Algorithms for Scheduling with Reservations. Algorithmica 58(2): 391-404 (2010) - [j71]Klaus Jansen, Roberto Solis-Oba:
Approximation Schemes for Scheduling Jobs with Chain Precedence Constraints. Int. J. Found. Comput. Sci. 21(1): 27-49 (2010) - [j70]Thomas Erlebach, Torben Hagerup, Klaus Jansen, Moritz Minzlaff, Alexander Wolff:
Trimming of Graphs, with Application to Point Labeling. Theory Comput. Syst. 47(3): 613-636 (2010) - [j69]Klaus Jansen, Ralf Thöle:
Approximation Algorithms for Scheduling Parallel Jobs. SIAM J. Comput. 39(8): 3571-3615 (2010) - [j68]Klaus Jansen:
An EPTAS for Scheduling Jobs on Uniform Processors: Using an MILP Relaxation with a Constant Number of Integral Variables. SIAM J. Discret. Math. 24(2): 457-485 (2010) - [c89]Marin Bougeret, Pierre-François Dutot, Klaus Jansen, Christina Otte, Denis Trystram:
A Fast 5/2-Approximation Algorithm for Hierarchical Scheduling. Euro-Par (1) 2010: 157-167 - [c88]Marin Bougeret, Pierre-François Dutot, Klaus Jansen, Christina Otte, Denis Trystram:
Approximating the Non-contiguous Multiple Organization Packing Problem. IFIP TCS 2010: 316-327 - [c87]Klaus Jansen, Roberto Solis-Oba:
An OPT + 1 Algorithm for the Cutting Stock Problem with Constant Number of Object Lengths. IPCO 2010: 438-449 - [c86]Klaus Jansen, Stefan Kratsch, Dániel Marx, Ildikó Schlotter:
Bin Packing with Fixed Number of Bins Revisited. SWAT 2010: 260-272 - [e19]Maria J. Serna, Ronen Shaltiel, Klaus Jansen, José D. P. Rolim:
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 13th International Workshop, APPROX 2010, and 14th International Workshop, RANDOM 2010, Barcelona, Spain, September 1-3, 2010. Proceedings. Lecture Notes in Computer Science 6302, Springer 2010, ISBN 978-3-642-15368-6 [contents] - [e18]Evripidis Bampis, Klaus Jansen:
Approximation and Online Algorithms, 7th International Workshop, WAOA 2009, Copenhagen, Denmark, September 10-11, 2009. Revised Papers. Lecture Notes in Computer Science 5893, Springer 2010, ISBN 978-3-642-12449-5 [contents]
2000 – 2009
- 2009
- [j67]Klaus Jansen, Roberto Solis-Oba:
Rectangle packing with one-dimensional resource augmentation. Discret. Optim. 6(3): 310-323 (2009) - [j66]Klaus Jansen:
Parameterized Approximation Scheme for the Multiple Knapsack Problem. SIAM J. Comput. 39(4): 1392-1412 (2009) - [c85]Florian Diedrich, Klaus Jansen, Ulrich M. Schwarz, Denis Trystram:
A Survey on Approximation Algorithms for Scheduling with Machine Unavailability. Algorithmics of Large and Complex Networks 2009: 50-64 - [c84]Klaus Jansen:
An EPTAS for Scheduling Jobs on Uniform Processors: Using an MILP Relaxation with a Constant Number of Integral Variables. ICALP (1) 2009: 562-573 - [c83]Nikhil Bansal, Alberto Caprara, Klaus Jansen, Lars Prädel, Maxim Sviridenko:
A Structural Lemma in 2-Dimensional Packing, and Its Implications on Approximability. ISAAC 2009: 77-86 - [c82]Klaus Jansen:
Parameterized approximation scheme for the multiple knapsack problem. SODA 2009: 665-674 - [c81]Florian Diedrich, Klaus Jansen:
Improved approximation algorithms for scheduling with fixed jobs. SODA 2009: 675-684 - [c80]Klaus Jansen, Lars Prädel, Ulrich M. Schwarz:
Two for One: Tight Approximation of 2D Bin Packing. WADS 2009: 399-410 - [c79]Marin Bougeret, Pierre-François Dutot, Klaus Jansen, Christina Otte, Denis Trystram:
Approximation Algorithms for Multiple Strip Packing. WAOA 2009: 37-48 - [e17]Irit Dinur, Klaus Jansen, Joseph Naor, José D. P. Rolim:
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 12th International Workshop, APPROX 2009, and 13th International Workshop, RANDOM 2009, Berkeley, CA, USA, August 21-23, 2009. Proceedings. Lecture Notes in Computer Science 5687, Springer 2009, ISBN 978-3-642-03684-2 [contents] - [r2]Thomas Erlebach, Klaus Jansen, Christos Kaklamanis, Giuseppe Persiano:
Directed Tree Networks. Encyclopedia of Optimization 2009: 716-725 - 2008
- [b2]Klaus Jansen, Marian Margraf:
Approximative Algorithmen und Nichtapproximierbarkeit. De Gruyter Lehrbuch, de Gruyter 2008, ISBN 978-3-11-020316-5, pp. I-XV, 1-501 - [j65]Aleksei V. Fishkin, Klaus Jansen, Monaldo Mastrolilli:
Grouping Techniques for Scheduling Problems: Simpler and Faster. Algorithmica 51(2): 183-199 (2008) - [j64]Aleksei V. Fishkin, Olga Gerber, Klaus Jansen, Roberto Solis-Oba:
On Packing Rectangles with Resource Augmentation: Maximizing the Profit. Algorithmic Oper. Res. 3(1) (2008) - [j63]Florian Diedrich, Rolf Harren, Klaus Jansen, Ralf Thöle, Henning Thomas:
Approximation Algorithms for 3D Orthogonal Knapsack. J. Comput. Sci. Technol. 23(5): 749-762 (2008) - [j62]Klaus Jansen, Hu Zhang:
Approximation algorithms for general packing problems and their application to the multicast congestion problem. Math. Program. 114(1): 183-206 (2008) - [c78]Klaus Jansen, Ralf Thöle:
Approximation Algorithms for Scheduling Parallel Jobs: Breaking the Approximation Ratio of 2. ICALP (1) 2008: 234-245 - [c77]Klaus Jansen, Roberto Solis-Oba:
A Polynomial Time Approximation Scheme for the Square Packing Problem. IPCO 2008: 184-198 - [c76]Thomas Erlebach, Torben Hagerup, Klaus Jansen, Moritz Minzlaff, Alexander Wolff:
Trimming of Graphs, with Application to Point Labeling. STACS 2008: 265-276 - [e16]Ashish Goel, Klaus Jansen, José D. P. Rolim, Ronitt Rubinfeld:
Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques, 11th International Workshop, APPROX 2008, and 12th International Workshop, RANDOM 2008, Boston, MA, USA, August 25-27, 2008. Proceedings. Lecture Notes in Computer Science 5171, Springer 2008, ISBN 978-3-540-85362-6 [contents] - [i22]Thomas Erlebach, Torben Hagerup, Klaus Jansen, Moritz Minzlaff, Alexander Wolff:
Trimming of Graphs, with Application to Point Labeling. CoRR abs/0802.2854 (2008) - 2007
- [j61]Klaus Jansen, Guochuan Zhang:
Maximizing the Total Profit of Rectangles Packed into a Rectangle. Algorithmica 47(3): 323-342 (2007) - [j60]Janka Chlebíková, Klaus Jansen:
The d-precoloring problem for k-degenerate graphs. Discret. Math. 307(16): 2042-2052 (2007) - [j59]Florian Diedrich, Klaus Jansen:
Faster and simpler approximation algorithms for mixed packing and covering problems. Theor. Comput. Sci. 377(1-3): 181-204 (2007) - [c75]Florian Diedrich, Klaus Jansen:
An Approximation Algorithm for the General Mixed Packing and Covering Problem. ESCAPE 2007: 128-139 - [c74]Florian Diedrich, Klaus Jansen, Fanny Pascual, Denis Trystram:
Approximation Algorithms for Scheduling with Reservations. HiPC 2007: 297-307 - [c73]Klaus Jansen, Roberto Solis-Oba:
New Approximability Results for 2-Dimensional Packing Problems. MFCS 2007: 103-114 - [c72]Florian Diedrich, Rolf Harren, Klaus Jansen, Ralf Thöle, Henning Thomas:
Approximation Algorithms for 3D Orthogonal Knapsack. TAMC 2007: 34-45 - [c71]Klaus Jansen:
Approximation Algorithms for Geometric Intersection Graphs. WG 2007: 151-153 - [e15]Moses Charikar, Klaus Jansen, Omer Reingold, José D. P. Rolim:
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 10th International Workshop, APPROX 2007, and 11th International Workshop, RANDOM 2007, Princeton, NJ, USA, August 20-22, 2007, Proceedings. Lecture Notes in Computer Science 4627, Springer 2007, ISBN 978-3-540-74207-4 [contents] - [e14]Andreas Brandstädt, Klaus Jansen, Dieter Kratsch, Jeremy P. Spinrad:
Exact, Approximative, Robust and Certifying Algorithms on Particular Graph Classes, 20.05. - 25.05.2007. Dagstuhl Seminar Proceedings 07211, Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany 2007 [contents] - [r1]Hu Zhang, Klaus Jansen:
Scheduling Malleable Tasks. Handbook of Approximation Algorithms and Metaheuristics 2007 - [i21]Andreas Brandstädt, Klaus Jansen, Dieter Kratsch, Jeremy P. Spinrad:
07211 Abstracts Collection - Exact, Approximative, Robust and Certifying Algorithms on Particular Graph Classes. Exact, Approximative, Robust and Certifying Algorithms on Particular Graph Classes 2007 - 2006
- [j58]Evripidis Bampis, Klaus Jansen:
Introduction. Discret. Appl. Math. 154(4): 609 (2006) - [j57]Klaus Jansen:
An approximation algorithm for the general max-min resource sharing problem. Math. Program. 106(3): 547-566 (2006) - [j56]Klaus Jansen, Lorant Porkolab:
On PreemptiveResource Constrained Scheduling: Polynomial-Time Approximation Schemes. SIAM J. Discret. Math. 20(3): 545-563 (2006) - [j55]Klaus Jansen:
Approximation Algorithm for the Mixed Fractional Packing and Covering Problem. SIAM J. Optim. 17(2): 331-352 (2006) - [j54]Klaus Jansen, Hu Zhang:
An approximation algorithm for scheduling malleable tasks under general precedence constraints. ACM Trans. Algorithms 2(3): 416-434 (2006) - [j53]Klaus Jansen, Roberto Solis-Oba:
Preface. Theor. Comput. Sci. 361(2-3): 131-132 (2006) - [c70]Klaus Jansen, Roberto Solis-Oba:
An asymptotic approximation algorithm for 3D-strip packing. SODA 2006: 143-152 - [c69]Mihhail Aizatulin, Florian Diedrich, Klaus Jansen:
Implementation of Approximation Algorithms for the Max-Min Resource Sharing Problem. WEA 2006: 207-218 - [p1]Klaus Jansen:
Approximation Algorithms for Min-Max and Max-Min Resource Sharing Problems, and Applications. Efficient Approximation and Online Algorithms 2006: 156-202 - [e13]Josep Díaz, Klaus Jansen, José D. P. Rolim, Uri Zwick:
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 9th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2006 and 10th International Workshop on Randomization and Computation, RANDOM 2006, Barcelona, Spain, August 28-30 2006, Proceedings. Lecture Notes in Computer Science 4110, Springer 2006, ISBN 3-540-38044-2 [contents] - [e12]Evripidis Bampis, Klaus Jansen, Claire Kenyon:
Efficient Approximation and Online Algorithms - Recent Progress on Classical Combinatorial Optimization Problems and New Applications. Lecture Notes in Computer Science 3484, Springer 2006, ISBN 978-3-540-32212-2 [contents] - 2005
- [j52]Thomas Erlebach, Klaus Jansen:
Conversion of coloring algorithms into maximum weight independent set algorithms. Discret. Appl. Math. 148(1): 107-125 (2005) - [j51]Klaus Jansen, Monaldo Mastrolilli, Roberto Solis-Oba:
Approximation schemes for job shop scheduling problems with controllable processing times. Eur. J. Oper. Res. 167(2): 297-319 (2005) - [j50]Klaus Jansen, Monaldo Mastrolilli, Roberto Solis-Oba:
Approximation algorithms for flexible job shop problems. Int. J. Found. Comput. Sci. 16(2): 361-379 (2005) - [j49]Thomas Erlebach, Klaus Jansen, Eike Seidel:
Polynomial-Time Approximation Schemes for Geometric Intersection Graphs. SIAM J. Comput. 34(6): 1302-1323 (2005) - [j48]Klaus Jansen, Marek Karpinski, Andrzej Lingas, Eike Seidel:
Polynomial Time Approximation Schemes for MAX-BISECTION on Planar and Geometric Graphs. SIAM J. Comput. 35(1): 110-119 (2005) - [j47]Klaus Jansen, Lorant Porkolab:
General Multiprocessor Task Scheduling: Approximate Solutions in Linear Time. SIAM J. Comput. 35(3): 519-530 (2005) - [c68]Aleksei V. Fishkin, Olga Gerber, Klaus Jansen, Roberto Solis-Oba:
On Packing Squares with Resource Augmentation: Maximizing the Profit. CATS 2005: 61-67 - [c67]Aleksei V. Fishkin, Klaus Jansen, Sergey V. Sevastianov, René Sitters:
Preemptive Scheduling of Independent Jobs on Identical Parallel Machines Subject to Migration Delays. ESA 2005: 580-591 - [c66]Klaus Jansen, Hu Zhang:
An Approximation Algorithm for Scheduling Malleable Tasks Under General Precedence Constraints. ISAAC 2005: 236-245 - [c65]Aleksei V. Fishkin, Olga Gerber, Klaus Jansen:
On Efficient Weighted Rectangle Packing with Large Resources. ISAAC 2005: 1039-1050 - [c64]Aleksei V. Fishkin, Olga Gerber, Klaus Jansen, Roberto Solis-Oba:
Packing Weighted Rectangles into a Square. MFCS 2005: 352-363 - [c63]Klaus Jansen, Hu Zhang:
Scheduling malleable tasks with precedence constraints. SPAA 2005: 86-95 - [c62]Klaus Jansen, Rob van Stee:
On strip packing With rotations. STOC 2005: 755-761 - [e11]Chandra Chekuri, Klaus Jansen, José D. P. Rolim, Luca Trevisan:
Approximation, Randomization and Combinatorial Optimization, Algorithms and Techniques, 8th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2005 and 9th InternationalWorkshop on Randomization and Computation, RANDOM 2005, Berkeley, CA, USA, August 22-24, 2005, Proceedings. Lecture Notes in Computer Science 3624, Springer 2005, ISBN 3-540-28239-4 [contents] - 2004
- [j46]Klaus Jansen, Samir Khuller:
Guest Editors' Introduction. Algorithmica 38(3): 415-416 (2004) - [j45]Klaus Jansen:
Scheduling Malleable Parallel Tasks: An Asymptotic Fully Polynomial Time Approximation Scheme. Algorithmica 39(1): 59-81 (2004) - [j44]Klaus Jansen, Monaldo Mastrolilli:
Approximation schemes for parallel machine scheduling problems with controllable processing times. Comput. Oper. Res. 31(10): 1565-1581 (2004) - [j43]Klaus Jansen, Lorant Porkolab:
Preemptive Scheduling with Dedicated Processors: Applications of Fractional Graph Coloring. J. Sched. 7(1): 35-48 (2004) - [c61]Klaus Jansen:
Approximation Algorithms for Mixed Fractional Packing and Covering Problems. IFIP TCS 2004: 223-236 - [c60]Aleksei V. Fishkin, Olga Gerber, Klaus Jansen:
On Weighted Rectangle Packing with Large Resources. IFIP TCS 2004: 237-250 - [c59]Klaus Jansen, Guochuan Zhang:
On rectangle packing: maximizing benefits. SODA 2004: 204-213 - [c58]Klaus Jansen:
Approximation Algorithms for the General Max-min Resource Sharing Problem: Faster and Simpler. SWAT 2004: 311-322 - [c57]Klaus Jansen, Guochuan Zhang:
Maximizing the Number of Packed Rectangles. SWAT 2004: 362-371 - [c56]Klaus Jansen:
Approximation Algorithms for Mixed Fractional Packing and Covering Problems. WAOA 2004: 6-8 - [e10]Klaus Jansen, Sanjeev Khanna, José D. P. Rolim, Dana Ron:
Approximation, Randomization, and Combinatorial Optimization, Algorithms and Techniques, 7th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2004, and 8th International Workshop on Randomization and Computation, RANDOM 2004, Cambridge, MA, USA, August 22-24, 2004, Proceedings. Lecture Notes in Computer Science 3122, Springer 2004, ISBN 3-540-22894-2 [contents] - [e9]Andreas Brandstädt, Derek G. Corneil, Klaus Jansen, Jeremy P. Spinrad:
Robust and Approximative Algorithms an Particular Graph Classes, 23.05. - 28.05.2004. Dagstuhl Seminar Proceedings 04221, Internationales Begegnungs- und Forschungszentrum für Informatik (IBFI), Schloss Dagstuhl, Germany 2004 [contents] - [e8]Klaus Jansen, Roberto Solis-Oba:
Approximation and Online Algorithms, First International Workshop, WAOA 2003, Budapest, Hungary, September 16-18, 2003, Revised Papers. Lecture Notes in Computer Science 2909, Springer 2004, ISBN 3-540-21079-2 [contents] - [i20]Andreas Brandstädt, Derek G. Corneil, Klaus Jansen, Jeremy P. Spinrad:
04221 Abstracts Collection - Robust and Approximative Algorithms on Particular Graph Classes. Robust and Approximative Algorithms an Particular Graph Classes 2004 - 2003
- [j42]Klaus Jansen:
The mutual exclusion scheduling problem for permutation and comparability graphs. Inf. Comput. 180(2): 71-81 (2003) - [j41]Klaus Jansen, Lorant Porkolab:
Computing optimal preemptive schedules for parallel tasks: linear programming approaches. Math. Program. 95(3): 617-630 (2003) - [j40]Klaus Jansen, Roberto Solis-Oba, Maxim Sviridenko:
Makespan Minimization in Job Shops: A Linear Time Approximation Scheme. SIAM J. Discret. Math. 16(2): 288-300 (2003) - [j39]Jirí Fiala, Klaus Jansen, Van Bang Le, Eike Seidel:
Graph Subcolorings: Complexity and Algorithms. SIAM J. Discret. Math. 16(4): 635-650 (2003) - [j38]Klaus Jansen:
Approximate strong separation with application in fractional graph coloring and preemptive scheduling. Theor. Comput. Sci. 302(1-3): 239-256 (2003) - [j37]Klaus Jansen, Roberto Solis-Oba:
An asymptotic fully polynomial time approximation scheme for bin covering. Theor. Comput. Sci. 306(1-3): 543-551 (2003) - [c55]Aleksei V. Fishkin, Klaus Jansen, Monaldo Mastrolilli:
On Minimizing Average Weighted Completion Time: A PTAS for the Job Shop Problem with Release Dates. ISAAC 2003: 319-328 - [c54]Klaus Jansen, Roberto Solis-Oba:
Approximation Algorithms for Scheduling Jobs with Chain Precedence Constraints. PPAM 2003: 105-112 - [e7]Sanjeev Arora, Klaus Jansen, José D. P. Rolim, Amit Sahai:
Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques, 6th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2003 and 7th International Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM 2003, Princeton, NJ, USA, August 24-26, 2003, Proceedings. Lecture Notes in Computer Science 2764, Springer 2003, ISBN 3-540-40770-7 [contents] - [e6]Klaus Jansen, Marian Margraf, Monaldo Mastrolilli, José D. P. Rolim:
Experimental and Efficient Algorithms, Second International Workshop, WEA 2003, Ascona, Switzerland, May 26-28, 2003, Proceedings. Lecture Notes in Computer Science 2647, Springer 2003, ISBN 3-540-40205-5 [contents] - 2002
- [j36]Klaus Jansen, Lorant Porkolab:
Linear-Time Approximation Schemes for Scheduling Malleable Parallel Tasks. Algorithmica 32(3): 507-520 (2002) - [j35]Klaus Jansen, Lorant Porkolab:
Polynomial time approximation schemes for general multiprocessor job shop scheduling. J. Algorithms 45(2): 167-191 (2002) - [j34]Thomas Erlebach, Klaus Jansen:
Implementation of Approximation Algorithms for Weighted and Unweighted Edge-Disjoint Paths in Bidirected Trees. ACM J. Exp. Algorithmics 7: 6 (2002) - [j33]Thomas Balzer, Klaus Jansen:
A duality approach to problems of combined stopping and deciding under constraints. Math. Methods Oper. Res. 55(3): 431-446 (2002) - [c53]Klaus Jansen:
Scheduling Malleable Parallel Tasks: An Asymptotic Fully Polynomial-Time Approximation Scheme. ESA 2002: 562-573 - [c52]Klaus Jansen, Hu Zhang:
Approximation Algorithms for General Packing Problems with Modified Logarithmic Potential Function. IFIP TCS 2002: 255-266 - [c51]Klaus Jansen, Lorant Porkolab:
On Preemptive Resource Constrained Scheduling: Polynomial-Time Approximation Schemes. IPCO 2002: 329-349 - [c50]Klaus Jansen, Roberto Solis-Oba:
An Asymptotic Fully Polynomial Time Approximation Scheme for Bin Covering. ISAAC 2002: 175-186 - [c49]Klaus Jansen:
Approximate Strong Separation with Application in Fractional Graph Coloring and Preemptive Scheduling. STACS 2002: 100-111 - [e5]Klaus Jansen, Stefano Leonardi, Vijay V. Vazirani:
Approximation Algorithms for Combinatorial Optimization, 5th International Workshop, APPROX 2002, Rome, Italy, September 17-21, 2002, Proceedings. Lecture Notes in Computer Science 2462, Springer 2002, ISBN 3-540-44186-7 [contents] - 2001
- [j32]Klaus Jansen, José D. P. Rolim:
Guest Editors' Introduction. Algorithmica 30(3): 351-352 (2001) - [j31]Klaus Jansen, Lorant Porkolab:
Improved Approximation Schemes for Scheduling Unrelated Parallel Machines. Math. Oper. Res. 26(2): 324-338 (2001) - [j30]Thomas Erlebach, Klaus Jansen:
The Maximum Edge-Disjoint Paths Problem in Bidirected Trees. SIAM J. Discret. Math. 14(3): 326-355 (2001) - [j29]Thomas Erlebach, Klaus Jansen:
The complexity of path coloring and call scheduling. Theor. Comput. Sci. 255(1-2): 33-50 (2001) - [c48]Aleksei V. Fishkin, Klaus Jansen, Monaldo Mastrolilli:
Grouping Techniques for Scheduling Problems: Simpler and Faster. ESA 2001: 206-217 - [c47]Klaus Jansen:
Approximation Algorithms for Fractional Covering and Packing Problems, and Applications. FCT 2001: 14 - [c46]Aleksei V. Fishkin, Klaus Jansen, Lorant Porkolab:
On Minimizing Average Weighted Completion Time: A PTAS for Scheduling General Multiprocessor Tasks. FCT 2001: 495-507 - [c45]Aleksei V. Fishkin, Klaus Jansen, Lorant Porkolab:
On Minimizing Average Weighted Completion Time of Multiprocessor Tasks with Release Dates. ICALP 2001: 875-886 - [c44]Klaus Jansen, Monaldo Mastrolilli, Roberto Solis-Oba:
Job Shop Scheduling Problems with Controllable Processing Times. ICTCS 2001: 107-122 - [c43]Thomas Erlebach, Klaus Jansen, Eike Seidel:
Polynomial-time approximation schemes for geometric graphs. SODA 2001: 671-679 - [c42]Klaus Jansen, Marek Karpinski, Andrzej Lingas, Eike Seidel:
Polynomial Time Approximation Schemes for MAX-BISECTION on Planar and Geometric Graphs. STACS 2001: 365-375 - [c41]Jirí Fiala, Klaus Jansen, Van Bang Le, Eike Seidel:
Graph Subcolorings: Complexity and Algorithms. WG 2001: 154-165 - [e4]Michel X. Goemans, Klaus Jansen, José D. P. Rolim, Luca Trevisan:
Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques, 4th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2001 and 5th International Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM 2001 Berkeley, CA, USA, August 18-20, 2001, Proceedings. Lecture Notes in Computer Science 2129, Springer 2001, ISBN 3-540-42470-9 [contents] - 2000
- [j28]Klaus Jansen:
Approximation Results for the Optimum Cost Chromatic Partition Problem. J. Algorithms 34(1): 54-89 (2000) - [j27]Hans L. Bodlaender, Klaus Jansen:
On the Complexity of the Maximum Cut Problem. Nord. J. Comput. 7(1): 14-31 (2000) - [c40]Foto N. Afrati, Evripidis Bampis, Aleksei V. Fishkin, Klaus Jansen, Claire Kenyon:
Scheduling to Minimize the Average Completion Time of Dedicated Tasks. FSTTCS 2000: 454-464 - [c39]Thomas Erlebach, Klaus Jansen:
Conversion of Coloring Algorithms into Maximum Weight Independent Set Algorithms. ICALP Satellite Workshops 2000: 135-146 - [c38]Klaus Jansen, Monaldo Mastrolilli:
Parallel Machine Scheduling Problems with Controllable Processing Times. ICALP Satellite Workshops 2000: 179-190 - [c37]Klaus Jansen, Lorant Porkolab:
Polynominal Time Approximation Schemes for General Multiprocessor Job Shop Scheduling. ICALP 2000: 878-889 - [c36]Klaus Jansen, Lorant Porkolab:
Preemptive Parallel Task Scheduling in O(n)+Poly(m) Time. ISAAC 2000: 398-409 - [c35]Klaus Jansen, Monaldo Mastrolilli, Roberto Solis-Oba:
Approximation Algorithms for Flexible Job Shop Problems. LATIN 2000: 68-77 - [c34]Klaus Jansen, Lorant Porkolab:
Preemptive Scheduling on Dedicated Processors: Applications of Fractional Graph Coloring. MFCS 2000: 446-455 - [c33]Klaus Jansen, Maxim Sviridenko:
Polynomial Time Approximation Schemes for the Multiprocessor Open and Flow Shop Scheduling Problem. STACS 2000: 455-465 - [c32]Thomas Erlebach, Klaus Jansen:
Implementation of Approximation Algorithms for Weighted and Unweighted Edge-Disjoint Paths in Bidirected Trees. WAE 2000: 195-206 - [e3]Klaus Jansen, Samir Khuller:
Approximation Algorithms for Combinatorial Optimization, Third International Workshop, APPROX 2000, Saarbrücken, Germany, September 5-8, 2000, Proceedings. Lecture Notes in Computer Science 1913, Springer 2000, ISBN 3-540-67996-0 [contents] - [i19]Klaus Jansen, Marek Karpinski, Andrzej Lingas:
A Polynomial Time Approximation Scheme for MAX-BISECTION on Planar Graphs. Electron. Colloquium Comput. Complex. TR00 (2000)
1990 – 1999
- 1999
- [j26]Klaus Jansen:
An Approximation Scheme for Bin Packing with Conflicts. J. Comb. Optim. 3(4): 363-377 (1999) - [j25]Thomas Erlebach, Klaus Jansen:
Efficient Implementation of an Optimal Greedy Algorithm for Wavelength Assignment in Directed Tree Networks. ACM J. Exp. Algorithmics 4: 4 (1999) - [j24]Thomas Erlebach, Klaus Jansen, Christos Kaklamanis, Milena Mihail, Pino Persiano:
Optimal Wavelength Routing on Directed Fiber Trees. Theor. Comput. Sci. 221(1-2): 119-137 (1999) - [c31]Klaus Jansen, Roberto Solis-Oba, Maxim Sviridenko:
A Linear Time Approximation Scheme for the Job Shop Scheduling Problem. RANDOM-APPROX 1999: 177-188 - [c30]Klaus Jansen, Lorant Porkolab:
Linear-Time Approximation Schemes for Scheduling Malleable Parallel Tasks. SODA 1999: 490-498 - [c29]Klaus Jansen, Roberto Solis-Oba, Maxim Sviridenko:
Makespan Minimization in Job Shops: A Polynomial Time Approximation Scheme. STOC 1999: 394-399 - [c28]Klaus Jansen, Lorant Porkolab:
Improved Approximation Schemes for Scheduling Unrelated Parallel Machines. STOC 1999: 408-417 - [c27]Klaus Jansen, Lorant Porkolab:
General Multiprocessor Task Scheduling: Approximate Solutions in Linear Time. WADS 1999: 110-121 - [e2]Dorit S. Hochbaum, Klaus Jansen, José D. P. Rolim, Alistair Sinclair:
Randomization, Approximation, and Combinatorial Algorithms and Techniques, Third International Workshop on Randomization and Approximation Techniques in Computer Science, and Second International Workshop on Approximation Algorithms for Combinatorial Optimization Problems RANDOM-APPROX'99, Berkeley, CA, USA, August 8-11, 1999, Proceedings. Lecture Notes in Computer Science 1671, Springer 1999, ISBN 3-540-66329-0 [contents] - 1998
- [j23]Klaus Jansen, Joachim Reiter:
An approximation algorithm for the register allocation problem. Integr. 25(2): 89-102 (1998) - [j22]Hans L. Bodlaender, Jitender S. Deogun, Klaus Jansen, Ton Kloks, Dieter Kratsch, Haiko Müller, Zsolt Tuza:
Rankings of Graphs. SIAM J. Discret. Math. 11(1): 168-181 (1998) - [c26]Thomas Erlebach, Klaus Jansen:
Maximizing the Number of Connections in Optical Tree Networks. ISAAC 1998: 179-188 - [c25]Klaus Jansen:
A New Characterization for Parity Graphs and a Coloring Problem with Costs. LATIN 1998: 249-260 - [c24]Klaus Jansen, José D. P. Rolim:
Algorithms Based on Randomization and Linear and Semidefinite Programming. SOFSEM 1998: 124-134 - [c23]Klaus Jansen:
The Mutual Exclusion Scheduling Problem for Permutation and Comparability Graphs. STACS 1998: 287-297 - [c22]Klaus Jansen:
An Approximation Scheme for Bin Packing with Conflicts. SWAT 1998: 35-46 - [c21]Thomas Erlebach, Klaus Jansen:
Efficient Implementation of an Optimal Greedy Algorithm for Wavelength Assignment in Directed Tree Networks. WAE 1998: 13-24 - [e1]Klaus Jansen, Dorit S. Hochbaum:
Approximation Algorithms for Combinatorial Optimization, International Workshop APPROX'98, Aalborg, Denmark, July 18-19, 1998, Proceedings. Lecture Notes in Computer Science 1444, Springer 1998, ISBN 3-540-64736-8 [contents] - 1997
- [j21]Klaus Jansen, Petra Scheffler:
Generalized Coloring for Tree-like Graphs. Discret. Appl. Math. 75(2): 135-155 (1997) - [j20]Klaus Jansen, Sabine R. Öhring:
Approximation Algorithms for Time Constrained Scheduling. Inf. Comput. 132(2): 85-108 (1997) - [c20]Klaus Jansen:
The Optimum Cost Chromatic Partition Problem. CIAC 1997: 25-36 - [c19]Klaus Jansen:
An approximation scheme for scheduling of malleable parallel tasks. Randomization Methods in Algorithm Design 1997: 109-121 - [c18]Thomas Erlebach, Klaus Jansen, Christos Kaklamanis, Giuseppe Persiano:
An optimal greedy algorithm for wavelength allocation in directed tree networks. Network Design: Connectivity and Facilities Location 1997: 117-129 - [c17]Klaus Jansen:
Approximation results for the optimum cost chromatic partition problem. Network Design: Connectivity and Facilities Location 1997: 143-168 - [c16]Thomas Erlebach, Klaus Jansen:
Call Scheduling in Trees, Rings and Meshes. HICSS (1) 1997: 221- - [c15]Christos Kaklamanis, Pino Persiano, Thomas Erlebach, Klaus Jansen:
Constrained Bipartite Edge Coloring with Applications to Wavelength Routing. ICALP 1997: 493-504 - [c14]Klaus Jansen:
Approximation Results for the Optimum Cost Partition Problem. ICALP 1997: 727-737 - [c13]Klaus Jansen, Joachim Reiter:
A New Approximation Algorithm for the Register Allocation Problem. IRREGULAR 1997: 135-146 - [c12]Thomas Erlebach, Klaus Jansen:
Off-Line and On-Line Call-Scheduling in Stars and Trees. WG 1997: 199-213 - [i18]Klaus Jansen:
Approximation Results for the Optimum Cost Chromatic Partition Problem. Universität Trier, Mathematik/Informatik, Forschungsbericht 97-01 (1997) - [i17]Thomas Erlebach, Klaus Jansen:
An Optimal Greedy Algorithm for Wavelength Allocation in Directed Tree Networks. Universität Trier, Mathematik/Informatik, Forschungsbericht 97-03 (1997) - 1996
- [j19]Klaus Jansen:
A rainbow about T-colorings for complete graphs. Discret. Math. 154(1-3): 129-139 (1996) - [i16]Klaus Jansen, Joachim Reiter:
Approximation Algorithms for Register Allocation. Universität Trier, Mathematik/Informatik, Forschungsbericht 96-13 (1996) - [i15]Thomas Erlebach, Klaus Jansen:
Scheduling of Virtual Connections in Fast Networks. Universität Trier, Mathematik/Informatik, Forschungsbericht 96-19 (1996) - [i14]Klaus Jansen:
Approximation Results for Wavelength Routing in Directed Binary Trees. Universität Trier, Mathematik/Informatik, Forschungsbericht 96-37 (1996) - [i13]Klaus Jansen:
Complexity Results for the Optimum Cost Chromatic Partition Problem. Universität Trier, Mathematik/Informatik, Forschungsbericht 96-41 (1996) - 1995
- [j18]Klaus Jansen, Gerhard J. Woeginger, Zhongliang Yu:
UET-scheduling with chain-type precedence constraints. Comput. Oper. Res. 22(9): 915-920 (1995) - [j17]Klaus Jansen:
Scheduling of Conditional Executed Jobs on Unrelated Processors. Discret. Appl. Math. 61(3): 245-255 (1995) - [j16]Klaus Jansen, Haiko Müller:
The Minimum Broadcast Time Problem for Several Processor Networks. Theor. Comput. Sci. 147(1&2): 69-85 (1995) - [j15]Hans L. Bodlaender, Klaus Jansen:
Restrictions of Graph Partition Problems. Part I. Theor. Comput. Sci. 148(1): 93-109 (1995) - [c11]Klaus Jansen, Sabine R. Öhring:
Approximation Algorithms for Time Constrained Scheduling. IRREGULAR 1995: 143-157 - 1994
- [j14]Klaus Jansen:
Analysis of Scheduling Problems with Typed Task Systems. Discret. Appl. Math. 52(3): 223-232 (1994) - [j13]Hans L. Bodlaender, Klaus Jansen, Gerhard J. Woeginger:
Scheduling with Incompatible Jobs. Discret. Appl. Math. 55(3): 219-232 (1994) - [j12]Klaus Jansen:
On the complexity of allocation problems in high-level synthesis. Integr. 17(3): 241-252 (1994) - [j11]Klaus Jansen:
Integral Flow with Disjoint Bundles. Nord. J. Comput. 1(2): 264-267 (1994) - [c10]Klaus Jansen, Haiko Müller:
The Minimum Broadcast Time Problem. Canada-France Conference on Parallel and Distributed Computing 1994: 219-234 - [c9]Hans L. Bodlaender, Klaus Jansen:
On the Complexity of the Maximum Cut Problem. STACS 1994: 769-780 - [c8]Hans L. Bodlaender, Jitender S. Deogun, Klaus Jansen, Ton Kloks, Dieter Kratsch, Haiko Müller, Zsolt Tuza:
Ranking of Graphs. WG 1994: 292-304 - 1993
- [j10]Klaus Jansen, Gerhard J. Woeginger:
The Complexity of Detecting Crossingfree Configurations in the Plane. BIT 33(4): 580-595 (1993) - [j9]Klaus Jansen:
One Strike Against the Min-max Degree Triangulation Problem. Comput. Geom. 3: 107-120 (1993) - [j8]Klaus Jansen:
Scheduling with constrained processor allocation for interval orders. Comput. Oper. Res. 20(6): 587-595 (1993) - [j7]Klaus Jansen:
The Allocation Problem in Hardware Design. Discret. Appl. Math. 43(1): 37-46 (1993) - [j6]Klaus Jansen:
Transfer flow graphs. Discret. Math. 115(1-3): 187-199 (1993) - [j5]Klaus Jansen:
Scheduling of Incompatible Jobs on Unrelated Machines. Int. J. Found. Comput. Sci. 4(4): 275-291 (1993) - [j4]Klaus Jansen:
The Interconnection Problem. J. Comput. Syst. Sci. 46(1): 27-38 (1993) - [j3]Klaus Jansen:
Bounds for the general capacitated routing problem. Networks 23(3): 165-173 (1993) - [c7]Klaus Jansen, Petra Scheffler, Gerhard J. Woeginger:
Maximum Covering with D Cliques. FCT 1993: 319-328 - [c6]Anders Dessmark, Klaus Jansen, Andrzej Lingas:
The Maximum k-Dependent and f-Dependent Set Problem. ISAAC 1993: 88-98 - [c5]Hans L. Bodlaender, Klaus Jansen:
On the Complexity of Scheduling Incompatible Jobs with Unit-Times. MFCS 1993: 291-300 - [c4]Klaus Jansen:
A Rainbow About T-Colorings for Complete Graphs. WG 1993: 189-199 - [i12]Klaus Jansen:
Scheduling of Conditional Executed Jobs. Universität Trier, Mathematik/Informatik, Forschungsbericht 93-01 (1993) - [i11]Klaus Jansen:
A Rainbow about T-Colorings for Complete Graphs. Universität Trier, Mathematik/Informatik, Forschungsbericht 93-03 (1993) - [i10]Klaus Jansen:
Scheduling of Conditional Executed Jobs on Unrelated Processors. Universität Trier, Mathematik/Informatik, Forschungsbericht 93-04 (1993) - [i9]Klaus Jansen:
Scheduling and Related Graph Theoretical Problems. Universität Trier, Mathematik/Informatik, Forschungsbericht 93-24 (1993) - 1992
- [j2]Klaus Jansen:
An Approximation Algorithm for the General Routing Problem. Inf. Process. Lett. 41(6): 333-339 (1992) - [j1]Klaus Jansen:
Processor Optimization for Flow Graphs. Theor. Comput. Sci. 104(2): 285-298 (1992) - [c3]Klaus Jansen:
On Scheduling Problems Restricted to Interval Orders. WG 1992: 27-36 - [c2]Hans L. Bodlaender, Klaus Jansen, Gerhard J. Woeginger:
Scheduling with Incompatible Jobs. WG 1992: 37-49 - [c1]Klaus Jansen, Petra Scheffler:
Generalized Coloring for Tree-like Graphs. WG 1992: 50-59 - [i8]Klaus Jansen, Petra Scheffler:
Generalized Coloring for Tree-like Graphs. Universität Trier, Mathematik/Informatik, Forschungsbericht 92-08 (1992) - [i7]Hans L. Bodlaender, Klaus Jansen, Gerhard J. Woeginger:
Scheduling with Incompatible Jobs. Universität Trier, Mathematik/Informatik, Forschungsbericht 92-09 (1992) - [i6]Klaus Jansen:
Scheduling with Constrained Processor Allocation for Interval Orders. Universität Trier, Mathematik/Informatik, Forschungsbericht 92-11 (1992) - [i5]Klaus Jansen:
On the Complexity of One Branching Graphs. Universität Trier, Mathematik/Informatik, Forschungsbericht 92-12 (1992) - [i4]Klaus Jansen:
One Strike Against the Min-Max Degree Triangulation Problem. Universität Trier, Mathematik/Informatik, Forschungsbericht 92-14 (1992) - [i3]Klaus Jansen:
On the Complexity of a Licence Constrained Job Assignment Problem. Universität Trier, Mathematik/Informatik, Forschungsbericht 92-15 (1992) - [i2]Klaus Jansen, Petra Scheffler, Gerhard J. Woeginger:
The Disjoint Cliques Problem. Universität Trier, Mathematik/Informatik, Forschungsbericht 92-23 (1992) - [i1]Klaus Jansen, Gerhard J. Woeginger:
The Complexity of Detecting Crossingfree Configurations in the Plane. Universität Trier, Mathematik/Informatik, Forschungsbericht 92-25 (1992) - 1990
- [b1]Klaus Jansen:
Ein Zuordnungsproblem im Hardware-Design. University of Trier, Germany, 1990
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-10 21:18 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
