
Search the dblp DataBase
Mohamed El Haddad:
[Publications]
[Author Rank by year]
[Coauthors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
 Evripidis Bampis, Mohamed El Haddad, Yannis Manoussakis, Miklos Santha
A Parallel Reduction of Hamiltonian Cycle to Hamiltonian Path in Tournaments. [Citation Graph (0, 0)][DBLP] PARLE, 1993, pp:553560 [Conf]
 Jørgen BangJensen, Mohamed El Haddad, Yannis Manoussakis, Teresa M. Przytycka
Parallel Algorithms for the Hamiltonian Cycle and Hamiltonian Path Problems in Semicomplete Bipartite Digraphs. [Citation Graph (0, 0)][DBLP] Algorithmica, 1997, v:17, n:1, pp:6787 [Journal]
 Wenceslas Fernandez de la Vega, Mohamed El Haddad, Daniel Barraez, Oscar Ordaz
The Forwarding Diameter of Graphs. [Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 1998, v:86, n:23, pp:201211 [Journal]
 Mohamed El Haddad, Yannis Manoussakis, Rachid Saad
Upper bounds for the forwarding indices of communication networks. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2004, v:286, n:3, pp:233240 [Journal]
 Evripidis Bampis, Mohamed El Haddad, Yannis Manoussakis, Miklos Santha
A Parallel Reduction of Hamiltonian Cycle to Hamiltonian Path in Tournaments. [Citation Graph (0, 0)][DBLP] J. Algorithms, 1995, v:19, n:3, pp:432440 [Journal]
Search in 0.001secs, Finished in 0.002secs
