12 search results - page 1 / 3 » Subexponential parameterized algorithms on graphs of bounded... |
MFCS
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. Bidimensionality provides a tool for developing subexponential fixed-parameter algorithms for combinatorial optimization problems on graph families that exclude a minor....
FSTTCS
2009
Springer
13 years 11 months ago
2009
Springer
Partial Cover problems are optimization versions of fundamental and well studied problems like Vertex Cover and Dominating Set. Here one is interested in covering (or dominating) ...
JDA
2010
12 years 11 months 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...
SODA
2010
ACM
14 years 2 months ago
2010
ACM
Bidimensionality theory appears to be a powerful framework in the development of meta-algorithmic techniques. It was introduced by Demaine et al. [J. ACM 2005 ] as a tool to obtai...
SODA
2004
ACM
13 years 6 months ago
2004
ACM
