×

zbMATH — the first resource for mathematics

Jansen, Klaus

Compute Distance To:
Author ID: jansen.klaus Recent zbMATH articles by "Jansen, Klaus"
Published as: Jansen, K.; Jansen, Klaus
External Links: MGP · dblp
Documents Indexed: 247 Publications since 1990, including 29 Books
Reviewing Activity: 6 Reviews
all top 5

Co-Authors

44 single-authored
26 Solis-Oba, Roberto
21 Rolim, José D. P.
17 Porkolab, Lorant
13 Erlebach, Thomas
11 Fishkin, Aleksei V.
11 Klein, Kim-Manuel
10 Mastrolilli, Monaldo
9 Diedrich, Florian
9 Prädel, Lars
8 Maack, Marten
8 Rohwedder, Lars
8 Trystram, Denis R.
7 Bodlaender, Hans L.
7 Rau, Malin
6 Bougeret, Marin
6 Seidel, Eike
6 Sviridenko, Maxim I.
6 Woeginger, Gerhard Johannes
5 Dutot, Pierre Francois
5 Zhang, Guochuan
4 Gerber, Olga
4 Harren, Rolf
4 Kraft, Stefan E. J.
4 Land, Felix
4 Land, Kati
4 Robenek, Christina
4 Scheffler, Petra
4 Schwarz, Ulrich M.
4 van Stee, Rob
4 Zhang, Hu
3 Bampis, Evripidis
3 Bazgan, Cristina
3 Berndt, Sebastian
3 Branković, Ljiljana
3 Casel, Katrin
3 Chen, Lin
3 Fernau, Henning
3 Kaklamanis, Christos
3 Kraft, Stefan
3 Lampis, Michael
3 Liedloff, Mathieu
3 Lingas, Andrzej
3 Monnot, Jérôme
3 Paschos, Vangelis Th.
3 Persiano, Pino
3 Thöle, Ralf
2 Fiala, Jiří
2 Gehrke, Jan Clemens
2 Hagerup, Torben
2 Henning, Sören
2 Karpinski, Marek
2 Kenyon, Claire M.
2 Kratsch, Stefan
2 Lê Văn Băng
2 Margraf, Marian
2 Marx, Dániel
2 Minzlaff, Moritz
2 Müller, Haiko
2 Otte, Christina
2 Schikowski, Jakob
2 Schlotter, Ildikó
2 Schmarje, Lars
2 Trevisan, Luca
2 Verschae, José
2 Wolff, Alexander
1 Afrati, Foto N.
1 Aizatulin, Mihhail
1 Arora, Sanjeev
1 Bansal, Nikhil
1 Blais, Eric
1 Brandstädt, Andreas
1 Caprara, Alberto
1 Charikar, Moses S.
1 Chekuri, Chandra S.
1 Chlebíková, Janka
1 Czumaj, Artur
1 Deogun, Jitender S.
1 Dessmark, Anders
1 Devanur, Nikhil R.
1 Díaz, Josep
1 Dinur, Irit
1 Dreismann, Valentin
1 Garg, Naveen Kumar
1 Goel, Ashish
1 Goemans, Michel X.
1 Goldberg, Leslie Ann
1 Grage, Kilian
1 Gupta, Anupam
1 Hochbaum, Dorit S.
1 Kaluza, Maren
1 Khanna, Sanjeev
1 Khuller, Samir
1 Kloks, Ton
1 Knof, Ingmar
1 Kratsch, Dieter
1 Lassota, Alexandra
1 Leonardi, Stefano
1 Luo, Wenchang
1 Mathieu, Claire
1 Meyer auf der Heide, Friedhelm
...and 37 more Co-Authors

Publications by Year

Citations contained in zbMATH Open

179 Publications have been cited 1,100 times in 731 Documents Cited by Year
Rankings of graphs. Zbl 0907.68137
Bodlaender, Hans L.; Deogun, Jitender S.; Jansen, Klaus; Kloks, Ton; Kratsch, Dieter; Müller, Heiko; Tuza, Zsolt
55
1998
Generalized coloring for tree-like graphs. Zbl 0879.68076
Jansen, Klaus; Scheffler, Petra
35
1997
Polynomial-time approximation schemes for geometric intersection graphs. Zbl 1081.68031
Erlebach, Thomas; Jansen, Klaus; Seidel, Eike
31
2005
Scheduling with incompatible jobs. Zbl 0822.68011
Bodlaender, Hans L.; Jansen, Klaus; Woeginger, Gerhard J.
30
1994
An approximation scheme for bin packing with conflicts. Zbl 0971.90072
Jansen, Klaus
24
1999
Restrictions of graph partition problems. I. Zbl 0873.68158
Bodlaender, Hans L.; Jansen, Klaus
24
1995
Improved approximation schemes for scheduling unrelated parallel machines. Zbl 1082.90525
Jansen, Klaus; Porkolab, Lorant
23
2001
The complexity of path coloring and call scheduling. Zbl 0974.68021
Erlebach, T.; Jansen, K.
23
2001
Bin packing with fixed number of bins revisited. Zbl 1261.68065
Jansen, Klaus; Kratsch, Stefan; Marx, Dániel; Schlotter, Ildikó
21
2013
An EPTAS for scheduling jobs on uniform processors: using an MILP relaxation with a constant number of integral variables. Zbl 1253.90111
Jansen, Klaus
19
2010
The mutual exclusion scheduling problem for permutation and comparability graphs. Zbl 1054.68019
Jansen, Klaus
19
2003
On the complexity of the maximum cut problem. Zbl 0963.68224
Bodlaender, Hans L.; Jansen, Klaus
19
2000
Approximation results for the optimum cost chromatic partition problem. Zbl 1401.68353
Jansen, Klaus
19
1997
Approximation algorithms for time constrained scheduling. Zbl 0866.68012
Jansen, Klaus; Öhring, Sabine
18
1997
Stabilized finite element methods in fluids: inspirations, origins, status and recent developments. Zbl 1122.76346
Hughes, T. J. R.; Hauke, G.; Jansen, K.; Johan, Z.
17
1994
Maximizing the total profit of rectangles packed into a rectangle. Zbl 1111.68150
Jansen, Klaus; Zhang, Guochuan
15
2007
On rectangle packing, maximizing benefits. Zbl 1317.68280
Jansen, Klaus; Zhang, Guochaun
15
2004
An asymptotic fully polynomial time approximation scheme for bin covering. Zbl 1060.68111
Jansen, Klaus; Solis-Oba, Roberto
15
2003
On the complexity of scheduling incompatible jobs with unit-times. Zbl 0925.90222
Bodlaender, Hans L.; Jansen, Klaus
15
1993
On strip packing with rotations. Zbl 1192.68908
Jansen, Klaus; van Stee, Rob
14
2005
Approximation results for the optimum cost chromatic partition problem. Zbl 0947.68164
Jansen, Klaus
14
2000
Optimal wavelength routing on directed fiber trees. Zbl 0933.68155
Erlebach, Thomas; Jansen, Klaus; Kaklamanis, Christos; Mihail, Milena; Persiano, Pino
14
1999
Closing the gap for makespan scheduling via sparsification techniques. Zbl 1388.68123
Jansen, Klaus; Klein, Kim-Manuel; Verschae, José
13
2016
Approximation schemes for parallel machine scheduling problems with controllable processing times. Zbl 1068.68035
Jansen, Klaus; Mastrolilli, Monaldo
13
2004
Graph subcolorings: Complexity and algorithms. Zbl 1029.05052
Fiala, Jiří; Jansen, Klaus; Le, Van Bang; Seidel, Eike
13
2003
Polynomial time approximation schemes for the multiprocessor open and flow shop scheduling problem. Zbl 0962.68012
Jansen, Klaus; Sviridenko, Maxim I.
13
2000
A \((5/3+\varepsilon)\)-approximation for strip packing. Zbl 1283.52024
Harren, Rolf; Jansen, Klaus; Prädel, Lars; van Stee, Rob
12
2014
Polynomial time approximation schemes for MAX-BISECTION on planar and geometric graphs. Zbl 1087.90063
Jansen, Klaus; Karpinski, Marek; Lingas, Andrzej; Seidel, Eike
12
2005
Polynomial-time approximation schemes for geometric graphs. Zbl 0988.65020
Erlebach, Thomas; Jansen, Klaus; Seidel, Eike
12
2001
Parameterized approximation scheme for the multiple knapsack problem. Zbl 1211.68276
Jansen, Klaus
11
2009
Rectangle packing with one-dimensional resource augmentation. Zbl 1167.90632
Jansen, Klaus; Solis-Oba, Roberto
11
2009
Scheduling malleable parallel tasks: an asymptotic fully polynomial time approximation scheme. Zbl 1072.90015
Jansen, Klaus
11
2004
Maximizing the number of packed rectangles. Zbl 1095.68750
Jansen, Klaus; Zhang, Guochuan
10
2004
Makespan minimization in job shops: A linear time approximation scheme. Zbl 1051.68153
Jansen, Klaus; Solis-Oba, Roberto; Sviridenko, Maxim
10
2003
Linear-Time approximation schemes for scheduling malleable parallel tasks. Zbl 1009.68013
Jansen, K.; Porkolab, L.
10
2002
The complexity of detecting crossingfree configurations in the plane. Zbl 0797.68080
Jansen, Klaus; Woeginger, Gerhard J.
10
1993
A quasi-polynomial approximation for the restricted assignment problem. Zbl 1418.90232
Jansen, Klaus; Rohwedder, Lars
9
2017
Approximation algorithms for scheduling parallel jobs. Zbl 1209.68064
Jansen, Klaus; Thöle, Ralf
9
2010
A polynomial time approximation scheme for the square packing problem. Zbl 1143.90399
Jansen, Klaus; Solis-Oba, Roberto
9
2008
An asymptotic approximation algorithm for 3D-strip packing. Zbl 1192.90176
Jansen, Klaus; Solis-Oba, Roberto
9
2006
Packing weighted rectangles into a square. Zbl 1156.68616
Fishkin, Aleksei V.; Gerber, Olga; Jansen, Klaus; Solis-Oba, Roberto
9
2005
Improved approximation schemes for scheduling unrelated parallel machines. Zbl 1345.90043
Jansen, Klaus; Porkolab, Lorant
9
1999
Off-line and on-line call-scheduling in stars and trees. Zbl 0890.68017
Erlebach, Thomas; Jansen, Klaus
9
1997
On the configuration-LP of the restricted assignment problem. Zbl 1415.90041
Jansen, Klaus; Rohwedder, Lars
8
2017
Approximation schemes for job shop scheduling problems with controllable processing times. Zbl 1075.90029
Jansen, Klaus; Mastrolilli, Monaldo; Solis-Oba, Roberto
8
2005
The maximum edge-disjoint paths problem in bidirected trees. Zbl 0977.68043
Erlebach, Thomas; Jansen, Klaus
8
2001
Constrained bipartite edge coloring with applications to wavelength routing. Zbl 1401.68251
Kaklamanis, Christos; Persiano, Pino; Erlebach, Thomas; Jansen, Klaus
8
1997
On the complexity of the maximum cut problem. Zbl 0941.05515
Bodlaender, Hans L.; Jansen, Klaus
8
1994
New approximability results for 2-dimensional packing problems. Zbl 1147.68874
Jansen, Klaus; Solis-Oba, Roberto
7
2007
Approximate strong separation with application in fractional graph coloring and preemptive scheduling. Zbl 1044.68127
Jansen, Klaus
7
2003
Approximation results for the optimum cost chromatic partition problem. Zbl 0895.68098
Jansen, Klaus
7
1998
The maximum \(k\)-dependent and \(f\)-dependent set problem. Zbl 0925.05062
Dessmark, Anders; Jansen, Klaus; Lingas, Andrzej
7
1993
Approximation algorithms for multiple strip packing and scheduling parallel jobs in platforms. Zbl 1253.68356
Bougeret, Marin; Dutot, Pierre-Francois; Jansen, Klaus; Robenek, Christina; Trystram, Denis
6
2011
A structural lemma in 2-dimensional packing, and its implications on approximability. Zbl 1272.52018
Bansal, Nikhil; Caprara, Alberto; Jansen, Klaus; Prädel, Lars; Sviridenko, Maxim
6
2009
Grouping techniques for scheduling problems: simpler and faster. Zbl 1159.90403
Fishkin, Aleksei V.; Jansen, Klaus; Mastrolilli, Monaldo
6
2008
Approximation algorithms for min-max and max-min resource sharing problems, and applications. Zbl 1132.90379
Jansen, Klaus
6
2006
Polynomial time approximation schemes for MAX-BISECTION on planar and geometric graphs. Zbl 0976.68523
Jansen, Klaus; Karpinski, Marek; Lingas, Andrzej; Seidel, Eike
6
2001
Approximation algorithms for flexible job shop problems. Zbl 0959.68009
Jansen, Klaus; Mastrolilli, Monaldo; Solis-Oba, Roberto
6
2000
Linear-time approximation schemes for scheduling malleable parallel tasks. Zbl 0944.90028
Jansen, Klaus; Porkolab, Lorant
6
1999
Consistent finite element calculations of boundary and internal fluxes. Zbl 0917.76039
Oshima, M.; Hughes, T. J. R.; Jansen, K.
6
1998
Upper domination: complexity and approximation. Zbl 06631025
Bazgan, Cristina; Brankovic, Ljiljana; Casel, Katrin; Fernau, Henning; Jansen, Klaus; Klein, Kim-Manuel; Lampis, Michael; Liedloff, Mathieu; Monnot, Jérôme; Paschos, Vangelis Th.
5
2016
Approximation algorithms for multiple strip packing. Zbl 1284.68657
Bougeret, Marin; Dutot, Pierre Francois; Jansen, Klaus; Otte, Christina; Trystram, Denis
5
2010
Two for one: tight approximation of 2D bin packing. Zbl 1253.68361
Jansen, Klaus; Prädel, Lars; Schwarz, Ulrich M.
5
2009
Preemptive parallel task scheduling in \(O(n)+\text{poly}(m)\) time. Zbl 1044.68522
Jansen, Klaus; Porkolab, Lorant
5
2000
A rainbow about \(T\)-colorings for complete graphs. Zbl 0852.05047
Jansen, Klaus
5
1996
One strike against the min-max degree triangulation problem. Zbl 0779.68088
Jansen, Klaus
5
1993
The many facets of upper domination. Zbl 1388.68099
Bazgan, Cristina; Brankovic, Ljiljana; Casel, Katrin; Fernau, Henning; Jansen, Klaus; Klein, Kim-Manuel; Lampis, Michael; Liedloff, Mathieu; Monnot, Jérôme; Paschos, Vangelis Th.
4
2018
About the structure of the integer cone and its application to bin packing. Zbl 1410.90178
Jansen, Klaus; Klein, Kim-Manuel
4
2017
Structural parameters for scheduling with assignment restrictions. Zbl 06751075
Jansen, Klaus; Maack, Marten; Solis-Oba, Roberto
4
2017
Improved approximation for two dimensional strip packing with polynomial bounded width. Zbl 1427.68368
Jansen, Klaus; Rau, Malin
4
2017
Estimating the makespan of the two-valued restricted assignment problem. Zbl 1378.90049
Jansen, Klaus; Land, Kati; Maack, Marten
4
2016
Algorithmic aspects of Upper Domination: a parameterised perspective. Zbl 06649751
Bazgan, Cristina; Brankovic, Ljiljana; Casel, Katrin; Fernau, Henning; Jansen, Klaus; Klein, Kim-Manuel; Lampis, Michael; Liedloff, Mathieu; Monnot, Jérôme; Paschos, Vangelis Th.
4
2016
Fully dynamic bin packing revisited. Zbl 1375.68223
Berndt, Sebastian; Jansen, Klaus; Klein, Kim-Manuel
4
2015
A robust AFPTAS for online bin packing with polynomial migration. Zbl 1336.68296
Jansen, Klaus; Klein, Kim-Manuel
4
2013
Scheduling malleable tasks with precedence constraints. Zbl 1238.68041
Jansen, Klaus; Zhang, Hu
4
2012
Approximation algorithms for 3D orthogonal Knapsack. Zbl 1198.68299
Diedrich, Florian; Harren, Rolf; Jansen, Klaus; Thöle, Ralf; Thomas, Henning
4
2007
Faster and simpler approximation algorithms for mixed packing and covering problems. Zbl 1115.68172
Diedrich, Florian; Jansen, Klaus
4
2007
Approximation algorithms for flexible job shop problems. Zbl 1089.90025
Jansen, Klaus; Mastrolilli, Monaldo; Solis-Oba, Roberto
4
2005
On preemptive resource constrained scheduling: Polynomial-time approximation schemes. Zbl 1049.90025
Jansen, Klaus; Porkolab, Lorant
4
2002
On minimizing average weighted completion time: A PTAS for scheduling general multiprocessor tasks. Zbl 0999.68024
Fishkin, Aleksei V.; Jansen, Klaus; Porkolab, Lorant
4
2001
On minimizing average weighted completion time of multiprocessor tasks with release dates. Zbl 0986.68007
Fishkin, Aleksei V.; Jansen, Klaus; Porkolab, Lorant
4
2001
Makespan minimization in job shops: a polynomial time approximation scheme. Zbl 1345.90044
Jansen, Klaus; Solis-Oba, Roberto; Sviridenko, Maxim
4
1999
The disjoint cliques problem. Zbl 0881.90123
Jansen, Klaus; Scheffler, Petra; Woeginger, Gerhard
4
1997
The minimum broadcast time problem for several processor networks. Zbl 0873.68009
Jansen, Klaus; Müller, Haiko
4
1995
Analysis of scheduling problems with typed task systems. Zbl 0822.90083
Jansen, Klaus
4
1994
Generalized coloring for tree-like graphs. Zbl 0795.05057
Jansen, Klaus; Scheffler, Petra
4
1993
Scheduling with constrained processor allocation for interval orders. Zbl 0779.90042
Jansen, Klaus
4
1993
An EPTAS for scheduling on unrelated machines of few different types. Zbl 1430.68448
Jansen, Klaus; Maack, Marten
3
2017
Approximation schemes for machine scheduling with resource (in-)dependent processing times. Zbl 1410.68401
Jansen, Klaus; Maack, Marten; Rau, Malin
3
2016
A faster FPTAS for the unbounded knapsack problem. Zbl 06562491
Jansen, Klaus; Kraft, Stefan E. J.
3
2016
A PTAS for scheduling unrelated machines of few different types. Zbl 1442.90073
Gehrke, Jan Clemens; Jansen, Klaus; Kraft, Stefan E. J.; Schikowski, Jakob
3
2016
A new asymptotic approximation algorithm for 3-dimensional strip packing. Zbl 1432.68576
Jansen, Klaus; Prädel, Lars
3
2014
Bounding the running time of algorithms for scheduling and packing problems. Zbl 1391.68041
Jansen, Klaus; Land, Felix; Land, Kati
3
2013
Scheduling jobs on identical and uniform processors revisited. Zbl 1242.68036
Jansen, Klaus; Robenek, Christina
3
2012
A \((5/3 + \varepsilon )\)-approximation for strip packing. Zbl 1342.68357
Harren, Rolf; Jansen, Klaus; Prädel, Lars; van Stee, Rob
3
2011
Bin packing with fixed number of bins revisited. Zbl 1285.68065
Jansen, Klaus; Kratsch, Stefan; Marx, Dániel; Schlotter, Ildikó
3
2010
Trimming of graphs, with application to point labeling. Zbl 1258.05043
Erlebach, Thomas; Hagerup, Torben; Jansen, Klaus; Minzlaff, Moritz; Wolff, Alexander
3
2008
Approximation algorithms for scheduling parallel jobs: Breaking the approximation ratio of 2. Zbl 1152.90446
Jansen, Klaus; Thöle, Ralf
3
2008
Approximation algorithms for general packing problems and their application to the multicast congestion problem. Zbl 1137.90011
Jansen, Klaus; Zhang, Hu
3
2008
An approximation algorithm for scheduling malleable tasks under general precedence constraints. Zbl 1321.68121
Jansen, Klaus; Zhang, Hu
3
2006
Complexity and inapproximability results for parallel task scheduling and strip packing. Zbl 07175458
Henning, Sören; Jansen, Klaus; Rau, Malin; Schmarje, Lars
1
2020
Fully dynamic bin packing revisited. Zbl 07152791
Berndt, Sebastian; Jansen, Klaus; Klein, Kim-Manuel
1
2020
Zeta-regularized vacuum expectation values. Zbl 1448.81432
Hartung, T.; Jansen, K.
2
2019
An EPTAS for scheduling on unrelated machines of few different types. Zbl 1439.90034
Jansen, Klaus; Maack, Marten
2
2019
The many facets of upper domination. Zbl 1388.68099
Bazgan, Cristina; Brankovic, Ljiljana; Casel, Katrin; Fernau, Henning; Jansen, Klaus; Klein, Kim-Manuel; Lampis, Michael; Liedloff, Mathieu; Monnot, Jérôme; Paschos, Vangelis Th.
4
2018
A PTAS for scheduling unrelated machines of few different types. Zbl 1397.90173
Gehrke, Jan Clemens; Jansen, Klaus; Kraft, Stefan E. J.; Schikowski, Jakob
2
2018
On the optimality of exact and approximation algorithms for scheduling problems. Zbl 1393.68056
Chen, Lin; Jansen, Klaus; Zhang, Guochuan
2
2018
Complexity and inapproximability results for parallel task scheduling and strip packing. Zbl 1434.68187
Henning, Sören; Jansen, Klaus; Rau, Malin; Schmarje, Lars
1
2018
Estimating the makespan of the two-valued restricted assignment problem. Zbl 1393.90057
Jansen, Klaus; Land, Kati; Maack, Marten
1
2018
A faster FPTAS for the unbounded knapsack problem. Zbl 1381.90071
Jansen, Klaus; Kraft, Stefan E. J.
1
2018
A quasi-polynomial approximation for the restricted assignment problem. Zbl 1418.90232
Jansen, Klaus; Rohwedder, Lars
9
2017
On the configuration-LP of the restricted assignment problem. Zbl 1415.90041
Jansen, Klaus; Rohwedder, Lars
8
2017
About the structure of the integer cone and its application to bin packing. Zbl 1410.90178
Jansen, Klaus; Klein, Kim-Manuel
4
2017
Structural parameters for scheduling with assignment restrictions. Zbl 06751075
Jansen, Klaus; Maack, Marten; Solis-Oba, Roberto
4
2017
Improved approximation for two dimensional strip packing with polynomial bounded width. Zbl 1427.68368
Jansen, Klaus; Rau, Malin
4
2017
An EPTAS for scheduling on unrelated machines of few different types. Zbl 1430.68448
Jansen, Klaus; Maack, Marten
3
2017
Monitoring effective connectivity in the preterm brain: a graph approach to study maturation. Zbl 1377.92011
Lavanga, M.; De Wel, O.; Caicedo, A.; Jansen, K.; Dereymaeker, A.; Naulaers, G.; Van Huffel, S.
1
2017
Closing the gap for makespan scheduling via sparsification techniques. Zbl 1388.68123
Jansen, Klaus; Klein, Kim-Manuel; Verschae, José
13
2016
Upper domination: complexity and approximation. Zbl 06631025
Bazgan, Cristina; Brankovic, Ljiljana; Casel, Katrin; Fernau, Henning; Jansen, Klaus; Klein, Kim-Manuel; Lampis, Michael; Liedloff, Mathieu; Monnot, Jérôme; Paschos, Vangelis Th.
5
2016
Estimating the makespan of the two-valued restricted assignment problem. Zbl 1378.90049
Jansen, Klaus; Land, Kati; Maack, Marten
4
2016
Algorithmic aspects of Upper Domination: a parameterised perspective. Zbl 06649751
Bazgan, Cristina; Brankovic, Ljiljana; Casel, Katrin; Fernau, Henning; Jansen, Klaus; Klein, Kim-Manuel; Lampis, Michael; Liedloff, Mathieu; Monnot, Jérôme; Paschos, Vangelis Th.
4
2016
Approximation schemes for machine scheduling with resource (in-)dependent processing times. Zbl 1410.68401
Jansen, Klaus; Maack, Marten; Rau, Malin
3
2016
A faster FPTAS for the unbounded knapsack problem. Zbl 06562491
Jansen, Klaus; Kraft, Stefan E. J.
3
2016
A PTAS for scheduling unrelated machines of few different types. Zbl 1442.90073
Gehrke, Jan Clemens; Jansen, Klaus; Kraft, Stefan E. J.; Schikowski, Jakob
3
2016
An efficient PTAS for parallel machine scheduling with capacity constraints. Zbl 06679794
Chen, Lin; Jansen, Klaus; Luo, Wenchang; Zhang, Guochuan
2
2016
New approximability results for two-dimensional bin packing. Zbl 1341.90111
Jansen, Klaus; Prädel, Lars
2
2016
Bounding the running time of algorithms for scheduling and packing problems. Zbl 1336.68100
Jansen, K.; Land, F.; Land, K.
2
2016
Scheduling parallel jobs on heterogeneous platforms. Zbl 1404.68028
Jansen, Klaus; Trystram, Denis
1
2016
An improved approximation scheme for variable-sized bin packing. Zbl 1356.68265
Jansen, Klaus; Kraft, Stefan
1
2016
Fully dynamic bin packing revisited. Zbl 1375.68223
Berndt, Sebastian; Jansen, Klaus; Klein, Kim-Manuel
4
2015
Improved approximation algorithms for scheduling parallel jobs on identical clusters. Zbl 1329.68284
Bougeret, Marin; Dutot, Pierre-Francois; Trystram, Denis; Jansen, Klaus; Robenek, Christina
1
2015
A \((5/3+\varepsilon)\)-approximation for strip packing. Zbl 1283.52024
Harren, Rolf; Jansen, Klaus; Prädel, Lars; van Stee, Rob
12
2014
A new asymptotic approximation algorithm for 3-dimensional strip packing. Zbl 1432.68576
Jansen, Klaus; Prädel, Lars
3
2014
On the optimality of approximation schemes for the classical scheduling problem. Zbl 1421.68201
Chen, Lin; Jansen, Klaus; Zhang, Guochuan
2
2014
Bin packing with fixed number of bins revisited. Zbl 1261.68065
Jansen, Klaus; Kratsch, Stefan; Marx, Dániel; Schlotter, Ildikó
21
2013
A robust AFPTAS for online bin packing with polynomial migration. Zbl 1336.68296
Jansen, Klaus; Klein, Kim-Manuel
4
2013
Bounding the running time of algorithms for scheduling and packing problems. Zbl 1391.68041
Jansen, Klaus; Land, Felix; Land, Kati
3
2013
Two for one: tight approximation of 2D bin packing. Zbl 1291.68431
Harren, Rolf; Jansen, Klaus; Prädel, Lars; Schwarz, Ulrich M.; Van Stee, Rob
2
2013
An improved knapsack solver for column generation. Zbl 1344.68287
Jansen, Klaus; Kraft, Stefan
2
2013
New approximability results for two-dimensional bin packing. Zbl 1423.90228
Jansen, Klaus; Prädel, Lars
1
2013
Scheduling malleable tasks with precedence constraints. Zbl 1238.68041
Jansen, Klaus; Zhang, Hu
4
2012
Scheduling jobs on identical and uniform processors revisited. Zbl 1242.68036
Jansen, Klaus; Robenek, Christina
3
2012
An improved approximation scheme for variable-sized bin packing. Zbl 1365.68468
Jansen, Klaus; Kraft, Stefan
2
2012
A fast approximation scheme for the multiple knapsack problem. Zbl 1302.90183
Jansen, Klaus
2
2012
Tight approximation algorithms for scheduling with fixed jobs and nonavailability. Zbl 1295.68212
Diedrich, Florian; Jansen, Klaus; Prädel, Lars; Schwarz, Ulrich M.; Svensson, Ola
1
2012
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. Zbl 1248.68036
Gupta, Anupam (ed.); Jansen, Klaus (ed.); Rolim, José (ed.); Servedio, Rocco (ed.)
1
2012
Approximation algorithms for multiple strip packing and scheduling parallel jobs in platforms. Zbl 1253.68356
Bougeret, Marin; Dutot, Pierre-Francois; Jansen, Klaus; Robenek, Christina; Trystram, Denis
6
2011
A \((5/3 + \varepsilon )\)-approximation for strip packing. Zbl 1342.68357
Harren, Rolf; Jansen, Klaus; Prädel, Lars; van Stee, Rob
3
2011
A polynomial time OPT + 1 algorithm for the cutting stock problem with a constant number of object lengths. Zbl 1246.68265
Jansen, Klaus; Solis-Oba, Roberto
1
2011
Approximation and online algorithms. 8th international workshop, WAOA 2010, Liverpool, UK, September 9–10, 2010. Revised papers. Zbl 1206.68011
Jansen, Klaus (ed.); Solis-Oba, Roberto (ed.)
1
2011
An EPTAS for scheduling jobs on uniform processors: using an MILP relaxation with a constant number of integral variables. Zbl 1253.90111
Jansen, Klaus
19
2010
Approximation algorithms for scheduling parallel jobs. Zbl 1209.68064
Jansen, Klaus; Thöle, Ralf
9
2010
Approximation algorithms for multiple strip packing. Zbl 1284.68657
Bougeret, Marin; Dutot, Pierre Francois; Jansen, Klaus; Otte, Christina; Trystram, Denis
5
2010
Bin packing with fixed number of bins revisited. Zbl 1285.68065
Jansen, Klaus; Kratsch, Stefan; Marx, Dániel; Schlotter, Ildikó
3
2010
Approximating the non-contiguous multiple organization packing problem. Zbl 1198.68102
Bougeret, Marin; Dutot, Pierre François; Jansen, Klaus; Otte, Christina; Trystram, Denis
2
2010
Trimming of graphs, with application to point labeling. Zbl 1225.05212
Erlebach, Thomas; Hagerup, Torben; Jansen, Klaus; Minzlaff, Moritz; Wolff, Alexander
2
2010
Approximation algorithms for scheduling with reservations. Zbl 1204.68273
Diedrich, Florian; Jansen, Klaus; Pascual, Fanny; Trystram, Denis
2
2010
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. Zbl 1195.68012
Serna, Maria (ed.); Shaltiel, Ronen (ed.); Jansen, Klaus (ed.); Rolim, José (ed.)
1
2010
An \(\text{OPT} + 1\) algorithm for the cutting stock problem with constant number of object lengths. Zbl 1285.90051
Jansen, Klaus; Solis-Oba, Roberto
1
2010
Parameterized approximation scheme for the multiple knapsack problem. Zbl 1211.68276
Jansen, Klaus
11
2009
Rectangle packing with one-dimensional resource augmentation. Zbl 1167.90632
Jansen, Klaus; Solis-Oba, Roberto
11
2009
A structural lemma in 2-dimensional packing, and its implications on approximability. Zbl 1272.52018
Bansal, Nikhil; Caprara, Alberto; Jansen, Klaus; Prädel, Lars; Sviridenko, Maxim
6
2009
Two for one: tight approximation of 2D bin packing. Zbl 1253.68361
Jansen, Klaus; Prädel, Lars; Schwarz, Ulrich M.
5
2009
Improved approximation algorithms for scheduling with fixed jobs. Zbl 1423.90088
Diedrich, Florian; Jansen, Klaus
2
2009
Parameterized approximation scheme for the multiple knapsack problem. Zbl 1423.68592
Jansen, Klaus
2
2009
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. Zbl 1173.68008
Dinur, Irit (ed.); Jansen, Klaus (ed.); Naor, Joseph (ed.); Rolim, José (ed.)
2
2009
A survey on approximation algorithms for scheduling with machine unavailability. Zbl 1248.68112
Diedrich, Florian; Jansen, Klaus; Schwarz, Ulrich M.; Trystram, Denis
2
2009
An EPTAS for scheduling jobs on uniform processors: using an MILP relaxation with a constant number of integral variables. Zbl 1248.68118
Jansen, Klaus
1
2009
A polynomial time approximation scheme for the square packing problem. Zbl 1143.90399
Jansen, Klaus; Solis-Oba, Roberto
9
2008
Grouping techniques for scheduling problems: simpler and faster. Zbl 1159.90403
Fishkin, Aleksei V.; Jansen, Klaus; Mastrolilli, Monaldo
6
2008
Trimming of graphs, with application to point labeling. Zbl 1258.05043
Erlebach, Thomas; Hagerup, Torben; Jansen, Klaus; Minzlaff, Moritz; Wolff, Alexander
3
2008
Approximation algorithms for scheduling parallel jobs: Breaking the approximation ratio of 2. Zbl 1152.90446
Jansen, Klaus; Thöle, Ralf
3
2008
Approximation algorithms for general packing problems and their application to the multicast congestion problem. Zbl 1137.90011
Jansen, Klaus; Zhang, Hu
3
2008
On packing rectangles with resource augmentation: maximizing the profit. Zbl 1277.90112
Fishkin, Aleksei V.; Gerber, Olga; Jansen, Klaus; Solis-Oba, Roberto
1
2008
Maximizing the total profit of rectangles packed into a rectangle. Zbl 1111.68150
Jansen, Klaus; Zhang, Guochuan
15
2007
New approximability results for 2-dimensional packing problems. Zbl 1147.68874
Jansen, Klaus; Solis-Oba, Roberto
7
2007
Approximation algorithms for 3D orthogonal Knapsack. Zbl 1198.68299
Diedrich, Florian; Harren, Rolf; Jansen, Klaus; Thöle, Ralf; Thomas, Henning
4
2007
Faster and simpler approximation algorithms for mixed packing and covering problems. Zbl 1115.68172
Diedrich, Florian; Jansen, Klaus
4
2007
An approximation algorithm for the general mixed packing and covering problem. Zbl 1176.90490
Diedrich, Florian; Jansen, Klaus
1
2007
An asymptotic approximation algorithm for 3D-strip packing. Zbl 1192.90176
Jansen, Klaus; Solis-Oba, Roberto
9
2006
Approximation algorithms for min-max and max-min resource sharing problems, and applications. Zbl 1132.90379
Jansen, Klaus
6
2006
An approximation algorithm for scheduling malleable tasks under general precedence constraints. Zbl 1321.68121
Jansen, Klaus; Zhang, Hu
3
2006
On preemptive resource constrained scheduling: Polynomial-time approximation schemes. Zbl 1127.90028
Jansen, Klaus; Porkolab, Lorant
3
2006
Approximation algorithm for the mixed fractional packing and covering problem. Zbl 1165.90609
Jansen, Klaus
3
2006
Implementation of approximation algorithms for the max-min resource sharing problem. Zbl 1196.68319
Aizatulin, Mihhail; Diedrich, Florian; Jansen, Klaus
2
2006
An approximation algorithm for the general max-min resource sharing problem. Zbl 1134.90049
Jansen, Klaus
2
2006
Efficient approximation and online algorithms. Recent progress on classical combinatorial optimization problems and new applications. Zbl 1131.68002
Bampis, Evripidis (ed.); Jansen, Klaus (ed.); Kenyon, Claire (ed.)
1
2006
Polynomial-time approximation schemes for geometric intersection graphs. Zbl 1081.68031
Erlebach, Thomas; Jansen, Klaus; Seidel, Eike
31
2005
On strip packing with rotations. Zbl 1192.68908
Jansen, Klaus; van Stee, Rob
14
2005
Polynomial time approximation schemes for MAX-BISECTION on planar and geometric graphs. Zbl 1087.90063
Jansen, Klaus; Karpinski, Marek; Lingas, Andrzej; Seidel, Eike
12
2005
Packing weighted rectangles into a square. Zbl 1156.68616
Fishkin, Aleksei V.; Gerber, Olga; Jansen, Klaus; Solis-Oba, Roberto
9
2005
Approximation schemes for job shop scheduling problems with controllable processing times. Zbl 1075.90029
Jansen, Klaus; Mastrolilli, Monaldo; Solis-Oba, Roberto
8
2005
Approximation algorithms for flexible job shop problems. Zbl 1089.90025
Jansen, Klaus; Mastrolilli, Monaldo; Solis-Oba, Roberto
4
2005
On efficient weighted rectangle packing with large resources. Zbl 1175.90329
Fishkin, Aleksei V.; Gerber, Olga; Jansen, Klaus
3
2005
Preemptive scheduling of independent jobs on identical parallel machines subject to migration delays. Zbl 1162.90451
Fishkin, Aleksei V.; Jansen, Klaus; Sevastyanov, Sergey V.; Sitters, René
3
2005
An approximation algorithm for scheduling malleable tasks under general precedence constraints. Zbl 1173.68408
Jansen, Klaus; Zhang, Hu
2
2005
Conversion of coloring algorithms into maximum weight independent set algorithms. Zbl 1087.68069
Erlebach, Thomas; Jansen, Klaus
2
2005
General multiprocessor task scheduling: Approximate solutions in linear time. Zbl 1095.68010
Jansen, Klaus; Porkolab, Lorant
1
2005
On rectangle packing, maximizing benefits. Zbl 1317.68280
Jansen, Klaus; Zhang, Guochaun
15
2004
Approximation schemes for parallel machine scheduling problems with controllable processing times. Zbl 1068.68035
Jansen, Klaus; Mastrolilli, Monaldo
13
2004
...and 79 more Documents
all top 5

