Planar k-Path in Subexponential Time and Polynomial Space

Daniel Lokshtanov, Matthias Mnich, Saket Saurabh. Planar k-Path in Subexponential Time and Polynomial Space. In Petr Kolman, Jan Kratochvíl, editors, Graph-Theoretic Concepts in Computer Science - 37th International Workshop, WG 2011, Teplá Monastery, Czech Republic, June 21-24, 2011. Revised Papers. Volume 6986 of Lecture Notes in Computer Science, pages 262-270, Springer, 2011. [doi]

Abstract

Abstract is missing.