2 citations · 2 across the 2 of their papers we have counts for
2 papers
cs.GT2022
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.…
cs.DS2019★ 2 cited
Length-Bounded Cuts: Proper Interval Graphs and Structural Parameters
Matthias Bentert, Klaus Heeger, Dušan Knop
In the presented paper we study the Length-Bounded Cut problem for special graph classes as well as from a parameterized-complexity viewpoint. Here, we are given a graph , two v…