15 search results - page 2 / 3 » On the fixed-parameter tractability of parameterized model-c... |
SWAT
2010
Springer
13 years 10 months ago
2010
Springer
Given a permutation π of {1, . . . , n} and a positive integer k, we give an algorithm with running time 2O(k2 log k) nO(1) that decides whether π can be partitioned into at mos...
CORR
1999
Springer
13 years 5 months ago
1999
Springer
In this article, we study parameterized complexity theory from the perspective of logic, or more specifically, descriptive complexity theory. We propose to consider parameterized ...
STACS
2010
Springer
14 years 8 days ago
2010
Springer
Research on parameterized algorithmics for NP-hard problems has steadily grown over the last years. We survey and discuss how parameterized complexity analysis naturally develops i...
SIAMCOMP
2010
13 years 1 days ago
2010
We show that Edge Dominating Set, Hamiltonian Cycle, and Graph Coloring are W[1]-hard parameterized by clique-width. It was an open problem, explicitly mentioned in several papers,...
CATS
2008
13 years 6 months ago
2008
The problem of deciding whether the edge-set of a given graph can be partitioned into at most k cliques is well known to be NP-complete. In this paper we investigate this problem ...