Hamamache Kheddouci

Proceedings of the 2016 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, 2016

2015

A new self-stabilizing algorithm for maximal p-star decomposition of general graphs.

[BibT_eX]

[DOI]

Brahim Neggazi

Houcine Boumediene Merouane

Inf. Process. Lett., 2015

Efficient Self-Stabilizing Algorithm for Independent Strong Dominating Sets in Arbitrary Graphs.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2015

Dominated Colorings of Graphs.

[BibT_eX]

[DOI]

Mustapha Chellali

Graphs Comb., 2015

Decomposition of complete multigraphs into stars and cycles.

[BibT_eX]

[DOI]

Fairouz Beggas

Discuss. Math. Graph Theory, 2015

Labeled 2-packings of trees.

[BibT_eX]

[DOI]

Discret. Math., 2015

Saturated boundary k-alliances in graphs.

[BibT_eX]

[DOI]

Hachem Slimani

Discret. Appl. Math., 2015

Subdivision into i-packings and S-packing chromatic number of some lattices.

[BibT_eX]

[DOI]

Nicolas Gastineau

Ars Math. Contemp., 2015

Kite Recognition by Means of Graph Matching.

[BibT_eX]

[DOI]

Kamel Madi

Charles-Edmond Bichot

Proceedings of the Graph-Based Representations in Pattern Recognition, 2015

GraphExploiter: Creation, Visualization and Algorithms on graphs.

[BibT_eX]

[DOI]

Proceedings of the 2015 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, 2015

A Graph Approach for Enhancing Process Models Matchmaking.

[BibT_eX]

[DOI]

Proceedings of the 2015 IEEE International Conference on Services Computing, 2015

Graph Edit Distance Based on Triangle-Stars Decomposition for Deformable 3D Objects Recognition.

[BibT_eX]

[DOI]

Proceedings of the 2015 International Conference on 3D Vision, 2015

2014

A distance measure for large graphs based on prime graphs.

[BibT_eX]

[DOI]

Pattern Recognit., 2014

Efficient self-stabilizing algorithms for minimal total k-dominating sets in graphs.

[BibT_eX]

[DOI]

Yacine Belhoul

Saïd Yahiaoui

Inf. Process. Lett., 2014

Latent semantic analysis for business protocol discovery using log files.

[BibT_eX]

[DOI]

Abdelkader Moudjari

Int. J. Web Eng. Technol., 2014

[r, s, t]-Colorings of Graph Products.

[BibT_eX]

[DOI]

Graphs Comb., 2014

A self-organized system improving inner topology for data sharing efficiency.

[BibT_eX]

[DOI]

Evol. Syst., 2014

On the family of r-regular graphs with Grundy number r+1.

[BibT_eX]

[DOI]

Nicolas Gastineau

Discret. Math., 2014

The b-chromatic number and f-chromatic vertex number of regular graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2014

Labeled embedding of (n, n-2)-graphs in their complements.

[BibT_eX]

[DOI]

Mariusz Wozniak

CoRR, 2014

Monitoring in mobile ad hoc networks: A survey.

[BibT_eX]

[DOI]

Nadia Battat

Comput. Networks, 2014

Efficient distributed lifetime optimization algorithm for sensor networks.

[BibT_eX]

[DOI]

Ad Hoc Networks, 2014

A Self-stabilizing Algorithm for Edge Monitoring Problem.

[BibT_eX]

[DOI]

Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2014

Partial Restreaming Approach for Massive Graph Partitioning.

[BibT_eX]

[DOI]

Ghizlane Echbarthi

Proceedings of the Tenth International Conference on Signal-Image Technology and Internet-Based Systems, 2014

Fractional greedy and partial restreaming partitioning: New methods for massive graph partitioning.

[BibT_eX]

[DOI]

Ghizlane Echbarthi

Proceedings of the 2014 IEEE International Conference on Big Data (IEEE BigData 2014), 2014

2013

Self-stabilizing Consensus Average Algorithm in Distributed Sensor Networks.

[BibT_eX]

[DOI]

Trans. Large Scale Data Knowl. Centered Syst., 2013

Coloring based approach for matching unrooted and/or unordered trees.

[BibT_eX]

[DOI]

Pattern Recognit. Lett., 2013

Distance edge coloring and collision-free communication in wireless sensor networks.

[BibT_eX]

[DOI]

