2 citations · 2 across the 4 of their papers we have counts for
9 papers
Stable Matching with Multilayer Approval Preferences: Approvals can be Harder than Strict Preferences
Matthias Bentert, Niclas Boehmer, Klaus Heeger +1
We study stable matching problems where agents have multilayer preferences: There are layers each consisting of one preference relation for each agent. Recently, Chen et al.…
Multivariate Algorithmics for Eliminating Envy by Donating Goods
Niclas Boehmer, Robert Bredereck, Klaus Heeger +2
Fairly dividing a set of indivisible resources to a set of agents is of utmost importance in some applications. However, after an allocation has been implemented the preferences of…
Polynomial Turing Kernels for Clique with an Optimal Number of Queries
Till Fluschnik, Klaus Heeger, Danny Hermelin
A polynomial Turing kernel for some parameterized problem is a polynomial-time algorithm that solves using queries to an oracle of whose sizes are upper-bounded by some…
Multidimensional Stable Roommates with Master List
Robert Bredereck, Klaus Heeger, Dušan Knop +1
Since the early days of research in algorithms and complexity, the computation of stable matchings is a core topic. While in the classic setting the goal is to match up two agents…
A Fine-Grained View on Stable Many-To-One Matching Problems with Lower and Upper Quotas
Niclas Boehmer, Klaus Heeger
In the Hospital Residents problem with lower and upper quotas (), the goal is to find a stable matching of residents to hospitals where the number of residents matched to…
Multistage Graph Problems on a Global Budget
Klaus Heeger, Anne-Sophie Himmel, Frank Kammer +3
Time-evolving or temporal graphs gain more and more popularity when studying the behavior of complex networks. In this context, the multistage view on computational problems is amo…