Search the dblp DataBase

Publications of Author

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