2 citations · 3 across the 3 of their papers we have counts for
4 papers
Equivalent Instances for Scheduling and Packing Problems
Klaus Jansen, Kai Kahler, Corinna Wambsganz
Two instances and of a parameterized problem are equivalent if they have the same set of solutions (static equivalent) or if the set of solutions of c…
New Algorithm for Combinatorial -folds and Applications
Klaus Jansen, Kai Kahler, Lis Pirotton +1
Block-structured integer linear programs (ILPs) play an important role in various application fields. We address -fold ILPs where the matrix has a specific structu…
Exact and Approximate High-Multiplicity Scheduling on Identical Machines
Klaus Jansen, Kai Kahler, Esther Zwanger
Goemans and Rothvoss (SODA'14) gave a framework for solving problems which can be described as finding a point in intcone, where $P,Q\subset\mathbb{R}…
On the Complexity of Scheduling Problems With a Fixed Number of Parallel Identical Machines
Klaus Jansen, Kai Kahler
In parallel machine scheduling, we are given a set of jobs, together with a number of machines and our goal is to decide for each job, when and on which machine(s) it should be sch…