Brice EFFANTIN
IUT Lyon 1, Département Informatique de Bourg-en-Bresse
Maître de conférences
E-mail: brice.effantin-dit-toussaint@iut.univ-lyon1.fr
Laboratoire d'accueil: LIRIS (Laboratoire d'InfoRmatique en Image et Système d'information)
Equipe: GOAL (Graphes algOrtihmes et AppLications)
Laboratoire LIRIS IUT de Lyon
Journaux internationaux
  1. B. Effantin, The b_q-coloring of graphs, Discrete Mathematics Letters, vol. 12, pp. 173-180 (2023)
  2. G. Bagan, Q. Deschamps, E. Duchêne, B. Durain, B. Effantin, V. Gledel, N. Oijid and A. Parreau, Incidence, a scoring positional game on graphs, Discrete Mathematics, 113570 (2023)
  3. A. Habi, B. Effantin and H. Kheddouci, Diversified top-k search with relaxed graph simulation, Social Network Analysis and Mining, vol. 9(1), article 55 (2019)
  4. C. Charpentier, B. Effantin and G. Paris, On the game coloring index of F+-decomposable graphs, Discrete Applied Mathematics, vol. 236, pp. 73-83 (2018)
  5. B. Effantin, A Note on Grundy colorings of central graphs, Australasian Journal of Combinatorics, vol. 68(3), pp. 346-356 (2017)
  6. B. Effantin, N. Gastineau and O. Togni, A characterization of b-chromatic and partial Grundy numbers by induced subgraphs, Discrete Mathematics, vol. 339(8), pp. 2157-2167 (2016)
  7. L. Dekar, B. Effantin and H. Kheddouci, [r,s,t]-colorings of graph products, Graphs and Combinatorics, vol. 30(5), pp. 1135-1147 (2014)
  8. B. Effantin, H. Kheddouci and H. Seba, Distance edge coloring of the Kronecker product of some graphs, Utilitas Mathematica, vol. 93, pp. 179-192 (2014)
  9. S. Yahiaoui, M. Haddad, B. Effantin and H. Kheddouci, Coloring Based Approach for Matching Unrooted and/or Unordered Trees, Pattern Recognition Letters, vol. 34, pp.686-695 (2013)
  10. K. Drira, H. Seba, B. Effantin and H. Kheddouci, Distance Edge Coloring and Collision-Free Communication in Wireless Sensor Networks, Networks, vol. 62(1), pp.35-47, doi: 10.1002/net.21491 (2013)
  11. J.-P. Boutin, E. Duchêne, B. Effantin, H. Kheddouci and H. Seba, New results about set colorings of graphs, Electronic Journal of Combinatorics, vol. 17(1), article R173 (2010)
  12. L. Dekar, B. Effantin and H. Kheddouci, [r,s,t]-Coloring of Trees and Bipartite Graphs, Discrete Mathematics, vol. 310, pp.260-269 (2010)
  13. B. Effantin, H. Kheddouci, Discussion on the (partial) Grundy and b-chromatic numbers of graphs, Utilitas Mathematica, vol. 80, pp.65-89 (2009)
  14. B. Effantin, H. Kheddouci, Grundy number of graphs, Discussiones Mathematicae Graph Theory, vol. 27(1), pp. 5-18 (2007)
  15. B. Effantin, The b-chromatic number of power graphs of complete caterpillars, Journal of Discrete Mathematical Sciences and Cryptography, vol. 8(3), pp. 483-502 (2005)
  16. B. Effantin, H. Kheddouci, Exact values for the b-chromatic number of a power complete k-ary tree, Journal of Discrete Mathematical Sciences and Cryptography, vol. 8(1), pp. 117-129 (2005)
  17. B. Effantin, H. Kheddouci, The b-chromatic number of some power graphs, Discrete Mathematics and Theoretical Computer Science 6(1), pp.45-54 (2003)

