Hamamache Kheddouci

Orcid: 0000-0002-5561-6203

According to our database1, Hamamache Kheddouci authored at least 171 papers between 2000 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Eternal feedback vertex sets: A new graph protection model using guards.
Discret. Math. Algorithms Appl., April, 2024

2023
Pseudo-polynomial algorithms for solving the Knapsack Problem with dependencies between items.
Comput. Oper. Res., October, 2023

Fast parallel algorithms for finding elementary circuits of a directed graph: a GPU-based approach.
J. Supercomput., March, 2023

On P<sub>5</sub>-free locally split graphs.
Discuss. Math. Graph Theory, 2023

Modeling and Analysis of Organizational Network Analysis Graphs Based on Employee Data.
Proceedings of the Optimization and Learning - 6th International Conference, 2023

A New Automated Customer Prioritization Method.
Proceedings of the Optimization and Learning - 6th International Conference, 2023

Network Vulnerability Assessment Using Critical Nodes Identification.
Proceedings of the International Symposium on Networks, Computers and Communications, 2023

Strategies for creating knowledge graphs to depict a multi-perspective Queer communities representation.
Proceedings of the Workshops of the EDBT/ICDT 2023 Joint Conference, 2023

Communication Behavior Analysis to Understand Employee Attrition.
Proceedings of the 9th International Conference on Control, 2023

A Graph Matching Approach by Aggregated Search.
Proceedings of the 9th International Conference on Control, 2023

A Linear Algorithm for the Eternal Feedback Vertex Set on Interval Graphs.
Proceedings of the 9th International Conference on Control, 2023

2022
Efficient parallel edge-centric approach for relaxed graph pattern matching.
J. Supercomput., 2022

Distributed graph pattern matching via bounded dual simulation.
Inf. Sci., 2022

Labeled packing of cycles and circuits.
Discuss. Math. Graph Theory, 2022

On the double total dominator chromatic number of graphs.
Discret. Math. Algorithms Appl., 2022

Complexity of edge monitoring on some graph classes.
Discret. Appl. Math., 2022

A Survey on Distributed Graph Pattern Matching in Massive Graphs.
ACM Comput. Surv., 2022

Categorical-Continuous Bayesian Optimization Applied to Chemical Reactions.
Proceedings of the Optimization and Learning - 5th International Conference, 2022

TOP-Key Influential Nodes for Opinion Leaders Identification in Travel Recommender Systems.
Proceedings of the Advances in Model and Data Engineering in the Digitalization Era, 2022

Process-Oriented Intents: A Cornerstone for Superimposition of Natural Language Conversations over Composite Services.
Proceedings of the Service-Oriented Computing - 20th International Conference, 2022

A New Approach for Employee Attrition Prediction.
Proceedings of the Graph-Based Representation and Reasoning, 2022

Context Knowledge-Aware Recognition of Composite Intents in Task-Oriented Human-Bot Conversations.
Proceedings of the Advanced Information Systems Engineering, 2022

2021
A graph grammar and K<sub>4</sub>-type tournament-based approach to detect conflicts of interest in a social network.
Knowl. Inf. Syst., 2021

Eternal dominating sets on digraphs and orientations of graphs.
Discret. Appl. Math., 2021

Continuous energy-efficient monitoring model for mobile ad hoc networks.
Proceedings of the 17th International Wireless Communications and Mobile Computing, 2021

Graph Analytics Workflows Enactment on Just in Time Data Centres Position Paper.
Proceedings of the Service-Oriented Computing - ICSOC 2021 Workshops, 2021

Predicting employee attrition with a more effective use of historical events.
Proceedings of the 29th European Symposium on Artificial Neural Networks, 2021

Reusable Abstractions and Patterns for Recognising Compositional Conversational Flows.
Proceedings of the Advanced Information Systems Engineering, 2021

2020
Temporal Pattern Mining for E-commerce Dataset.
Trans. Large Scale Data Knowl. Centered Syst., 2020

Real-time tracking and mining of users' actions over social media.
Comput. Sci. Inf. Syst., 2020

Towards an Efficient Monitoring in Multi-hop Mobile Ad Hoc Networks.
Ad Hoc Sens. Wirel. Networks, 2020

A Generative Time Series Clustering Framework Based on an Ensemble Mixture of HMMs.
Proceedings of the 32nd IEEE International Conference on Tools with Artificial Intelligence, 2020

Simulated Annealing Approach for the Vehicle Routing Problem with Synchronized Visits.
Proceedings of the 9th International Conference on Operations Research and Enterprise Systems, 2020

A distributed large graph coloring algorithm on Giraph.
Proceedings of the 5th International Conference on Cloud Computing and Artificial Intelligence: Technologies and Applications, 2020

2019
Listing all maximal cliques in large graphs on vertex-centric model.
J. Supercomput., 2019

