473 search results - page 3 / 95 » Computing excluded minors |
WDAG
2005
Springer
14 years 25 days ago
2005
Springer
ESA
2004
Springer
14 years 23 days ago
2004
Springer
JCT
2000
13 years 7 months ago
2000
FOCS
2009
IEEE
14 years 2 months ago
2009
IEEE
—We introduce a new tool for approximation and testing algorithms called partitioning oracles. We develop methods for constructing them for any class of bounded-degree graphs wit...
MFCS
2004
Springer
14 years 22 days 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....