451 search results - page 9 / 91 » On Parameterized Exponential Time Complexity |
SIAMCOMP
2010
13 years 4 months 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,...
DLT
2009
13 years 7 months ago
2009
Abstract. We analyze Hmelevskii's theorem, which states that the general solutions of constant-free equations on three unknowns are expressible by a finite collection of formu...
LICS
1999
IEEE
14 years 2 months ago
1999
IEEE
We present some new decision and comparison problems of unusually high computational complexity. Most of the problems are strictly combinatorial in nature; others involve basic lo...
TROB
2010
13 years 4 months ago
2010
Abstract--This paper proposes a unified optimization framework to solve the time parameterization problem of humanoid robot paths. Even though the time parameterization problem is ...
DAGSTUHL
2003
13 years 11 months ago
2003
Abstract. The continuing trend towards more sophisticated technical applications results in an increasing demand for high quality software for complex, safety-critical systems. Des...