Conférences internationales
  1. A. Habi, B. Effantin and H. Kheddouci, Fast top-k search with relaxed graph simulation, the 2018 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, Barcelona (Spain) (2018).
  2. A. Habi, B. Effantin and H. Kheddouci, Search and Aggregation in XML Documents, 28th International Conference on Database and Expert Systems Applications - DEXA 2017, Lecture Notes in Computer Science, vol. 10438(1), pp.290-304 (2017)
  3. V. Lequay, A. Ringot, M. Haddad, B. Effantin and H. Kheddouci, GraphExploiter: Creation, Visualization and Algorithms on graphs, 2015 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, pp. 765-767 (2015)
  4. N. Gastineau, O. Togni and B. Effantin, On parameterized complexity to determine b-chromatic and partial Grundy numbers, Bordeaux Graph Workshop (BGW) (2014)
  5. K. Benabdeslem, B. Effantin and H. Elghazel, A graph enrichment based clustering over vertically partitioned data, 7th International Conference on Advanced Data Mining and Applications (ADMA 2011), Lecture Notes in Artificial Intelligence, vol. 7120 (Part I), pp. 42-54 (2011)
  6. K. Drira, H. Seba, B. Effantin and H. Kheddouci, Distance edge coloring of power graphs, Proceedings of the 8th French Combinatorial Conference (8FCC'10) (2010)
  7. S. Liu, B. Effantin and 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, Sydney, Australia), IEEE CS, ISBN 978-0-7695-3471-8, pp. 657-662 (2008)
  8. H. Sun, B. Effantin and H. Kheddouci, A Self-stabilizing Algorithm for the Minimum Color Sum of a Graph, 9th International Conference on Distributed Computing and Networking (ICDCN 2008, Kolkata, India), Lecture Notes in Computer Science, vol.4904, pp.209-214 (2008)
  9. L. Dekar, B. Effantin et H. Kheddouci, An incremental distributed algorithm for a partial Grund coloring of graphs, The fifth International Symposium on Parallel and Distributed Processing and Applications (ISPA 2007, Niagara Falls, Canada), Lecture Notes in Computer Science, vol.4742, pp. 170-181 (2007)
  10. L. Dekar, B. Effantin and H. Kheddouci, [r,s,t]-coloring of Trees and Bipartite graphs, Proceedings of the 21st British Combinatorial Conference (BCC 2007), University of Reading, England
  11. B. Effantin, H. Kheddouci, A Distributed Algorithm for a b-Coloring of a Graph, International Symposium on Parallel and Distributed Processing and Applications (ISPA 2006, Naples, Italie), Lecture Notes in Computer Science, vol.4330, pp.430-438 (2006)
  12. B. Effantin, H. Kheddouci, Sum coloring of distance and circulant graphs, 7th International Colloquium on Graph Theory, France (Hyères) (2005), Electronic Notes in Discrete Mathematics, vol.22, pp. 239-244 (2005)
  13. B. Effantin, Generation of Unordered Binary Trees, International Conference on Computational Science and its Applications (ICCSA 2004), Italy (Assisi), Lecture Notes in Computer Science, vol.3045, pp.648-655 (2004)
  14. B. Effantin, Generation of Valid Labeled Binary Trees, International Conference on Computational Science and its Applications (ICCSA 2003), Canada (Monréal), Lecture Notes in Computer Science, vol.2667, pp.245-253 (2003)
Conférences nationales, Workshops, Rapports de recherche
  • A. Habi, B. Effantin and H. Kheddouci, La simulation relaxée de graphes pour la recherche de motifs, Extraction et Gestion des connaissances, EGC 2019, Metz, France, January 21-25, 2019, 2019, pp. 401–406 (2019)
  • L. Dekar, B. Effantin et H. Kheddouci, An incremental distributed algorithm for a partial Grund coloring of graphs, Colloque sur l'Optimisation et les Systèmes d'Information (COSI'07), Algeria (Oran) (2007)
  • B. Effantin, Extraction of Web communities, workshop COMBSTRU, Italie (Venise) (2004)
  • B. Effantin, The b-chromatic number of some power graphs, workshop COMBSTRU, France (Bordeaux) (2004)
  • B. Effantin, Génération d'arbres binaires étiquetés, Journées Graphes et Algorithmes, France (Dijon) (2003)
  • B. Effantin, Le nombre b-chromatique pour les graphes puissances, Journées Graphes et Algorithmes, France (Nantes) (2002)