359 search results - page 8 / 72 » The Parameterized Complexity of Counting Problems |
CADE
1994
Springer
15 years 2 months ago
1994
Springer
CP
2008
Springer
14 years 12 months ago
2008
Springer
CORR
1998
Springer
14 years 9 months ago
1998
Springer
TAMC
2009
Springer
15 years 4 months ago
2009
Springer
In this paper we define the notion of an f(k)-uniform parameterized exponential time scheme. We show that a problem can be solved in parameterized O(2o(f(k)) p(n)) time if and on...
CJ
2008
14 years 10 months ago
2008
We survey results and open questions on complexity of parameterized problems on digraphs. The problems include the feedback vertex and arc set problems, induced subdigraph problem...