This paper focuses on kernelization algorithms for the fundamental Knaps...
We provide a general framework to exclude parameterized running times of...
Focusing on Stable Roommates (SR) instances, we contribute to the toolbo...
When computing stable matchings, it is usually assumed that the preferen...
We study stable matching problems where agents have multilayer preferenc...
We introduce the problem of adapting a stable matching to forced and
for...
Fairly dividing a set of indivisible resources to a set of agents is of
...
Following up on purely theoretical work of Bredereck et al. [AAAI 2020],...
In the Popular Matching problem, we are given a bipartite graph G = (A ∪...
A polynomial Turing kernel for some parameterized problem P is a
polynom...
We introduce a natural but seemingly yet unstudied generalization of the...
Since the early days of research in algorithms and complexity, the
compu...
In the Hospital Residents problem with lower and upper quotas (HR-Q^U_L)...
We initiate the study of external manipulations in Stable Marriage by
co...
Time-evolving or temporal graphs gain more and more popularity when stud...
Time-evolving or temporal graphs gain more and more popularity when stud...
We continue and extend previous work on the parameterized complexity ana...
In the presented paper we study the Length-Bounded Cut problem for speci...
In the stable marriage problem, a set of men and a set of women are give...