1. Aho A, Garey M, Ullman J (1972) The transitive reduction of a directed graph. SIAM Journal on Computing 1(2):131–137
2. Alam M, Le TNN, Napoli A (2016) LatViz: A new practical tool for performing interactive exploration over concept lattices. In: Huchard M, Kuznetsov S (eds) Proc. 13th Intl. Conf. CLA, CEUR-WS.org, vol 1624, pp 9–20
3. Andrews S (2009) In-Close, a fast algorithm for computing formal concepts. In: Rudolph S, Dau F, Kuznetsov S (eds) Supplementary Proc. 17th Intl. Conf. Conceptual Structures, CEUR-WS.org, vol 483
4. Andrews S, Hirsch L (2016) A tool for creating and visualising formal concept trees. In: Andrews S, Polovina S (eds) Proc. 5th Conceptual Structures Tools & Interoperability Workshop (CSTIW 2016) held at the 22nd Intl. Conf. Conceptual Structures (ICCS 2016), CEUR-WS.org, vol 1637, pp 1–9
5. Archambault D, Munzner T, Auber D (2008) Grouseflocks: Steerable exploration of graph hierarchy space. IEEE Transactions on Visualization and Computer Graphics 14(4):900–913