Philippe Janssen

According to our database, Philippe Janssen authored at least 4 papers between 1997 and 2006.

Collaborative distances:

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

2006

Minimum implicational basis for meet-semidistributive lattices.

Philippe Janssen, Lhouari Nourine

Inf. Process. Lett., 2006

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