473 search results - page 3 / 95 » Computing excluded minors |
130
Voted
ESA
2004
Springer
15 years 11 months ago
2004
Springer
JCT
2000
15 years 5 months ago
2000
159
click to vote
FOCS
2009
IEEE
16 years 20 days 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...
189
click to vote
MFCS
2004
Springer
15 years 11 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....