Networks, 2013

Self-stabilizing algorithms for minimal global powerful alliance sets in graphs.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2013

Edge coloring total k-labeling of generalized Petersen graphs.

[BibT_eX]

[DOI]

Riadh Khennoufa

Inf. Process. Lett., 2013

Weighted graph-based methods for identifying the most influential actors in trust social networks.

[BibT_eX]

[DOI]

Nassira Chekkai

Int. J. Netw. Virtual Organisations, 2013

A survey on tree matching and XML retrieval.

[BibT_eX]

[DOI]

Karen Pinel-Sauvagnat

Comput. Sci. Rev., 2013

Robustness study of emerged communities from exchanges in peer-to-peer networks.

[BibT_eX]

[DOI]

Slimane Lemmouchi

Comput. Commun., 2013

Labeled packings of graphs.

[BibT_eX]

[DOI]

Richard J. Nowakowski

Australas. J Comb., 2013

A Self-stabilizing Algorithm for Maximal p-Star Decomposition of General Graphs.

[BibT_eX]

[DOI]

Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2013

Stabilization and Lifetime Optimization in Distributed Sensor Networks.

[BibT_eX]

[DOI]

Proceedings of the 27th International Conference on Advanced Information Networking and Applications Workshops, 2013

Spectral Graph Approach for Process Model Matchmaking.

[BibT_eX]

[DOI]

Proceedings of the 2013 IEEE International Conference on Services Computing, Santa Clara, CA, USA, June 28, 2013

2012

Alliance-based clustering scheme for group key management in mobile ad hoc networks.

[BibT_eX]

[DOI]

Sofiane Lagraa

J. Supercomput., 2012

Gap vertex-distinguishing edge colorings of graphs.

[BibT_eX]

[DOI]

Discret. Math., 2012

Vertex Distinguishing Edge- and Total-Colorings of Cartesian and other Product Graphs.

[BibT_eX]

Jean-Luc Baril

Ars Comb., 2012

Self-stabilizing algorithm for maximal graph decomposition into disjoint paths of fixed length.

[BibT_eX]

[DOI]

Brahim Neggazi

Proceedings of the 4th Workshop on Theoretical Aspects of Dynamic Distributed Systems, 2012

Self-stabilizing Algorithm for Maximal Graph Partitioning into Triangles.

[BibT_eX]

[DOI]

Brahim Neggazi

Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2012

A consistency rule for graph isomorphism problem.

[BibT_eX]

[DOI]

Badreddine Benreguia

Proceedings of the ACM Symposium on Applied Computing, 2012

A weighted-graph based approach for solving the cold start problem in collaborative recommender systems.

[BibT_eX]

[DOI]

Nassira Chekkai

Hocine Boumediene Merouane

Proceedings of the 2012 IEEE Symposium on Computers and Communications, 2012

Dominated Coloring of Graphs.

[BibT_eX]

Mustapha Chellali

Proceedings of the 11th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2012

AdSIP: Decentralized SIP for Mobile Ad Hoc Networks.

[BibT_eX]

[DOI]

Saïd Yahiaoui

Yacine Belhoul

Nadia Nouali-Taboudjemat

Proceedings of the 26th International Conference on Advanced Information Networking and Applications Workshops, 2012

String Comparators Based Algorithms for Process Model Matchmaking.

[BibT_eX]

[DOI]

Proceedings of the 2012 IEEE Ninth International Conference on Services Computing, 2012

2011

Web Service Matchmaking by Subgraph Matching.

[BibT_eX]

[DOI]

Sofiane Lagraa

Proceedings of the Web Information Systems and Technologies - 7th International Conference, 2011

A Graph Decomposition Approach to Web Service Matchmaking.

[BibT_eX]

Proceedings of the WEBIST 2011, 2011

A summary-based approach for enhancing process model matchmaking.

[BibT_eX]

[DOI]

Proceedings of the 2011 IEEE International Conference on Service-Oriented Computing and Applications, 2011

Study of robustness of community emerged from exchanges in networks communication.

[BibT_eX]

[DOI]

Slimane Lemmouchi

Proceedings of the MEDES '11: International ACM Conference on Management of Emergent Digital EcoSystems, 2011

Matchmaking OWL-S processes: an approach based on path signatures.

[BibT_eX]

[DOI]

Sofiane Lagraa

