1 paper
Dario Cavallaro, Ken-ichi Kawarabayashi, Stephan Kreutzer
Disjoint paths problems are among the most prominent problems in combinatorial optimization. The edge- as well as vertex-disjoint paths problem, are NP-complete on directed and und…