Brice Effantin

According to our database, Brice Effantin authored at least 23 papers between 2003 and 2019.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2019

Diversified top-k search with relaxed graph simulation.

Abdelmalek Habi, Brice Effantin, Hamamache Kheddouci

Soc. Netw. Anal. Min., 2019

La simulation relaxée de graphes pour la recherche de motifs.

Abdelmalek Habi, Brice Effantin, Hamamache Kheddouci

Proceedings of the Extraction et Gestion des connaissances, 2019

2018

On the game coloring index of -decomposable graphs.

Clément Charpentier, Brice Effantin, Gabriela Paris

Discret. Appl. Math., 2018

Fast Top-k Search with Relaxed Graph Simulation.

Abdelmalek Habi, Brice Effantin, Hamamache Kheddouci

Proceedings of the IEEE/ACM 2018 International Conference on Advances in Social Networks Analysis and Mining, 2018

2017

A note on Grundy colorings of central graphs.

Brice Effantin

Australas. J Comb., 2017

Search and Aggregation in XML Documents.

Abdelmalek Habi, Brice Effantin, Hamamache Kheddouci

Proceedings of the Database and Expert Systems Applications, 2017

2016

A characterization of b-chromatic and partial Grundy numbers by induced subgraphs.

Brice Effantin, Nicolas Gastineau, Olivier Togni

Discret. Math., 2016

2015

GraphExploiter: Creation, Visualization and Algorithms on graphs.

Victor Lequay, Alexis Ringot, Mohammed Haddad, Brice Effantin, Hamamache Kheddouci

Proceedings of the 2015 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, 2015

2014

[r, s, t]-Colorings of Graph Products.

Lyes Dekar, Brice Effantin, Hamamache Kheddouci

Graphs Comb., 2014

2013

Coloring based approach for matching unrooted and/or unordered trees.

Saïd Yahiaoui, Mohammed Haddad, Brice Effantin, Hamamache Kheddouci

Pattern Recognit. Lett., 2013

Distance edge coloring and collision-free communication in wireless sensor networks.

Kaouther Drira, Hamida Seba, Brice Effantin, Hamamache Kheddouci

Networks, 2013

2011

A Graph Enrichment Based Clustering over Vertically Partitioned Data.

Khalid Benabdeslem, Brice Effantin, Haytham Elghazel

Proceedings of the Advanced Data Mining and Applications - 7th International Conference, 2011

2010

[r, s, t]-coloring of trees and bipartite graphs.

Lyes Dekar, Brice Effantin, Hamamache Kheddouci

Discret. Math., 2010

New Results about Set Colorings of Graphs.

J. P. Boutin, Éric Duchêne, Brice Effantin, Hamamache Kheddouci, Hamida Seba

Electron. J. Comb., 2010

2008

A Fully Dynamic Distributed Algorithm for a B-Coloring of Graphs.

Shuang Liu, Brice Effantin, Hamamache Kheddouci

Proceedings of the IEEE International Symposium on Parallel and Distributed Processing with Applications, 2008

A Self-stabilizing Algorithm for the Minimum Color Sum of a Graph.

Huang Sun, Brice Effantin, Hamamache Kheddouci

Proceedings of the Distributed Computing and Networking, 9th International Conference, 2008

2007

Grundy number of graphs.

Brice Effantin, Hamamache Kheddouci

Discuss. Math. Graph Theory, 2007

An Incremental Distributed Algorithm for a Partial Grundy Coloring of Graphs.

Lyes Dekar, Brice Effantin, Hamamache Kheddouci

Proceedings of the Parallel and Distributed Processing and Applications, 2007

2006

A Distributed Algorithm for a b-Coloring of a Graph.

Brice Effantin, Hamamache Kheddouci

Proceedings of the Parallel and Distributed Processing and Applications, 2006

2005

Sum coloring of distance and circulant graphs.

Brice Effantin, Hamamache Kheddouci

Electron. Notes Discret. Math., 2005

2004

Generation of Unordered Binary Trees.

Brice Effantin

Proceedings of the Computational Science and Its Applications, 2004

2003

The b-chromatic number of power graphs.

Brice Effantin, Hamamache Kheddouci

Discret. Math. Theor. Comput. Sci., 2003

Generation of Valid Labeled Binary Trees.

Brice Effantin

Proceedings of the Computational Science and Its Applications, 2003