Rachid Saad Coauthor index DBLP Vis pubzone.org

List of publications from the DBLP Bibliography Server - FAQ
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

DBLP keys2009
10Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLA. Abouelaoualim, V. Borozan, Yannis Manoussakis, Carlos A. J. Martinhon, R. Muthu, Rachid Saad: Colored Trees in Edge-Colored Graphs. CTW 2009: 115-119
2008
9Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLA. Abouelaoualim, Kinkar Chandra Das, L. Faria, Yannis Manoussakis, Carlos A. J. Martinhon, Rachid Saad: Paths and Trails in Edge-Colored Graphs. LATIN 2008: 723-735
8Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLA. Abouelaoualim, Kinkar Chandra Das, L. Faria, Yannis Manoussakis, Carlos A. J. Martinhon, Rachid Saad: Paths and trails in edge-colored graphs. Theor. Comput. Sci. 409(3): 497-510 (2008)
2004
7Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMohamed El Haddad, Yannis Manoussakis, Rachid Saad: Upper bounds for the forwarding indices of communication networks. Discrete Mathematics 286(3): 233-240 (2004)
2003
6Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLA. 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)
1996
5no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRachid Saad: Finding a Longest Alternating Cycle in a 2-edge-coloured Complete Graph is in RP. Combinatorics, Probability & Computing 5: 297-306 (1996)
1995
4Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJoë 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)
1993
3no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRachid Saad: Complexity of the Forwarding Index Problem. SIAM J. Discrete Math. 6(3): 418-427 (1993)
1992
2no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLWenceslas 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
1991
1no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLA. 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

Coauthor Index

1A. Abouelaoualim [8] [9] [10]
2A. Benkouar [1] [6]
3Joë Blot [4]
4V. Borozan [10]
5Kinkar Chandra Das [8] [9]
6L. Faria [8] [9]
7Mohamed El Haddad [7]
8Yannis Manoussakis [1] [6] [7] [8] [9] [10]
9Carlos A. J. Martinhon [8] [9] [10]
10R. Muthu [10]
11Vangelis Th. Paschos [1] [2] [4]
12Wenceslas Fernandez de la Vega [2] [4]

Copyright © Fri Dec 4 16:04:45 2009 by Michael Ley (ley@uni-trier.de)