Saad I. El-Zanati's Publications:

1.    S. I. El-Zanati and W. R. R. Transue, On dynamics of certain Cantor sets, Journal of Number Theory, Vol. 36, No. 2 (1990), 246-253.

2.    S. I. El-Zanati and C. A. Rodger, Blocking sets in G-designs, Ars Combinatoria, Vol. 35 (1993), 237-251.

3.    D. E. Bryant, S. I. El-Zanati and R. B. Gardner, Decompositions of K_m,n and of K_n into Cubes, Australasian Journal of Combinatorics, Vol. 9 (1994), 284-290.

4.    S. I. El-Zanati, Maximum packings with odd cycles, Discrete Mathematics, Vol. 131 (1994), 91-97.

5.    P. Adams, D. E. Bryant and S. I. El-Zanati, Lambda-fold cube decompositions, Australasian Journal of Combinatorics, Vol. 11 (1995), 197-210.

6.    S. I. El-Zanati, M. J. Plantholt and S. K. Tipnis, Factorization of regular multigraphs into regular graphs, Journal of Graph Theory, Vol. 19, No. 1 (1995), 93-105.

7.    S. I. El-Zanati and C. Vanden Eynden, Decompositions of K_m,n into cubes, Journal of Combinatorial Designs, Vol. 4, No. 1 (1996), 51-57.

8.    S. I. El-Zanati, M. J. Plantholt and S. K. Tipnis, Extensions of some factorization results from simple graphs to multigraphs, Journal of Graph Theory, Vol. 24, No. 4, 291-295, (1997)

9.    P. Adams, D. E. Bryant, S. I. El-Zanati and C. Vanden Eynden, d-cube decompositions of K_n\K_m,Graphs and Combinatorics, Vol. 13, (1997), 1-7.

10.  P. Adams, D. E. Bryant, S. I. El-Zanati and A. Khodkar, The intersection problem for cubes, Australasian Journal of Combinatorics, Vol. 15 (1997), 127-134.

11.  S. I. El-Zanati and C. Vanden Eynden, Cycle factorizations of Cycle Products, Discrete Mathematics, Vol. 189 (1998), 267-275.

12.  S. I. El-Zanati, M. J. Plantholt and C. Vanden Eynden, Graph decompositions into generalized cubes, Ars Combinatoria, Vol. 49 (1998), 237-247.

13.  S. I. El-Zanati and C. Vanden Eynden, Cycle factorizations of powers of odd cycles, Journal of Combinatorial Designs, Vol. 7, No. 3 (1999), 173-183.

14.  A. Khodkar, D. E. Bryant, and S. I. El-Zanati, Small embeddings for partial G-designs when G is bipartite, Bulletin of the Institute for Combinatorics and its Applications, Vol 26 (1999), 86-90.

15.  S. I. El-Zanati and C. Vanden Eynden, Factorizations of K_m,n into spanning trees, Graphs and Combinatorics, Vol 15 (1999), 287-293.

16.  P. Adams, D. E. Bryant and S. I. El-Zanati, Packing and covering the complete graph with cubes, Australasian Journal of Combinatorics, Vol. 20 (1999), 267-288.

17.  D. E. Bryant, S. I. El-Zanati and C. A. Rodger, Maximal sets of Hamilton cycles in K_n,n, Journal of Graph Theory, Vol. 33 (2000), 25-31.

18.  S. I. El-Zanati and C. Vanden Eynden, Factorizations of complete multipartite graphs into generalized cubes, Journal of Graph Theory, Vol. 33 (2000), 144-150.

19.  S. I. El-Zanati, H. L. Fu and C. L. Shiue, On the alpha-labeling number of bipartite graphs, Discrete Mathematics, Vol. 214 (2000), 241-243.

20.  S. I. El-Zanati, M. J. Kenig and C. Vanden Eynden, On graphs with near alpha-labelings, Australasian Journal of Combinatorics, Vol. 21 (2000), 275-285.

21.  S. I. El-Zanati, M. J. Plantholt, S. K. Tipnis and C. L. Vanden Eynden, Equitable Football Pools, Bulletin of the ICA, Vol. 29 (2000), 71-84.

22.  S. I. El-Zanati and C. Vanden Eynden, On graphs with strong alpha valuations, Ars Combinatoria, Vol. 56 (2000), 175-188.

23.  S. I. El-Zanati, H. L. Fu and C. Vanden Eynden, On the alpha-labeling number of bipartite graphs, Utilitas Mathematica, Vol. 58 (2000), 145-152.

24.  S. I. El-Zanati, S. Stubbs and C. Vanden Eynden, On the decomposition of Cayley graphs into isomorphic trees, Australasian Journal of Combinatorics, Vol. 22 (2000), 13-18.

25.  D. E. Bryant, S. I. El-Zanati and C. Vanden Eynden, Star factorizations of graph products, Journal of Graph Theory, Vol. 36 (2001), 59-66.

26.  D. E. Bryant, S. I. El-Zanati, D. G. Hoffman and C. Vanden Eynden, Star deccompositions of cubes, Graphs and Combinatorics, Vol. 17 (2001), 55-59.

27.  S. I. El-Zanati and C. Vanden Eynden, On alpha-valuations of disconnected graphs, Ars Combinatoria, Vol. 61 (2001), 129-136.

28.  S. I. El-Zanati, N. Punnim and C. Vanden Eynden, On the cyclic decomposition of complete graphs into bipartite graphs, Australasian Journal of Combinatorics, Vol. 24 (2001), 209-219.

