Orthogonal-Ordering Constraints are Tough

We show that rectilinear graph drawing, the core problem of bendminimum orthogonal graph drawing, and uniform edge-length drawing, the core problem of force-directed placement, are NP-hard even for embedded paths if subjected to orthogonal-ordering constraints.