Nombre de documents

25


Article dans une revue13 documents

  • Brice Effantin, Nicolas Gastineau, Olivier Togni. A characterization of b-chromatic and partial Grundy numbers by induced subgraphs. Discrete Mathematics, Elsevier, 2016, 339 (8). <hal-01157902v2>
  • Lyes Dekar, Brice Effantin, Hamamache Kheddouci. [r,s,t]-colorings of graph products. Graphs and Combinatorics, Springer Verlag, 2014, 30 (5), pp.1135-1147. <hal-01285320>
  • Brice Effantin, Hamamache Kheddouci, Hamida Seba. Distance edge coloring of the Kronecker product of some graphs. Utilitas Mathematica, 2014, 93, pp.179-192. <hal-01285321>
  • Saïd Yahiaoui, Mohammed Haddad, Brice Effantin, Hamamache Kheddouci. Coloring Based Approach for Matching Unrooted and/or Unordered Trees. Pattern Recognition Letters, Elsevier, 2013, 6, 34, pp.686-695. <10.1016/j.patrec.2013.01.017>. <hal-01339150>
  • Kaouther Drira, Hamida Seba, Brice Effantin, Hamamache Kheddouci. Distance edge coloring and collision-free communication in wireless sensor networks. Networks, 2013, 1, 62, pp.35-47. <10.1002/net.21491>. <hal-01339137>
  • Jean-Pierre Boutin, Eric Duchêne, Brice Effantin, Hamamache Kheddouci, Hamida Seba. New Results about Set Colorings of Graphs. Electronic Journal of Combinatorics, Electronic Journal of Combinatorics, 2010, 17, pp.R173. <hal-01285324>
  • L. Dekar, Brice Effantin, Hamamache Kheddouci. [r,s,t]-Coloring of Trees and Bipartite Graphs. Discrete Mathematics, Elsevier, 2009. <hal-00385490>
  • Brice Effantin, Hamamache Kheddouci. Discussion on the (partial) Grundy and b-chromatic numbers of graphs. Utilitas Mathematica, 2008. <hal-00267298>
  • Brice Effantin, Hamamache Kheddouci. Grundy number of graphs. Discussiones Mathematicae Graph Theory, University of Zielona Góra, 2007, 27 (1), pp.5-18. <hal-00174212>
  • Brice Effantin, Hamamache Kheddouci. Exact values for the b-chromatic number of a power complete k-ary tree. Journal of Discrete Mathematical Sciences and Cryptography, non, 2005, 8 (1), pp.117-129. <hal-00174210>
  • Brice Effantin. The b-chromatic number of power graphs of complete caterpillars. Journal of Discrete Mathematical Sciences and Cryptography, non, 2005, 8 (3), pp.483-502. <hal-00173577>
  • Brice Effantin, H. Kheddouci. Exact values for the b-chromatic number of a power complete k-ary tree. Journal of Discrete Mathematical Sciences and Cryptography, non, 2005, 8 (1), pp.117-129. <hal-00381210>
  • Brice Effantin, Hamamache Kheddouci. The b-chromatic number of power graphs. Discrete Mathematics and Theoretical Computer Science, DMTCS, 2003, 6 (1), pp.45-54. <hal-00958987>

Communication dans un congrès12 documents

  • Victor Lequay, Alexis Ringot, Mohammed Haddad, Brice Effantin, Hamamache Kheddouci. GraphExploiter: Creation, Visualization and Algorithms on graphs. IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, ASONAM 2015, Aug 2015, Paris, France. pp.765-767. <hal-01282644>
  • Khalid Benabdeslem, Brice Effantin, Haytham Elghazel. A Graph Enrichment Based Clustering over Vertically Partitioned Data. 7th International Conference on Advanced Data Mining and Applications (ADMA 2011), Dec 2011, Beijing, China. Advanced Data Mining and Applications 7th International Conference, ADMA 2011, Beijing, China, 7120 (1), pp.42-54, 2011, Lecture Notes in Artificial Intelligence. <hal-01285352>
  • Kaouther Drira, Hamida Seba, Brice Effantin, Hamamache Kheddouci. Distance-edge-coloring of power graphs. 8FCC'10, 2010, Paris, France. 2010. <hal-00490510>
  • Huang Sun, Brice Effantin, Hamamache Kheddouci. A Self-stabilizing Algorithm for the Minimum Color Sum of a Graph. 9th International Conference on Distributed Computing and Networking (ICDCN 2008), 2008, India. 4904, pp.209-214, 2008. <hal-00188342>
  • Shuang Liu, Brice Effantin, H. Kheddouci. A fully dynamic distributed algorithm for a b-coloring of graphs. The 2008 IEEE International Symposium on Advances in Parallel and Distributed Computing Techniques (APDCT-08), 2008, Sydney, Australia. 2008. <hal-00381213>
  • L. Dekar, Brice Effantin, H. Kheddouci. [r,s,t]-coloring of Trees and Bipartite graphs. British Combinatorial Conference 2007, BCC'2007, 2007, Reading, United Kingdom. pp.000, 2007. <hal-00192135>
  • L. Dekar, Brice Effantin, H. Kheddouci. An incremental distributed algorithm for a partial Grundy coloring of graphs. The Fifth International Symposium on Parallel and Distributed Processing and Applications (ISPA-07), 2007, Niagara Falls, Canada. 4742, pp.170-181, 2007. <hal-00192132>
  • L. Dekar, Brice Effantin, H. Kheddouci. An incremental distributed algorithm for a partial Grundy coloring of graphs. Colloque sur l'Optimisation et les systèmes d'Informations (COSI'07), 2007, Oran, Algeria. pp.000, 2007. <hal-00192137>
  • Brice Effantin, Hamamache Kheddouci. A Distributed Algorithm for a b-Coloring of a Graph. M Guo, LT Yang, B DiMartino, HP Zima, J Dongarra, F Tang. 4th International Symposium on Parallel and Distributed Processing and Applications, Dec 2006, Sorrento, Italy. 4330, pp.430-438, 2006. <hal-00171173>
  • Brice Effantin, Hamamache Kheddouci. Sum coloring of distance and circulant graphs. 7th International Colloquium on Graph Theory, 2005, Hyères, France. 22, pp.239-244, 2005. <hal-00174206>
  • Brice Effantin. Generation of Unordered Binary Trees. International Conference on Computational Science and its Applications 2004, 2004, Assisi, Italy. 3045, pp.648-655, 2004. <hal-00174198>
  • Brice Effantin. Generation of Valid Labeled Binary Trees. International Conference on Computational Science and its Applications 2003, 2003, Montréal, Canada. 2667, pp.245-253, 2003. <hal-00174194>