Marie-Catherine Vilarem

According to our database, Marie-Catherine Vilarem authored at least 6 papers between 1989 and 2004.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of five.

2004

Compiling CSPs into Tree-Driven Automata for Interactive Solving.

Hélène Fargier, Marie-Catherine Vilarem

Constraints An Int. J., 2004

1999

FA Minimisation Heuristics for a Class of Finite Languages.

Jérôme Amilhastre, Philippe Janssen, Marie-Catherine Vilarem

Proceedings of the Automata Implementation, 1999

1998

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

1997

Computing a Minimum Biclique Cover is Polynomial for Bipartite Domino-Free Graphs.

Jérôme Amilhastre, Philippe Janssen, Marie-Catherine Vilarem

Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 1997

1993

On some partial line graphs of a hypergraph and the associated matroid.

Philippe Jégou, Marie-Catherine Vilarem

Discret. Math., 1993

1989

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

Proceedings of the IEEE International Workshop on Tools for Artificial Intelligence: Architectures, 1989