29.  D. E. Bryant, S. I. El-Zanati and C. Vanden Eynden, Factorizations of and by powers of complete graphs, Discrete Mathematics, Vol. 243 (2002), 201-205.

30.  P. Adams, E. J. Billington, D. E. Bryant and S. I. El-Zanati, On the Hamilton-Waterloo problem, Graphs and Combinatorics, Vol. 18 (2002), 31-51.

31.  S. I. El-Zanati, S. K. Tipnis and C. Vanden Eynden, A generalization of the Oberwolfach problem, Journal of Graph Theory, Vol. 41 (2002), 151-161.

32.  P. Adams, D. E. Bryant, S. I. El-Zanati, B. Maenhaut and C. Vanden Eynden, Least Common Multiple of cubes, Bulletin of the ICA, Vol. 38 (2003), 45-49.

33.  P. Adams, D. E. Bryant, H. Gavlas and S. I. El-Zanati, Factorizations of the complete graph into C₅-factors and 1-factors, Graphs and Combinatorics, Vol. 19 (2003), 289-296. 

34.  A. Blinco and S. I. El-Zanati, A note on the cyclic decomposition of complete graphs into bipartite graphs,  Bulletin of the ICA, Vol. 40 (2004), 77-82.

35.  D. Donovan, S. I. El-Zanati, C. Vanden Eynden and S. Sutinuntopas, Labelings of unions of up to four uniform cycles,  Australasian Journal of Combinatorics, Vol.  29 (2004), 323-336.

36.  N. Cavenagh, S. I. El-Zanati, A. Khodkar and C. Vanden Eynden, On a generalization of the Oberwolfach problem, Journal of Combinatorial Theory, Series A, Vol. 106 (2004), 255-275.

37.  A. Blinco, S. I. El-Zanati and C. Vanden Eynden, On the cyclic decomposition of complete graphs into almost-bipartite graphs, Discrete Mathematics, Vol. 284 (2004), 71-81.

38.  J. Dumouchel and S. I. El-Zanati, On labeling the union of two cycles, Journal of Combinatorial Mathematics and Combinatorial Computing,Vol. 53 (2005), 3-11.

39.  D. E. Bryant, S. I. EL-Zanati, B. Maenhaut and C. Vanden Eynden, Decomposition of complete graphs by 5-cubes, Journal of Combinatorial Designs, Vol. 14 (2006), 159-166.

40.  S. I. EL-Zanati and C. Vanden Eynden, Decomposing complete graphs into cubes, Discussiones Mathematicae-Graph Theory, Vol. 26 (2006), 141-147.

41.  D. E. Bryant and S. I. El-Zanati, Graph decompositions, CRC Handbook of Combinatorial Designs (C. Colbourn and J. Dinitz, Editors), Second Edition, 2007, 477-485.

42.  A. Aguado, S. I. El-Zanati, H. Hake, J. Stob and H. Yayla, On rho-labeling the union of three cycles, Australasian Journal of Combinatorics, Vol. 37 (2007), 155-170.

43. S. I. El-Zanati, M. J. Plantholt, P. A. Sissokho and L. Spence, On the existence of a rainbow 1-factor in 1-factorizations of  K_rn^(r), Journal of Combinatorial Designs, Vol. 15 (2007), 487-490.

44.  A. Aguado and S. I. El-Zanati, On sigma-labeling the union of three cycles, Journal of Combinatorial Mathematics and Combinatorial Computing, Vol. 64 (2008), 33-48.

45.  S. I. El-Zanati, G. F. Seelinger, P. A. Sissokho, L. E. Spence, and C. Vanden Eynden, Partitions of finite vector spaces into spaces, Journal of Combinatorial Designs, Vol. 16 (2008), 329-341.

46.  S. I. El-Zanati and C. Vanden Eynden, On Rosa-type labelings and cyclic graph decompositions, Mathematica-Slovaca, to appear.

47.  R. C. Bunge , S. I. El-Zanati, W. O'Hanlon, and C. Vanden Eynden, On gamma-labeling the almost-bipartite graph P_m+e, Ars Combinatoria, to appear.

48.  S. I. El-Zanati, G. F. Seelinger, P. A. Sissokho, L. E. Spence, and C. Vanden Eynden, On partitions of finite vector spaces of small dimension over GF(2), Discrete Mathematics, to appear.

49.  A. D. Blinco, S. I. El-Zanati, G. F. Seelinger, P. A. Sissokho, L. E. Spence, and C. Vanden Eynden, On vector space partitions and uniformly resolvable designs, Designs, Codes and Cryptography, Vol. 48 (2008), 69-77.

50.  G. Blair, D. Bowman, S. I. El-Zanati, S. Hlad, M. Priban, and K. Sebesta, On Cyclic (C_m+e)-designs, submitted.

51.  E. Butzen, S. I. El-Zanati, H. Jordon, A. Modica, and E. Schrishuhn, On rho-labeling up to ten vertex-disjoint C_4x+1, Journal of Combinatorial Mathematics and Combinatorial Computing, to appear.

52.  S. I. El-Zanati, W. O’Hanlon, and E. R. Spicer, On gamma-labeling the almost-bipartite graph K_m,n+e, submitted.

53.  S. I. El-Zanati, N. Punnim, and C. A. Rodger, Gregarious GDDs with Two Associate Classes, submitted.

54.  D. Bryant, S. I. El-Zanati, S. Hartke, and P. R. J. Östergård, The Nonexistence of a (K₆-e)-decomposition of the Complete Graph K₂₉, submitted.