A filtering process for general constraint-satisfaction problems: achieving pairwise-consistency using an associated binary representation. - P. Janssen; Philippe Jégou; B. Nouguier; Marie-Catherine Vilarem (TAI, 1989)

On some partial line graphs of a hypergraph and the associated matroid. - Philippe Jégou; Marie-Catherine Vilarem (Discret. Math., 1993)

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)

Compiling CSPs into Tree-Driven Automata for Interactive Solving. - Hélène Fargier; Marie-Catherine Vilarem (Constraints An Int. J., 2004)