13 citations · 23 across the 10 of their papers we have counts for
Showing cs.CCShow all
3 papers · 1 filter
cs.CC2020
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…
cs.CC2019
Parameterized Complexity of Stable Roommates with Ties and Incomplete Lists Through the Lens of Graph Parameters
Robert Bredereck, Klaus Heeger, Dušan Knop +1
We continue and extend previous work on the parameterized complexity analysis of the NP-hard Stable Roommates with Ties and Incomplete Lists problem, thereby strengthening earlier…
cs.CC2011
Graph and Election Problems Parameterized by Feedback Set Numbers
Robert Bredereck
This work investigates the parameterized complexity of three related graph modification problems. Given a directed graph, a distinguished vertex, and a positive integer k, Minimum…