Diversified top-k search with relaxed graph simulation.
Soc. Netw. Anal. Min., 2019

New graph distance for deformable 3D objects recognition based on triangle-stars decomposition.
Pattern Recognit., 2019

A polynomial-time algorithm for finding critical nodes in bipartite permutation graphs.
Optim. Lett., 2019

Critical links detection in stochastic networks: application to the transport networks.
Int. J. Intell. Comput. Cybern., 2019

Business process graph matching based on vectorial signatures.
Int. J. Bus. Process. Integr. Manag., 2019

[1, 2]-Domination in generalized Petersen graphs.
Discret. Math. Algorithms Appl., 2019

A heuristic algorithm for a vehicle routing problem with pickup & delivery and synchronization constraints.
Proceedings of the 9th International Network Optimization Conference, 2019

La simulation relaxée de graphes pour la recherche de motifs.
Proceedings of the Extraction et Gestion des connaissances, 2019

Propagation d'événements dans un graphe économique.
Proceedings of the Extraction et Gestion des connaissances, 2019

Detection of Conflicts of Interest in Social Networks.
Proceedings of the Complex Networks and Their Applications VIII, 2019

New Graph Distance Based on Stable Marriage Formulation for Deformable 3D Objects Recognition.
Proceedings of the 16th IEEE/ACS International Conference on Computer Systems and Applications, 2019

2018
-equitable b-coloring of graphs.
Discret. Appl. Math., 2018

The Critical Node Detection Problem in networks: A survey.
Comput. Sci. Rev., 2018

Graph grammars according to the type of input and manipulated data: A survey.
Comput. Sci. Rev., 2018

Mining Patterns with Durations from E-Commerce Dataset.
Proceedings of the Complex Networks and Their Applications VII, 2018

Quasi-cliques Analysis for IRC Channel Thread Detection.
Proceedings of the Complex Networks and Their Applications VII, 2018

Fast Top-k Search with Relaxed Graph Simulation.
Proceedings of the IEEE/ACM 2018 International Conference on Advances in Social Networks Analysis and Mining, 2018

2017
A Graph-based approach for Kite recognition.
Pattern Recognit. Lett., 2017

A <i>O</i>(<i>m</i>) Self-Stabilizing Algorithm for Maximal Triangle Partition of General Graphs.
Parallel Process. Lett., 2017

On the parameterized complexity of the Edge Monitoring problem.
Inf. Process. Lett., 2017

A self-stabilizing algorithm for edge monitoring in wireless sensor networks.
Inf. Comput., 2017

Labeled embedding of <i>(n, n-2)</i>-graphs in their complements.
Discuss. Math. Graph Theory, 2017

A Vizing-like theorem for union vertex-distinguishing edge coloring.
Discret. Appl. Math., 2017

On some domination colorings of graphs.
Discret. Appl. Math., 2017

A Graph Matching Approach Based on Aggregated Search.
Proceedings of the 13th International Conference on Signal-Image Technology & Internet-Based Systems, 2017

LaSaS: an Aggregated Search based Graph Matching Approach.
Proceedings of the 29th International Conference on Software Engineering and Knowledge Engineering, 2017

Identifying the Cyber Attack Origin with Partial Observation: A Linear Regression Based Approach.
Proceedings of the 2nd IEEE International Workshops on Foundations and Applications of Self* Systems, 2017

Search and Aggregation in XML Documents.
Proceedings of the Database and Expert Systems Applications, 2017

Trust Based Monitoring Approach for Mobile Ad Hoc Networks.
Proceedings of the Ad-hoc, Mobile, and Wireless Networks, 2017

2016
Edge Monitoring Problem on Interval Graphs.
Electron. Notes Discret. Math., 2016

Component-cardinality-constrained critical node problem in graphs.
Discret. Appl. Math., 2016

Least Squares Method for Diffusion Source Localization in Complex Networks.
Proceedings of the Complex Networks & Their Applications V - Proceedings of the 5th International Workshop on Complex Networks and their Applications (COMPLEX NETWORKS 2016), Milan, Italy, November 30, 2016

Streaming METIS partitioning.
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.
Inf. Process. Lett., 2015

Efficient Self-Stabilizing Algorithm for Independent Strong Dominating Sets in Arbitrary Graphs.
Int. J. Found. Comput. Sci., 2015

Dominated Colorings of Graphs.
Graphs Comb., 2015

Decomposition of complete multigraphs into stars and cycles.
Discuss. Math. Graph Theory, 2015

Labeled 2-packings of trees.
Discret. Math., 2015

Saturated boundary k-alliances in graphs.
Discret. Appl. Math., 2015

Subdivision into i-packings and S-packing chromatic number of some lattices.
Ars Math. Contemp., 2015

