 | 2011 |
| 12 |  | Khalid Benabdeslem,
Brice Effantin,
Haytham Elghazel:
A Graph Enrichment Based Clustering over Vertically Partitioned Data.
ADMA (1) 2011: 42-54 |
| 2010 |
| 11 |  | Lyes Dekar,
Brice Effantin,
Hamamache Kheddouci:
[r, s, t]-coloring of trees and bipartite graphs.
Discrete Mathematics 310(2): 260-269 (2010) |
| 10 |  | J. P. Boutin,
E. Duchêne,
Brice Effantin,
Hamamache Kheddouci,
Hamida Seba:
New Results about Set Colorings of Graphs.
Electr. J. Comb. 17(1): (2010) |
| 2008 |
| 9 |  | Huang Sun,
Brice Effantin,
Hamamache Kheddouci:
A Self-stabilizing Algorithm for the Minimum Color Sum of a Graph.
ICDCN 2008: 209-214 |
| 8 |  | Shuang Liu,
Brice Effantin,
Hamamache Kheddouci:
A Fully Dynamic Distributed Algorithm for a B-Coloring of Graphs.
ISPA 2008: 657-662 |
| 2007 |
| 7 |  | Lyes Dekar,
Brice Effantin,
Hamamache Kheddouci:
An Incremental Distributed Algorithm for a Partial Grundy Coloring of Graphs.
ISPA 2007: 170-181 |
| 6 |  | Brice Effantin,
Hamamache Kheddouci:
Grundy number of graphs.
Discussiones Mathematicae Graph Theory 27(1): 5-18 (2007) |
| 2006 |
| 5 |  | Brice Effantin,
Hamamache Kheddouci:
A Distributed Algorithm for a b-Coloring of a Graph.
ISPA 2006: 430-438 |
| 2005 |
| 4 |  | Brice Effantin,
Hamamache Kheddouci:
Sum coloring of distance and circulant graphs.
Electronic Notes in Discrete Mathematics 22: 239-244 (2005) |
| 2004 |
| 3 |  | Brice Effantin:
Generation of Unordered Binary Trees.
ICCSA (3) 2004: 648-655 |
| 2003 |
| 2 |  | Brice Effantin:
Generation of Valid Labeled Binary Trees.
ICCSA (1) 2003: 245-253 |
| 1 |  | Brice Effantin,
Hamamache Kheddouci:
The b-chromatic number of power graphs.
Discrete Mathematics & Theoretical Computer Science 6(1): 45-54 (2003) |