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