Home › Researcher directory › Hamamache Kheddouci
Hamamache Kheddouci
Affiliation : Lyon 1 Université · Centre National de la Recherche Scientifique · Laboratoire d'Informatique en Images et Systèmes d'Information
- 49Publications (affiliation in France)
- 283Total publications
- 1708Citations
- 17h-index
Research profile
Hamamache Kheddouci has 49 indexed publications (2009–2026). Their work appears mainly in “Discrete Applied Mathematics”, “The Journal of Supercomputing” and “Lecture notes in computer science”. Their most cited article, “The Critical Node Detection Problem in networks: A survey” (2018), has been cited 313 times. 4 of these publications date from the last three years of activity. Their work is co-authored with at least 12 researchers, including institutions in Algeria.
Is this you? Get your research seen
Create your free DzCademia profile and add your articles: they will show up more easily on Google and in AI assistants like ChatGPT, so more people can read and cite your work.
Create my free profile Add my publicationsResearch areas
- Advanced Graph Theory Research
- Complexity and Algorithms in Graphs
- Graph Labeling and Dimension Problems
- Graph Theory and Algorithms
- Complex Network Analysis Techniques
Publications (49)
- Influence maximization: a local branching algorithm for solving the positive influence dominating set problem
- A BRANCH AND BOUND ALGORITHM FOR FINDING THE POSITIVE INFLUENCE DOMINATING SET ON CHORDAL GRAPHS
- Giraph-Based Distributed Algorithms for Coloring Large-Scale Graphs
- GPU-accelerated relaxed graph pattern matching algorithms
- A new distributed graph coloring algorithm for large graphs
- A Graph Matching Approach by Aggregated Search
- Distributed graph pattern matching via bounded dual simulation
- A New Approach for Employee Attrition Prediction
- Fast parallel algorithms for finding elementary circuits of a directed graph: a GPU-based approach
- Complexity of edge monitoring on some graph classes
- A Survey on Distributed Graph Pattern Matching in Massive Graphs
- Efficient parallel edge-centric approach for relaxed graph pattern matching
- On the double total dominator chromatic number of graphs
- Continuous energy-efficient monitoring model for mobile ad hoc networks
- Packing three copies of a tree into its sixth power
- On P5-free locally split graphs
- A distributed large graph coloring algorithm on Giraph
- A graph grammar and $$K_{4}$$-type tournament-based approach to detect conflicts of interest in a social network
- Listing all maximal cliques in large graphs on vertex-centric model
- Business process graph matching based on vectorial signatures
- [1,2]-Domination in generalized Petersen graphs
- Detection of Conflicts of Interest in Social Networks
- Business process graph matching based on vectorial signatures
- The Critical Node Detection Problem in networks: A survey
- A polynomial-time algorithm for finding critical nodes in bipartite permutation graphs
- Critical links detection in stochastic networks: application to the transport networks
- Graph grammars according to the type of input and manipulated data: A survey
- On some domination colorings of graphs
- Identifying the Cyber Attack Origin with Partial Observation: A Linear Regression Based Approach
- Trust Based Monitoring Approach for Mobile Ad Hoc Networks
- (N,p) -equitable b-coloring of graphs
- CSCF: Clustering based-approach for social collaborative filtering
- Least Squares Method for Diffusion Source Localization in Complex Networks
- Component-cardinality-constrained critical node problem in graphs
- Efficient Self-Stabilizing Algorithm for Independent Strong Dominating Sets in Arbitrary Graphs
- A Graph Approach for Enhancing Process Models Matchmaking
- Dominated Colorings of Graphs
- Efficient self-stabilizing algorithms for minimal total k-dominating sets in graphs
- Saturated boundary k -alliances in graphs
- Latent semantic analysis for business protocol discovery using log files
- Self-stabilizing algorithms for minimal global powerful alliance sets in graphs
- Spectral Graph Approach for Process Model Matchmaking
- Weighted graph-based methods for identifying the most influential actors in trust social networks
- AdSIP: Decentralized SIP for Mobile Ad Hoc Networks
- A weighted-graph based approach for solving the cold start problem in collaborative recommender systems
- A consistency rule for graph isomorphism problem
- HMAN: Hierarchical Monitoring for Ad Hoc Network
- TopCoF: A Topology Control Framework for Wireless Ad Hoc Networks
- A survey on self-stabilizing algorithms for independence, domination, coloring, and matching in graphs
Publication venues
- Discrete Applied Mathematics × 5
- The Journal of Supercomputing × 4
- Lecture notes in computer science × 2
- Discrete Mathematics Algorithms and Applications × 2
- International Journal of Business Process Integration and Management × 2
- Studies in computational intelligence × 2
Publications per year
- 20262
- 20242
- 20232
- 20224
- 20216
- 20202
- 20195
- 20184
- 20175
- 20161
Collaborations
Partner institutions : Université de Lyon · University of Béjaïa · Centre de Recherche sur l'Information Scientifique et Technique · École Nationale Supérieure d'Informatique · Université de Bourgogne
Co-authors’ countries : Algeria
Co-authors
- Mohammed Haddad
- Mohammed Lalou
- Yacine Belhoul
- Sarra Bouhenni
- Saïd Yahiaoui
- Guillaume Bagan
- Abdallah Makhoul
- Mohammed Amin Tahraoui
- Mokrane Bouzeghoub
- Ahmed Gater
- Lydia Douaidi
- Fairouz Beggas
Bibliographic data from OpenAlex (open database).
Why choose DzCademia?
Profiles, articles and conference contributions: give your research a structured public presence. Integrated metadata help search engines and AI assistants identify your work and understand its references.
Comment with Google
Sign in with Google to comment directly on this page.