Mohamed El Haddad

According to our database, Mohamed El Haddad authored at least 9 papers between 1995 and 2018.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2018

A new scalable leader-community detection approach for community detection in social networks.

Sara Ahajjam, Mohamed El Haddad, Hassan Badir

Soc. Networks, 2018

2016

Influentials identification for community detection in complex networks.

Sara Ahajjam, Mohamed El Haddad, Hassan Badir

Proceedings of the 4th IEEE International Colloquium on Information Science and Technology, 2016

2015

Communities Identification Using Nodes Features.

Sara Ahajjam, Hassan Badir, Rachida Fissoune, Mohamed El Haddad

Proceedings of the Foundations of Intelligent Systems - 22nd International Symposium, 2015

Towards a New Approach for Community Detection Algorithm in Social Networks.

Sara Ahajjam, Hassan Badir, Mohamed El Haddad

Proceedings of the International Conference on Big Data, 2015

LeadersRank: Towards a new approach for community detection in social networks.

Sara Ahajjam, Mohamed El Haddad, Hassan Badir

Proceedings of the 12th IEEE/ACS International Conference of Computer Systems and Applications, 2015

2004

Upper bounds for the forwarding indices of communication networks.

Mohamed El Haddad, Yannis Manoussakis, Rachid Saad

Discret. Math., 2004

1998

The Forwarding Diameter of Graphs.

Wenceslas Fernandez de la Vega, Mohamed El Haddad, Daniel Barraez, Oscar Ordaz

Discret. Appl. Math., 1998

1997

Parallel Algorithms for the Hamiltonian Cycle and Hamiltonian Path Problems in Semicomplete Bipartite Digraphs.

Jørgen Bang-Jensen, Mohamed El Haddad, Yannis Manoussakis, Teresa M. Przytycka

Algorithmica, 1997

1995

A Parallel Reduction of Hamiltonian Cycle to Hamiltonian Path in Tournaments.

Evripidis Bampis, Mohamed El Haddad, Yannis Manoussakis, Miklos Santha

J. Algorithms, 1995