- CSB - MetaPress - Google - Bing - Yahoo
 | 2012 | |
|---|---|---|
| j20 |      | Daniela Silvesan, Nabil Shalaby: Cyclic block designs with block size 3 from Skolem-type sequences. Des. Codes Cryptography 63(3): 345-355 (2012) |
| j19 | | Nabil Shalaby, Daniela Silvesan: The intersection spectrum of Skolem sequences and its applications to λ-fold cyclic triple systems. Discrete Mathematics 312(12-13): 1985-1999 (2012) |
| 2011 | ||
| j18 | | Andrew T. Jesso, David A. Pike, Nabil Shalaby: Hamilton cycles in restricted block-intersection graphs. Des. Codes Cryptography 61(3): 345-353 (2011) |
| 2007 | ||
| j17 | | Gennian Ge, Rolf S. Rees, Nabil Shalaby: Kirkman frames having hole type hu m1 for small h. Des. Codes Cryptography 45(2): 157-184 (2007) |
| 2005 | ||
| j16 | | Sharon Koubi, Mannque Mata-Montero, Nabil Shalaby: Using directed hill-climbing for the construction of difference triangle sets. IEEE Transactions on Information Theory 51(1): 335-339 (2005) |
| 2003 | ||
| j15 |  | |
| j14 | | Nabil Shalaby: The existence of near-Rosa and hooked near-Rosa sequences. Discrete Mathematics 261(1-3): 435-450 (2003) |
| 2002 | ||
| j13 | | Nabil Shalaby, Jianmin Wang, Jianxing Yin: Existence of Perfect 4-Deletion-Correcting Codes with Length Six. Des. Codes Cryptography 27(1-2): 145-156 (2002) |
| 2001 | ||
| j12 | | David A. Pike, Nabil Shalaby: The Use of Sklem Sequences to Generate Perfect One-Factorizations. Ars Comb. 59 (2001) |
| j11 | | Ahmed M. Assaf, Nabil Shalaby, Jianxing Yin: Directed packing and covering designs with block size four. Discrete Mathematics 238(1-3): 3-17 (2001) |
| 1999 | ||
| j10 | | |
| 1998 | ||
| j9 | | Nabil Shalaby, Jianxing Yin: Nested Optimal -Packings and -Coverings of Pairs with Triples. Des. Codes Cryptography 15(3): 271-278 (1998) |
| 1997 | ||
| j8 | | 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) |
| 1995 | ||
| j7 | | Nabil Shalaby, Jianxing Yin: Directed Packings with Block Size 5 and Even v. Des. Codes Cryptography 6(2): 133-142 (1995) |
| 1994 | ||
| j6 | | Nabil Shalaby: The existence of near-Skolem and hooked near-Skolem sequences. Discrete Mathematics 135(1-3): 303-319 (1994) |
| 1993 | ||
| j5 | | 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, Ser. A 63(1): 43-54 (1993) |
| 1992 | ||
| j4 | | Ahmed M. Assaf, Alan Hartman, Nabil Shalaby: Packing designs with block size 6 and index 5. Discrete Mathematics 103(2): 121-128 (1992) |
| j3 | | Ahmed M. Assaf, Nabil Shalaby: Packing Designs with Block Size 5 and Indexes 8, 12, 16. J. Comb. Theory, Ser. A 59(1): 23-30 (1992) |
| 1991 | ||
| j2 | | Charles J. Colbourn, Rudolf Mathon, Alexander Rosa, Nabil Shalaby: The fine structure of threefold triple systems: u = 1 or 3 (mod 6). Discrete Mathematics 92(1-3): 49-64 (1991) |
| j1 | | Eric Mendelsohn, Nabil Shalaby: Skolem labelled graphs. Discrete Mathematics 97(1-3): 301-317 (1991) |
Colors in the list of coauthors
Last update Sun May 19 22:21:51 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page