Page
%P
-
Chapter and Conference Paper
Multidimensional Stable Roommates with Master List
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 (either from different “gende...
-
Chapter and Conference Paper
Kernelization of Graph Hamiltonicity: Proper H-Graphs
We obtain new polynomial kernels and compression algorithms for Pat...
-
Chapter and Conference Paper
Fixed Parameter Complexity of Distance Constrained Labeling and Uniform Channel Assignment Problems
We study computational complexity of the class of distance-constrained graph labeling problems from the fixed parameter tractability point of view. The parameters studied are neighborhood diversity and clique ...