Jérôme Amilhastre

According to our database, Jérôme Amilhastre authored at least 5 papers between 1997 and 2012.

Collaborative distances:

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

2012

Compiling CSPs: A Complexity Map of (Non-Deterministic) Multivalued Decision Diagrams.

Jérôme Amilhastre, Hélène Fargier, Alexandre Niveau, Cédric Pralet

Proceedings of the IEEE 24th International Conference on Tools with Artificial Intelligence, 2012

2002

Consistency restoration and explanations in dynamic CSPs Application to configuration.

Jérôme Amilhastre, Hélène Fargier, Pierre Marquis

Artif. Intell., 2002

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