9 search results - page 2 / 2 » Parameterized Complexity: Exponential Speed-Up for Planar Gr... |
FSTTCS
2009
Springer
13 years 11 months ago
2009
Springer
Partial Cover problems are optimization versions of fundamental and well studied problems like Vertex Cover and Dominating Set. Here one is interested in covering (or dominating) ...
RECOMB
2006
Springer
14 years 5 months ago
2006
Springer
This paper proposes a parameterized algorithm for aligning two protein structures, in the case where one protein structure is represented by a contact map graph and the other by a ...
IWPEC
2009
Springer
13 years 11 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...
CRYPTO
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. We study the natural problem of secure n-party computation (in the passive, computationally unbounded attack model) of the n-product function fG(x1, . . . , xn) = x1 · x...