Publications
|
2010 |
International
Journals
7 - J-L. Baril, H. Kheddouci and O. Togni, Vertex distinguishing edge- and total-colorings
of cartesian and other
product graphs, Ars Combinatoria
(To appear).
6 - L. Dekar, B.Effantin and H. Kheddouci, [r,s,t]-Coloring
of Trees and Bipartite Graphs, Discrete
Mathematics, vol. 310, Pages 260-269, 2010.
5 - K. Drira,
H. Seba and H. Kheddouci, ECGK: an Efficient Clustering
Scheme for Group Key Management in MANETs, Computer Communications 33 (9),
pages 1094-1107 (2010).
4 - E. Duchêne,
A.S. Fraenkel, R.J. Nowakowski
and M. Rigo, Extensions
and restrictions of Wyhtoffs game preserving Wythoffs P-positions , Journal of Combinatorial
Theory series A., vol. 117, 545-567, 2010.
3 - E. Duchêne
et M. Rigo, Invariant
games,
Theoretical Computer Science (to appear).
2 - C. Germain and H. Kheddouci, Grundy coloring
numbers of powers of graphs, Discrete
Mathematics (to appear).
1 - N. Guellati
and H. Kheddouci. A Survey on Self-Stabilizing
Algorithms for Independence, Domination, Coloring,
and Matching in Graphs. Journal of
Parallel and Distributed Computing, Volume 70, Issue 4, Pages 406-415, April
2010.
International Conferences
10 - K. Drira and H. Kheddouci, A New Clustering Algorithm for
MANETs, 14th
International Telecommunications Network Strategy and Planning Symposium (Networks'10),
Warsaw-Poland, September 27-30, 2010.
9 - K. Drira, H. Seba, B. Effantin and H. Kheddouci, Distance-edge-coloring of power
graphs, 8th French
Combinatorial Conference (8FCC'10), Paris-France, July 2010.
8 - M. Haddad, B. Serrour
and H. Kheddouci, Towards
Community Detection Problem Formalization. European
Conference on Complex Systems (ECCS’10), 2010 (to appear).
7 - M. Haddad, F. Armetta,
H. Kheddouci and S. Hassas, A
Self-organized Query Routing for Peer-to-Peer Networks, ACM UPC'2010, Berlin,
Germany
6 - M. Haddad and H. Kheddouci, On (total) domination in graph
colorings, 8th French Combinatorial Conference, Orsay,
France, 2010
5 - S. Lemmouchi, M. Haddad and H. Kheddouci, Robustesse de communautés émergées des graphes sociaux issus des réseaux de communication, Extraction et Gestion des Connaissances (EGC 2010).
4 - S. Lemmouchi, M.
Haddad and H. Kheddouci, Robustness Evaluation Framework, 4th Workshop on Software Engineering
Challenges for Ubiquitous and Pervasive Computing (UPC'2010) (to appear).
3 - L. Ning, Tree
matching for querying XML data, (EGC2010), pp 57-69, Hammamet,
Tunisie, 26-29 janvier
2010.
2 - B. Serrour and H.
Kheddouci, Community
Comparison in Communication Networks. International
Conference on Advances in Social Networks Analysis and Mining (ASONAM’10), 2010
(to appear).
1 - M. A Tahraoui , E. Duchene and H. Kheddouci . Max-Min vertex-distinguishing edge colorings of graphs. In 8TH French Combinatorial Conference. (To appear).
National Conferences/Days
1 - B. Serrour and H. Kheddouci, Une Méthode à base de Graphes pour la Corrélation de Messages dans les Logs des Services Web. 11es Journées Doctorales en Informatique et Réseaux (JDIR’10), Sophia Antipolis, France, 2010.
|
2009 |
International
Journals
6 - E. Duchêne,
A.S. Fraenkel, S. Gravier
and R.J. Nowakowski, "Another
bridge between Nim and Wythoff",
Australasian Journal of
Combinatorics 44, 43-56, (2009).
5 - E. Duchêne,
S. Gravier and M. Mhalla, "Combinatorial
graph games", Ars Combinatoria 90,
33-44, (2009).
4 - E. Duchêne, S. Gravier and J. Moncel, "New results about Impartial
Solitaire Clobber",
RAIRO-Operations Research, Volume: 43, Issue: 4, Pages: 463-482.
3 - E. Duchêne and S.
Gravier, "Geometrical
extensions of Wythoff's game", Discrete Mathematics, Volume:
309 Issue: 11 Special Issue: Sp. Iss.
SI Pages: 3595-3608.
2 - B. Effantin and
H. Kheddouci, Discussion on the
(partial) Grundy and b-chromatic numbers of graphs, Utilitas Mathematica, Volume. 80
Pages: 65-90, 2009.
1 - M.
Haddad and H. Kheddouci, A strict strong coloring
of graphs, Information Processing Letters – IPL, Volume: 109, Issue: 18, Pages: 1047-1054, 2009.
International Conferences
9- L. Dekar and H. Kheddouci, A Resource Discovery Scheme for Large Scale Ad
hoc Networks Using a Hypercube-based backbone, The IEEE 23rd
International Conference on Advanced Information Networking and Applications,
AINA-09: pp. 293-300, 2009.
8- L. Dekar and H. Kheddouci. A Self-Stabilizing Web
Services Communities Management Scheme. The 5th IEEE International
Conference on Signal Image Technology and Internet Based Systems (SETIS2009),
Marrakech (Morocco), 29nov-4dec 2009.
7 - K. Drira, L. Dekar et H. Kheddouci. A self-stabilizing (Delta+1)-edge-coloring algorithm of arbitrary graphs. In
proceedings of the Second International Workshop on Reliability, Availability,
and Security(WRAS 2009)/ The Tenth International Conference on Parallel and
Distributed Computing, Applications and Technologies (PDCAT), pp :
312-317, Hiroshima, Japan, December
2009.
6 - K. Drira,
H. Seba, H. Kheddouci, Distance edge coloring of trees,
International
Optimization Conference INOC 2009, Pise,
Italie.
5 - H. Elghazel, K. Benabdeslem and H. Kheddouci. McSOM: Minimal Coloring of Self Organizing Map, In the 5th International
Conference on Advanced Data Mining and Applications (ADMA 2009), Lecture Notes
in Artificial Intelligence - © Springer Verlag,
Beijing, China, August 17-19, 2009.
4 - N. Guellati and
H. Kheddouci, A Self-stabilizing
Distributed Algorithm for Maintaining a Hamiltonian Cycle. IEEE International Symposium on Parallel and Distributed Processing
with Applications (ISPA-09), Chengdu, Sichuan, China.
3 -
M. Haddad and H. Kheddouci, A Graph Coloring
Based Service Discovery in Ad hoc Networks, In
proceedings of the ACM International Conference on Pervasive Services
(ICPS'09/AUPC), July 13-17, 2009,
2 - S. Lemmouchi, M.
Haddad and H. Kheddouci, Robustness
of emerged community in social network, MEDES, 2009.
1 - H. Seba, F. Tigrine and H. Kheddouci. A
Tree-based Group Key Agreement Scheme for Secure Multicast Increasing
Efficiency of Rekeying in Leave Operation, IEEE Symposium on Computers and
Communications (ISCC'09),
July 5 - 8, 2009,
National Conferences/Days
1 – L. Dekar and H. Kheddouci, Méthode de découverte de services utilisant un backbone basé sur les hypercubes, pour les réseaux ad hoc à grande échelle. Journées Doctorales en Informatique et Réseaux - JDIR'09 - 2 au 4 Février 2009 à Belfort (best paper).
|
2008 |
International
Journals
7 - L. Dekar and H. Kheddouci, A Cluster Based Mobility
Prediction Scheme for Ad hoc networks, Ad hoc Networks, Volume 6,
Issue 2, Pages 168-194, (2008).
6 - P. Dorbec, E. Duchêne and S. Gravier, "Solitaire Clobber played on Hamming
graphs", Integers, Electronic Journal of
combinatorial number theory, vol. 8, #G3, (2008).
5 - E. Duchêne and M.
Rigo, "Cubic Pisot
unit games", Monatshefte fr
Mathematik, *155*, 217–249, (2008).
4 - E. Duchêne and M.
Rigo, "A morphic approach to combinatorial games: the Tribonacci case", Theoretical Informatics and Applications
(RAIRO), vol. 42, pp 375-393, (2008).
3 - H. Elghazel, H. Kheddouci, V. Deslandres and A. Dussauchoy. A Graph b-coloring Framework
for Data Clustering. Journal of Mathematical Modelling and Algorithms, vol. 7, pp 389-423, (2008).
2 - M. Haddad and H. Kheddouci, A survey on graph based service discovery approaches for ad hoc
networks, International Transactions on Systems Science and Applications
(ITSSA), Volume 4, Issue 2, pp. 145-152, 2008.
1 - H. Kheddouci
and O. Togni, The Minimum Feedback Vertex Sets in
Distance Graphs and Circulant Graphs. Discrete Mathematics and Theoretical Computer
Science, Vol 10, No 1, 57-70 (2008).
International Conferences
7 - L. Dekar and H. Kheddouci, A graph b-coloring
based scheme for Composition-Oriented Web Services Abstraction: COWSA, PhD
Symposium of the 6th International Conference on Service Oriented Computing,
ICSOC‘2008, December 1-5, 2008,
6 - L. Dekar and H. Kheddouci, Distance-2 Self-stabilizing Algorithm for a b-Coloring
of Graphs, 10th
International Symposium on Stabilization, Safety, and Security of Distributed
Systems, SSS 2008, Lecture Notes in Computer Science 5340, 19-31 (2008).
5 - L. Dekar and H. Kheddouci, A Graph b-coloring based method for
composition oriented Web services classification, 17th International
Symposium on Methodologies for Intelligent Systems ISMIS 2008,
4 - M. Haddad, L. Dekar and H. Kheddouci, A
distributed strict strong coloring algorithm for
broadcast applications in ad hoc networks. 8th annual international conference on
New Technologies of Distributed Systems NOTERE’2008 ACM Digital Library
3 - 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).
2 - B. Serrour,
D. Gasparotto, H. Kheddouci
and B. Benatallah. Message Correlation and Business Protocol Discovery in Service
Interaction Logs. 20th International Conference on Advanced
Information Systems Engineering (CAiSE’08), Lecture Notes in Computer Science,
Vol. 5074, pp. 405-419, 2008.
1 - 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),
|
2007 |
International Journals
2 - B. Effantin
and H Kheddouci, Grundy number of graphs, Discussiones Mathematicae Graph Theory, vol. 27(1), pp. 5-18 (2007).
1 - F. Tigrine
and H. Kheddouci, The Minimum Feedback Vertex Set for Kronecker
Product of Graphs, Vol 74, pages 207-238, Utilitas Mathematica (2007).
International Conferences
14 - S. Benbernou,
D. Benslimane, M-S. Hacid, H. Kheddouci and A. Tari. A Graph-Based Approach for Web Services
Composition. 3rd International Conference on Web Information Systems
and Technologies - WEBIST 2007, 3-6 March, 2007, Barcelona, Spain.
13 - Y. Belhoul, S. Yahiaoui, H. Kheddouci and S. Gharout. Mobility
Models and Routing Protocols for Mobile Ad hoc Networks. International
Conference on Late Advances in Networks (ICLAN'2007)
12 - Y. Belhoul, S. Yahiaoui, H. Kheddouci and S. Gharout, Mobility
impact on routing protocols in mobile ad hoc networks, 7th International
Conference on Computer and Information Technology – IEEE CIT 2007. University
of Aizu, Fukushima Japan, October 16 to 19, 2007.
11 - L. Dekar, B.Effantin and 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), Canada
(Niagara Falls), Lecture Notes in Computer Science,
Vol. 4742, pp. 170-181, Springer, 2007.
10 - L. Dekar, B. Effantin and H. Kheddouci, [r,s,t]-coloring of Trees and Bipartite graphs, British Combinatorial Conference
2007, BCC’2007, 8-13 July 2007, University of Reading, England.
9 - H. Drid and H. Kheddouci, Un algorithme d’exclusion mutuelle distribué pour les réseaux ad hoc, Conference SETIT 2007 : Hammamet 25-29 March 2007 – Tunisia
8 - K. Drira, H. Kheddouci and N. Tabbane, Une topologie dynamique virtuelle pour le routage dans les réseaux mobiles ad hoc, Conference SETIT 2007 : Hammamet 25-29 March 2007 – Tunisia
7 - H. Elghazel, H. Kheddouci, V. Deslandres and A. Dussauchoy, A Partially Dynamic Clustering
Algorithm for Data Insertion and Removal, 10th International Conference on Discovery
Science (DS 2007), Sendai, Japan, Lecture Notes in Computer Science 4755.
Lecture Notes in Artificial Intelligence, 78-90 (2007).
6 - H. Elghazel, H. Kheddouci, V. Deslandres and A. Dussauchoy, A Graph-based Approach for Dynamic
Clustering. 5th International Workshop on Mining and
Learning with Graphs, Firenze, Italy. August 1-3, 2007
5 - M. Haddad and H. Kheddouci, Graph based approaches for service oriented applications in ad hoc
networks, In the Proceedings of IEEE International Conference on Pervasive
Services (ICPS'07), pp. 431- 436, July 15 - 20, 2007, Istanbul, Turkey.
4 - M.
Haddad and H. Kheddouci. A Virtual dynamic topology for service
discovery in mobile ad hoc networks. In the Proceedings of IEEE
Wireless Communications and Networking Conference 2007 - Services and
applications – Hong Kong 11-15 March 2007
3 - F. Tigrine, L.H. Seba
and H. Kheddouci, A Self-Stabilizing Group Key Agreement Protocol. Sixth
International Conference on Networking ICN 2007 – April 22-28, 2007 –
Martinique, French Caribbean.
2 - F. Tigrine
and H. Kheddouci. A
Distributed Fully Dynamic Algorithm for Maintaining a Minimal Feedback Vertex
Set in a Graph. International Network Optimization
Conference 2007 April 22-25 Spa, Belgium.
1 - S. Yahiaoui, H. Kheddouci and A. Tari, Une Topologie k-arbre pour la Découverte de Services dans les Réseaux Ad hoc, 4th International Conference SETIT 2007, Hammamet – Tunisia, March 25-29, 2007.
National Conferences
1 - H. Elghazel, H. Kheddouci, V. Deslandres and A. Dussauchoy.
Une approche incrémentale de classification non supervisée par b-coloration
de graphes, 9ème Conférence Francophone sur l'apprentissage automatique (CAp 2007), Grenoble, France, 2-6 Juillet 2007
Workshops
1 - L. Dekar, B. Effantin and 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). Algeria (Oran) (2007).
|
2006 |
International Journals
3 - J. L. Baril,
H. Kheddouci and O. Togni, Adjacent vertex distinguishing
edge-colorings of meshes, Australasian
Journal of Combinatorics, Vol
35,
pp. 89-102, (2006).
2 - L. Blanc, E. Duchêne
and S. Gravier, "A
new deletion game on graphs : Le Pic'arète",
Integers,
Electronic Journal of combinatorial number theory, vol. 6, #G2, (2006).
1- L.H Seba,
«FTKM: A fault-tolerant key management protocol for multicast comm», Computer & Security Journal , Elsevier, Vol 25 n°6, pp. 426-434, 2006
International Conferences
6 - K. Drira,
H. Kheddouci and N. Tabbane. Virtual
Dynamic Topology for Routing in Mobile Ad Hoc Networks.
International Conference on Late Advances in Networks (ICLAN'2006), pp 129-134,
Paris, France
5 - B. Effantin and H. Kheddouci, A distributed algorithm for a b-coloring of a graph, International Symposium on
Parallel and Distributed Processing and Applications (ISPA-2006), Italy
(Sorrento), Lecture Notes in Computer Science, Vol. 4330, pp. 430-438,
Springer, 2006.
4 - H. Elghazel, H. Kheddouci, V. Deslandres and A. Dussauchoy, A New Graph-Based Clustering
Approach: Application to PMSI Data, In the Proceedings
of IEEE International Conference on Services Systems and Services
Management (ICSSSM06): 25-27 October 2006, France.
3 - H. Elghazel, V.
Deslandres, M-S. Hacid, A Dussauchoy and H. Kheddouci, A New Clustering Approach for Symbolic Data and its Validation:
Application to the Healthcare Data, 16th International Symposium
on Methodologies for Intelligent Systems ISMIS 2006, Lecture Notes in Computer Science, Vol. 4203, pp. 473-482,
Springer, 2006.
2 - L.H. Seba,
ARPM: an Adaptive Routing Protocol for Manets, In the Proceedings of the IEEE International
Conference on Pervasive Services 2006. 26-29 June, France,
2006.
1 - M. Haddad and H. Kheddouci. Service
discovery in ad hoc networks. International Conference on Late
Advances in Networks (ICLAN'2006), pp 61-66, Paris, France
National Conferences
3 - H. Elghazel, M-S. Hacid, H.
Kheddouci and A Dussauchoy, A New Clustering Approach for Symbolic Data:
Algorithms and Application to Healthcare Data. 22ème Journées Bases de Données Avancées (BDA’06), 17-20 October 2006,
2 - M. Haddad and H. Kheddouci, Découverte de services dans les réseaux ad hoc, Algotel 2006, Trégastel, France.
1 - F. Tigrine, L.H. Seba and H. Kheddouci,
S2KAP: Self-Stabilizing Group Key
Agreement Protocol, 5th Conference on Security and Network
Architectures (SAR 2006), 6-9 June,France,
2006.
Workshops
3 - L. Dekar and H. Kheddouci, Théorie des évidences pour la prédiction de la mobilité dans les réseaux ad hoc, Colloque sur l'Optimisation et les systèmes d'Informations (COSI'06). Algeria (Algiers) (2006).
2 - M. Haddad and H. Kheddouci, Topologie virtuelle pour la découverte de service dans les réseaux ad hoc, Colloque sur l'Optimisation et les systèmes d'Informations (COSI'06). Algeria (Algiers) (2006).
1 - F. Tigrine and H. Kheddouci, Minimum Feedback Vertex set for Knödel graphs, Colloque sur l'Optimisation et les systèmes d'Informations (COSI'06). Algeria (Algiers) (2006).
|
2005 |
International
Journals
4 -
J.-L. Baril, H. Kheddouci
and O. Togni, The irregularity strength of circulant graphs, Discrete Mathematics,
Volume 304, Number 1-3, pp. 1-10. 28 (2005).
3 - Y. Challal and H. Seba, Group Key Management
Protocols: A NovelTaxonomy, International
Journal of Information Technology 2(1), pp.1305-2403 (2005)
2 - 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)
1 - B. Effantin
and 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)
International Conferences
6 - L. Bouhafs
and H. Kheddouci, Tolérance aux pannes
dans les graphes distants et circulants, 3rd
International conference : Sciences of Electronic, Technologies of Information
and Telecommunications, Tunisia (Susa) (2005).
5 - I. Cahit
and H. Kheddouci, Embedding
Plane Graphs in the Grids, 9th
International Conference on Information Visualisation IV05, UK (London)(2005), pp. 670-675, IEEE Computer Society, 2005.
4 - Y. Challal
and H. Seba, A Taxonomy of Group Key
Management Protocols: Issues and Solutions, Proceedings of International
Conference on Information Security (ICIS’05), vol.6, pp.5-17. ISBN
975-98458-5-7 (2005)
3 - B. Effantin
and 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)
2 - H. Megharbi
and H. Kheddouci, Distributed Algorithms for Constructing and
Maintaining a Spanning Tree in a Mobile Ad hoc Network, First International Workshop on
Managing Context Information in Mobile and Pervasive Environments, Cyprus
(Ayia Napa) (2005).
1 - F. Tigrine
and H. Kheddouci, The Minimum Feedback
Vertex Set for the Kronecker Product of a Cubic Graph
By a Complete Graph, International Network Optimization Conference
(INOC2005), Portugal (Lisbon) (2005)
|
2004 |
International Journals
1 - H. Seba,
A. Bouabdallah and N. Badache, A
New approach to scalable and fault-tolerant group key management protocols, Journal
of High Speed Networks 13(4), pp.283-296 (2004)
International Conferences
4 - 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)
3 - D. Ménegaux,
D. Faudot and H. Kheddouci, Skeletizing 3D-objetcs by projections, International Conference on Computational Science and
its Applications (ICCSA 2004), Italy (Assisi), Lecture Notes in Computer
Science, vol.3045, pp.267-276, Springer, 2004.
2 - N. Samaan,
A. Karmouch and H. Kheddouci, Mobility
prediction based service location and delivery, 17th IEEE Canadian Conference on Electrical and Computer Engineering
(CCECE 2004), May 2-5, Niagara Falls Ontario, Canada.
1 - F. Tigrine and H. Kheddouci, The Minimum Feedback Vertex Set for the Kronecker
Product of graphs, Conference on Graph
Theory in memory of Claude BERGE (GT04), France (Paris), vol.1, pp.110-114,
(2004)
National Conferences and Workshops
3 - B.Effantin,
Extraction of Web communities, workshop COMBSTRU, Italy (Venice) (2004)
2 - B.Effantin,
The b-chromatic number of some power graphs, workshop COMBSTRU, France
(Bordeaux) (2004)
1 - F. Tigrine, L’ensemble minimum de sommets
de rebouclement pour le produit
de Kronecker d’un graphe cubique par K2, MAnifestation
des JEunes Chercheurs STIC
(MAJECSTIC'04), France (Calais), vol.2 (2004)
|
2003 |
International Journals
4 - B. Effantin
and H. Kheddouci, The b-chromatic number
of some power graphs, Discrete Mathematics and Theoretical Computer Science
6(1), pp.45-54 (2003)
3 - C. Germain
and H. Kheddouci, Packing of two copies of a
caterpillar into its third power, Discussiones Mathematicae Graph Theory
23(1), pp. 105-115 (2003)
2 - H. Kheddouci, A note on packing of two copies of some
trees into their third power, Applied Mathematics Letters
vol.16, pp. 1115-1121 (2003)
1 -
S. Lanquetin, S. Foufou,
H. Kheddouci and M. Neveu,
Trois algorithmes
d’intersection des surfaces de subdivision,
International Conferences
8 - 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).
7 - C. Germain and H. Kheddouci, Grundy
coloring for power caterpillars, International
Optimization Conference INOC2003, pp. 243-247, France (Evry/Paris)
(2003).
6 - S. Lanquetin, S. Foufou, H. Kheddouci and M. Neveu, A Graph Based Algorithm For Intersection Of
Subdivision Surfaces, International Conference on Computational Science and its Applications
(ICCSA 2003), Canada (Monréal), Lecture Notes in
Computer Science, vol.2669, pp.387-396, Springer, 2003.
5 - S. Lanquetin, S. Foufou, H. Kheddouci, M. Neveu, Computing Subdivision Surface Intersection, In Poster
Proceedings of the Int'l Conference. WSCG'03, Czech Republic, pp. 73-76, 2003.
3 - H. Seba,
A. Bouabdallah and N. Badache,
Ensuring fault-tolerance in group key distribution using multicast
group characteristics, Trusted Internet Workshop (TIW03) to be held
in conjunction with the Intl. Conference on
High-Performance Computing (HiPC),
Inde (2003)
2 - H. Seba,
A. Bouabdallah, N. Badache,
H. Bettahar and D. Tandjaoui, Gestion
de clés et sécurité multipoint : étude et perspectives, Annals of telecommunications 58(7-8),
pp.1090-1129 (2003)
1 - D. Tandjaoui,
N. Badache, A. Bouabdallah,
H. Bettahar and H. Seba, Performance
enhancement of smooth handoff in mobile IP by reducing packets disorder, 8th IEEE
Symposium on Computers and Communications (ISCC2003), Turquie (2003)
National Conferences
and Workshops
3 - J.-L. Baril, H. Kheddouci and
O. Togni, Force d'irrégularité des graphes
circulants, Journées Graphes et Algorithmes, France (Dijon) (2003)
2 - B. Effantin,
Génération d'arbres binaires étiquetés, Journées Graphes et Algorithmes,
France (Dijon) (2003)
1 - D. Ménegaux,
D. Faudot and H. Kheddouci,
Squelettisation des objets 3D par des projections, Actes des XVIèmes journées de l'AFIG'03 (2003)
|
2002 |
International Journals
2 - C. Germain
and H.
Kheddouci, Grundy coloring
for power graphs, Electronic Notes in Discrete Mathematics, vol. 15.
Instructional Workshop and Symposium on Discrete Mathematics and Applications
(on the occasion of the birth centenary of Professor Raj Chandra Bose), India
(Kolkata)
1
International Conferences
7 - H. Kheddouci,
Packing unicyclic graphs in their powers, 2nd
IEEE International Symposium on Signal Processing and Information Technology,
Proceedings vol. 1, pp. 73-76, Morocco (
6 - H. Seba, N. Badache and A. Bouabdallah, Solving the consensus problem in a
dynamic group: an approach suitable for a mobile environment, 7th IEEE Symposium on Computers
and Communications (ISCC02), Italie, pp.327-332
(2002)
5 - H. Seba,
N. Badache and A. Bouabdallah, Fault-tolerant
group communication service for mobile hosts, International
Conference on Communications in Computing (CIC02), USA (Las
Vegas), pp.3-9 (2002)
4 - H. Seba, N. Badache and A. Bouabdallah, A disconnection-tolerant
non blocking atomic commitment, 3rd International conference on Parrallel and Distributed Computing, Applications and
Technologies (PDCAT02), Japan, pp.227-234 (2002)
3 - H. Seba,
N. Badache and A. Bouabdallah,
A two level failure detector scheme for solving consensus in a mobile
environment, 2nd Asian International Mobile Computing Conference (AMOC2002),
Malaisie (2002)
2 - H. Seba,
A. Bouabdallah, N. Badache,
H. Bettahar and D. Tandjaoui,
A hybrid approach for group key management, 3rd International Network
Conference (INC2002), UK (Plymouth), pp.381-388 (2002)
1 - D. Tandjaoui,
N. Badache, A. Bouabdallah,
H. Bettahar and H. Seba, Towards
a smooth handoff for tcp and real time application in
wireless network, 3rd International Network Conference (INC2002), UK
(Plymouth), pp.519-527 (2002)
National Conferences and Workshops
3 - B. Effantin,
Le nombre b-chromatique
pour les graphes puissances,
Journées Graphes et Algorithmes, France (Nantes) (2002)
2 - H. Kheddouci
and O. Togni, Feedback vertex set for distance
and circulant graphs, Journées
Graphes et Algorithmes, France
(Nantes) (2002)
1 - S. Lanquetin,
S. Foufou, H. Kheddouci and
M. Neveu, Deux
algorithmes d'intersection
des surfaces de subdivision, Actes des XVèmes journées de l'AFIG'02, pp.
251-258 (2002)
|
2001 |
International Journals
4 - D. Barth, A. Benhamdine,
H. Kheddouci and H. Li, Fault-Tolerant
deflection Routing in 2-dimensional Meshes, International Conference
in Image and Signal Processing, Proceedings Volume 1, pp. 304-316 (2001), Morroccan Journal of Control Computer Science and Signal
Processing, vol III, n°2, pp 57-69 (2001)
3 - H. Kheddouci, Remarks on the Partially Square Graphs, Hamiltonicity and Circumference, Discussiones Mathematicae Graph Theory 21(1), pp. 255-266 (2001)
2 - H. Kheddouci,
1 - H. Kheddouci, A Dual of 4-regular
graph for GxC2n, Journal
of Discrete Mathematical sciences and Cryptography, vol. 6, n°1, pp. 85-96
International Conferences
2 - D. Barth, A. Benhamdine, H. Kheddouci
and H. Li, Fault-Tolerant deflection Routing in 2-dimensional
Meshes, International Conference in Image and Signal Processing, vol.
1, pp.304-316, Morocco (Agadir) (2001)
1 - H. Kheddouci,
On the packing of trees into their power,
Electronic Notes in Discrete Mathematics, vol. 10. Comb01, Euroconference
on Combinatorics, Graph Theory and Applications,
Spain (Barcelona) (2001)
National Conferences, Workshops and Research reports
1 - F. Tigrine,
Les méta-heuristiques Pour le Flow Shop Hybride, reasearch
report LI(OC) EPU, Tours (2001)
|
Before 2001 |
International Journals
1 - H. Kheddouci,
J. F. Saclé and M. Wozniak, Packing
two copies of a tree into its fourth power, Discrete Mathematics 213 (1-3), pp. 169-178 (2000)
International Conferences
4 - H. Kheddouci, Partially
Square Graphs, Hamiltonicity and Circumference II,
Colloque International de Graphes
et Combinatoire, France (Luminy/Marseille)
(2000)
3 - H. Kheddouci
and M. Kouider, Hamiltonian Cycle
Decomposition of Kronecker Product of some Cubic
Graphs by Cycles, Colloque International de Graphes
et Combinatoire, France (Luminy/Marseille)
(1995)
2 - H. Kheddouci,
S. Marshall, J. F. Saclé and M. Wozniak, On
the packing of three graphs, Third
1 - H. Seba
and N. Badache, Real-time Constraints and
Transaction Commitment in Multidatabase Systems,
Fourth International Conference on Recent Trends in Computer Science
Applications & Information Systems, Jordanie
(Amman), pp.65-73 (1999)
National Conferences, Workshops and Research reports
3 - H. Seba, B. Medjahed
and M.A. Atroun, La Sérialisabilité
par Conflits Composés : un Critère pour la Correction Forte dans les Multibases de Données, Proc. des 14èmes Journées
de Bases de Données Avancées (BDA’98), Tunisie (Hammamet), pp.101-116 (1998)
2 - H. Seba,
B. Medjahed and M.A. Atroun, Préservation
de la correction forte dans les multibases de données,
Deuxième Séminaire National en Informatique (SNIB’97), Algérie (Biskra),
pp.92-104 (1997)
1 - F. Tigrine,
Les methodes exacts et métaheurstiques
pour le No-Wait Flow Shop flexible (problème de
voyageur de commerce TSP), reasearch report
INI, Alger (2000)