Brandes, U. and Pampel, B. (2013) “Orthogonal-Ordering Constraints are Tough”, Journal of Graph Algorithms and Applications, 17(1), pp. 1–10. doi: 10.7155/jgaa.00281.