1. Armin, Biere, CaDiCaL, Lingeling, Plingeling, Treengeling and YalSAT Entering the SAT Competition 2018. In Proc. of SAT Competition 2018 – Solver and Benchmark Descriptions, volume B-2018-1 of Department of Computer Science Series of Publications B, pages 13–14. University of Helsinki, 2018
2. Niklas Eén, Armin Biere. Effective preprocessing in SAT through variable and clause elimination. In Fahiem Bacchus and Toby Walsh, editors, Theory and Applications of Satisfiability Testing, 8th International Conference, SAT 2005, St. Andrews, UK, June 19-23, 2005, Proceedings, volume 3569 of Lecture Notes in Computer Science, pages 61–75. Springer, 2005
3. Erdős, Paul, Moser, Leo: On the representation of directed graphs as unions of orderings. Math. Inst. Hung. Acad. Sci 9, 125–132 (1964)
4. Ian P, Gent. Arc consistency in SAT. In Frank van Harmelen, editor, Proceedings of the 15th Eureopean Conference on Artificial Intelligence, ECAI’2002, Lyon, France, July 2002, pages 121–125. IOS Press, 2002
5. Lidicky, Bernard, Pfender, Florian: Semidefinite programming and ramsey numbers. SIAM J. Discret. Math. 35(4), 2328–2344 (2021)