790 search results - page 1 / 158 » Subexponential Parameterized Algorithms |
JDA
2010
13 years 3 days ago
2010
We present subexponential parameterized algorithms on planar graphs for a family of problems of the following shape: given a graph, find a connected (induced) subgraph with bounde...
STACS
2010
Springer
14 years 9 days ago
2010
Springer
In 2000 Alber et al. [SWAT 2000 ] obtained the first parameterized subexponential algorithm on undirected planar graphs by showing that k-DOMINATING SET is solvable in time 2O( ...
COCO
2006
Springer
13 years 9 months ago
2006
Springer
We establish a close connection between (sub)exponential time complexity and parameterized complexity by proving that the so-called miniaturization mapping is a reduction preservi...
SODA
2004
ACM
13 years 6 months ago
2004
ACM
ICALP
2007
Springer
13 years 11 months ago
2007
Springer
