A Parallel Reduction of Hamiltonian Cycle to Hamiltonian Path in Tournaments. - Evripidis Bampis; Mohamed El Haddad; Yannis Manoussakis; Miklos Santha (J. Algorithms, 1995)

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)

The Forwarding Diameter of Graphs. - Wenceslas Fernandez de la Vega; Mohamed El Haddad; Daniel Barraez; Oscar Ordaz (Discret. Appl. Math., 1998)

Upper bounds for the forwarding indices of communication networks. - Mohamed El Haddad; Yannis Manoussakis; Rachid Saad (Discret. Math., 2004)

LeadersRank: Towards a new approach for community detection in social networks. - Sara Ahajjam; Mohamed El Haddad; Hassan Badir (AICCSA, 2015)

Towards a New Approach for Community Detection Algorithm in Social Networks. - Sara Ahajjam; Hassan Badir; Mohamed El Haddad (BDCA, 2015)

Communities Identification Using Nodes Features. - Sara Ahajjam; Hassan Badir; Rachida Fissoune; Mohamed El Haddad (ISMIS, 2015)

Influentials identification for community detection in complex networks. - Sara Ahajjam; Mohamed El Haddad; Hassan Badir (CIST, 2016)

A new scalable leader-community detection approach for community detection in social networks. - Sara Ahajjam; Mohamed El Haddad; Hassan Badir (Soc. Networks, 2018)