2 citations · 9 across the 18 of their papers we have counts for
5 papers · 1 filter
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…
Deepening the (Parameterized) Complexity Analysis of Incremental Stable Matching Problems
Niclas Boehmer, Klaus Heeger, Rolf Niedermeier
When computing stable matchings, it is usually assumed that the preferences of the agents in the matching market are fixed. However, in many realistic scenarios, preferences change…
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.…
Adapting Stable Matchings to Forced and Forbidden Pairs
Niclas Boehmer, Klaus Heeger
We introduce the problem of adapting a stable matching to forced and forbidden pairs. Specifically, given a stable matching , a set of forced pairs, and a set of forbi…
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…