Jean-Marc Lanlignel

	2012
4		Derek G. Corneil, Michel Habib, Jean-Marc Lanlignel, Bruce A. Reed, Udi Rotics: Polynomial-time recognition of clique-width ≤3 graphs. Discrete Applied Mathematics 160(6): 834-865 (2012)
	2010
3		Derek G. Corneil, Ekkehard Köhler, Jean-Marc Lanlignel: On end-vertices of Lexicographic Breadth First Searches. Discrete Applied Mathematics 158(5): 434-443 (2010)
	2000
2		Derek G. Corneil, Michel Habib, Jean-Marc Lanlignel, Bruce A. Reed, Udi Rotics: Polynomial Time Recognition of Clique-Width \le \leq 3 Graphs (Extended Abstract). LATIN 2000: 126-134
1		Jean-Marc Lanlignel, Olivier Raynaud, Eric Thierry: Pruning Graphs with Digital Search Trees. Application to Distance Hereditary Graphs. STACS 2000: 529-541

Coauthor Index

1	Derek G. Corneil	[2] [3] [4]
2	Michel Habib	[2] [4]
3	Ekkehard Köhler	[3]
4	Olivier Raynaud	[1]
5	Bruce A. Reed	[2] [4]
6	Udi Rotics	[2] [4]
7	Eric Thierry	[1]

Last update Sun Jun 3 16:06:10 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page