The following publications are possibly variants of this publication:
- Subexponential Parameterized Algorithms for Planar and Apex-Minor-Free Graphs via Low Treewidth Pattern CoveringFedor V. Fomin, Daniel Lokshtanov, Dániel Marx, Marcin Pilipczuk, Michal Pilipczuk, Saket Saurabh. focs 2016: 515-524 [doi]
- A subexponential parameterized algorithm for Subset TSP on planar graphsPhilip N. Klein, Dániel Marx. soda 2014: 1812-1830 [doi]
- Subexponential parameterized algorithms on graphs of bounded-genus and ::::H::::-minor-free graphsErik D. Demaine, Fedor V. Fomin, Mohammad Taghi Hajiaghayi, Dimitrios M. Thilikos. soda 2004: 830-839 [doi]
- Subexponential parameterized algorithms on bounded-genus graphs and ::::H::::-minor-free graphsErik D. Demaine, Fedor V. Fomin, Mohammad Taghi Hajiaghayi, Dimitrios M. Thilikos. JACM, 52(6):866-893, 2005. [doi]
- A Subexponential Parameterized Algorithm for Directed Subset Traveling Salesman Problem on Planar GraphsDániel Marx, Marcin Pilipczuk, Michal Pilipczuk. SICOMP, 51(2):254-289, 2022. [doi]
- On Subexponential Parameterized Algorithms for Steiner Tree and Directed Subset TSP on Planar GraphsDániel Marx, Marcin Pilipczuk, Michal Pilipczuk. focs 2018: 474-484 [doi]
- A Framework for Parameterized Subexponential Algorithms for Generalized Cycle Hitting Problems on Planar GraphsDániel Marx, Pranabendu Misra, Daniel Neuen, Prafullkumar Tale. soda 2022: 2085-2127 [doi]
- Subexponential-Time Parameterized Algorithm for Steiner Tree on Planar GraphsMarcin Pilipczuk, Michal Pilipczuk, Piotr Sankowski, Erik Jan van Leeuwen. STACS 2013: 353-364 [doi]