Home    Publications    Resume
                                                                                                                
 International Journals
  1. Decomposition of complete multigraphs into stars and cycles. With F. Beggas and H. Kheddouci, Discussiones Mathematicae Graph Theory, 2015 (to appear).
  2. Dominated colorings of graphs. With H. B. Merouane, M. Chellali and H. Kheddouci, Graphs and Combinatorics, 2014 (to appear). link.
  3. Efficient Distributed Lifetime Optimization Algorithm for Sensor Networks. With J.M. Bahi, M. Hakem and H. Kheddouci, Ad Hoc Networks Journal, 16: 1-12, 2014. link.
  4. A Self-organized System Improving Inner Topology for Data Sharing Efficiency. With F. Armetta S. Hassas and H. Kheddouci, Evolving Systems, Springer, 5(2): 109-119, 2014. link.
  5. Self-Stabilizing Consensus Average Algorithm in Distributed Sensor Networks. With J. M. Bahi, M. Hakem and H. Kheddouci, Transactions on Large-Scale Data and Knowledge-Centered Systems IX, 7980, pp 28-41, Springer, 2013. link
  6. Robustness Study of Emerged Communities from Exchanges in Peer-to-peer Networks. With  S. Lemmouchi and H. Kheddouci. Computer Communications 36(10-11):1145-1158, Elsevier, 2013. link
  7. Self-stabilizing Algorithms for Minimal Global Powerful Alliance Sets in Graphs. With  S. Yahiaoui, Y. Belhoul and H. Kheddouci. Information Processing Letters 113(10-11):365-370, Elsevier, 2013. link
  8. Coloring Based Approach for Matching Unrooted and/or Unordered Trees. With S. Yahiaoui, B. Effantin and H. Kheddouci. Pattern Recognition Letters 34(6):686-695, Elsevier, 2013. link
  9. A Strict Strong Coloring of Trees. With H. Kheddouci. Information Processing Letters 109(18): 1047-1054, Elsevier, 2009. link
  10. A Survey on Graph Based Service Discovery Approaches for Ad hoc Networks. With H. Kheddouci. International Transactions on Systems Science and Applications 4(2):145-152, SIWN, 2008. (Printed issue only) link, scan
 International Conferences and Workshops
  1. A Self-stabilizing Algorithm for Edge Monitoring ProblemWith B. Neggazi, V. Turau and H. Kheddouci, 16th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2014), September 28 - October 1, 2014Paderborn, Germany. link
  2. A Self-stabilizing Algorithm for Maximal p-Star Decomposition of General Graphs. With B. Neggazi, V. Turau and H. Kheddouci, 15th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2013), 13-16 November 2013, Osaka, Japan. link
  3. Spectral graph approach for process model matchmaking, With Y. Belhoul, A. Gater, D. Grigori, H. Kheddouci and M. Bouzeghoub, IEEE Tenth International Conference on Services Computing (IEEE SCC) June 27-July 2, 2013, Santa Clara (Center of Silicon Valley), CA, USA. link
  4. Stabilization and Lifetime Optimization in Distributed Sensor Networks, With J. M. Bahi,  M. Hakem and H. Kheddouci, Workshops of the 26th IEEE International Conference on  Advanced Information Networking and Applications (WAINA-2013), 25-28 March 2013, Barcelona, Spain. link
  5. Self-stabilizing Algorithm for Maximal Graph Partitioning into Triangles. With B. Neggazi and H. Kheddouci, 14th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2012), 1-4 October 2012, Toronto, Canada. link
  6. String Comparators Based Algorithms for Process Model Matchmaking. With Y. Belhoul, E. Duchêne and H. Kheddouci, IEEE Ninth International Conference on Services Computing (IEEE SCC) 24-29 June 2012, Honolulu, HI, USA. link
  7. Self-stabilizing Algorithm for Maximal Graph Decomposition into Disjoint Paths of Fixed Length. With B. Neggazi and H. Kheddouci, 4th Workshop on Theoretical Aspects of Dynamic Distributed Systems (TADDS 2012), 17th December 2012, Rome, Italy. link
  8. Dominated coloring of graphs. With H. B.  Merouane, M. Chellali and H. Kheddouci, 11th Cologne-Twente Workshop on Graphs & Combinatorial Optimization, Universitat der Bundeswehr Munchen, 29-31 May, 2012, Neubiberg, Germany. link.
  9. A Self-organized System Improving Inner Topology for Data Sharing Efficiency. With F. Armetta S. Hassas and H. Kheddouci, IEEE Conference on Evolving and Adaptive Intelligent Systems (EAIS), 17-18 May 2012, Madrid, Spain. link
  10. Distributed Lifetime Optimization in Wireless Sensor Networks. With J. M. Bahi,  M. Hakem and H. Kheddouci, IEEE 13th International Conference on High Performance Computing and Communications (HPCC), 2-4 September 2011, banff, Canada. link
  11. Study of Robustness of Community Emerged from Exchanges in Networks Communication. With S. Lemmouchi and H. Kheddouci, The International Conference on Management of Emergent Digital EcoSystems (MEDES), 21-23 November 2011, San-Francisco, USA. link
  12. A Summary-based Approach for Enhancing Process Model Matchmaking. With A. Gater, D. Grigori, M. Bouzeghoub and H. Kheddouci, The IEEE International Conference on Service Oriented Computing & Applications (SOCA 2011), 12-14 December 2011, University of California, Irvine, USA. link
  13. A New Reliable and Self-Stabilizing Data Fusion Scheme in Unsafe Wireless Sensor Networks. With J. M. Bahi, Mourad Hakem and H. Kheddouci, International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT 2010), 8-11 December, 2010, Wuhan, China. link
  14. Self-Organized Routing for Unstructured Peer-to-Peer Networks. With F. Armetta, Salima Hassas and H. Kheddouci, Fourth IEEE International Conference on Self-Adaptive and Self-Organizing Systems (IEEE SASO), 27 September -1 October 2010, Budapest, Hungary. link
  15. Robustness of Emerged Community in Social Networks. With S. Lemmouchi and H. Kheddouci, International ACM Conference on Management of Emergent Digital EcoSystems (MEDES'09), 27-30 October 2009, Lyon, France. link
  16. A Graph Coloring Based Service Discovery in Ad hoc Networks. With H. Kheddouci, ACM 3rd workshop on Agent-oriented software engineering challenges for ubiquitous and pervasive computing (ICPS-AUPC'09), 13-17 July 2009, Imperial College, London, UK. link
  17. A Distributed Strict Strong Coloring Algorithm for Broadcast Applications in Ad hoc Networks. With L. Dekar and H. Kheddouci, 8th annual international conference on New Technologies of Distributed Systems NOTERE'2008, 23-27 June 2008, Lyon, France. link
  18. Graph Based Approaches for Services Oriented pplication in Ad hoc Networks. With H. Kheddouci, IEEE International Conference on Pervasive Services (IEEE ICPS'07), 15-20 July 2007, Istanbul, Turkey. link
  19. Service Discovery in Ad hoc Networks. With H. Kheddouci, International Conference on Late Advances in Networks (ICLAN'2006), 06-08 December 2006, Paris, France. (Printed proceedings only) PDF, Conf.
 Abstracts
  • On (total) domination in graph colorings. With H. Kheddouci, 8th Franch Combinatorial Conference 2010, June 28 - July 2, 2010, University of Paris Sud, France.
  • An asymptotic approximation scheme for strict strong coloring of graphs. With H. Kheddouci, 22nd British Combinatorial Conference 2009, July 5-10, 2009, University of St Andrews, Scotland.
 French Speaking Conferences
  • Une approche de solution au problème d'exclusion mutuelle dans les réseaux mobiles ad hoc. Avec M. Benchaiba, The 8th International Symposium on Programming and Systems (ISPS'2007). 5-7 Mai 2007, Alger.
  • Découverte de services dans les réseaux ad hoc. Avec H. Kheddouci, Huitièmes rencontres francophones sur les aspects algorithmiques de télécommunications (Algotel 2006), 9-12 Mai 2006, Trégastel.
  • Vers une solution au problème d'exclusion mutuelle dans les réseaux mobiles ad hoc. Avec M. Benchaiba et M. Ahmed-Nacer, Septième Colloque francophone sur la Gestion de Réseaux et de Services (GRES 2006), 9-12 Mai 2006, Bordeaux.
  • Topologie virtuelle pour la découverte de service dans les réseaux ad hoc. Avec H. Kheddouci, Colloque sur l'Optimisation et les systèmes d'Informations (COSI'06). 2006, Alger.
  • Sur résumé:
    • Un algorithme distribué de coloration forte stricte pour la diffusion dans les réseaux ad hoc, Journées ResCom 2008, Strasbourg.
    • Un algorithme exact pour la coloration forte stricte des arbres, Journées Graphes et Algorithmes, JGA 2008, Sophia-Antipolis.
    • Coloration Forte Stricte des Graphes, Journées Graphes et Algorithmes, JGA 2007, Paris.