Graph minors. VII. Disjoint paths on a surface
Journal of Combinatorial Theory Series B
Linear time algorithms for NP-hard problems restricted to partial k-trees
Discrete Applied Mathematics
A separator theorem for graphs with an excluded minor and its applications
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Graph minors: X. obstructions to tree-decomposition
Journal of Combinatorial Theory Series B
Excluded minors, network decomposition, and multicommodity flow
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Approximation algorithms for NP-complete problems on planar graphs
Journal of the ACM (JACM)
Graph minors. XI.: circuits on a surface
Journal of Combinatorial Theory Series B
Quickly excluding a planar graph
Journal of Combinatorial Theory Series B
Graph minors. XII: distance on a surface
Journal of Combinatorial Theory Series B
Efficient approximation schemes for maximization problems on K3,3-free of K5-free graphs
Journal of Algorithms
Subgraph isomorphism in planar graphs and related problems
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Shallow excluded minors and improved graph decompositions
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Journal of Combinatorial Theory Series B
Deciding first-order properties of locally tree-decomposable structures
Journal of the ACM (JACM)
Embedding k-outerplanar graphs into ℓ1
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
-Approximation for Treewidth of Graphs Excluding a Graph with One Crossing as a Minor
APPROX '02 Proceedings of the 5th International Workshop on Approximation Algorithms for Combinatorial Optimization
Exponential Speedup of Fixed-Parameter Algorithms on K3, 3-Minor-Free or K5-Minor-Free Graphs
ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
Dimension Reduction in the \ell _1 Norm
FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
Cuts, Trees and -Embeddings of Graphs
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Node-and edge-deletion NP-complete problems
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
Graph minors. XVI. excluding a non-planar graph
Journal of Combinatorial Theory Series B
Approximation algorithms for classes of graphs excluding single-crossing graphs as minors
Journal of Computer and System Sciences
Fixed-parameter algorithms for the (k, r)-center in planar graphs and map graphs
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Subexponential parameterized algorithms on graphs of bounded-genus and H-minor-free graphs
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Bidimensionality: new connections between FPT algorithms and PTASs
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Algorithmic Graph Minor Theory: Decomposition, Approximation, and Coloring
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Subexponential parameterized algorithms on bounded-genus graphs and H-minor-free graphs
Journal of the ACM (JACM)
Approximation algorithms via contraction decomposition
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Approximation Algorithms via Structural Results for Apex-Minor-Free Graphs
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Local search: is brute-force avoidable?
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Local search: is brute-force avoidable?
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Parameterized complexity of the smallest degree-constrained subgraph problem
IWPEC'08 Proceedings of the 3rd international conference on Parameterized and exact computation
Sparse spanners vs. compact routing
Proceedings of the twenty-third annual ACM symposium on Parallelism in algorithms and architectures
Guard games on graphs: Keep the intruder out!
Theoretical Computer Science
Parameterized complexity of finding small degree-constrained subgraphs
Journal of Discrete Algorithms
Faster approximation schemes and parameterized algorithms on (odd-)H-minor-free graphs
Theoretical Computer Science
Fast algorithms for hard graph problems: bidimensionality, minors, and local treewidth
GD'04 Proceedings of the 12th international conference on Graph Drawing
Guard games on graphs: keep the intruder out!
WAOA'09 Proceedings of the 7th international conference on Approximation and Online Algorithms
Algorithmic graph minor theory: improved grid minor bounds and wagner's contraction
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
Beyond bidimensionality: Parameterized subexponential algorithms on directed graphs
Information and Computation
Hi-index | 0.00 |
We solve an open problem posed by Eppstein in 1995 [14, 15] and re-enforced by Grohe [16, 17] concerning locally bounded treewidth in minor-closed families of graphs. A graph has bounded local treewidth if the subgraph induced by vertices within distance r of any vertex has treewidth bounded by a function of r (not n). Eppstein characterized minor-closed families of graphs with bounded local treewidth as precisely minor-closed families that minor-exclude an apex graph, where an apex graph has one vertex whose removal leaves a planar graph. In particular, Eppstein showed that all apex-minor-free graphs have bounded local treewidth, but his bound is doubly exponential in r, leaving open whether a tighter bound could be obtained. We improve this doubly exponential bound to a linear bound, which is optimal. In particular, any minor-closed graph family with bounded local treewidth has linear local treewidth. Our bound generalizes previously known linear bounds for special classes of graphs proved by several authors. As a consequence of our result, we obtain substantially faster polynomial-time approximation schemes for a broad class of problems in apex-minor-free graphs, improving the running time from 222O(1/ε) nO(1) to 2O(1/ε)nO(1).