1. Maximal antichains in partially ordered sets;Behrendt;ARS Combin.,1988
2. K. Bertet, J. Gustedt, M. Morvan, Weak-order extensions of an order, in: R. Möhring (Ed.), Lecture Notes in Computer Science, Proc. 23rd Workshop on Graph-Theoretic Concepts in Computer Science June 1997, Vol. 1335, WG’97, Springer, Berlin, Germany, pp. 65–77.
3. Some algorithms for computing plethysms of quasi-symmetric functions in the sense of Malvenuto and Reutenauer;Bertet;Comm. Algebra,2001
4. K. Bertet, L. Nourine, Lazy completion of a partial order to the smallest lattice, in: G. Mineau, A. Fall (Eds.), 2nd Internat. Symp. on Knowledge Retrieval, Use and Storage for Efficiency, August 1997, pp. 72–81.
5. G. Birkhoff, Lattice Theory (3rd ed.), Vol. 25, American Mathematical Society, Providence, RI, 1967.