Jean-Marc Lanlignel

According to our database, Jean-Marc Lanlignel authored at least 4 papers between 2000 and 2012.

Collaborative distances:

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

2012

Polynomial-time recognition of clique-width ≤3 graphs.

Derek G. Corneil, Michel Habib, Jean-Marc Lanlignel, Bruce A. Reed, Udi Rotics

Discret. Appl. Math., 2012

2010

On end-vertices of Lexicographic Breadth First Searches.

Derek G. Corneil, Ekkehard Köhler, Jean-Marc Lanlignel

Discret. Appl. Math., 2010

2000

Pruning Graphs with Digital Search Trees. Application to Distance Hereditary Graphs.

Jean-Marc Lanlignel, Olivier Raynaud, Eric Thierry

Proceedings of the STACS 2000, 2000

Polynomial Time Recognition of Clique-Width \le \leq 3 Graphs (Extended Abstract).

Derek G. Corneil, Michel Habib, Jean-Marc Lanlignel, Bruce A. Reed, Udi Rotics

Proceedings of the LATIN 2000: Theoretical Informatics, 2000