Computing a Minimum Biclique Cover is Polynomial for Bipartite Domino-Free Graphs. - Jérôme Amilhastre; Philippe Janssen; Marie-Catherine Vilarem (SODA, 1997)

Complexity of Minimum Biclique Cover and Minimum Biclique Decomposition for Bipartite Domino-free Graphs. - Jérôme Amilhastre; Marie-Catherine Vilarem; Philippe Janssen (Discret. Appl. Math., 1998)

FA Minimisation Heuristics for a Class of Finite Languages. - Jérôme Amilhastre; Philippe Janssen; Marie-Catherine Vilarem (WIA, 1999)

Minimum implicational basis for meet-semidistributive lattices. - Philippe Janssen; Lhouari Nourine (Inf. Process. Lett., 2006)