Hamamache Kheddouci

Saïd Yahiaoui, Yacine Belhoul, Mohammed Haddad, Hamamache Kheddouci: Self-stabilizing algorithms for minimal global powerful alliance sets in graphs. Inf. Process. Lett. 113(10-11): 365-370 (2013)

Riadh Khennoufa, Hamida Seba, Hamamache Kheddouci: Edge coloring total k-labeling of generalized Petersen graphs. Inf. Process. Lett. 113(13): 489-494 (2013)

Saïd Yahiaoui, Mohammed Haddad, Brice Effantin, Hamamache Kheddouci: Coloring based approach for matching unrooted and/or unordered trees. Pattern Recognition Letters 34(6): 686-695 (2013)

Jean-Luc Baril, Hamamache Kheddouci, Olivier Togni: Vertex Distinguishing Edge- and Total-Colorings of Cartesian and other Product Graphs. Ars Comb. 107: 109-127 (2012)

M. A. Tahraoui, Éric Duchêne, Hamamache Kheddouci: Gap vertex-distinguishing edge colorings of graphs. Discrete Mathematics 312(20): 3011-3025 (2012)

Hamida Seba, Sofiane Lagraa, Hamamache Kheddouci: Alliance-based clustering scheme for group key management in mobile ad hoc networks. The Journal of Supercomputing 61(3): 481-501 (2012)

Yacine Belhoul, Mohammed Haddad, Éric Duchêne, Hamamache Kheddouci: String Comparators Based Algorithms for Process Model Matchmaking. IEEE SCC 2012: 649-656

Saïd Yahiaoui, Yacine Belhoul, Nadia Nouali-Taboudjemat, Hamamache Kheddouci: AdSIP: Decentralized SIP for Mobile Ad Hoc Networks. AINA Workshops 2012: 490-495

Hocine Boumediene Merouane, Mohammed Haddad, Mustapha Chellali, Hamamache Kheddouci: Dominated Coloring of Graphs. CTW 2012: 189-192

Nassira Chekkai, Salim Chikhi, Hamamache Kheddouci: A weighted-graph based approach for solving the cold start problem in collaborative recommender systems. ISCC 2012: 759-764

Badreddine Benreguia, Hamamache Kheddouci: A consistency rule for graph isomorphism problem. SAC 2012: 906-911

Brahim Neggazi, Mohammed Haddad, Hamamache Kheddouci: Self-stabilizing Algorithm for Maximal Graph Partitioning into Triangles. SSS 2012: 31-42

Brahim Neggazi, Mohammed Haddad, Hamamache Kheddouci: Self-stabilizing algorithm for maximal graph decomposition into disjoint paths of fixed length. TADDS 2012: 15-19

Nassira Chekkai, Salim Chikhi, Hamamache Kheddouci: Nouvelle Approche à base de Graphes pour les Systèmes de Recommandation Collaboratifs. CIIA 2011

Nadia Battat, Hamamache Kheddouci: HMAN: Hierarchical Monitoring for Ad Hoc Network. EUC 2011: 414-419

Jacques M. Bahi, Mohammed Haddad, Mourad Hakem, Hamamache Kheddouci: Distributed Lifetime Optimization in Wireless Sensor Networks. HPCC 2011: 432-439

Sofiane Lagraa, Hamida Seba, Hamamache Kheddouci: Matchmaking OWL-S processes: an approach based on path signatures. MEDES 2011: 169-176

Slimane Lemmouchi, Mohammed Haddad, Hamamache Kheddouci: Study of robustness of community emerged from exchanges in networks communication. MEDES 2011: 189-196

Ahmed Gater, Daniela Grigori, Mohammed Haddad, Mokrane Bouzeghoub, Hamamache Kheddouci: A summary-based approach for enhancing process model matchmaking. SOCA 2011: 1-8

Sofiane Lagraa, Hamida Seba, Riadh Khennoufa, Hamamache Kheddouci: A Graph Decomposition Approach to Web Service Matchmaking. WEBIST 2011: 31-40