Kite Recognition by Means of Graph Matching.
Proceedings of the Graph-Based Representations in Pattern Recognition, 2015

GraphExploiter: Creation, Visualization and Algorithms on graphs.
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.
Proceedings of the 2015 IEEE International Conference on Services Computing, 2015

Graph Edit Distance Based on Triangle-Stars Decomposition for Deformable 3D Objects Recognition.
Proceedings of the 2015 International Conference on 3D Vision, 2015

2014
A distance measure for large graphs based on prime graphs.
Pattern Recognit., 2014

Efficient self-stabilizing algorithms for minimal total k-dominating sets in graphs.
Inf. Process. Lett., 2014

Latent semantic analysis for business protocol discovery using log files.
Int. J. Web Eng. Technol., 2014

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

A self-organized system improving inner topology for data sharing efficiency.
Evol. Syst., 2014

On the family of r-regular graphs with Grundy number r+1.
Discret. Math., 2014

The b-chromatic number and f-chromatic vertex number of regular graphs.
Discret. Appl. Math., 2014

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

Monitoring in mobile ad hoc networks: A survey.
Comput. Networks, 2014

Efficient distributed lifetime optimization algorithm for sensor networks.
Ad Hoc Networks, 2014

A Self-stabilizing Algorithm for Edge Monitoring Problem.
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2014

Partial Restreaming Approach for Massive Graph Partitioning.
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.
Proceedings of the 2014 IEEE International Conference on Big Data (IEEE BigData 2014), 2014

2013
Self-stabilizing Consensus Average Algorithm in Distributed Sensor Networks.
Trans. Large Scale Data Knowl. Centered Syst., 2013

Coloring based approach for matching unrooted and/or unordered trees.
Pattern Recognit. Lett., 2013

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

Self-stabilizing algorithms for minimal global powerful alliance sets in graphs.
Inf. Process. Lett., 2013

Edge coloring total k-labeling of generalized Petersen graphs.
Inf. Process. Lett., 2013

Weighted graph-based methods for identifying the most influential actors in trust social networks.
Int. J. Netw. Virtual Organisations, 2013

A survey on tree matching and XML retrieval.
Comput. Sci. Rev., 2013

Robustness study of emerged communities from exchanges in peer-to-peer networks.
Comput. Commun., 2013

Labeled packings of graphs.
Australas. J Comb., 2013

A Self-stabilizing Algorithm for Maximal p-Star Decomposition of General Graphs.
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2013

Stabilization and Lifetime Optimization in Distributed Sensor Networks.
Proceedings of the 27th International Conference on Advanced Information Networking and Applications Workshops, 2013

Spectral Graph Approach for Process Model Matchmaking.
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.
J. Supercomput., 2012

Gap vertex-distinguishing edge colorings of graphs.
Discret. Math., 2012

Vertex Distinguishing Edge- and Total-Colorings of Cartesian and other Product Graphs.
Ars Comb., 2012

Self-stabilizing algorithm for maximal graph decomposition into disjoint paths of fixed length.
Proceedings of the 4th Workshop on Theoretical Aspects of Dynamic Distributed Systems, 2012

Self-stabilizing Algorithm for Maximal Graph Partitioning into Triangles.
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2012

A consistency rule for graph isomorphism problem.
Proceedings of the ACM Symposium on Applied Computing, 2012

A weighted-graph based approach for solving the cold start problem in collaborative recommender systems.
Proceedings of the 2012 IEEE Symposium on Computers and Communications, 2012

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

AdSIP: Decentralized SIP for Mobile Ad Hoc Networks.
Proceedings of the 26th International Conference on Advanced Information Networking and Applications Workshops, 2012

String Comparators Based Algorithms for Process Model Matchmaking.
Proceedings of the 2012 IEEE Ninth International Conference on Services Computing, 2012

2011
Web Service Matchmaking by Subgraph Matching.
Proceedings of the Web Information Systems and Technologies - 7th International Conference, 2011

A Graph Decomposition Approach to Web Service Matchmaking.
Proceedings of the WEBIST 2011, 2011

A summary-based approach for enhancing process model matchmaking.
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.
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.
Proceedings of the MEDES '11: International ACM Conference on Management of Emergent Digital EcoSystems, 2011

Distributed Lifetime Optimization in Wireless Sensor Networks.
Proceedings of the 13th IEEE International Conference on High Performance Computing & Communication, 2011

HMAN: Hierarchical Monitoring for Ad Hoc Network.
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.
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.
J. Parallel Distributed Comput., 2010

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

ECGK: An efficient clustering scheme for group key management in MANETs.
Comput. Commun., 2010

New Results about Set Colorings of Graphs.
Electron. J. Comb., 2010

