1 citations · 1 across the 5 of their papers we have counts for
5 papers
Fair Repetitive Interval Scheduling
Klaus Heeger, Danny Hermelin, Yuval Itzhaki +2
Fair resource allocation is undoubtedly a crucial factor in customer satisfaction in several scheduling scenarios. This is especially apparent in repetitive scheduling models where…
Minimizing the Number of Tardy Jobs with Uniform Processing Times on Parallel Machines
Klaus Heeger, Hendrik Molter
In this work, we study the computational (parameterized) complexity of . Here, we are given identical parallel machines and jobs with…
Fully Polynomial-time Algorithms Parameterized by Vertex Integrity Using Fast Matrix Multiplication
Matthias Bentert, Klaus Heeger, Tomohiro Koana
We study the computational complexity of several polynomial-time-solvable graph problems parameterized by vertex integrity, a measure of a graph's vulnerability to vertex removal i…
A Map of Diverse Synthetic Stable Roommates Instances
Niclas Boehmer, Klaus Heeger, Stanisław Szufa
Focusing on Stable Roommates (SR) instances, we contribute to the toolbox for conducting experiments for stable matching problems. We introduce a polynomial-time computable pseudom…
Theory of and Experiments on Minimally Invasive Stability Preservation in Changing Two-Sided Matching Markets
Niclas Boehmer, Klaus Heeger, Rolf Niedermeier
Following up on purely theoretical work of Bredereck et al. [AAAI 2020], we contribute further theoretical insights into adapting stable two-sided matchings to change. Moreover, we…