1. Andrews, S.: In-Close, a fast algorithm for computing formal concepts. In: Proceedings of the International Conference on Conceptual Structures, Moscow (2009)
2. Andrews, S.: Making use of empty intersections to improve the performance of CbO-type algorithms. In: Bertet, K., Borchmann, D., Cellier, P., Ferre, S. (eds.) Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 10308. LNAI, pp. 56–71. Springer, Cham (2017). https://doi.org/10.1007/978-3-319-59271-8_4
3. Andrews, S.: A new method for inheriting canonicity test failures in close-by-one type algorithms. In: Ignatov, D.I., Nourine, L. (eds.) Proceedings of the Fourteenth International Conference on Concept Lattices and Their Applications, CLA 2018, Olomouc, Czech Republic, 12–14 June 2018. CEUR Workshop Proceedings, vol. 2123, pp. 255–266. CEUR-WS.org (2018). https://ceur-ws.org/Vol-2123/paper21.pdf
4. Aragón, R.G., Medina, J., Ramírez-Poussa, E.: Factorizing formal contexts from closures of necessity operators. Comput. Appl. Math. 43, 1–32 (2024). https://doi.org/10.1016/j.ins.2022.05.047
5. Bělohávek, R., De Baets, B., Outrata, J., Vychodil, V.: Computing the lattice of all fixpoints of a fuzzy closure operator. IEEE Trans. Fuzzy Syst. 18(3), 546–557 (2010). https://doi.org/10.1109/TFUZZ.2010.2041006