In the classical Node-Disjoint Paths (NDP) problem, we are given an n-vertex graph G = (V,E), and a collection M = {(s1, t1), . . . , (sk, tk)} of pairs of its vertices, called source-destination, or demand pairs. The goal is to route as many of the demand pairs as possible, where to route a pair we need to select a path connecting it, so that all selected paths are disjoint in their vertices. ...