Generation of Valid Labeled Binary Trees. - Brice Effantin (ICCSA (1), 2003)

The b-chromatic number of power graphs. - Brice Effantin; Hamamache Kheddouci (Discret. Math. Theor. Comput. Sci., 2003)

Generation of Unordered Binary Trees. - Brice Effantin (ICCSA (3), 2004)

Sum coloring of distance and circulant graphs. - Brice Effantin; Hamamache Kheddouci (Electron. Notes Discret. Math., 2005)

A Distributed Algorithm for a b-Coloring of a Graph. - Brice Effantin; Hamamache Kheddouci (ISPA, 2006)

An Incremental Distributed Algorithm for a Partial Grundy Coloring of Graphs. - Lyes Dekar; Brice Effantin; Hamamache Kheddouci (ISPA, 2007)

Grundy number of graphs. - Brice Effantin; Hamamache Kheddouci (Discuss. Math. Graph Theory, 2007)

A Self-stabilizing Algorithm for the Minimum Color Sum of a Graph. - Huang Sun; Brice Effantin; Hamamache Kheddouci (ICDCN, 2008)

A Fully Dynamic Distributed Algorithm for a B-Coloring of Graphs. - Shuang Liu; Brice Effantin; Hamamache Kheddouci (ISPA, 2008)

New Results about Set Colorings of Graphs. - J. P. Boutin; Éric Duchêne; Brice Effantin; Hamamache Kheddouci; Hamida Seba (Electron. J. Comb., 2010)

[r, s, t]-coloring of trees and bipartite graphs. - Lyes Dekar; Brice Effantin; Hamamache Kheddouci (Discret. Math., 2010)

A Graph Enrichment Based Clustering over Vertically Partitioned Data. - Khalid Benabdeslem; Brice Effantin; Haytham Elghazel (ADMA (1), 2011)

Distance edge coloring and collision-free communication in wireless sensor networks. - Kaouther Drira; Hamida Seba; Brice Effantin; Hamamache Kheddouci (Networks, 2013)

Coloring based approach for matching unrooted and/or unordered trees. - Saïd Yahiaoui; Mohammed Haddad 001; Brice Effantin; Hamamache Kheddouci (Pattern Recognit. Lett., 2013)

[r, s, t]-Colorings of Graph Products. - Lyes Dekar; Brice Effantin; Hamamache Kheddouci (Graphs Comb., 2014)

GraphExploiter: Creation, Visualization and Algorithms on graphs. - Victor Lequay; Alexis Ringot; Mohammed Haddad 001; Brice Effantin; Hamamache Kheddouci (ASONAM, 2015)

A characterization of b-chromatic and partial Grundy numbers by induced subgraphs. - Brice Effantin; Nicolas Gastineau; Olivier Togni (Discret. Math., 2016)

Search and Aggregation in XML Documents. - Abdelmalek Habi; Brice Effantin; Hamamache Kheddouci (DEXA (1), 2017)

A note on Grundy colorings of central graphs. - Brice Effantin (Australas. J Comb., 2017)

Fast Top-k Search with Relaxed Graph Simulation. - Abdelmalek Habi; Brice Effantin; Hamamache Kheddouci (ASONAM, 2018)

On the game coloring index of -decomposable graphs. - Clément Charpentier; Brice Effantin; Gabriela Paris (Discret. Appl. Math., 2018)

La simulation relaxée de graphes pour la recherche de motifs. - Abdelmalek Habi; Brice Effantin; Hamamache Kheddouci (EGC, 2019)

Diversified top-k search with relaxed graph simulation. - Abdelmalek Habi; Brice Effantin; Hamamache Kheddouci (Soc. Netw. Anal. Min., 2019)