One Sided Crossing Minimization Is NP-Hard for Sparse Graphs.

Xavier Muoz, Walter Unger, Imrich Vrto

Browse the full GD paper archive.