| Closing the gap for makespan scheduling via sparsification techniques K Jansen, KM Klein, J Verschae Mathematics of Operations Research 45 (4), 1371-1392, 2020 | 77 | 2020 |
| An algorithmic theory of integer programming F Eisenbrand, C Hunkenschröder, KM Klein, M Koutecký, A Levin, S Onn arXiv preprint arXiv:1904.01361, 2019 | 70 | 2019 |
| Faster algorithms for integer programs with block structure F Eisenbrand, C Hunkenschröder, KM Klein arXiv preprint arXiv:1802.06289, 2018 | 56 | 2018 |
| Fully dynamic bin packing revisited S Berndt, K Jansen, KM Klein Mathematical Programming 179 (1-2), 109-155, 2020 | 53 | 2020 |
| Empowering the configuration-IP: new PTAS results for scheduling with setup times K Jansen, KM Klein, M Maack, M Rau Mathematical Programming 195 (1-2), 367-401, 2022 | 49 | 2022 |
| The many facets of upper domination C Bazgan, L Brankovic, K Casel, H Fernau, K Jansen, KM Klein, ... Theoretical Computer Science 717, 2-25, 2018 | 41 | 2018 |
| A robust AFPTAS for online bin packing with polynomial migration K Jansen, KM Klein SIAM Journal on Discrete Mathematics 33 (4), 2062-2091, 2019 | 33* | 2019 |
| About the complexity of two-stage stochastic IPs KM Klein Integer Programming and Combinatorial Optimization: 21st International …, 2020 | 21 | 2020 |
| About the structure of the integer cone and its application to bin packing K Jansen, KM Klein Mathematics of Operations Research 45 (4), 1498-1511, 2020 | 18 | 2020 |
| An EPTAS for machine scheduling with bag-constraints K Grage, K Jansen, KM Klein The 31st ACM Symposium on Parallelism in Algorithms and Architectures, 135-144, 2019 | 16 | 2019 |
| Upper domination: Complexity and approximation C Bazgan, L Brankovic, K Casel, H Fernau, K Jansen, KM Klein, ... Combinatorial Algorithms: 27th International Workshop, IWOCA 2016, Helsinki …, 2016 | 14 | 2016 |
| Online strip packing with polynomial migration K Jansen, KM Klein, M Kosche, L Ladewig arXiv preprint arXiv:1706.04939, 2017 | 12 | 2017 |
| The double exponential runtime is tight for 2-stage stochastic ILPs K Jansen, KM Klein, A Lassota Mathematical Programming 197 (2), 1145-1172, 2023 | 11 | 2023 |
| Algorithmic aspects of upper domination: a parameterised perspective C Bazgan, L Brankovic, K Casel, H Fernau, K Jansen, KM Klein, ... Algorithmic Aspects in Information and Management: 11th International …, 2016 | 9 | 2016 |
| On the Fine-Grained Complexity of the Unbounded SubsetSum and the Frobenius Problem∗ KM Klein Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2022 | 8 | 2022 |
| New Bounds for the Vertices of the Integer Hull∗ S Berndt, K Jansen, KM Klein Symposium on Simplicity in Algorithms (SOSA), 25-36, 2021 | 8 | 2021 |
| An algorithmic theory of integer programming (2019) F Eisenbrand, C Hunkenschröder, KM Klein, M Koutecký, A Levin, S Onn arXiv preprint arXiv:1904.01361, 1904 | 7 | 1904 |
| Collapsing the Tower-On the Complexity of Multistage Stochastic IPs∗ KM Klein, J Reuter Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2022 | 5 | 2022 |
| Improved efficient approximation schemes for scheduling jobs on identical and uniform machines K Jansen, KM Klein, J Verschae Proceedings of the 13th workshop on models and algorithms for planning and …, 2017 | 5 | 2017 |
| Complexity bounds for block-ips K Jansen, KM Klein, J Reuter | 1 | 2021 |
Klaus JansenProfessor, Computer Science, University of KielVerified email at informatik.uni-kiel.de
