Kim-Manuel Klein

According to our database, Kim-Manuel Klein authored at least 30 papers between 2013 and 2025.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2025

Sparse Integer Programming Is Fixed-Parameter Tractable.

Friedrich Eisenbrand, Christoph Hunkenschröder, Kim-Manuel Klein, Martin Koutecký, Asaf Levin, Shmuel Onn

Math. Oper. Res., 2025

Faster Lattice Basis Computation via a Natural Generalization of the Euclidean Algorithm.

Kim-Manuel Klein, Janina Reuter

Proceedings of the 57th Annual ACM Symposium on Theory of Computing, 2025

2024

Faster Lattice Basis Computation - The Generalization of the Euclidean Algorithm.

Kim-Manuel Klein, Janina Reuter

CoRR, 2024

PACE Solver Description: UzL Exact Solver for One-Sided Crossing Minimization.

Max Bannach, Florian Chudigiewitsch, Kim-Manuel Klein, Marcel Wienöbst

Proceedings of the 19th International Symposium on Parameterized and Exact Computation, 2024

Tight Lower Bounds for Block-Structured Integer Programs.

Christoph Hunkenschröder, Kim-Manuel Klein, Martin Koutecký, Alexandra Lassota, Asaf Levin

Proceedings of the Integer Programming and Combinatorial Optimization, 2024

2023

Reducibility bounds of objective functions over the integers.

Friedrich Eisenbrand, Christoph Hunkenschröder, Kim-Manuel Klein, Martin Koutecký, Asaf Levin, Shmuel Onn

Oper. Res. Lett., November, 2023

Simple Lattice Basis Computation - The Generalization of the Euclidean Algorithm.

Kim-Manuel Klein, Janina Reuter

CoRR, 2023

On Minimizing Tardy Processing Time, Max-Min Skewed Convolution, and Triangular Structured ILPs.

Kim-Manuel Klein, Adam Polak, Lars Rohwedder

Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

2022

Empowering the configuration-IP: new PTAS results for scheduling with setup times.

Klaus Jansen, Kim-Manuel Klein, Marten Maack, Malin Rau

Math. Program., 2022

Collapsing the Tower - On the Complexity of Multistage Stochastic IPs.

Kim-Manuel Klein, Janina Reuter

Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022

On the Fine-Grained Complexity of the Unbounded SubsetSum and the Frobenius Problem.

Kim-Manuel Klein

Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022

2021

New Bounds for the Vertices of the Integer Hull.

Sebastian Berndt, Klaus Jansen, Kim-Manuel Klein

Proceedings of the 4th Symposium on Simplicity in Algorithms, 2021

Fuzzy Simultaneous Congruences.

Max A. Deppert, Klaus Jansen, Kim-Manuel Klein

Proceedings of the 46th International Symposium on Mathematical Foundations of Computer Science, 2021

The Double Exponential Runtime is Tight for 2-Stage Stochastic ILPs.

Klaus Jansen, Kim-Manuel Klein, Alexandra Lassota

Proceedings of the Integer Programming and Combinatorial Optimization, 2021

2020

About the Complexity of Two-Stage Stochastic IPs.

Kim-Manuel Klein

Proceedings of the Integer Programming and Combinatorial Optimization, 2020

2019

An Algorithmic Theory of Integer Programming.

Friedrich Eisenbrand, Christoph Hunkenschröder, Kim-Manuel Klein, Martin Koutecký, Asaf Levin, Shmuel Onn

CoRR, 2019

An EPTAS for Machine Scheduling with Bag-Constraints.

Kilian Grage, Klaus Jansen, Kim-Manuel Klein

Proceedings of the 31st ACM on Symposium on Parallelism in Algorithms and Architectures, 2019

Empowering the Configuration-IP - New PTAS Results for Scheduling with Setups Times.

Klaus Jansen, Kim-Manuel Klein, Marten Maack, Malin Rau

Proceedings of the 10th Innovations in Theoretical Computer Science Conference, 2019

2018

The many facets of upper domination.

Cristina Bazgan, Ljiljana Brankovic, Katrin Casel, Henning Fernau, Klaus Jansen, Kim-Manuel Klein, Michael Lampis, Mathieu Liedloff, Jérôme Monnot, Vangelis Th. Paschos

Theor. Comput. Sci., 2018

Faster Algorithms for Integer Programs with Block Structure.

Friedrich Eisenbrand, Christoph Hunkenschröder, Kim-Manuel Klein

Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

Using Structural Properties for Integer Programs.

Sebastian Berndt, Kim-Manuel Klein

Proceedings of the Sailing Routes in the World of Computation, 2018

2017

About the Structure and Sensitivity of Integer Linear Programs and their Application in Combinatorial Optimization.

Kim-Manuel Klein

PhD thesis, 2017

About the Structure of the Integer Cone and its Application to Bin Packing.

Klaus Jansen, Kim-Manuel Klein

Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

Online Strip Packing with Polynomial Migration.

Klaus Jansen, Kim-Manuel Klein, Maria Kosche, Leon Ladewig

Proceedings of the Approximation, 2017

2016

Robust Bin Packing.

Kim-Manuel Klein

Encyclopedia of Algorithms, 2016

Upper Domination: Complexity and Approximation.

Cristina Bazgan, Ljiljana Brankovic, Katrin Casel, Henning Fernau, Klaus Jansen, Kim-Manuel Klein, Michael Lampis, Mathieu Liedloff, Jérôme Monnot, Vangelis Th. Paschos

Proceedings of the Combinatorial Algorithms - 27th International Workshop, 2016

Closing the Gap for Makespan Scheduling via Sparsification Techniques.

Klaus Jansen, Kim-Manuel Klein, José Verschae

Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016

Algorithmic Aspects of Upper Domination: A Parameterised Perspective.

Cristina Bazgan, Ljiljana Brankovic, Katrin Casel, Henning Fernau, Klaus Jansen, Kim-Manuel Klein, Michael Lampis, Mathieu Liedloff, Jérôme Monnot, Vangelis Th. Paschos

Proceedings of the Algorithmic Aspects in Information and Management, 2016

2015

Fully Dynamic Bin Packing Revisited .

Sebastian Berndt, Klaus Jansen, Kim-Manuel Klein

Proceedings of the Approximation, 2015

2013

A Robust AFPTAS for Online Bin Packing with Polynomial Migration, .

Klaus Jansen, Kim-Manuel Klein

Proceedings of the Automata, Languages, and Programming - 40th International Colloquium, 2013