|
Search the dblp DataBase
Nabil Shalaby:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- Ahmed M. Assaf, Nabil Shalaby, L. P. S. Singh
On Packing Designs with Block Size 5 and Indexes 3 and 6. [Citation Graph (0, 0)][DBLP] Ars Comb., 1997, v:45, n:, pp:- [Journal]
- Eric Mendelsohn, Nabil Shalaby
On Skolem Labelling of Windmills. [Citation Graph (0, 0)][DBLP] Ars Comb., 1999, v:53, n:, pp:- [Journal]
- David A. Pike, Nabil Shalaby
The Use of Sklem Sequences to Generate Perfect One-Factorizations. [Citation Graph (0, 0)][DBLP] Ars Comb., 2001, v:59, n:, pp:- [Journal]
- Nabil Shalaby, Jianxing Yin
Maximum Complementary P3-Packings of Kv. [Citation Graph (0, 0)][DBLP] Ars Comb., 2003, v:66, n:, pp:- [Journal]
- Nabil Shalaby, Jianmin Wang, Jianxing Yin
Existence of Perfect 4-Deletion-Correcting Codes with Length Six. [Citation Graph (0, 0)][DBLP] Des. Codes Cryptography, 2002, v:27, n:1-2, pp:145-156 [Journal]
- Nabil Shalaby, Jianxing Yin
Directed Packings with Block Size 5 and Even v. [Citation Graph (0, 0)][DBLP] Des. Codes Cryptography, 1995, v:6, n:2, pp:133-142 [Journal]
- Nabil Shalaby, Jianxing Yin
Nested Optimal -Packings and -Coverings of Pairs with Triples. [Citation Graph (0, 0)][DBLP] Des. Codes Cryptography, 1998, v:15, n:3, pp:271-278 [Journal]
- Ahmed M. Assaf, Nabil Shalaby, Jianxing Yin
Directed packing and covering designs with block size four. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2001, v:238, n:1-3, pp:3-17 [Journal]
- Nabil Shalaby
The existence of near-Rosa and hooked near-Rosa sequences. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2003, v:261, n:1-3, pp:435-450 [Journal]
- Ahmed M. Assaf, Nabil Shalaby
Packing Designs with Block Size 5 and Indexes 8, 12, 16. [Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. A, 1992, v:59, n:1, pp:23-30 [Journal]
- Ahmed M. Assaf, Nabil Shalaby, L. P. S. Singh
Packing Designs with Block Size 5 and Index 2: The Case v Even. [Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. A, 1993, v:63, n:1, pp:43-54 [Journal]
- Sharon Koubi, Mannque Mata-Montero, Nabil Shalaby
Using directed hill-climbing for the construction of difference triangle sets. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 2005, v:51, n:1, pp:335-339 [Journal]
- Charles J. Colbourn, Rudolf Mathon, Alexander Rosa, Nabil Shalaby
The fine structure of threefold triple systems: u = 1 or 3 (mod 6). [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1991, v:92, n:1-3, pp:49-64 [Journal]
- Eric Mendelsohn, Nabil Shalaby
Skolem labelled graphs. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1991, v:97, n:1-3, pp:301-317 [Journal]
- Ahmed M. Assaf, Alan Hartman, Nabil Shalaby
Packing designs with block size 6 and index 5. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1992, v:103, n:2, pp:121-128 [Journal]
- Nabil Shalaby
The existence of near-Skolem and hooked near-Skolem sequences. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1994, v:135, n:1-3, pp:303-319 [Journal]
Kirkman frames having hole type hu m1 for small h. [Citation Graph (, )][DBLP]
Search in 0.005secs, Finished in 0.006secs
|