Nabil Shalaby

Professor of Mathematics

PhD McMaster, FTICA
MA York
Motivational Teaching Award, 2009

Office: HH-3016
Phone: (709) 864-8796
Fax: (709) 864-3010

Personal website


My research focuses mainly on Combinatorial Designs, Skolem type sequences, covering and packing design with applications. Also some graph labeling problems. Representative of my research is:

  • Shalaby, Nabil; Wang, Jianmin; Yin, Jianxing Existence of perfect 4-deletion-correcting codes with length six. Special issue in honour of Ronald C. Mullin, Part II. Des. Codes Cryptogr. 27 (2002), no. 1-2, 145-156. MR 1 923 400.
  • Rees, R.; Shalaby, N.; Yin, J. Minimum complementary $Psb 3$-coverings of $Ksb v$. Util. Math. 60 (2001), 41-49. MR 2002i:05094.
  • Pike, David A.; Shalaby, Nabil The use of Skolem sequences to generate perfect one-factorizations. Ars Combin. 59 (2001), 153-159. MR 2002a:05202.
  • Rees, Rolf; Shalaby, Nabil Simple and indecomposable twofold cyclic triple systems from Skolem sequences. J. Combin. Des. 8 (2000), no. 6, 402-410. (Reviewer: A. Rosa) MR 2001i:05034.
  • Assaf, Ahmed M.; Shalaby, N.; Yin, J. Directed packings with block size $5$. Australas. J. Combin. 17 (1998), 245-256. MR 99d:05019.