Proceedings of the MEDES '11: International ACM Conference on Management of Emergent Digital EcoSystems, 2011

Distributed Lifetime Optimization in Wireless Sensor Networks.

[BibT_eX]

[DOI]

Proceedings of the 13th IEEE International Conference on High Performance Computing & Communication, 2011

HMAN: Hierarchical Monitoring for Ad Hoc Network.

[BibT_eX]

[DOI]

Nadia Battat

Proceedings of the IEEE/IFIP 9th International Conference on Embedded and Ubiquitous Computing, 2011

Nouvelle Approche à base de Graphes pour les Systèmes de Recommandation Collaboratifs.

[BibT_eX]

[DOI]

Nassira Chekkai

Proceedings of the Third International Conference on Computer Science and its Applications (CIIA'11), 2011

2010

A survey on self-stabilizing algorithms for independence, domination, coloring, and matching in graphs.

[BibT_eX]

[DOI]

Nabil Guellati

J. Parallel Distributed Comput., 2010

[r, s, t]-coloring of trees and bipartite graphs.

[BibT_eX]

[DOI]

Discret. Math., 2010

ECGK: An efficient clustering scheme for group key management in MANETs.

[BibT_eX]

[DOI]

Kaouther Drira

Comput. Commun., 2010

New Results about Set Colorings of Graphs.

[BibT_eX]

[DOI]

Electron. J. Comb., 2010

Self-Organized Routing for Unstructured Peer-to-Peer Networks.

[BibT_eX]

[DOI]

Proceedings of the Fourth IEEE International Conference on Self-Adaptive and Self-Organizing Systems, 2010

A New Reliable and Self-Stabilizing Data Fusion Scheme in Unsafe Wireless Sensor Networks.

[BibT_eX]

[DOI]

Proceedings of the 2010 International Conference on Parallel and Distributed Computing, 2010

TopCoF: A Topology Control Framework for Wireless Ad Hoc Networks.

[BibT_eX]

[DOI]

Proceedings of the Sixth International Conference on Mobile Ad-hoc and Sensor Networks, 2010

Community Comparison in Communication Networks.

[BibT_eX]

[DOI]

Belkacem Serrour

Proceedings of the International Conference on Advances in Social Networks Analysis and Mining, 2010

2009

A strict strong coloring of trees.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2009

A Self-Stabilizing Web Services Communities Management Scheme.

[BibT_eX]

[DOI]

Proceedings of the Fifth International Conference on Signal-Image Technology & Internet-Based Systems, 2009

A Self-Stabilizing (delta+1)- Edge-Coloring Algorithm of Arbitrary Graphs.

[BibT_eX]

[DOI]

Kaouther Drira

Proceedings of the 2009 International Conference on Parallel and Distributed Computing, 2009

Robustness of emerged community in social network.

[BibT_eX]

[DOI]

Slimane Lemmouchi

Proceedings of the MEDES '09: International ACM Conference on Management of Emergent Digital EcoSystems, 2009

A tree-based group key agreement scheme for secure multicast increasing efficiency of rekeying in leave operation.

[BibT_eX]

[DOI]

Fouad Tigrine

Proceedings of the 14th IEEE Symposium on Computers and Communications (ISCC 2009), 2009

A Resource Discovery Scheme for Large Scale Ad Hoc Networks Using a Hypercube-Based Backbone.

[BibT_eX]

[DOI]

Proceedings of the IEEE 23rd International Conference on Advanced Information Networking and Applications, 2009

McSOM: Minimal Coloring of Self-Organizing Map.

[BibT_eX]

[DOI]

Haytham Elghazel

Khalid Benabdeslem

Proceedings of the Advanced Data Mining and Applications, 5th International Conference, 2009

2008

A Graph b-coloring Framework for Data Clustering.

[BibT_eX]

[DOI]

J. Math. Model. Algorithms, 2008

Minimum Feedback Vertex Sets in Distance Graphs and Circulant Graphs.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 2008

A cluster based mobility prediction scheme for ad hoc networks.

[BibT_eX]

[DOI]

Ad Hoc Networks, 2008

Distance-2 Self-stabilizing Algorithm for a b-Coloring of Graphs.

[BibT_eX]

[DOI]

Proceedings of the Stabilization, 2008

A distributed strict strong coloring algorithm for broadcast applications in ad hoc networks.

[BibT_eX]

[DOI]

Proceedings of the 8th international conference on New technologies in distributed systems, 2008

A Fully Dynamic Distributed Algorithm for a B-Coloring of Graphs.

[BibT_eX]

[DOI]

Shuang Liu

Proceedings of the IEEE International Symposium on Parallel and Distributed Processing with Applications, 2008

A Graph b-Coloring Based Method for Composition-Oriented Web Services Classification.

[BibT_eX]

[DOI]

Proceedings of the Foundations of Intelligent Systems, 17th International Symposium, 2008

A Self-stabilizing Algorithm for the Minimum Color Sum of a Graph.

[BibT_eX]

[DOI]

Huang Sun

Proceedings of the Distributed Computing and Networking, 9th International Conference, 2008

Message Correlation and Business Protocol Discovery in Service Interaction Logs.

[BibT_eX]

[DOI]

Proceedings of the Advanced Information Systems Engineering, 20th International Conference, 2008

2007

Grundy number of graphs.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2007

A Graph-based Approach for Web Services Composition.

[BibT_eX]

Proceedings of the WEBIST 2007, 2007

An Incremental Distributed Algorithm for a Partial Grundy Coloring of Graphs.

[BibT_eX]

[DOI]

Proceedings of the Parallel and Distributed Processing and Applications, 2007

Graph based approaches for service oriented applications in ad hoc networks.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Conference on Pervasive Services, 2007

A Partially Dynamic Clustering Algorithm for Data Insertion and Removal.

[BibT_eX]

[DOI]

Proceedings of the Discovery Science, 10th International Conference, 2007

2006

Adjacent vertex distinguishing edge-colorings of meshes.

[BibT_eX]

[DOI]

Jean-Luc Baril

Australas. J Comb., 2006

A Distributed Algorithm for a b-Coloring of a Graph.

[BibT_eX]

[DOI]

Proceedings of the Parallel and Distributed Processing and Applications, 2006

A New Clustering Approach for Symbolic Data and Its Validation: Application to the Healthcare Data.

[BibT_eX]

[DOI]

Proceedings of the Foundations of Intelligent Systems, 16th International Symposium, 2006

A New Clustering Approach for Symbolic Data: Algorithms and Application to Healthcare Data.

[BibT_eX]

Proceedings of the 22èmes Journées Bases de Données Avancées, 2006

2005

Sum coloring of distance and circulant graphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2005

The irregularity strength of circulant graphs.

[BibT_eX]

[DOI]

Jean-Luc Baril

Discret. Math., 2005

Distributed algorithms for Constructing and Maintaining a Spanning Tree in a Mobile Ad hoc Network.

[BibT_eX]

[DOI]

Hichem Megharbi

Proceedings of the First International Workshop on Managing Context Information in Mobile and Pervasive Environments May 9, 2005

Embedding Plane Graphs in the Grids.

[BibT_eX]

[DOI]

Ibrahim Cahit

Proceedings of the 9th International Conference on Information Visualisation, 2005

2004

Skeletizing 3D-Objects by Projections.

[BibT_eX]

[DOI]

David Ménegaux

Dominique Faudot

Proceedings of the Computational Science and Its Applications, 2004

2003

Grundy coloring for power graphs.

[BibT_eX]

[DOI]

Christian Germain

Electron. Notes Discret. Math., 2003

The b-chromatic number of power graphs.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 2003

On the packing of two copies of a caterpillar in its third power.

[BibT_eX]

[DOI]

Christian Germain

Discuss. Math. Graph Theory, 2003

A note on the packing of two copies of some trees into their third power.

[BibT_eX]

[DOI]

Appl. Math. Lett., 2003

Computing Subdivision Surface Intersection.

[BibT_eX]

[DOI]

Proceedings of the 11-th International Conference in Central Europe on Computer Graphics, 2003

A Graph Based Algorithm for Intersection of Subdivision Surfaces.

[BibT_eX]

[DOI]

Proceedings of the Computational Science and Its Applications, 2003

2001

On the packing of trees into their power.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2001

Remarks on Partially Square Graphs, Hamiltonicity and Circumference.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2001

On the packing of three graphs.

[BibT_eX]

[DOI]

Discret. Math., 2001

2000

Partially Square Graphs, Hamiltonicity and Circumference II.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2000

Packing two copies of a tree into its fourth power.

[BibT_eX]

[DOI]