Closing the gap for makespan scheduling via sparsification techniques K Jansen, KM Klein, J Verschae Mathematics of Operations Research 45 (4), 1371-1392, 2020 | 89 | 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 | 85 | 2019 |
Fully dynamic bin packing revisited S Berndt, K Jansen, KM Klein Mathematical Programming 179 (1), 109-155, 2020 | 72 | 2020 |
Faster algorithms for integer programs with block structure F Eisenbrand, C Hunkenschröder, KM Klein arXiv preprint arXiv:1802.06289, 2018 | 69 | 2018 |
Empowering the configuration-IP: new PTAS results for scheduling with setup times K Jansen, KM Klein, M Maack, M Rau Mathematical Programming 195 (1), 367-401, 2022 | 59 | 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 | 44 | 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 | 35* | 2019 |
About the complexity of two-stage stochastic IPs KM Klein International Conference on Integer Programming and Combinatorial …, 2020 | 29 | 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 | 21 | 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 | 20 | 2019 |
The double exponential runtime is tight for 2-stage stochastic ILPs K Jansen, KM Klein, A Lassota Mathematical Programming 197 (2), 1145-1172, 2023 | 19 | 2023 |
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 | 14 | 2022 |
Upper domination: complexity and approximation C Bazgan, L Brankovic, K Casel, H Fernau, K Jansen, KM Klein, ... International Workshop on Combinatorial Algorithms, 241-252, 2016 | 14 | 2016 |
Collapsing the tower—on the complexity of multistage stochastic IPs KM Klein, J Reuter ACM Transactions on Algorithms 20 (3), 1-21, 2024 | 13 | 2024 |
Online strip packing with polynomial migration K Jansen, KM Klein, M Kosche, L Ladewig arXiv preprint arXiv:1706.04939, 2017 | 13 | 2017 |
On minimizing tardy processing time, max-min skewed convolution, and triangular structured ILPs KM Klein, A Polak, L Rohwedder Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2023 | 11 | 2023 |
New Bounds for the Vertices of the Integer Hull∗ S Berndt, K Jansen, KM Klein Symposium on Simplicity in Algorithms (SOSA), 25-36, 2021 | 11 | 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 | 10 | 1904 |
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 | 8 | 2016 |
An algorithmic theory of integer programming. CoRR, abs/1904.01361 F Eisenbrand, C Hunkenschröder, KM Klein, M Koutecký, A Levin, S Onn arXiv preprint arXiv:1904.01361, 2019 | 5 | 2019 |