Hamida Seba, Sofiane Lagraa, Hamamache Kheddouci: Web Service Matchmaking by Subgraph Matching. WEBIST (Selected Papers) 2011: 43-56

J. P. Boutin, Éric Duchêne, Brice Effantin, Hamamache Kheddouci, Hamida Seba: New Results about Set Colorings of Graphs. Electr. J. Comb. 17(1) (2010)

Kaouther Drira, Hamida Seba, Hamamache Kheddouci: ECGK: An efficient clustering scheme for group key management in MANETs. Computer Communications 33(9): 1094-1107 (2010)

Lyes Dekar, Brice Effantin, Hamamache Kheddouci: [r, s, t]-coloring of trees and bipartite graphs. Discrete Mathematics 310(2): 260-269 (2010)

Nabil Guellati, Hamamache Kheddouci: A survey on self-stabilizing algorithms for independence, domination, coloring, and matching in graphs. J. Parallel Distrib. Comput. 70(4): 406-415 (2010)

Belkacem Serrour, Hamamache Kheddouci: Community Comparison in Communication Networks. ASONAM 2010: 393-394

Saïd Yahiaoui, Yacine Belhoul, Farid Faoudi, Hamamache Kheddouci: TopCoF: A Topology Control Framework for Wireless Ad Hoc Networks. MSN 2010: 222-225

Jacques M. Bahi, Mohammed Haddad, Mourad Hakem, Hamamache Kheddouci: A New Reliable and Self-Stabilizing Data Fusion Scheme in Unsafe Wireless Sensor Networks. PDCAT 2010: 87-93

Frederic Armetta, Mohammed Haddad, Salima Hassas, Hamamache Kheddouci: Self-Organized Routing for Unstructured Peer-to-Peer Networks. SASO 2010: 273-274

Mohammed Haddad, Hamamache Kheddouci: A strict strong coloring of trees. Inf. Process. Lett. 109(18): 1047-1054 (2009)

Haytham Elghazel, Khalid Benabdeslem, Hamamache Kheddouci: McSOM: Minimal Coloring of Self-Organizing Map. ADMA 2009: 128-139

Lyes Dekar, Hamamache Kheddouci: A Resource Discovery Scheme for Large Scale Ad Hoc Networks Using a Hypercube-Based Backbone. AINA 2009: 293-300

Hamida Seba, Fouad Tigrine, Hamamache Kheddouci: A tree-based group key agreement scheme for secure multicast increasing efficiency of rekeying in leave operation. ISCC 2009: 697-700

Slimane Lemmouchi, Mohammed Haddad, Hamamache Kheddouci: Robustness of emerged community in social network. MEDES 2009: 477-479

Kaouther Drira, Lyes Dekar, Hamamache Kheddouci: A Self-Stabilizing (delta+1)- Edge-Coloring Algorithm of Arbitrary Graphs. PDCAT 2009: 312-317

Lyes Dekar, Hamamache Kheddouci: A Self-Stabilizing Web Services Communities Management Scheme. SITIS 2009: 337-344

Lyes Dekar, Hamamache Kheddouci: A cluster based mobility prediction scheme for ad hoc networks. Ad Hoc Networks 6(2): 168-194 (2008)

Hamamache Kheddouci, Olivier Togni: Minimum Feedback Vertex Sets in Distance Graphs and Circulant Graphs. Discrete Mathematics & Theoretical Computer Science 10(1) (2008)

Haytham Elghazel, Hamamache Kheddouci, Véronique Deslandres, Alain Dussauchoy: A Graph b-coloring Framework for Data Clustering. J. Math. Model. Algorithms 7(4): 389-423 (2008)

Belkacem Serrour, Daniel P. Gasparotto, Hamamache Kheddouci, Boualem Benatallah: Message Correlation and Business Protocol Discovery in Service Interaction Logs. CAiSE 2008: 405-419

Huang Sun, Brice Effantin, Hamamache Kheddouci: A Self-stabilizing Algorithm for the Minimum Color Sum of a Graph. ICDCN 2008: 209-214

