In the Paired Pointset Traversal problem we ask whether, given two sets A = {a1, . . . , an} and B = {b1, . . . , bn} in the plane, there is an ordering π of the points such that both a π(1), . . . , aπ(n) and bπ(1), . . . , bπ(n) are self-avoiding polygonal arcs? We show thatPaired Pointset Traversal is NP-complete. This has consequences for the complexity of computing the Fréchet distance of ...

Conventional gang scheduling has the disadvantage that when processes perform I/O or blocking communication, their processors remain idle because alternative processes cannot be run independently of their own gangs. To alleviate this problem, we suggest a slight relaxation of this rule: match gangs that make heavy use of the CPU with gangs that make light use of the CPU (presumably due to I/O o...