@inproceedings{8bd887c072a14bf198b3cbabe0db8d9b,

title = "Planar k-Path in Subexponential Time and Polynomial Space",

abstract = "In the k-path problem we are given an n-vertex graph g together with an integer k and asked whether g contains a path of length k as a subgraph. We give the first subexponential time, polynomial space parameterized algorithm for k-path on planar graphs, and more generally, on h-minor-free graphs. The running time of our algorithm is o(2^{o(\sqrt{k}\log^2 k)}n^{o(1)})o(2^{o(\sqrt{k}\log^2 k)}n^{o(1)}).",

author = "Daniel Lokshtanov and Matthias Mnich and Saket Saurabh",

year = "2011",

doi = "10.1007/978-3-642-25870-1_24",

language = "English",

isbn = "978-3-642-25869-5",

series = "Lecture Notes in Computer Science",

publisher = "Springer",

pages = "262--270",

editor = "Petr Kolman and Jan Kratochvil",

booktitle = "Graph-Theoretic Concepts in Computer Science",

address = "United States",

}