The SCEAS System
| |||||||

## Search the dblp DataBase
Hamamache Kheddouci:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Haytham Elghazel, Mohand-Said Hacid, Hamamache Kheddouci, Alain Dussauchoy
**A New Clustering Approach for Symbolic Data: Algorithms and Application to Healthcare Data.**[Citation Graph (0, 0)][DBLP] BDA, 2006, pp:- [Conf] - David Ménegaux, Dominique Faudot, Hamamache Kheddouci
**Skeletizing 3D-Objects by Projections.**[Citation Graph (0, 0)][DBLP] ICCSA (3), 2004, pp:267-276 [Conf] - 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.**[Citation Graph (0, 0)][DBLP] ISMIS, 2006, pp:473-482 [Conf] - Brice Effantin, Hamamache Kheddouci
**A Distributed Algorithm for a b-Coloring of a Graph.**[Citation Graph (0, 0)][DBLP] ISPA, 2006, pp:430-438 [Conf] - Hamamache Kheddouci
**A note on the packing of two copies of some trees into their third power.**[Citation Graph (0, 0)][DBLP] Appl. Math. Lett., 2003, v:16, n:7, pp:1115-1121 [Journal] - Jean-Luc Baril, Hamamache Kheddouci, Olivier Togni
**The irregularity strength of circulant graphs.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2005, v:304, n:1-3, pp:1-10 [Journal] - Hamamache Kheddouci, Susan Marshall, Jean-François Saclé, Mariusz Wozniak
**On the packing of three graphs.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2001, v:236, n:1-3, pp:197-225 [Journal] - Hamamache Kheddouci, Jean-François Saclé, Mariusz Wozniak
**Packing two copies of a tree into its fourth power.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2000, v:213, n:1-3, pp:169-178 [Journal] - Brice Effantin, Hamamache Kheddouci
**The b-chromatic number of power graphs.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics & Theoretical Computer Science, 2003, v:6, n:1, pp:45-54 [Journal] - Haytham Elghazel, Hamamache Kheddouci, Véronique Deslandres, Alain Dussauchoy
**A Partially Dynamic Clustering Algorithm for Data Insertion and Removal.**[Citation Graph (0, 0)][DBLP] Discovery Science, 2007, pp:78-90 [Conf] - Lyes Dekar, Brice Effantin, Hamamache Kheddouci
**An Incremental Distributed Algorithm for a Partial Grundy Coloring of Graphs.**[Citation Graph (0, 0)][DBLP] ISPA, 2007, pp:170-181 [Conf] **McSOM: Minimal Coloring of Self-Organizing Map.**[Citation Graph (, )][DBLP]**A Resource Discovery Scheme for Large Scale Ad Hoc Networks Using a Hypercube-Based Backbone.**[Citation Graph (, )][DBLP]**Message Correlation and Business Protocol Discovery in Service Interaction Logs.**[Citation Graph (, )][DBLP]**A tree-based group key agreement scheme for secure multicast increasing efficiency of rekeying in leave operation.**[Citation Graph (, )][DBLP]**A Graph b-Coloring Based Method for Composition-Oriented Web Services Classification.**[Citation Graph (, )][DBLP]**A Fully Dynamic Distributed Algorithm for a B-Coloring of Graphs.**[Citation Graph (, )][DBLP]**A Self-Stabilizing (delta+1)- Edge-Coloring Algorithm of Arbitrary Graphs.**[Citation Graph (, )][DBLP]**Distance-2 Self-stabilizing Algorithm for a b-Coloring of Graphs.**[Citation Graph (, )][DBLP]**A Self-stabilizing Algorithm for the Minimum Color Sum of a Graph.**[Citation Graph (, )][DBLP]**Robustness of emerged community in social network.**[Citation Graph (, )][DBLP]**Community Comparison in Communication Networks.**[Citation Graph (, )][DBLP]**A cluster based mobility prediction scheme for ad hoc networks.**[Citation Graph (, )][DBLP]**ECGK: An efficient clustering scheme for group key management in MANETs.**[Citation Graph (, )][DBLP]**[r, s, t]-coloring of trees and bipartite graphs.**[Citation Graph (, )][DBLP]**Minimum Feedback Vertex Sets in Distance Graphs and Circulant Graphs.**[Citation Graph (, )][DBLP]
Search in 0.667secs, Finished in 0.669secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |