OceanRep
Items where Author is "Jansen, Klaus"
Number of items: 26.
Articles in a Scientific Journal - peer-reviewed
Bazgan, C., Brankovic, L., Casel, K., Fernau, H., Jansen, K., Klein, K. M., Lampis, M., Liedloff, M., Monnot, J. and Paschos, V. T.
(2018)
The many facets of upper domination.
Theoretical Computer Science, 717
.
pp. 2-25.
DOI 10.1016/j.tcs.2017.05.042.
Berndt, S., Jansen, K. and Klein, K. M.
(2018)
Fully dynamic bin packing revisited.
Mathematical Programming, 38
.
DOI 10.1007/s10107-018-1325-x.
Chen, L., Jansen, K. and Zhang, G.
(2018)
On the optimality of exact and approximation algorithms for scheduling problems.
Journal of Computer and System Sciences, 96
.
pp. 1-32.
DOI 10.1016/j.jcss.2018.03.005.
Gehrke, J. C., Jansen, K., Kraft, S. E. J. and Schikowski, J.
(2018)
A PTAS for Scheduling Unrelated Machines of Few Different Types.
International Journal of Foundations of Computer Science, 29
(04).
pp. 591-621.
DOI 10.1142/S0129054118410071.
Jansen, K. and Kraft, S. E. J.
(2018)
A faster FPTAS for the Unbounded Knapsack Problem.
European Journal of Combinatorics, 68
.
pp. 148-174.
DOI 10.1016/j.ejc.2017.07.016.
Henning, S., Jansen, K., Rau, M. and Schmarje, L.
(2017)
Complexity and Inapproximability Results for Parallel Task Scheduling and Strip Packing.
Lecture Notes in Computer Science, 10846
.
DOI 10.1007/978-3-319-90530-3_15.
Jansen, K., Land, K. and Maack, M.
(2017)
Estimating the Makespan of the Two-Valued Restricted Assignment Problem.
Algorithmica, 80
.
DOI 10.1007/s00453-017-0314-4.
Jansen, K. and Pradel, L.
(2016)
New Approximability Results for Two-Dimensional Bin Packing.
Algorithmica, 74
(1).
pp. 208-269.
DOI 10.1007/s00453-014-9943-z.
Jansen, K., Land, F. and Land, K.
(2016)
BOUNDING THE RUNNING TIME OF ALGORITHMS FOR SCHEDULING AND PACKING PROBLEMS.
Siam Journal on Discrete Mathematics, 8037
(1).
pp. 343-366.
DOI 10.1007/978-3-642-40104-6_38.
Bougeret, M., Dutot, P. F., Trystram, D., Jansen, K. and Robenek, C.
(2015)
Improved approximation algorithms for scheduling parallel jobs on identical clusters.
Theoretical Computer Science, 600
.
pp. 70-85.
DOI 10.1016/j.tcs.2015.07.003.
Eich, S., Stange, A., Carr, A. V., Urbancic, J., Popmintchev, T., Wiesenmayer, M., Jansen, K., Ruffing, A., Jakobs, S., Rohwer, T., Hellmann, S., Chen, C., Matyba, P., Kipp, L., Rossnagel, K., Bauer, M., Murnane, M. M., Kapteyn, H. C., Mathias, S. and Aeschlimann, M.
(2014)
Time- and angle-resolved photoemission spectroscopy with optimized high-harmonic pulses using frequency-doubled Ti:Sapphire lasers.
Journal of Electron Spectroscopy and Related Phenomena, 195
.
pp. 231-236.
DOI 10.1016/j.elspec.2014.04.013.
Harren, R., Jansen, K., Praedel, L. and van Stee, R.
(2014)
A (5/3+epsilon)-approximation for strip packing.
Computational Geometry-Theory and Applications, 47
(2).
pp. 248-267.
DOI 10.1016/j.comgeo.2013.08.008.
Book chapters
Jansen, K.
(2017)
New Algorithmic Results for Bin Packing and Scheduling.
In: Algorithms and Complexity.
; 10236
.
Springer, Cham, pp. 10-15.
DOI 10.1007/978-3-319-57586-5_2.
Jansen, K. and Rau, M.
(2017)
Improved Approximation for Two Dimensional Strip Packing with Polynomial Bounded Width.
In: WALCOM: Algorithms and Computation.
; 10167
.
Springer, Cham, pp. 409-420.
DOI 10.1007/978-3-319-53925-6_32.
Jansen, K. and Rohwedder, L.
(2017)
Structured Instances of Restricted Assignment with Two Processing Times.
In: Algorithms and Discrete Applied Mathematics.
; 10156
.
Springer, Cham, pp. 230-241.
DOI 10.1007/978-3-319-53007-9_21.
Jansen, K., Maack, M. and Solis-Oba, R.
(2017)
Structural Parameters for Scheduling with Assignment Restrictions.
In: Algorithms and Complexity.
; 10236
.
Springer, Cham, pp. 357-368.
DOI 10.1007/978-3-319-57586-5_30.
Jansen, K. and Kraft, S.
(2016)
An Improved Approximation Scheme for Variable-Sized Bin Packing.
In: 37th International Symposium, MFCS 2012, Bratislava, Slovakia, August 27-31, 2012. Proceedings.
; 59
.
Springer Berlin Heidelberg, Berlin Heidelberg, pp. 262-322.
DOI 10.1007/978-3-642-32589-2_47.
Conference papers
Jansen, K. and Land, F.
(2018)
Scheduling Monotone Moldable Jobs in Linear Time.
[Paper]
In: IPDPS 2018. , May 21 - 25, 2018, Vancouver, Canada . 2018 IEEE International Parallel and Distributed Processing Symposium (IPDPS). ; pp. 172-181 .
DOI 10.1109/IPDPS.2018.00027.
Jansen, K. and Rohwedder, L.
(2017)
A Quasi-Polynomial Approximation for the Restricted Assignment Problem.
[Paper]
In: The 19th Conference on Integer Programming and Combinatorial Optimization(IPCO 2017). , June 26 - 28, 2017, Waterloo, Canada . Integer Programming and Combinatorial Optimization. ; pp. 305-316 .
DOI 10.1007/978-3-319-59250-3_25.
Copyright 2023 | GEOMAR Helmholtz-Zentrum für Ozeanforschung Kiel | All rights reserved
Questions, comments and suggestions regarding the GEOMAR repository are welcomed
at bibliotheksleitung@geomar.de !