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)

Consistency restoration and explanations in dynamic CSPs Application to configuration. - Jérôme Amilhastre; Hélène Fargier; Pierre Marquis (Artif. Intell., 2002)

Compiling CSPs: A Complexity Map of (Non-Deterministic) Multivalued Decision Diagrams. - Jérôme Amilhastre; Hélène Fargier; Alexandre Niveau; Cédric Pralet (Int. J. Artif. Intell. Tools, 2014)