451 search results - page 9 / 91 » On Parameterized Exponential Time Complexity |
181
click to vote
SIAMCOMP
2010
15 years 17 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,...
158
Voted
DLT
2009
15 years 3 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...
147
Voted
LICS
1999
IEEE
15 years 10 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...
156
Voted
TROB
2010
15 years 15 days 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 ...
156
Voted
DAGSTUHL
2003
15 years 7 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...