Cited by 1,235 Authors

57 Jansen, Klaus
14 Epstein, Leah
13 Zhang, Guochuan
12 Levin, Asaf
11 Bonomo, Flavia
10 Dósa, György
10 Tuza, Zsolt
10 Wiese, Andreas
9 Bodlaender, Hans L.
9 Monnot, Jérôme
9 Oñate Ibáñez de Navarra, Eugenio
9 Solis-Oba, Roberto
9 Ye, Deshi
8 Boudhar, Mourad
8 Kaklamanis, Christos
8 Narayan, Darren A.
8 Paschos, Vangelis Th.
7 Caragiannis, Ioannis
7 Dong, Jianming
7 Erlebach, Thomas
7 Lokshtanov, Daniel
7 Paulusma, Daniël
7 Saurabh, Saket
7 Trystram, Denis R.
7 Valencia-Pabon, Mario E.
6 de Werra, Dominique
6 Dumitrescu, Adrian
6 Fomin, Fedor V.
6 Golovach, Petr A.
6 Jiang, Minghui
6 Miyazawa, Flavio Keidi
6 Niedermeier, Rolf
6 Sorge, Manuel
6 Woeginger, Gerhard Johannes
5 Chen, Lin
5 Della Croce, Federico
5 Demange, Marc
5 Durán, Guillermo Alfredo
5 Garcia-Espinosa, Julio
5 Giannopoulou, Archontia C.
5 Giaro, Krzysztof
5 Gutin, Gregory Z.
5 Han, Xin
5 Hu, Jueliang
5 Klein, Kim-Manuel
5 Li, Weidong
5 Lin, Guohui
5 Mastrolilli, Monaldo
5 Otachi, Yota
5 Persiano, Pino
5 Ries, Bernard
5 Shachnai, Hadas
5 Shakhlevich, Natalia V.
5 Thilikos, Dimitrios M.
5 Tóth, Csaba D.
5 van Bevern, René
5 Zhou, Xiao
4 Bazgan, Cristina
4 Chan, Timothy Moon-Yew
4 Díaz, Josep
4 Ekim, Tınaz
4 Faria, Luerbio
4 Halldórsson, Magnús Mar
4 Harren, Rolf
4 Hughes, Thomas J. R.
4 Huo, Yumei
4 Imreh, Csanád
4 Janczewski, Robert
4 Komusiewicz, Christian
4 Koutecký, Martin
4 Kratsch, Dieter
4 Kratsch, Stefan
4 Lampis, Michael
4 Li, Jianping
4 Li, Minming
4 Maack, Marten
4 Marchetti-Spaccamela, Alberto
4 Marenco, Javier L.
4 Marx, Dániel
4 Mnich, Matthias
4 Nip, Kameng
4 Nishizeki, Takao
4 Noronha, Thiago F.
4 Pagourtzis, Aris T.
4 Pilipczuk, Michał
4 Prädel, Lars
4 Rau, Malin
4 Rawitz, Dror
4 Rohwedder, Lars
4 Sau, Ignasi
4 Shabtay, Dvir
4 Shalom, Mordechai
4 Spieksma, Frits C. R.
4 Strusevich, Vitaly A.
4 Tong, Weitian
4 Van Leeuwen, Erik Jan
4 van Stee, Rob
4 Verschae, José
4 Wakabayashi, Yoshiko
4 Wang, Zhenbo
...and 1,135 more Authors
all top 5

