Kim-Manuel Klein

According to our database1, Kim-Manuel Klein authored at least 16 papers between 2016 and 2020.

Collaborative distances:



In proceedings 
PhD thesis 




Fully dynamic bin packing revisited.
Math. Program., 2020

A Robust AFPTAS for Online Bin Packing with Polynomial Migration.
SIAM J. Discrete Math., 2019

An Algorithmic Theory of Integer Programming.
CoRR, 2019

About the Complexity of Two-Stage Stochastic IPs.
CoRR, 2019

An EPTAS for Machine Scheduling with Bag-Constraints.
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.
Proceedings of the 10th Innovations in Theoretical Computer Science Conference, 2019

The many facets of upper domination.
Theor. Comput. Sci., 2018

Faster Algorithms for Integer Programs with Block Structure.
Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

Using Structural Properties for Integer Programs.
Proceedings of the Sailing Routes in the World of Computation, 2018

About the Structure and Sensitivity of Integer Linear Programs and their Application in Combinatorial Optimization.
PhD thesis, 2017

About the Structure of the Integer Cone and its Application to Bin Packing.
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

Online Strip Packing with Polynomial Migration.
Proceedings of the Approximation, 2017

Robust Bin Packing.
Encyclopedia of Algorithms, 2016

Upper Domination: Complexity and Approximation.
Proceedings of the Combinatorial Algorithms - 27th International Workshop, 2016

Closing the Gap for Makespan Scheduling via Sparsification Techniques.
Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016

Algorithmic Aspects of Upper Domination: A Parameterised Perspective.
Proceedings of the Algorithmic Aspects in Information and Management, 2016