Lyes Dekar, Hamamache Kheddouci: A Graph b-Coloring Based Method for Composition-Oriented Web Services Classification. ISMIS 2008: 599-604

Shuang Liu, Brice Effantin, Hamamache Kheddouci: A Fully Dynamic Distributed Algorithm for a B-Coloring of Graphs. ISPA 2008: 657-662

Lyes Dekar, Hamamache Kheddouci: Distance-2 Self-stabilizing Algorithm for a b-Coloring of Graphs. SSS 2008: 19-31

Brice Effantin, Hamamache Kheddouci: Grundy number of graphs. Discussiones Mathematicae Graph Theory 27(1): 5-18 (2007)

Haytham Elghazel, Hamamache Kheddouci, Véronique Deslandres, Alain Dussauchoy: A Partially Dynamic Clustering Algorithm for Data Insertion and Removal. Discovery Science 2007: 78-90

Lyes Dekar, Brice Effantin, Hamamache Kheddouci: An Incremental Distributed Algorithm for a Partial Grundy Coloring of Graphs. ISPA 2007: 170-181

Salima Benbernou, Djamal Benslimane, Mohand-Said Hacid, Hamamache Kheddouci, Kamel Tari: A Graph-based Approach for Web Services Composition. WEBIST (1) 2007: 290-296

Haytham Elghazel, Mohand-Said Hacid, Hamamache Kheddouci, Alain Dussauchoy: A New Clustering Approach for Symbolic Data: Algorithms and Application to Healthcare Data. BDA 2006

Haytham Elghazel, Véronique Deslandres, Mohand-Said Hacid, Alain Dussauchoy, Hamamache Kheddouci: A New Clustering Approach for Symbolic Data and Its Validation: Application to the Healthcare Data. ISMIS 2006: 473-482

Brice Effantin, Hamamache Kheddouci: A Distributed Algorithm for a b-Coloring of a Graph. ISPA 2006: 430-438

Jean-Luc Baril, Hamamache Kheddouci, Olivier Togni: The irregularity strength of circulant graphs. Discrete Mathematics 304(1-3): 1-10 (2005)

Brice Effantin, Hamamache Kheddouci: Sum coloring of distance and circulant graphs. Electronic Notes in Discrete Mathematics 22: 239-244 (2005)

David Ménegaux, Dominique Faudot, Hamamache Kheddouci: Skeletizing 3D-Objects by Projections. ICCSA (3) 2004: 267-276

Hamamache Kheddouci: A note on the packing of two copies of some trees into their third power. Appl. Math. Lett. 16(7): 1115-1121 (2003)

Christian Germain, Hamamache Kheddouci: On the packing of two copies of a caterpillar in its third power. Discussiones Mathematicae Graph Theory 23(1): 105-115 (2003)

Brice Effantin, Hamamache Kheddouci: The b-chromatic number of power graphs. Discrete Mathematics & Theoretical Computer Science 6(1): 45-54 (2003)

Christian Germain, Hamamache Kheddouci: Grundy coloring for power graphs. Electronic Notes in Discrete Mathematics 15: 65-67 (2003)

Hamamache Kheddouci, Susan Marshall, Jean-François Saclé, Mariusz Wozniak: On the packing of three graphs. Discrete Mathematics 236(1-3): 197-225 (2001)

Hamamache Kheddouci: Remarks on Partially Square Graphs, Hamiltonicity and Circumference. Discussiones Mathematicae Graph Theory 21(2): 255-266 (2001)

Hamamache Kheddouci: On the packing of trees into their power. Electronic Notes in Discrete Mathematics 10: 157-159 (2001)

Hamamache Kheddouci, Jean-François Saclé, Mariusz Wozniak: Packing two copies of a tree into its fourth power. Discrete Mathematics 213(1-3): 169-178 (2000)

Hamamache Kheddouci: Partially Square Graphs, Hamiltonicity and Circumference II. Electronic Notes in Discrete Mathematics 5: 202-205 (2000)