default search action
Nabil Shalaby
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
- [j33]Farej Omer
, Nabil Shalaby:
Starter sequences and M-fold starter sequences: How can you begin? Discret. Math. Algorithms Appl. 12(4): 2050048:1-2050048:19 (2020)
2010 – 2019
- 2019
- [j32]Danny Dyer, Sadegheh Haghshenas, Nabil Shalaby:
The spectrum of optimal excess graphs for trees with up to four edges. AKCE Int. J. Graphs Comb. 16(3): 272-279 (2019) - 2016
- [j31]Danny Dyer, Sadegheh Haghshenas, Nabil Shalaby:
Constructing the Spectrum of Packings and Coverings for the Complete Graph with Stars with up to Five Edges. Graphs Comb. 32(3): 943-961 (2016) - 2014
- [j30]Nabil Shalaby, Daniela Silvesan:
The intersection spectrum of hooked Skolem sequences and applications. Discret. Appl. Math. 167: 239-260 (2014) - [j29]Václav Linek, Shai J. Mor, Nabil Shalaby:
Skolem and Rosa rectangles and related designs. Discret. Math. 331: 53-73 (2014) - 2013
- [j28]Manrique Mata-Montero, Nabil Shalaby, Bradley Sheppard
Efficient Serial and Parallel Algorithms for Selection of Unique Oligos in EST Databases. Adv. Bioinformatics 2013: 793130:1-793130:6 (2013) - 2012
- [j27]Danny Dyer, Ian Payne, Nabil Shalaby, Brenda Wicks:
On the graceful labelling of triangular cacti conjecture. Australas. J Comb. 53: 151-170 (2012) - [j26]Daniela Silvesan, Nabil Shalaby:
Cyclic block designs with block size 3 from Skolem-type sequences. Des. Codes Cryptogr. 63(3): 345-355 (2012) - [j25]Nabil Shalaby, Daniela Silvesan:
The intersection spectrum of Skolem sequences and its applications to λ-fold cyclic triple systems. Discret. Math. 312(12-13): 1985-1999 (2012) - 2011
- [j24]Andrew T. Jesso, David A. Pike, Nabil Shalaby:
Hamilton cycles in restricted block-intersection graphs. Des. Codes Cryptogr. 61(3): 345-353 (2011)
2000 – 2009
- 2008
- [j23]Václav Linek, Nabil Shalaby:
The existence of (p, q)-extended Rosa sequences. Discret. Math. 308(9): 1583-1602 (2008) - 2007
- [j22]Alasdair Graham, David A. Pike, Nabil Shalaby:
Skolem labelled trees and Ps□Pt Cartesian products. Australas. J Comb. 38: 101-116 (2007) - [j21]Gennian Ge, Rolf S. Rees, Nabil Shalaby:
Kirkman frames having hole type hu m1 for small h. Des. Codes Cryptogr. 45(2): 157-184 (2007) - 2005
- [j20]Sharon Koubi, Manrique Mata-Montero, Nabil Shalaby:
Using directed hill-climbing for the construction of difference triangle sets. IEEE Trans. Inf. Theory 51(1): 335-339 (2005) - 2003
- [j19]Nabil Shalaby, Jianxing Yin:
Maximum Complementary P3-Packings of Kv. Ars Comb. 66 (2003) - [j18]Nabil Shalaby:
The existence of near-Rosa and hooked near-Rosa sequences. Discret. Math. 261(1-3): 435-450 (2003) - 2002
- [j17]Nabil Shalaby, Jianmin Wang, Jianxing Yin:
Existence of Perfect 4-Deletion-Correcting Codes with Length Six. Des. Codes Cryptogr. 27(1-2): 145-156 (2002) - 2001
- [j16]David A. Pike, Nabil Shalaby:
The Use of Sklem Sequences to Generate Perfect One-Factorizations. Ars Comb. 59 (2001) - [j15]Ahmed M. Assaf, Nabil Shalaby, Jianxing Yin:
Directed packing and covering designs with block size four. Discret. Math. 238(1-3): 3-17 (2001) - 2000
- [j14]Rolf S. Rees, Nabil Shalaby, Ahmad Sharary:
Indecomposable Skolem and Rosa sequences. Australas. J Comb. 21: 3-12 (2000)
1990 – 1999
- 1999
- [j13]Eric Mendelsohn, Nabil Shalaby:
On Skolem Labelling of Windmills. Ars Comb. 53 (1999) - 1998
- [j12]Ahmed M. Assaf, Nabil Shalaby, Jianxing Yin:
Directed packings with block size 5. Australas. J Comb. 17: 235-256 (1998) - [j11]Nabil Shalaby, Jianxing Yin:
Nested Optimal -Packings and -Coverings of Pairs with Triples. Des. Codes Cryptogr. 15(3): 271-278 (1998) - 1997
- [j10]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
- [j9]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
- [j8]Nabil Shalaby, Jianxing Yin:
Directed Packings with Block Size 5 and Even v. Des. Codes Cryptogr. 6(2): 133-142 (1995) - 1994
- [j7]Nabil Shalaby:
The existence of near-Skolem and hooked near-Skolem sequences. Discret. Math. 135(1-3): 303-319 (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
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]Charles J. Colbourn, Rudolf Mathon, Nabil Shalaby:
The fine structure of threefold triple systems: v≡5(mod 6). Australas. J Comb. 3: 75-92 (1991) - [j2]Charles J. Colbourn, Rudolf Mathon, Alexander Rosa, Nabil Shalaby:
The fine structure of threefold triple systems: u = 1 or 3 (mod 6). Discret. Math. 92(1-3): 49-64 (1991) - [j1]Eric Mendelsohn, Nabil Shalaby:
Skolem labelled graphs. Discret. Math. 97(1-3): 301-317 (1991)
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:21 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: