IWPEC
2009
Springer
14 years 7 months ago
2009
Springer
Given an undirected graph with n nodes, the Maximum Leaf Spanning Tree problem is to find a spanning tree with as many leaves as possible. When parameterized in the number of leav...
IWPEC
2009
Springer
14 years 7 months ago
2009
Springer
We describe a framework for expressing the complexity of algorithms for FPT problems with two separate parameters k, m and with exponential time bounds O∗ (xk ym ) where x, y &g...
IWPEC
2009
Springer
14 years 7 months ago
2009
Springer
We give improvements over fixed parameter tractable (FPT) algorithms to solve the Kemeny aggregation problem, where the task is to summarize a multi-set of preference lists, call...
IWPEC
2009
Springer
14 years 7 months ago
2009
Springer
An induced matching in graph G is a matching which is an induced subgraph of G. Clearly, among two vertices with the same neighborhood (called twins) at most one is matched in any...
IWPEC
2009
Springer
14 years 7 months ago
2009
Springer
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 ...
IWPEC
2009
Springer
14 years 7 months ago
2009
Springer
In the p-Set Splitting problem we are given a universe U, a family F of subsets of U and a positive integer k and the objective is to find a partition of U into W and B such that...
IWPEC
2009
Springer
14 years 7 months ago
2009
Springer
We study the Equitable Connected Partition problem, which is the problem of partitioning a graph into a given number of partitions, such that each partition induces a connected sub...
IWPEC
2009
Springer
14 years 7 months ago
2009
Springer
We introduce a new approach for establishing fixed-parameter tractability of problems parameterized above tight lower bounds or below tight upper bounds. To illustrate the approac...
IWPEC
2009
Springer
14 years 7 months ago
2009
Springer
We study the parameterized complexity of the following fundamental geometric problems with respect to the dimension d: i) Given n points in Rd, compute their minimum enclosing cyl...