Rachid Saad

According to our database, Rachid Saad authored at least 12 papers between 1991 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

Parallel Connectivity in Edge-Colored Complete Graphs: Complexity Results.

Rachid Saad

Graphs Comb., April, 2024

2019

Maximum colored trees in edge-colored graphs.

Valentin Borozan, Wenceslas Fernandez de la Vega, Yannis Manoussakis, Carlos A. J. Martinhon, Rahul Muthu, Hong Phong Pham, Rachid Saad

Eur. J. Comb., 2019

2010

Cycles and paths in edge-colored graphs with given degrees.

Abdelfattah Abouelaoualim, Kinkar Chandra Das, Wenceslas Fernandez de la Vega, Marek Karpinski, Yannis Manoussakis, Carlos A. J. Martinhon, Rachid Saad

J. Graph Theory, 2010

2009

Colored Trees in Edge-Colored Graphs.

Abdelfattah Abouelaoualim, Valentin Borozan, Yannis Manoussakis, Carlos A. J. Martinhon, Rahul Muthu, Rachid Saad

Proceedings of the 8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2009

2008

Paths and trails in edge-colored graphs.

Abdelfattah Abouelaoualim, Kinkar Chandra Das, Luérbio Faria, Yannis Manoussakis, Carlos A. J. Martinhon, Rachid Saad

Theor. Comput. Sci., 2008

2004

Upper bounds for the forwarding indices of communication networks.

Mohamed El Haddad, Yannis Manoussakis, Rachid Saad

Discret. Math., 2004

2003

The number of 2-edge-colored complete graphs with unique hamiltonian alternating cycle.

A. Benkouar, Yannis Manoussakis, Rachid Saad

Discret. Math., 2003

1996

Finding a Longest Alternating Cycle in a 2-edge-coloured Complete Graph is in RP.

Rachid Saad

Comb. Probab. Comput., 1996

1995

Average Case Analysis of Greedy Algorithms for Optimisation Problems on Set Systems.

Joël Blot, Wenceslas Fernandez de la Vega, Vangelis Th. Paschos, Rachid Saad

Theor. Comput. Sci., 1995

1993

Complexity of the Forwarding Index Problem.

Rachid Saad

SIAM J. Discret. Math., 1993

1992

Average Case Analysis of a Greedy Algorithm for the Minimum Hitting Set Problem.

Wenceslas Fernandez de la Vega, Vangelis Th. Paschos, Rachid Saad

Proceedings of the LATIN '92, 1992

1991

On the Complexity of Some Hamiltonian and Eulerian Problems in Edge-Colored Complete Graphs.

A. Benkouar, Yannis Manoussakis, Vangelis Th. Paschos, Rachid Saad

Proceedings of the ISA '91 Algorithms, 1991