FAW
2008
Springer
14 years 4 months ago
2008
Springer
We study the parameterized complexity of an NP-complete geometric covering problem called d-dimensional Rectangle Stabbing where we are given a set of axis-parallel d-dimensional h...
AAAI
2008
14 years 4 months ago
2008
We argue that parameterized complexity is a useful tool with which to study global constraints. In particular, we show that many global constraints which are intractable to propag...
COCOON
2000
Springer
14 years 6 months ago
2000
Springer
We consider the parameterized complexity of the following problem under the framework introduced by Downey and Fellows[4]: Given a graph G, an integer parameter k and a non-trivial...
FCT
2003
Springer
14 years 7 months ago
2003
Springer
Abstract. The NP-complete Distinguishing Substring Selection problem (DSSS for short) asks, given a set of “good” strings and a set of “bad” strings, for a solution string ...
COCO
2003
Springer
14 years 7 months ago
2003
Springer
We give machine characterisations and logical descriptions of a number of parameterized complexity classes. The focus of our attention is the class W[P], which we characterise as ...
MFCS
2004
Springer
14 years 7 months ago
2004
Springer
Abstract. Problem parameters are ubiquitous. In every area of computer science, we find all kinds of “special aspects” to the problems encountered. Hence, the study of paramet...
ISAAC
2007
Springer
14 years 8 months ago
2007
Springer
The class of graphs where the size of a minimum vertex cover equals that of a maximum matching is known as K¨onig-Egerv´ary graphs. K¨onig-Egerv´ary graphs have been studied ex...
CSL
2007
Springer
14 years 8 months ago
2007
Springer
Recently it has been shown that the miniaturization mapping M faithfully translates subexponential parameterized complexity into (unbounded) parameterized complexity. We determine...
IWPEC
2009
Springer
14 years 8 months ago
2009
Springer
We study the parameterized complexity of two families of problems: the bounded length disjoint paths problem and the bounded length cut problem. From Menger’s theorem both proble...
FSTTCS
2009
Springer
14 years 8 months ago
2009
Springer
We investigate the parameterized complexity of generalisations and variations of the dominating set problem on classes of graphs that are nowhere dense. In particular, we show that...