Nabil Shalaby

According to our database, Nabil Shalaby authored at least 33 papers between 1991 and 2020.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2020

Starter sequences and M-fold starter sequences: How can you begin?

Farej Omer, Nabil Shalaby

Discret. Math. Algorithms Appl., 2020

2019

The spectrum of optimal excess graphs for trees with up to four edges.

Danny Dyer, Sadegheh Haghshenas, Nabil Shalaby

AKCE Int. J. Graphs Comb., 2019

2016

Constructing the Spectrum of Packings and Coverings for the Complete Graph with Stars with up to Five Edges.

Danny Dyer, Sadegheh Haghshenas, Nabil Shalaby

Graphs Comb., 2016

2014

Skolem and Rosa rectangles and related designs.

Václav Linek, Shai J. Mor, Nabil Shalaby

Discret. Math., 2014

The intersection spectrum of hooked Skolem sequences and applications.

Nabil Shalaby, Daniela Silvesan

Discret. Appl. Math., 2014

2013

Efficient Serial and Parallel Algorithms for Selection of Unique Oligos in EST Databases.

Manrique Mata-Montero, Nabil Shalaby, Bradley Sheppard

Adv. Bioinformatics, 2013

2012

The intersection spectrum of Skolem sequences and its applications to λ-fold cyclic triple systems.

Nabil Shalaby, Daniela Silvesan

Discret. Math., 2012

Cyclic block designs with block size 3 from Skolem-type sequences.

Daniela Silvesan, Nabil Shalaby

Des. Codes Cryptogr., 2012

On the graceful labelling of triangular cacti conjecture.

Danny Dyer, Ian Payne, Nabil Shalaby, Brenda Wicks

Australas. J Comb., 2012

2011

Hamilton cycles in restricted block-intersection graphs.

Andrew T. Jesso, David A. Pike, Nabil Shalaby

Des. Codes Cryptogr., 2011

2008

The existence of (p, q)-extended Rosa sequences.

Václav Linek, Nabil Shalaby

Discret. Math., 2008

2007

Kirkman frames having hole type h^u m¹ for small h.

Gennian Ge, Rolf S. Rees, Nabil Shalaby

Des. Codes Cryptogr., 2007

Skolem labelled trees and P_s□P_t Cartesian products.

Alasdair Graham, David A. Pike, Nabil Shalaby

Australas. J Comb., 2007

2005

Using directed hill-climbing for the construction of difference triangle sets.

Sharon Koubi, Manrique Mata-Montero, Nabil Shalaby

IEEE Trans. Inf. Theory, 2005

2003

The existence of near-Rosa and hooked near-Rosa sequences.

Nabil Shalaby

Discret. Math., 2003

Maximum Complementary P3-Packings of Kv.

Nabil Shalaby, Jianxing Yin

Ars Comb., 2003

2002

Existence of Perfect 4-Deletion-Correcting Codes with Length Six.

Nabil Shalaby, Jianmin Wang, Jianxing Yin

Des. Codes Cryptogr., 2002

2001

Directed packing and covering designs with block size four.

Ahmed M. Assaf, Nabil Shalaby, Jianxing Yin

Discret. Math., 2001

The Use of Sklem Sequences to Generate Perfect One-Factorizations.

David A. Pike, Nabil Shalaby

Ars Comb., 2001

2000

Indecomposable Skolem and Rosa sequences.

Rolf S. Rees, Nabil Shalaby, Ahmad Sharary

Australas. J Comb., 2000

1999

On Skolem Labelling of Windmills.

Eric Mendelsohn, Nabil Shalaby

Ars Comb., 1999

1998

Nested Optimal -Packings and -Coverings of Pairs with Triples.

Nabil Shalaby, Jianxing Yin

Des. Codes Cryptogr., 1998

Directed packings with block size 5.

Ahmed M. Assaf, Nabil Shalaby, Jianxing Yin

Australas. J Comb., 1998

1997

On Packing Designs with Block Size 5 and Indexes 3 and 6.

Ahmed M. Assaf, Nabil Shalaby, L. P. S. Singh

Ars Comb., 1997

1996

Directed packings with block size 5 and odd v.

Ahmed M. Assaf, A. Mahmoodi, Nabil Shalaby, Jianxing Yin

Australas. J Comb., 1996

1995

Directed Packings with Block Size 5 and Even v.

Nabil Shalaby, Jianxing Yin

Des. Codes Cryptogr., 1995

1994

The existence of near-Skolem and hooked near-Skolem sequences.

Nabil Shalaby

Discret. Math., 1994

1993

Packing Designs with Block Size 5 and Index 2: The Case v Even.

Ahmed M. Assaf, Nabil Shalaby, L. P. S. Singh

J. Comb. Theory A, 1993

1992

Packing Designs with Block Size 5 and Indexes 8, 12, 16.

Ahmed M. Assaf, Nabil Shalaby

J. Comb. Theory A, 1992

Packing designs with block size 6 and index 5.

Ahmed M. Assaf, Alan Hartman, Nabil Shalaby

Discret. Math., 1992

1991

Skolem labelled graphs.

Eric Mendelsohn, Nabil Shalaby

Discret. Math., 1991

The fine structure of threefold triple systems: u = 1 or 3 (mod 6).

Charles J. Colbourn, Rudolf Mathon, Alexander Rosa, Nabil Shalaby

Discret. Math., 1991

The fine structure of threefold triple systems: v≡5(mod 6).

Charles J. Colbourn, Rudolf Mathon, Nabil Shalaby

Australas. J Comb., 1991