13 citations · 40 across the 13 of their papers we have counts for
1 paper · 1 filter
Rajesh Chitnis
(see paper for full abstract) We show that the Edge-Disjoint Paths problem is W[1]-hard parameterized by the number k of terminal pairs, even when the input graph is a planar dir…