معرفی
Nabil Shalaby is a Professor of Mathematics at Memorial University of Newfoundland, where he holds an office in HH-3016. He earned his PhD from McMaster University and an MA from York University. His research focuses on Combinatorial Designs, Skolem sequences, coding theory applications, and graph labeling problems. He has contributed to seminal works on deletion-correcting codes, covering designs, and cyclic triple systems.
He has been recognized with the Motivational Teaching Award (2009). His research spans topics including perfect codes, hypergraph coverings, and combinatorial constructions. His publications frequently intersect graph theory and discrete mathematics, with notable contributions to both theoretical foundations and algorithmic applications.
While no current students or grants are listed, his work has been published in top-tier journals such as *Designs, Codes and Cryptography* and *Journal of Combinatorial Designs*. His research maintains a strong emphasis on structural combinatorics and practical applications in information theory.
