Get started
Author

Rachid Saad

Complexity of the Forwarding Index Problem
1993 · Rachid Saad · SIAM Journal on Discrete Mathematics · 46
Paths and trails in edge-colored graphs
2008 · A. Abouelaoualim, K.Ch. Das, et al. · Theoretical Computer Science · 42
PDF
Hamiltonian problems in edge-colored complete graphs and eulerian cycles in edge-colored graphs : some complexity results
1996 · A. Benkouar, Y. Manoussakis, et al. · RAIRO - Operations Research · 26
PDF
Finding a Longest Alternating Cycle in a 2-edge-coloured Complete Graph is in RP
1996 · Rachid Saad · Combinatorics Probability Computing · 24
Cycles and paths in edge‐colored graphs with given degrees
2009 · A. Abouelaoualim,, K. Ch. Das, et al. · Journal of Graph Theory · 23
On the complexity of some Hamiltonian and Eulerian problems in edge-colored complete graphs
1991 · A. Benkouar, Y. G. Manoussakis, et al. · Lecture notes in computer science · 20
Solving Timetabling Problems by Hybridizing Genetic Algorithms and Tabu Search
2006 · Malek Rahoual, Rachid Saad, et al. · 15
Paths and Trails in Edge-Colored Graphs
2008 · A. Abouelaoualim, K. Ch. Das, et al. · Lecture notes in computer science · 11
Maximum colored trees in edge-colored graphs
2019 · V. Borozan, W. Fernandez de La Vega, et al. · European Journal of Combinatorics · 8
PDF
Average case analysis of a greedy algorithm for the minimum hitting set problem
2005 · W. Fernandez de la Vega, V. Th. Paschos, et al. · Springer eBooks · 8
Average case analysis of greedy algorithms for optimisation problems on set systems
1995 · Joël Blot, Wenceslas Fernande de la Vega, et al. · Theoretical Computer Science · 6
The number of 2-edge-colored complete graphs with unique hamiltonian alternating cycle
2003 · A. Benkouar, Y. Manoussakis, et al. · Discrete Mathematics · 5
PDF
An optimal schedule for Gaussian elimination on an MIMD architecture
2005 · Rachid Saad · Journal of Computational and Applied Mathematics · 4
PDF
Upper bounds for the forwarding indices of communication networks
2004 · M. El Haddad, Y. Manoussakis, et al. · Discrete Mathematics · 3
PDF
Solving Timetabling Problems by Hybridizing Genetic Algorithms and Taboo Search
2006 · Rahoual, Malek, Saad, Rachid · HAL · 2
Colored Trees in Edge-Colored Graphs.
2009 · A. Abouelaoualim, Valentin Borozan, et al. · Cologne Twente Workshop on Graphs and Combinatorial Optimization · 1
Sur quelques problemes de complexite en theorie des graphes
1992 · Rachid Saad · 1
Parallel Connectivity in Edge-Colored Complete Graphs: Complexity Results
2024 · Rachid Saad · Graphs and Combinatorics
Solving Timetabling Problems by Hybridizing Genetic Algorithms and Taboo Search and complexity
2006 · Rahoual, Malek, Saad, Rachid · HAL
Analyse en moyenne de la performance des algorithmes gloutons pour des problèmes d'optimisation sur des systèmes d'ensembles
1995 · Joël Blot, Wenceslas Fernandez de la Vega, et al. · Base Institutionnelle de Recherche de l'université Paris-Dauphine (BIRD) (University Paris-Dauphine)
Works count: 25
Citation count: 245
H-index: 8
I10-index: 8
Year
Topic
Type