| |
| * | 2009 | |
|---|---|---|
| 7 | EE | Bruno Courcelle, Mamadou Moustapha Kanté: Graph operations characterizing rank-width. Discrete Applied Mathematics 157(4): 627-640 (2009) |
| 2008 | ||
| 6 | EE | Bruno Courcelle, Cyril Gavoille, Mamadou Moustapha Kanté: Efficient First-Order Model-Checking Using Short Labels. FAW 2008: 159-170 |
| 5 | EE | Bruno Courcelle, Cyril Gavoille, Mamadou Moustapha Kanté: Compact Labelings For Efficient First-Order Model-Checking CoRR abs/0811.4713: (2008) |
| 4 | EE | Bruno Courcelle, Cyril Gavoille, Mamadou Moustapha Kanté, Andrew Twigg: Connectivity check in 3-connected planar graphs with obstacles. Electronic Notes in Discrete Mathematics 31: 151-155 (2008) |
| 2007 | ||
| 3 | EE | Bruno Courcelle, Mamadou Moustapha Kanté: Graph Operations Characterizing Rank-Width and Balanced Graph Expressions. WG 2007: 66-75 |
| 2 | EE | Mamadou Moustapha Kanté: The rank-width of Directed Graphs CoRR abs/0709.1433: (2007) |
| 1 | EE | Mamadou Moustapha Kanté: Vertex-minor reductions can simulate edge contractions. Discrete Applied Mathematics 155(17): 2328-2340 (2007) |
| 1 | Bruno Courcelle | [3] [4] [5] [6] [7] |
| 2 | Cyril Gavoille | [4] [5] [6] |
| 3 | Andrew Twigg | [4] |