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 (AAIM, 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 (IWOCA, 2016)

Robust Bin Packing. - Kim-Manuel Klein (Encyclopedia of Algorithms, 2016)

Online Strip Packing with Polynomial Migration. - Klaus Jansen; Kim-Manuel Klein; Maria Kosche; Leon Ladewig (APPROX-RANDOM, 2017)

About the Structure and Sensitivity of Integer Linear Programs and their Application in Combinatorial Optimization. - Kim-Manuel Klein (2017)

Using Structural Properties for Integer Programs. - Sebastian Berndt 001; Kim-Manuel Klein (CiE, 2018)

Faster Algorithms for Integer Programs with Block Structure. - Friedrich Eisenbrand; Christoph Hunkenschröder; Kim-Manuel Klein (ICALP, 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)

Empowering the Configuration-IP - New PTAS Results for Scheduling with Setups Times. - Klaus Jansen; Kim-Manuel Klein; Marten Maack; Malin Rau (ITCS, 2019)

An EPTAS for Machine Scheduling with Bag-Constraints. - Kilian Grage; Klaus Jansen; Kim-Manuel Klein (SPAA, 2019)

An Algorithmic Theory of Integer Programming. - Friedrich Eisenbrand; Christoph Hunkenschröder; Kim-Manuel Klein; Martin Koutecký; Asaf Levin; Shmuel Onn (CoRR, 2019)

A Robust AFPTAS for Online Bin Packing with Polynomial Migration. - Klaus Jansen; Kim-Manuel Klein (SIAM J. Discret. Math., 2019)

About the Structure of the Integer Cone and Its Application to Bin Packing. - Klaus Jansen; Kim-Manuel Klein (Math. Oper. Res., 2020)

Closing the Gap for Makespan Scheduling via Sparsification Techniques. - Klaus Jansen; Kim-Manuel Klein; José Verschae (Math. Oper. Res., 2020)

Fully dynamic bin packing revisited. - Sebastian Berndt 001; Klaus Jansen; Kim-Manuel Klein (Math. Program., 2020)

Fuzzy Simultaneous Congruences. - Max A. Deppert; Klaus Jansen; Kim-Manuel Klein (MFCS, 2021)

New Bounds for the Vertices of the Integer Hull. - Sebastian Berndt 001; Klaus Jansen; Kim-Manuel Klein (SOSA, 2021)

On the Fine-Grained Complexity of the Unbounded SubsetSum and the Frobenius Problem. - Kim-Manuel Klein (SODA, 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)

About the complexity of two-stage stochastic IPs. - Kim-Manuel Klein (Math. Program., 2022)

On Minimizing Tardy Processing Time, Max-Min Skewed Convolution, and Triangular Structured ILPs. - Kim-Manuel Klein; Adam Polak 001; Lars Rohwedder (SODA, 2023)

Simple Lattice Basis Computation - The Generalization of the Euclidean Algorithm. - Kim-Manuel Klein; Janina Reuter (CoRR, 2023)

The double exponential runtime is tight for 2-stage stochastic ILPs. - Klaus Jansen; Kim-Manuel Klein; Alexandra Lassota (Math. Program., 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., 2023)

Tight Lower Bounds for Block-Structured Integer Programs. - Christoph Hunkenschröder; Kim-Manuel Klein; Martin Koutecký; Alexandra Lassota; Asaf Levin (IPCO, 2024)

PACE Solver Description: UzL Exact Solver for One-Sided Crossing Minimization. - Max Bannach; Florian Chudigiewitsch; Kim-Manuel Klein; Marcel Wienöbst (IPEC, 2024)

Faster Lattice Basis Computation - The Generalization of the Euclidean Algorithm. - Kim-Manuel Klein; Janina Reuter (CoRR, 2024)

Collapsing the Tower - On the Complexity of Multistage Stochastic IPs. - Kim-Manuel Klein; Janina Reuter (ACM Trans. Algorithms, 2024)

Faster Lattice Basis Computation via a Natural Generalization of the Euclidean Algorithm. - Kim-Manuel Klein; Janina Reuter (STOC, 2025)