Kim-Manuel Klein

Orcid: 0000-0002-0188-9492

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

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Collapsing the Tower - On the Complexity of Multistage Stochastic IPs.
ACM Trans. Algorithms, July, 2024

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

PACE Solver Description: UzL Exact Solver for One-Sided Crossing Minimization.
Proceedings of the 19th International Symposium on Parameterized and Exact Computation, 2024

Tight Lower Bounds for Block-Structured Integer Programs.
Proceedings of the Integer Programming and Combinatorial Optimization, 2024

2023
Reducibility bounds of objective functions over the integers.
Oper. Res. Lett., November, 2023

The double exponential runtime is tight for 2-stage stochastic ILPs.
Math. Program., February, 2023

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

On Minimizing Tardy Processing Time, Max-Min Skewed Convolution, and Triangular Structured ILPs.
Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

2022
About the complexity of two-stage stochastic IPs.
Math. Program., 2022

Empowering the configuration-IP: new PTAS results for scheduling with setup times.
Math. Program., 2022

On the Fine-Grained Complexity of the Unbounded SubsetSum and the Frobenius Problem.
Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022

2021
New Bounds for the Vertices of the Integer Hull.
Proceedings of the 4th Symposium on Simplicity in Algorithms, 2021

Fuzzy Simultaneous Congruences.
Proceedings of the 46th International Symposium on Mathematical Foundations of Computer Science, 2021

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

Closing the Gap for Makespan Scheduling via Sparsification Techniques.
Math. Oper. Res., 2020

About the Structure of the Integer Cone and Its Application to Bin Packing.
Math. Oper. Res., 2020

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

An Algorithmic Theory of Integer Programming.
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

2018
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

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

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

2016
Robust Bin Packing.
Encyclopedia of Algorithms, 2016

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

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


  Loading...