1. Banerjee, I., Richards, D.: Sorting under forbidden comparisons. In: 15th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2016). Leibniz International Proceedings in Informatics (LIPIcs), vol. 53, pp. 22:1–22:13. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik (2016)
2. Daskalakis, C., Karp, R.M., Mossel, E., Riesenfeld, S.J., Verbin, E.: Sorting and selection in posets. SIAM J. Comput. 40(3), 597–622 (2011)
3. Computer Science and Applied Mathematics;MC Golumbic,2014
4. Komlós, J., Ma, Y., Szemerédi, E.: Matching nuts and bolts in o(n log n) time. SIAM J. Discret. Math. 11(3), 347–372 (1998)
5. Rose, D.J., Tarjan, R.E., Lueker, G.S.: Algorithmic aspects of vertex elimination on graphs. SIAM J. Comput. 5(2), 266–283 (1976)