Browse by Creators (Kiel)

Up a level
Export as [feed] RSS [feed] RSS 3.0
Group by: Document type | No Grouping | Year of publication
Number of items: 20.

Article in a Scientific Journal - peer-reviewed


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 Cornell University Library .


Jansen, K. and Maack, M. (2017) An EPTAS for Scheduling on Unrelated Machines of Few Different Types Cornell University Library .


Jansen, K., Land, K. and Maack, M. (2017) Estimating the Makespan of the Two-Valued Restricted Assignment Problem Algorithmica . DOI 10.1007/s00453-017-0314-4.


Jansen, K., Land, F. and Land, K. (2016) BOUNDING THE RUNNING TIME OF ALGORITHMS FOR SCHEDULING AND PACKING PROBLEMS Siam Journal on Discrete Mathematics, 30 (1). pp. 343-366. DOI 10.1007/978-3-642-40104-6_38.


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.

Article in a Scientific Journal - without review


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.


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.


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.

Book chapter


Jansen, K. and Rau, M. (2017) Improved Approximation for Two Dimensional Strip Packing with Polynomial Bounded Width WALCOM: Algorithms and Computation. Springer, Cham, pp. 409-420. DOI 10.1007/978-3-319-53925-6_32.


Jansen, K. (2017) New Algorithmic Results for Bin Packing and Scheduling Algorithms and Complexity. Springer, Cham, pp. 10-15. DOI 10.1007/978-3-319-57586-5_2.


Jansen, K., Maack, M. and Solis-Oba, R. (2017) Structural Parameters for Scheduling with Assignment Restrictions Algorithms and Complexity. Springer, Cham, pp. 357-368. DOI 10.1007/978-3-319-57586-5_30.


Jansen, K. and Rohwedder, L. (2017) Structured Instances of Restricted Assignment with Two Processing Times Algorithms and Discrete Applied Mathematics. Springer, Cham, pp. 230-241. DOI 10.1007/978-3-319-53007-9_21.


Jansen, K. and Kraft, S. (2016) An Improved Approximation Scheme for Variable-Sized Bin Packing 37th International Symposium, MFCS 2012, Bratislava, Slovakia, August 27-31, 2012. Proceedings. Springer Berlin Heidelberg, Berlin Heidelberg, pp. 262-322. DOI 10.1007/978-3-642-32589-2_47.

Conference paper


Jansen, K. and Klein, K. M. (2017) About the structure of the integer cone and its application to bin packing [Paper] In: Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms , January 16 - 19, 2017, Barcelona, Spain.


Jansen, K., Klein, K. M. and Verschae, J. (2017) Improved Efficient Approximation Schemes for Scheduling Jobs on Identical and Uniform Machines [Paper] In: The 13th Workshop on Models and Algorithms for Planning and Scheduling Problems(MAPSP 2017), June 12 - 16, 2017, Seeon Abbey, Germany.


Jansen, K. and Klein, K. M. (2017) New Structural Results for Bin Packing with a Constant Number of Item Types [Paper] In: The 13th Workshop on Models and Algorithms for Planning and Scheduling Problems(MAPSP 2017),, June 12 - 16, 2017, Seeon Abbey, Germany.


Jansen, K. and Rohwedder, L. (2017) On the configuration-LP of the restricted assignment problem [Paper] In: Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms , January 16 - 19, 2017, Barcelona, Spain.


Jansen, K., Klein, K. M., Kosche, M. and Ladewig, L. (2017) Online Strip Packing with Polynomial Migration [Paper] In: The 20th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems(APPROX 2017), August 16 - 18, 2017, Berkeley, USA.


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.

This list was generated on Sun Jul 15 21:47:09 2018 CEST.