default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRachid Saad
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2024
[j9]Rachid Saad:
Parallel Connectivity in Edge-Colored Complete Graphs: Complexity Results. Graphs Comb. 40(2): 25 (2024)- 2019
- [j8]Valentin Borozan, Wenceslas Fernandez de la Vega, Yannis Manoussakis, Carlos A. J. Martinhon, Rahul Muthu, Hong Phong Pham, Rachid Saad:
Maximum colored trees in edge-colored graphs. Eur. J. Comb. 80: 296-310 (2019) - 2010
- [j7]Abdelfattah Abouelaoualim, Kinkar Chandra Das, Wenceslas Fernandez de la Vega, Marek Karpinski, Yannis Manoussakis, Carlos A. J. Martinhon, Rachid Saad:
Cycles and paths in edge-colored graphs with given degrees. J. Graph Theory 64(1): 63-86 (2010) - 2008
- [j6]Abdelfattah Abouelaoualim, Kinkar Chandra Das, Luérbio 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
- [j5]Mohamed El Haddad, Yannis Manoussakis, Rachid Saad:
Upper bounds for the forwarding indices of communication networks. Discret. Math. 286(3): 233-240 (2004) - 2003
- [j4]A. Benkouar, Yannis Manoussakis, Rachid Saad:
The number of 2-edge-colored complete graphs with unique hamiltonian alternating cycle. Discret. Math. 263(1-3): 1-10 (2003) - 1996
- [j3]Rachid Saad:
Finding a Longest Alternating Cycle in a 2-edge-coloured Complete Graph is in RP. Comb. Probab. Comput. 5: 297-306 (1996) - 1995
- [j2]Joël 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
- [j1]Rachid Saad:
Complexity of the Forwarding Index Problem. SIAM J. Discret. Math. 6(3): 418-427 (1993)
Conference and Workshop Papers
- 2009
- [c4]Abdelfattah Abouelaoualim, Valentin Borozan, Yannis Manoussakis, Carlos A. J. Martinhon, Rahul Muthu, Rachid Saad:
Colored Trees in Edge-Colored Graphs. CTW 2009: 115-119 - 2008
- [c3]Abdelfattah Abouelaoualim, Kinkar Chandra Das, Luérbio Faria, Yannis Manoussakis, Carlos A. J. Martinhon, Rachid Saad:
Paths and Trails in Edge-Colored Graphs. LATIN 2008: 723-735 - 1992
- [c2]Wenceslas 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
- [c1]A. 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
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:46 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
