SIAMCOMP

2010

12 years 11 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,...

CIAC

2010

Springer

13 years 1 months ago
2010

Springer

We study the parameterized complexity of the problems of determining whether a graph contains a k-edge subgraph (k-vertex induced subgraph) that is a -graph for -graphs being one ...

FSTTCS

2010

Springer

13 years 2 months ago
2010

Springer

We study the propositional satisfiability problem (SAT) on classes of CNF formulas (formulas in Conjunctive Normal Form) that obey certain structural restrictions in terms of thei...

MST

2007

13 years 3 months ago
2007

In 1996, Khanna and Motwani [KM96] proposed three logic-based optimization problems constrained by planar structure, and oﬀered the hypothesis that these putatively fundamental ...

DAM

2000

13 years 4 months ago
2000

An irredundant set of vertices V V in a graph G = (V; E) has the property that for every vertex u V ; N[V - {u}] is a proper subset of N[V ]. We investigate the parameterized co...

IPL

2007

13 years 4 months ago
2007

In this paper, we consider the parameterized complexity of the following problem: Given a hereditary property P on digraphs, an input digraph D and a positive integer k, does D ha...

APAL

2006

13 years 4 months ago
2006

Parameterized complexity has, so far, been largely con ned to consideration of computational problems as decision or search problems. However, it is becoming evident that the param...

ATAL

2010

Springer

13 years 5 months ago
2010

Springer

Combinatorial auctions have been studied by the multiagent systems community for some time, since these auctions are an effective mechanism for resource allocation when agents are...

DLT

2004

13 years 5 months ago
2004

Recently there have been some new initiatives in the field of parameterized complexity. In this paper, we will report on some of these, concentrating on some open questions, and al...

CATS

2008

13 years 5 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 ...