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