The planar directed k-Vertex-Disjoint Paths problem is fixed-parameter tractable

Marek Cygan, Dániel Marx, Marcin Pilipczuk +1

Given a graph G and k pairs of vertices (s_1,t_1), ..., (s_k,t_k), the k-Vertex-Disjoint Paths problem asks for pairwise vertex-disjoint paths P_1, ..., P_k such that P_i goes from…