473 search results - page 3 / 95 » Computing excluded minors |
96
Voted
WDAG
2005
Springer
15 years 7 months ago
2005
Springer
93
Voted
ESA
2004
Springer
15 years 7 months ago
2004
Springer
59
Voted
JCT
2000
15 years 1 months ago
2000
119
Voted
FOCS
2009
IEEE
15 years 8 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...
133
Voted
MFCS
2004
Springer
15 years 7 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....