1. Can visibility graphs be represented compactly?;Agarwal;Discrete Comput. Geom.,1994
2. Alexandre Albano, Bogdan Chornomaz, Why concept lattices are large - extremal theory for the number of minimal generators and formal concepts, in: Proceedings of the Twelfth International Conference on Concept Lattices and their Applications, Clermont-Ferrand, France, October 13–16, 2015, pp. 73–86.
3. A convexity upper bound for the number of maximal bicliques of a bipartite graph;Albano;Discrete Appl. Math.,2014
4. Consensus algorithms for the generation of all maximal bicliques;Alexe;Discrete Appl. Math.,2004
5. Complexity of minimum biclique cover and minimum biclique decomposition for bipartite domino-free graphs;Amilhastre;Discrete Appl. Math.,1998