Rachid Saad

13 papers B 2C 1Journal 9Unranked 1
YearRankTypeTitle / Venue / Authors
2024 J jnl
Parallel Connectivity in Edge-Colored Complete Graphs: Complexity Results.
Graphs Comb.
Rachid Saad
2019 J jnl
Maximum colored trees in edge-colored graphs.
Eur. J. Comb.
Valentin Borozan, Wenceslas Fernandez de la Vega, Yannis Manoussakis, Carlos A. J. Martinhon, Rahul Muthu, Hong Phong Pham, Rachid Saad
2010 J jnl
Cycles and paths in edge-colored graphs with given degrees.
J. Graph Theory
Abdelfattah Abouelaoualim, Kinkar Chandra Das, Wenceslas Fernandez de la Vega, Marek Karpinski, Yannis Manoussakis, Carlos A. J. Martinhon, Rachid Saad
2009 C conf
Colored Trees in Edge-Colored Graphs.
CTW
Abdelfattah Abouelaoualim, Valentin Borozan, Yannis Manoussakis, Carlos A. J. Martinhon, Rahul Muthu, Rachid Saad
2008 B conf
Paths and Trails in Edge-Colored Graphs.
LATIN
Abdelfattah Abouelaoualim, Kinkar Chandra Das, Luérbio Faria, Yannis Manoussakis, Carlos A. J. Martinhon, Rachid Saad
2008 J jnl
Paths and trails in edge-colored graphs.
Theor. Comput. Sci.
Abdelfattah Abouelaoualim, Kinkar Chandra Das, Luérbio Faria, Yannis Manoussakis, Carlos A. J. Martinhon, Rachid Saad
2004 J jnl
Upper bounds for the forwarding indices of communication networks.
Discret. Math.
Mohamed El Haddad, Yannis Manoussakis, Rachid Saad
2003 J jnl
The number of 2-edge-colored complete graphs with unique hamiltonian alternating cycle.
Discret. Math.
A. Benkouar, Yannis Manoussakis, Rachid Saad
1996 J jnl
Finding a Longest Alternating Cycle in a 2-edge-coloured Complete Graph is in RP.
Comb. Probab. Comput.
Rachid Saad
1995 J jnl
Average Case Analysis of Greedy Algorithms for Optimisation Problems on Set Systems.
Theor. Comput. Sci.
Joël Blot, Wenceslas Fernandez de la Vega, Vangelis Th. Paschos, Rachid Saad
1993 J jnl
Complexity of the Forwarding Index Problem.
SIAM J. Discret. Math.
Rachid Saad
1992 B conf
Average Case Analysis of a Greedy Algorithm for the Minimum Hitting Set Problem.
LATIN
Wenceslas Fernandez de la Vega, Vangelis Th. Paschos, Rachid Saad
1991 — conf
On the Complexity of Some Hamiltonian and Eulerian Problems in Edge-Colored Complete Graphs.
ISA
A. Benkouar, Yannis Manoussakis, Vangelis Th. Paschos, Rachid Saad