102 citations · 154 across the 25 of their papers we have counts for
29 papers
Structural aspects of the Student Project Allocation problem
Peace Ayegba, Sofiat Olaosebikan, David Manlove
We study the Student Project Allocation problem with lecturer preferences over Students (SPA-S), which involves the assignment of students to projects based on student preferences…
Structural and Algorithmic Results for Stable Cycles and Partitions in the Roommates Problem
Frederik Glitzner, David Manlove
In the Stable Roommates problem, we seek a stable matching of the agents into pairs, in which no two agents have an incentive to deviate from their assignment. It is well known tha…
Couples can be tractable: New algorithms and hardness results for the Hospitals / Residents problem with Couples
Gergely Csáji, David Manlove, Iain McBride +1
In this paper, we study the Hospitals / Residents problem with Couples (HRC), where a solution is a stable matching or a report that none exists. We present a novel polynomial-time…
Envy-freeness in 3D Hedonic Games
Michael McKay, Ágnes Cseh, David Manlove
We study the problem of partitioning a set of agents into coalitions based on the agents' additively separable preferences, which can also be viewed as a hedonic game. We apply thr…
Packing s in bounded degree graphs
Michael McKay, David Manlove
We study the problem of finding a maximum-cardinality set of -cliques in an undirected graph of fixed maximum degree , subject to the cliques in that set being either vertex-…
Profile-based optimal stable matchings in the Roommates problem
Sofia Simola, David Manlove
The stable roommates problem can admit multiple different stable matchings. We have different criteria for deciding which one is optimal, but computing those is often NP-hard. We s…