In this survey/introductory article, we first present the basics of the field of Parameterized
Complexity, made accessible to readers without background on the subject. Afterwards, we …

Background A variety of outcome domains are currently measured for the assessment of
hearing rehabilitation. To date, there is no consensus about which outcome domains should …

We study the Hospitals/Residents with Couples problem, a variant of the classical Stable
Marriage problem. This is the extension of the Hospitals/Residents problem where residents …

A tanglegram is a pair of trees on the same set of leaves with matching leaves in the two
trees joined by an edge. Tanglegrams are widely used in biology—to compare evolutionary …

62] Turan, P., A note of welcome, J. Graph Theory 1 (1977) 7-9. 63] Dambitis, J., An
algorithm for superimposing a nonplanar graph onto the plane with nearly minimal number …

Abstract Focusing on Stable Roommates (SR), we contribute to the toolbox for conducting
experiments for stable matching problems. We introduce the polynomial-time computable …

Given m permutations π1, π2... πm of {1, 2,..., n} and a distance function d, the median
problem is to find a permutation π∗ that is the" closest" of the m given permutations. Here …

Given a set A⊆ S n of m permutations of {1, 2,…, n} and a distance function d, the median
problem consists of finding a permutation π∗ that is the “closest” of the m given …

We study a prototype Crossing Minimization problem, defined as follows. Let F be an infinite
family of (possibly vertex-labeled) graphs. Then, given a set P of (possibly labeled) n points …

In this paper we obtain parameterized subexponential-time algorithms for p-Kemeny
Aggregation (p-KAGG)—a problem in social choice theory—and for p-One-Sided Crossing …