Rachid Saad

A. Abouelaoualim, Kinkar Chandra Das, Wenceslas Fernandez de la Vega, Marek Karpinski, Yannis Manoussakis, Carlos A. J. Martinhon, Rachid Saad: Cycles and paths in edge-colored graphs with given degrees. Journal of Graph Theory 64(1): 63-86 (2010)

A. Abouelaoualim, Valentin Borozan, Yannis Manoussakis, Carlos A. J. Martinhon, R. Muthu, Rachid Saad: Colored Trees in Edge-Colored Graphs. CTW 2009: 115-119

A. Abouelaoualim, Kinkar Chandra Das, Luerbio Faria, Yannis Manoussakis, Carlos A. J. Martinhon, Rachid Saad: Paths and trails in edge-colored graphs. Theor. Comput. Sci. 409(3): 497-510 (2008)

A. Abouelaoualim, Kinkar Chandra Das, Luerbio Faria, Yannis Manoussakis, Carlos A. J. Martinhon, Rachid Saad: Paths and Trails in Edge-Colored Graphs. LATIN 2008: 723-735

Mohamed El Haddad, Yannis Manoussakis, Rachid Saad: Upper bounds for the forwarding indices of communication networks. Discrete Mathematics 286(3): 233-240 (2004)

A. Benkouar, Yannis Manoussakis, Rachid Saad: The number of 2-edge-colored complete graphs with unique hamiltonian alternating cycle. Discrete Mathematics 263(1-3): 1-10 (2003)

Rachid Saad: Finding a Longest Alternating Cycle in a 2-edge-coloured Complete Graph is in RP. Combinatorics, Probability & Computing 5: 297-306 (1996)

Joël Blot, Wenceslas Fernandez de la Vega, Vangelis Th. Paschos, Rachid Saad: Average Case Analysis of Greedy Algorithms for Optimisation Problems on Set Systems. Theor. Comput. Sci. 147(1&2): 267-298 (1995)

Rachid Saad: Complexity of the Forwarding Index Problem. SIAM J. Discrete Math. 6(3): 418-427 (1993)

Wenceslas Fernandez de la Vega, Vangelis Th. Paschos, Rachid Saad: Average Case Analysis of a Greedy Algorithm for the Minimum Hitting Set Problem. LATIN 1992: 130-138

A. Benkouar, Yannis Manoussakis, Vangelis Th. Paschos, Rachid Saad: On the Complexity of Some Hamiltonian and Eulerian Problems in Edge-Colored Complete Graphs. ISA 1991: 190-198