Graph minors. VII. Disjoint paths on a surface
Journal of Combinatorial Theory Series B
Embeddings of graphs with no short noncontractible cycles
Journal of Combinatorial Theory Series B
Graph minors. XI.: circuits on a surface
Journal of Combinatorial Theory Series B
Journal of the ACM (JACM)
On limited nondeterminism and the complexity of the V-C dimension
Journal of Computer and System Sciences
Which problems have strongly exponential complexity?
Journal of Computer and System Sciences
Graph minors. XVI. excluding a non-planar graph
Journal of Combinatorial Theory Series B
Tour Merging via Branch-Decomposition
INFORMS Journal on Computing
Parameterized complexity: exponential speed-up for planar graph problems
Journal of Algorithms
Bidimensional Parameters and Local Treewidth
SIAM Journal on Discrete Mathematics
Bidimensionality: new connections between FPT algorithms and PTASs
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)
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
Linear time low tree-width partitions and algorithmic consequences
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Dominating Sets in Planar Graphs: Branch-Width and Exponential Speed-Up
SIAM Journal on Computing
LICS '07 Proceedings of the 22nd Annual IEEE Symposium on Logic in Computer Science
Approximation algorithms via contraction decomposition
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Catalan structures and dynamic programming in H-minor-free graphs
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
A Linear-Time Approximation Scheme for TSP in Undirected Planar Graphs with Edge-Weights
SIAM Journal on Computing
Optimal branch-decomposition of planar graphs in O(n3) Time
ACM Transactions on Algorithms (TALG)
Subexponential parameterized algorithms for degree-constrained subgraph problems on planar graphs
Journal of Discrete Algorithms
Dynamic programming for graphs on surfaces
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
A simpler algorithm and shorter proof for the graph minor decomposition
Proceedings of the forty-third annual ACM symposium on Theory of computing
Problems parameterized by treewidth tractable in single exponential time: a logical approach
MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science
Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time
FOCS '11 Proceedings of the 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science
Fast subexponential algorithm for non-local problems on graphs of bounded genus
SWAT'06 Proceedings of the 10th Scandinavian conference on Algorithm Theory
Exact algorithms for the Hamiltonian cycle problem in planar graphs
Operations Research Letters
Survey: Subexponential parameterized algorithms
Computer Science Review
Parameterized Complexity
The Bidimensionality Theory and Its Algorithmic Applications 1
The Computer Journal
Fast hamiltonicity checking via bases of perfect matchings
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
Beyond bidimensionality: Parameterized subexponential algorithms on directed graphs
Information and Computation
Hi-index | 0.00 |
We give an algorithm that, for a fixed graph H and integer k, decides whether an n-vertex H-minor-free graph G contains a path of length k in 2^O^(^k^)@?n^O^(^1^) steps. Our approach builds on a combination of Demaine-Hajiaghayi@?s bounds on the size of an excluded grid in such graphs with a novel combinatorial result on certain branch decompositions of H-minor-free graphs. This result is used to bound the number of ways vertex disjoint paths can be routed through the separators of such decompositions. The proof is based on several structural theorems from the Graph Minors series of Robertson and Seymour. With a slight modification, similar combinatorial and algorithmic results can be derived for many other problems. Our approach can be viewed as a general framework for obtaining time 2^O^(^k^)@?n^O^(^1^) algorithms on H-minor-free graph classes.