Number of documents

30


Journal articles15 documents

  • Clément Charpentier, Brice Effantin, Gabrielle Paris. On the game coloring index of F+-decomposable graphs. Discrete Applied Mathematics, Elsevier, 2018, 236, pp.73-83. ⟨hal-01883462⟩
  • Brice Effantin. A note on Grundy colorings of central graphs. The Australasian Journal of Combinatorics, Combinatorial Mathematics Society of Australasia (Inc.), 2017, 68 (3), pp.346-356. ⟨https://ajc.maths.uq.edu.au/pdf/68/ajc_v68_p346.pdf⟩. ⟨hal-01528755⟩
  • Brice Effantin, Nicolas Gastineau, Olivier Togni. A characterization of b-chromatic and partial Grundy numbers by induced subgraphs. Discrete Mathematics, Elsevier, 2016, 339 (8), pp.2157 - 2167. ⟨10.1016/j.disc.2016.03.011⟩. ⟨hal-01157902v2⟩
  • 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⟩
  • 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⟩
  • 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⟩
  • 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⟩
  • Jean-Pierre Boutin, Eric Duchêne, Brice Effantin, Hamamache Kheddouci, Hamida Seba. New Results about Set Colorings of Graphs. The Electronic Journal of Combinatorics, Open Journal Systems, 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. 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. 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, Hamamache Kheddouci. The b-chromatic number of power graphs. Discrete Mathematics and Theoretical Computer Science, DMTCS, 2003, 6 (1), pp.45-54. ⟨hal-00958987⟩

Conference papers15 documents

  • Abdelmalek Habi, Brice Effantin, Hamamache Kheddouci. Fast top-k search with relaxed graph simulation. The 2018 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, Aug 2018, Barcelona, Spain. ⟨hal-01887427⟩
  • Abdelmalek Habi, Brice Effantin, Hamamache Kheddouci. Search and Aggregation in XML Documents. 28th International Conference on Database and Expert Systems Applications, Aug 2017, Lyon, France. pp.290-304. ⟨hal-01590605⟩
  • 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⟩
  • Nicolas Gastineau, Olivier Togni, Brice Effantin. On parameterized complexity to determine b-chromatic and partial Grundy numbers. Bordeaux Graph Workshop 2014, Nov 2014, Bordeaux, France. ⟨hal-02174532⟩
  • 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. pp.42-54, ⟨10.1007/978-3-642-25853-4_4⟩. ⟨hal-01285352⟩
  • Kaouther Drira, Hamida Seba, Brice Effantin, Hamamache Kheddouci. Distance-edge-coloring of power graphs. 8FCC'10, 2010, Paris, France. ⟨hal-00490510⟩
  • 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. ⟨hal-00381213⟩
  • 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. pp.209-214. ⟨hal-00188342⟩
  • 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. ⟨hal-00192137⟩
  • 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. ⟨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. pp.170-181. ⟨hal-00192132⟩
  • Brice Effantin, Hamamache Kheddouci. A Distributed Algorithm for a b-Coloring of a Graph. 4th International Symposium on Parallel and Distributed Processing and Applications, Dec 2006, Sorrento, Italy. pp.430-438. ⟨hal-00171173⟩
  • Brice Effantin, Hamamache Kheddouci. Sum coloring of distance and circulant graphs. 7th International Colloquium on Graph Theory, 2005, Hyères, France. pp.239-244. ⟨hal-00174206⟩
  • Brice Effantin. Generation of Unordered Binary Trees. International Conference on Computational Science and its Applications 2004, 2004, Assisi, Italy. pp.648-655. ⟨hal-00174198⟩
  • Brice Effantin. Generation of Valid Labeled Binary Trees. International Conference on Computational Science and its Applications 2003, 2003, Montréal, Canada. pp.245-253. ⟨hal-00174194⟩