 | 2011 |
| 11 |  | Mamadou Moustapha Kanté,
Michaël Rao:
\mathbb F\mathbb F-Rank-Width of (Edge-Colored) Graphs.
CAI 2011: 158-173 |
| 10 |  | Mamadou Moustapha Kanté,
Vincent Limouzy,
Arnaud Mary,
Lhouari Nourine:
Enumeration of Minimal Dominating Sets and Variants.
FCT 2011: 298-309 |
| 9 |  | Bruno Courcelle,
Cyril Gavoille,
Mamadou Moustapha Kanté:
Compact labelings for efficient first-order model-checking.
J. Comb. Optim. 21(1): 19-46 (2011) |
| 2009 |
| 8 |  | Mamadou Moustapha Kanté,
Michaël Rao:
Directed Rank-Width and Displit Decomposition.
WG 2009: 214-225 |
| 7 |  | Bruno Courcelle,
Mamadou Moustapha Kanté:
Graph operations characterizing rank-width.
Discrete Applied Mathematics 157(4): 627-640 (2009) |
| 2008 |
| 6 |  | Bruno Courcelle,
Cyril Gavoille,
Mamadou Moustapha Kanté:
Efficient First-Order Model-Checking Using Short Labels.
FAW 2008: 159-170 |
| 5 |  | Bruno Courcelle,
Cyril Gavoille,
Mamadou Moustapha Kanté:
Compact Labelings For Efficient First-Order Model-Checking
CoRR abs/0811.4713: (2008) |
| 4 |  | 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 |  | Bruno Courcelle,
Mamadou Moustapha Kanté:
Graph Operations Characterizing Rank-Width and Balanced Graph Expressions.
WG 2007: 66-75 |
| 2 |  | Mamadou Moustapha Kanté:
The rank-width of Directed Graphs
CoRR abs/0709.1433: (2007) |
| 1 |  | Mamadou Moustapha Kanté:
Vertex-minor reductions can simulate edge contractions.
Discrete Applied Mathematics 155(17): 2328-2340 (2007) |