| |
| 2004 | ||
|---|---|---|
| 5 | EE | Hélène Fargier, Marie-Catherine Vilarem: Compiling CSPs into Tree-Driven Automata for Interactive Solving. Constraints 9(4): 263-287 (2004) |
| 1999 | ||
| 4 | EE | Jérôme Amilhastre, Philippe Janssen, Marie-Catherine Vilarem: FA Minimisation Heuristics for a Class of Finite Languages. WIA 1999: 1-12 |
| 1998 | ||
| 3 | EE | Jérôme Amilhastre, Marie-Catherine Vilarem, Philippe Janssen: Complexity of Minimum Biclique Cover and Minimum Biclique Decomposition for Bipartite Domino-free Graphs. Discrete Applied Mathematics 86(2-3): 125-144 (1998) |
| 1997 | ||
| 2 | Jérôme Amilhastre, Philippe Janssen, Marie-Catherine Vilarem: Computing a Minimum Biclique Cover is Polynomial for Bipartite Domino-Free Graphs. SODA 1997: 36-42 | |
| 1993 | ||
| 1 | EE | Philippe Jégou, Marie-Catherine Vilarem: On some partial line graphs of a hypergraph and the associated matroid. Discrete Mathematics 111(1-3): 333-344 (1993) |
| 1 | Jérôme Amilhastre | [2] [3] [4] |
| 2 | Hélène Fargier | [5] |
| 3 | Philippe Janssen | [2] [3] [4] |
| 4 | Philippe Jégou | [1] |