The stable matching problem sets the economic foundation of several practical applications
ranging from school choice and medical residency to ridesharing and refugee placement. It …

Abstract Balanced Stable Marriage (BSM) is a central optimization version of the classic
Stable Marriage (SM) problem. We study BSM from the viewpoint of Parameterized …

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 …

Many important stable matching problems are known to be NP-hard, even when strong
restrictions are placed on the input. In this paper we seek to identify structural properties of …

Redistricting is the problem of dividing a state into a number $ k $ of regions, called districts.
Voters in each district elect a representative. The primary criteria are: each district is …

We investigate the following many-to-one stable matching problem with diversity constraints
(SMTI-Diverse): Given a set of students and a set of colleges which have preferences over …

In the stable marriage (SM) problem, there are two sets of agents—traditionally referred to as
men and women—and each agent has a preference list that ranks (a subset of) agents of the …

This paper gives an overview on and summarizes existing complexity and algorithmic
results of some variants of the Stable Marriage and the Stable Roommates problems. The …

Many important stable matching problems are known to be NP-hard, even when strong
restrictions are placed on the input. In this paper we seek to identify structural properties of …

A matching in a graph is a set of edges without common endpoints. Finding a matching is
one of the important ingredients that lead to defining the complexity class P. Computational …