Self-Organized Routing for Unstructured Peer-to-Peer Networks.
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.
Proceedings of the 2010 International Conference on Parallel and Distributed Computing, 2010

TopCoF: A Topology Control Framework for Wireless Ad Hoc Networks.
Proceedings of the Sixth International Conference on Mobile Ad-hoc and Sensor Networks, 2010

Community Comparison in Communication Networks.
Proceedings of the International Conference on Advances in Social Networks Analysis and Mining, 2010

2009
A strict strong coloring of trees.
Inf. Process. Lett., 2009

A Self-Stabilizing Web Services Communities Management Scheme.
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.
Proceedings of the 2009 International Conference on Parallel and Distributed Computing, 2009

Robustness of emerged community in social network.
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.
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.
Proceedings of the IEEE 23rd International Conference on Advanced Information Networking and Applications, 2009

McSOM: Minimal Coloring of Self-Organizing Map.
Proceedings of the Advanced Data Mining and Applications, 5th International Conference, 2009

2008
A Graph b-coloring Framework for Data Clustering.
J. Math. Model. Algorithms, 2008

Minimum Feedback Vertex Sets in Distance Graphs and Circulant Graphs.
Discret. Math. Theor. Comput. Sci., 2008

A cluster based mobility prediction scheme for ad hoc networks.
Ad Hoc Networks, 2008

Distance-2 Self-stabilizing Algorithm for a b-Coloring of Graphs.
Proceedings of the Stabilization, 2008

A distributed strict strong coloring algorithm for broadcast applications in ad hoc networks.
Proceedings of the 8th international conference on New technologies in distributed systems, 2008

A Fully Dynamic Distributed Algorithm for a B-Coloring of Graphs.
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.
Proceedings of the Foundations of Intelligent Systems, 17th International Symposium, 2008

A Self-stabilizing Algorithm for the Minimum Color Sum of a Graph.
Proceedings of the Distributed Computing and Networking, 9th International Conference, 2008

Message Correlation and Business Protocol Discovery in Service Interaction Logs.
Proceedings of the Advanced Information Systems Engineering, 20th International Conference, 2008

2007
Grundy number of graphs.
Discuss. Math. Graph Theory, 2007

A Graph-based Approach for Web Services Composition.
Proceedings of the WEBIST 2007, 2007

An Incremental Distributed Algorithm for a Partial Grundy Coloring of Graphs.
Proceedings of the Parallel and Distributed Processing and Applications, 2007

Graph based approaches for service oriented applications in ad hoc networks.
Proceedings of the IEEE International Conference on Pervasive Services, 2007

A Partially Dynamic Clustering Algorithm for Data Insertion and Removal.
Proceedings of the Discovery Science, 10th International Conference, 2007

2006
Adjacent vertex distinguishing edge-colorings of meshes.
Australas. J Comb., 2006

A Distributed Algorithm for a b-Coloring of a Graph.
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.
Proceedings of the Foundations of Intelligent Systems, 16th International Symposium, 2006

A New Clustering Approach for Symbolic Data: Algorithms and Application to Healthcare Data.
Proceedings of the 22èmes Journées Bases de Données Avancées, 2006

2005
Sum coloring of distance and circulant graphs.
Electron. Notes Discret. Math., 2005

The irregularity strength of circulant graphs.
Discret. Math., 2005

Distributed algorithms for Constructing and Maintaining a Spanning Tree in a Mobile Ad hoc Network.
Proceedings of the First International Workshop on Managing Context Information in Mobile and Pervasive Environments May 9, 2005

Embedding Plane Graphs in the Grids.
Proceedings of the 9th International Conference on Information Visualisation, 2005

2004
Skeletizing 3D-Objects by Projections.
Proceedings of the Computational Science and Its Applications, 2004

2003
Grundy coloring for power graphs.
Electron. Notes Discret. Math., 2003

The b-chromatic number of power graphs.
Discret. Math. Theor. Comput. Sci., 2003

On the packing of two copies of a caterpillar in its third power.
Discuss. Math. Graph Theory, 2003

A note on the packing of two copies of some trees into their third power.
Appl. Math. Lett., 2003

Computing Subdivision Surface Intersection.
Proceedings of the 11-th International Conference in Central Europe on Computer Graphics, 2003

A Graph Based Algorithm for Intersection of Subdivision Surfaces.
Proceedings of the Computational Science and Its Applications, 2003

2001
On the packing of trees into their power.
Electron. Notes Discret. Math., 2001

Remarks on Partially Square Graphs, Hamiltonicity and Circumference.
Discuss. Math. Graph Theory, 2001

On the packing of three graphs.
Discret. Math., 2001

2000
Partially Square Graphs, Hamiltonicity and Circumference II.
Electron. Notes Discret. Math., 2000

Packing two copies of a tree into its fourth power.
Discret. Math., 2000


  Loading...