104 search results - page 3 / 21 » On the Complexity of Some Colorful Problems Parameterized by... |
IWPEC
2009
Springer
14 years 7 days 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...
EJC
2008
13 years 5 months ago
2008
It is known that every constraint-satisfaction problem (CSP) reduces, and is in fact polynomially equivalent, to a digraph coloring problem. By carefully analyzing the constructio...
WG
2009
Springer
14 years 8 days ago
2009
Springer
We study the parameterized complexity of several minimum label graph problems, in which we are given an undirected graph whose edges are labeled, and a property Π, and we are ask...
IWPEC
2009
Springer
14 years 7 days ago
2009
Springer
We study the parameterized complexity of the following fundamental geometric problems with respect to the dimension d: i) Given n points in Rd, compute their minimum enclosing cyl...
CPM
2010
Springer
13 years 10 months ago
2010
Springer
