104 search results - page 8 / 21 » On the Complexity of Some Colorful Problems Parameterized by... |
ISAAC
2007
Springer
14 years 1 months ago
2007
Springer
Valiant introduced some 25 years ago an algebraic model of computation along with the complexity classes VP and VNP, which can be viewed as analogues of the classical classes P and...
LATIN
2010
Springer
14 years 2 months ago
2010
Springer
Many divide-and-conquer algorithms employ the fact that the vertex set of a graph of bounded treewidth can be separated in two roughly balanced subsets by removing a small subset o...
AAAI
2004
13 years 9 months ago
2004
Combinatorial auctions (CAs) are important mechanisms for allocating interrelated items. Unfortunately, winner determination is NP-complete unless there is special structure. We s...
FOCS
2007
IEEE
14 years 1 months ago
2007
IEEE
We propose a proof-theoretic approach for gaining evidence that certain parameterized problems are not fixedparameter tractable. We consider proofs that witness that a given prop...
STACS
2010
Springer
14 years 2 months ago
2010
Springer
In 2000 Alber et al. [SWAT 2000 ] obtained the first parameterized subexponential algorithm on undirected planar graphs by showing that k-DOMINATING SET is solvable in time 2O( ...