Cited in 94 Serials

86 Theoretical Computer Science
75 Discrete Applied Mathematics
45 European Journal of Operational Research
39 Algorithmica
34 Computers & Operations Research
32 Journal of Combinatorial Optimization
31 Information Processing Letters
26 Journal of Scheduling
16 Discrete Mathematics
13 Journal of Computer and System Sciences
13 Information and Computation
13 Mathematical Programming. Series A. Series B
12 Computational Geometry
12 Discrete Optimization
11 Theory of Computing Systems
10 Operations Research Letters
10 Graphs and Combinatorics
10 Journal of Discrete Algorithms
9 Computer Methods in Applied Mechanics and Engineering
8 SIAM Journal on Computing
8 Annals of Operations Research
7 International Journal of Foundations of Computer Science
7 Journal of Global Optimization
6 Networks
6 European Journal of Combinatorics
5 International Transactions in Operational Research
4 International Journal for Numerical Methods in Fluids
4 Asia-Pacific Journal of Operational Research
4 SIAM Journal on Discrete Mathematics
4 International Journal of Computational Geometry & Applications
4 RAIRO. Operations Research
4 4OR
3 Information Sciences
3 Mathematics of Operations Research
3 Operations Research
3 Discrete & Computational Geometry
3 Journal of Parallel and Distributed Computing
3 Real-Time Systems
3 Discussiones Mathematicae. Graph Theory
3 Discrete Mathematics, Algorithms and Applications
2 Journal of Computational Physics
2 Journal of Graph Theory
2 International Journal of Production Research
2 Computational Mechanics
2 Mathematical and Computer Modelling
2 Distributed Computing
2 Combinatorics, Probability and Computing
2 The Electronic Journal of Combinatorics
2 International Journal of Computational Methods
2 AKCE International Journal of Graphs and Combinatorics
2 Optimization Letters
2 Computer Science Review
1 Acta Informatica
1 Computing
1 International Journal for Numerical Methods in Engineering
1 Journal of Computational and Applied Mathematics
1 Combinatorica
1 Applied Numerical Mathematics
1 Acta Mathematicae Applicatae Sinica. English Series
1 Journal of Computer Science and Technology
1 New Generation Computing
1 Games and Economic Behavior
1 Aequationes Mathematicae
1 Applied Mathematical Modelling
1 SIAM Journal on Optimization
1 Computational Optimization and Applications
1 Applied Mathematics. Series B (English Edition)
1 Computational and Applied Mathematics
1 Mathematical Logic Quarterly (MLQ)
1 Top
1 Complexity
1 INFORMS Journal on Computing
1 Mathematical Problems in Engineering
1 Optimization Methods & Software
1 Mathematical Methods of Operations Research
1 Journal of Graph Algorithms and Applications
1 CEJOR. Central European Journal of Operations Research
1 Archives of Computational Methods in Engineering
1 OR Spectrum
1 JMMA. Journal of Mathematical Modelling and Algorithms
1 Quantum Information Processing
1 International Journal of Parallel, Emergent and Distributed Systems
1 Mathematics in Computer Science
1 Logical Methods in Computer Science
1 Acta Universitatis Sapientiae. Informatica
1 Algorithms
1 Advances in Operations Research
1 Mathematical Programming Computation
1 RAIRO. Theoretical Informatics and Applications
1 Numerical Algebra, Control and Optimization
1 Information and Inference
1 ACM Transactions on Computation Theory
1 Annales de l’Institut Henri Poincaré D. Combinatorics, Physics and their Interactions (AIHPD)
1 International Journal of Applied and Computational Mathematics

Citations by Year