![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Mohamed El Haddad
Person information
Refine list
![note](https://dblp.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2018
- [j5]Sara Ahajjam, Mohamed El Haddad, Hassan Badir
:
A new scalable leader-community detection approach for community detection in social networks. Soc. Networks 54: 41-49 (2018) - 2016
- [c5]Sara Ahajjam, Mohamed El Haddad, Hassan Badir
:
Influentials identification for community detection in complex networks. CIST 2016: 111-115 - 2015
- [c4]Sara Ahajjam, Mohamed El Haddad, Hassan Badir
:
LeadersRank: Towards a new approach for community detection in social networks. AICCSA 2015: 1-8 - [c3]Sara Ahajjam, Hassan Badir, Mohamed El Haddad:
Towards a New Approach for Community Detection Algorithm in Social Networks. BDCA 2015: 23-28 - [c2]Sara Ahajjam, Hassan Badir
, Rachida Fissoune, Mohamed El Haddad:
Communities Identification Using Nodes Features. ISMIS 2015: 303-312
2000 – 2009
- 2004
- [j4]Mohamed El Haddad, Yannis Manoussakis, Rachid Saad:
Upper bounds for the forwarding indices of communication networks. Discret. Math. 286(3): 233-240 (2004)
1990 – 1999
- 1998
- [j3]Wenceslas Fernandez de la Vega, Mohamed El Haddad, Daniel Barraez, Oscar Ordaz:
The Forwarding Diameter of Graphs. Discret. Appl. Math. 86(2-3): 201-211 (1998) - 1997
- [j2]Jørgen Bang-Jensen
, Mohamed El Haddad, Yannis Manoussakis, Teresa M. Przytycka:
Parallel Algorithms for the Hamiltonian Cycle and Hamiltonian Path Problems in Semicomplete Bipartite Digraphs. Algorithmica 17(1): 67-87 (1997) - 1995
- [j1]Evripidis Bampis
, Mohamed El Haddad, Yannis Manoussakis, Miklos Santha:
A Parallel Reduction of Hamiltonian Cycle to Hamiltonian Path in Tournaments. J. Algorithms 19(3): 432-440 (1995) - 1993
- [c1]Evripidis Bampis, Mohamed El Haddad, Yannis Manoussakis, Miklos Santha:
A Parallel Reduction of Hamiltonian Cycle to Hamiltonian Path in Tournaments. PARLE 1993: 553-560
Coauthor Index
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:46 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint