Search the dblp DataBase
Rachid Saad :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Publications of Author
A. Benkouar , Yannis Manoussakis , Vangelis Th. Paschos , Rachid Saad On the Complexity of Some Hamiltonian and Eulerian Problems in Edge-Colored Complete Graphs. [Citation Graph (0, 0)][DBLP ] ISA, 1991, pp:190-198 [Conf ] Wenceslas Fernandez de la Vega , Vangelis Th. Paschos , Rachid Saad Average Case Analysis of a Greedy Algorithm for the Minimum Hitting Set Problem. [Citation Graph (0, 0)][DBLP ] LATIN, 1992, pp:130-138 [Conf ] Rachid Saad Finding a Longest Alternating Cycle in a 2-edge-coloured Complete Graph is in RP. [Citation Graph (0, 0)][DBLP ] Combinatorics, Probability & Computing, 1996, v:5, n:, pp:297-306 [Journal ] A. Benkouar , Yannis Manoussakis , Rachid Saad The number of 2-edge-colored complete graphs with unique hamiltonian alternating cycle. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2003, v:263, n:1-3, pp:1-10 [Journal ] Mohamed El Haddad , Yannis Manoussakis , Rachid Saad Upper bounds for the forwarding indices of communication networks. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2004, v:286, n:3, pp:233-240 [Journal ] Rachid Saad Complexity of the Forwarding Index Problem. [Citation Graph (0, 0)][DBLP ] SIAM J. Discrete Math., 1993, v:6, n:3, pp:418-427 [Journal ] Joë Blot , Wenceslas Fernandez de la Vega , Vangelis Th. Paschos , Rachid Saad Average Case Analysis of Greedy Algorithms for Optimisation Problems on Set Systems. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1995, v:147, n:1&2, pp:267-298 [Journal ] Paths and Trails in Edge-Colored Graphs. [Citation Graph (, )][DBLP ] Colored Trees in Edge-Colored Graphs. [Citation Graph (, )][DBLP ] Search in 0.002secs, Finished in 0.003secs