Catalan structures and dynamic programming in H-minor-free graphs
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Additive approximation algorithms for list-coloring minor-closed class of graphs
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Searching for a Visible, Lazy Fugitive
Graph-Theoretic Concepts in Computer Science
A linear-time algorithm to find a separator in a graph excluding a minor
ACM Transactions on Algorithms (TALG)
The edge disjoint paths problem in Eulerian graphs and 4-edge-connected graphs
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Contraction obstructions for treewidth
Journal of Combinatorial Theory Series B
Subexponential algorithms for partial cover problems
Information Processing Letters
Journal of Computer and System Sciences
Bidimensionality and geometric graphs
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Polynomial treewidth forces a large grid-like-minor
European Journal of Combinatorics
The complexity of two graph orientation problems
Discrete Applied Mathematics
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Local search: Is brute-force avoidable?
Journal of Computer and System Sciences
FPT algorithms for connected feedback vertex set
WALCOM'10 Proceedings of the 4th international conference on Algorithms and Computation
Computational study on bidimensionality theory based algorithm for longest path problem
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
Catalan structures and dynamic programming in H-minor-free graphs
Journal of Computer and System Sciences
Survey: Subexponential parameterized algorithms
Computer Science Review
FPT algorithms for Connected Feedback Vertex Set
Journal of Combinatorial Optimization
Graph minors and parameterized algorithm design
The Multivariate Algorithmic Revolution and Beyond
Subexponential parameterized algorithms
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
On the excluded minor structure theorem for graphs of large tree-width
Journal of Combinatorial Theory Series B
Large-treewidth graph decompositions and applications
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Beyond bidimensionality: Parameterized subexponential algorithms on directed graphs
Information and Computation
| Hi-index | 0.00 |
We prove that any H-minor-free graph, for a fixed graph H, of treewidth w has an 驴(w) 脳 驴(w) grid graph as a minor. Thus grid minors suffice to certify that H-minorfree graphs have large treewidth, up to constant factors. This strong relationship was previously known for the special cases of planar graphs and bounded-genus graphs, and is known not to hold for general graphs. The approach of this paper can be viewed more generally as a framework for extending combinatorial results on planar graphs to hold on H-minor-free graphs for any fixed H. Our result has many combinatorial consequences on bidimensionality theory, parameter-treewidth bounds, separator theorems, and bounded local treewidth; each of these combinatorial results has several algorithmic consequences including subexponential fixed-parameter algorithms and approximation algorithms.