| 2004 |
|---|
| 5 | EE | Mohamed El Haddad,
Yannis Manoussakis,
Rachid Saad:
Upper bounds for the forwarding indices of communication networks.
Discrete Mathematics 286(3): 233-240 (2004) |
| 1998 |
|---|
| 4 | EE | Wenceslas Fernandez de la Vega,
Mohamed El Haddad,
Daniel Barraez,
Oscar Ordaz:
The Forwarding Diameter of Graphs.
Discrete Applied Mathematics 86(2-3): 201-211 (1998) |
| 1997 |
|---|
| 3 | | 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 |
|---|
| 2 | | 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 |
|---|
| 1 | | Evripidis Bampis,
Mohamed El Haddad,
Yannis Manoussakis,
Miklos Santha:
A Parallel Reduction of Hamiltonian Cycle to Hamiltonian Path in Tournaments.
PARLE 1993: 553-560 |
