default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAhmed M. Assaf
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2008
[j23]R. Julian R. Abel, Ahmed M. Assaf:
Modified group divisible designs with block size 5 and even index. Discret. Math. 308(15): 3335-3351 (2008)- 2007
- [j22]R. Julian R. Abel, Ahmed M. Assaf, Frank E. Bennett, Iliya Bluskov, Malcolm Greig:
Pair covering designs with block size 5. Discret. Math. 307(14): 1776-1791 (2007) - 2003
- [j21]Ahmed M. Assaf, H. Alhalees, L. P. S. Singh:
Directed covering with block size 5 and v even. Australas. J Comb. 28: 3-24 (2003) - 2002
- [j20]R. Julian R. Abel, Ahmed M. Assaf:
Modified group divisible designs with block size 5 and lambda=1. Discret. Math. 256(1-2): 1-22 (2002) - [j19]Ahmed M. Assaf, H. Alhalees, L. P. S. Singh:
Directed Covering with Block Size 5 and Index Odd. Electron. Notes Discret. Math. 11: 30-52 (2002) - 2001
- [j18]Ahmed M. Assaf, Nabil Shalaby, Jianxing Yin:
Directed packing and covering designs with block size four. Discret. Math. 238(1-3): 3-17 (2001)
1990 – 1999
- 1999
- [j17]Ahmed M. Assaf, Ruizhong Wei:
Modified group divisible designs with block size 4 and lambda = 1. Discret. Math. 195(1-3): 15-25 (1999) - 1998
- [j16]Ahmed M. Assaf, Nabil Shalaby, Jianxing Yin:
Directed packings with block size 5. Australas. J Comb. 17: 235-256 (1998) - [j15]Ahmed M. Assaf:
Directed covering with block size 5 and index even. Discret. Math. 188(1-3): 27-40 (1998) - 1997
- [j14]Ahmed M. Assaf, L. P. S. Singh:
On covering designs with block size 5 and index 11≤λ≤21: the case v≡0(mod 4). Australas. J Comb. 15: 91-122 (1997) - [j13]Ahmed M. Assaf:
Modified group divisible designs with block size 4 and λ>1. Australas. J Comb. 16: 229-238 (1997) - [j12]Ahmed M. Assaf, Nabil Shalaby, L. P. S. Singh:
On Packing Designs with Block Size 5 and Indexes 3 and 6. Ars Comb. 45 (1997) - 1996
- [j11]Ahmed M. Assaf, A. Mahmoodi, Nabil Shalaby, Jianxing Yin:
Directed packings with block size 5 and odd v. Australas. J Comb. 13: 217-226 (1996) - 1995
- [j10]Ahmed M. Assaf:
On Covering Designs with Block Size 5 and Index 5. Des. Codes Cryptogr. 5(2): 91-107 (1995) - 1994
- [j9]Ahmed M. Assaf, L. P. S. Singh:
Packing pairs by quintuples with index 2: v odd, v != 13 (mod 20). Discret. Math. 126(1-3): 1-12 (1994) - [j8]Ahmed M. Assaf:
Bipacking pairs by quintuples: The case nu=13 (mod 20). Discret. Math. 133(1-3): 47-54 (1994) - [j7]Ahmed M. Assaf:
An Application of Modified Group Divisible Designs. J. Comb. Theory A 68(1): 152-168 (1994) - 1993
- [j6]Ahmed M. Assaf, Nabil Shalaby, L. P. S. Singh:
Packing Designs with Block Size 5 and Index 2: The Case v Even. J. Comb. Theory A 63(1): 43-54 (1993) - 1992
- [j5]Ahmed M. Assaf, Alan Hartman
, Nabil Shalaby:
Packing designs with block size 6 and index 5. Discret. Math. 103(2): 121-128 (1992) - [j4]Ahmed M. Assaf, Nabil Shalaby:
Packing Designs with Block Size 5 and Indexes 8, 12, 16. J. Comb. Theory A 59(1): 23-30 (1992) - 1991
- [j3]Ahmed M. Assaf:
The packing of pairs by quadruples. Discret. Math. 90(3): 221-231 (1991) - 1990
- [j2]Ahmed M. Assaf, Alan Hartman:
On packing designs with block size 5 and index 4. Discret. Math. 79(2): 111-121 (1990)
1980 – 1989
- 1989
- [j1]Ahmed M. Assaf, Alan Hartman:
Resolvable group divisible designs with block size 3. Discret. Math. 77(1-3): 5-20 (1989)
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-06-10 21:22 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:
