1. Cygan, M., et al.: Parameterized Algorithms. Springer, Cham (2015). https://doi.org/10.1007/978-3-319-21275-3
2. Francis, M., Neogi, R., Raman, V.: Recognizing $$k$$-clique extendible orderings. arXiv:2007.06060 (2020)
3. Golumbic, M.C.: Algorithmic Graph Theory and Perfect Graphs, vol. 57. Elsevier, Amsterdam (2004)
4. Hamburger, P., McConnell, R.M., Pór, A., Spinrad, J.P., Xu, Z.: Double threshold digraphs. In: 43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018), vol. 117. Leibniz International Proceedings in Informatics (LIPIcs), pp. 69:1–69:12. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik (2018)
5. McConnell, R.M., Spinrad, J.P.: Linear-time transitive orientation. In: Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 19–25. Society for Industrial and Applied Mathematics (1997)