Mohammed Haddad

Orcid: 0000-0002-8699-7520

Affiliations:
  • Université Claude Bernard Lyon 1, France


According to our database1, Mohammed Haddad authored at least 55 papers between 2007 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Identity2Vec: learning mesoscopic structural identity representations via Poisson probability metric.
Int. J. Data Sci. Anal., April, 2024

DeepDense: Enabling node embedding to dense subgraph mining.
Expert Syst. Appl., March, 2024

2023
Improving node embedding by a compact neighborhood representation.
Neural Comput. Appl., March, 2023

A Fine-Grained Structural Partitioning Approach to Graph Compression.
Proceedings of the Big Data Analytics and Knowledge Discovery, 2023

Comparative study between quality measurement functions of a community distribution in a complex network.
Proceedings of the 14th International Conference on Ambient Systems, 2023

2022
Offline Arabic handwritten character recognition: from conventional machine learning system to deep learning approaches.
Int. J. Comput. Sci. Eng., 2022

Deep Convolutional Neural Network to improve the performances of screening process in LBVS.
Expert Syst. Appl., 2022

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

Hypergraphs with Polynomial Representation: Introducing r-splits.
CoRR, 2022

Guiding Random Walks by Effective Resistance for Effective Node Embedding.
Proceedings of the Pattern Recognition and Artificial Intelligence, 2022

Quasi-Clique Mining for Graph Summarization.
Proceedings of the Database and Expert Systems Applications, 2022

Decision-based Sampling for Node Context Representation.
Proceedings of the 8th International Conference on Control, 2022

2021
A Neighborhood-preserving Graph Summarization.
CoRR, 2021

2020
Energy-efficiency and coverage quality management for reliable diagnostics in wireless sensor networks.
Int. J. Sens. Networks, 2020

Efficient distributed average consensus in wireless sensor networks.
Comput. Commun., 2020

Polynomial Silent Self-Stabilizing p-Star Decomposition†.
Comput. J., 2020

2019
Word Spotting Based on Bispace Similarity for Visual Information Retrieval in Handwritten Document Images.
Int. J. Comput. Vis. Image Process., 2019

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

Evaluating Network Embedding Models for Machine Learning Tasks.
Proceedings of the Complex Networks and Their Applications VIII, 2019

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

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

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

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

Resiliency in Distributed Sensor Networks for PHM of the Monitoring Targets.
CoRR, 2016

Resiliency in Distributed Sensor Networks for Prognostics and Health Management of the Monitoring Targets.
Comput. J., 2016

Polynomial Silent Self-Stabilizing p-Star Decomposition (Short Paper).
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 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

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

2014
A self-organized system improving inner topology for data sharing efficiency.
Evol. Syst., 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

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

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

Robustness study of emerged communities from exchanges in peer-to-peer networks.
Comput. Commun., 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
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

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

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

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

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

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

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

Robustness of emerged community in social network.
Proceedings of the MEDES '09: International ACM Conference on Management of Emergent Digital EcoSystems, 2009

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

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


  Loading...