Google
Google Scholar
MS Academic
CiteSeerX
CORE
Semantic ScholarKlaus 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
- 2020
[j97]Sebastian Berndt
, Klaus Jansen, Kim-Manuel Klein:
Fully dynamic bin packing revisited. Math. Program. 179(1): 109-155 (2020)- [j96]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) - [c144]Marten Maack, Klaus Jansen:
Inapproximability Results for Scheduling with Interval and Resource Restrictions. STACS 2020: 5:1-5:18 - [i55]Max A. Deppert, Klaus Jansen, Kim-Manuel Klein:
Fuzzy Simultaneous Congruences. CoRR abs/2002.07746 (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@SODA 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. Discrete Math., Alg. and 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]