Accessibility Tools

Dark Mode

Font Resize

Are you having difficulties using this site?

Contact Us

Dr. Zaid Hussain

Dr. Zaid Hussain
Phone
24985366
Public Email
zaid.dashti@ku.edu.kw
Office Location
S02A2-146
Associate Professor

Dr. Zaid Hussain received the B.Sc. degree in Computer Science from Kuwait University, Kuwait, in 2006, the M.Sc. and Ph.D. degrees in Computer Science from Oregon State University, USA, in 2008 and 2011, respectively. Since 2011, he has been with Kuwait University, Kuwait, where he is currently an associate professor with the Computer Science Department.

Degrees and Certificates

•    Ph.D. in Computer Science, Oregon State University, Oregon, USA, June 2011.
•    M.Sc. in Computer Science, Oregon State University, Oregon, USA, December 2008.
•    B.S. in Computer Science, Kuwait University, Kuwait, February 2006.
 

Research Interests

•    Distributed Systems
•    Parallel Computing
•    High Performance Computing
•    Interconnection networks
•    Fault-tolerant
•    Graph Theory
•    Computer Networks

Publications

Journals

  1. H. AlMansouri and Z. Hussain, “Shortest Node-to-Node Disjoint Paths Algorithm for Symmetric Networks”, Cluster Computing - The Journal of Networks, Software Tools and Applications, 2024, Volume, 27, 4347 - 4360.

 

  1. Z. Hussain, F. AlAzemi, B. AlBdaiwi, “Completely Independent Spanning Trees in Eisenstein-Jacobi Networks”, The Journal of Supercomputing, Mar. 2024.

 

  1. M. Awadh, Z. Hussain, H. AlMansouri, “Panconnectivity algorithm for Eisenstein-Jacobi networks”, Kuwait Journal of Science, Volume 50, Issue 4, Pages 485-491, Oct. 2023.

 

  1. Z. Hussain, B. AlBdaiwi, H. AboElFotoh, “Independent spanning trees in Eisenstein–Jacobi networks”, The Journal of Supercomputing (2022).

 

  1. Z. Hussain, B. AlBdaiwi, A. Cerny, “Node-Independent Spanning Trees in Gaussian Networks”, Journal of Parallel and Distributed Computing, Volume 109, Pages 324–332, November 2017.

 

  1. M. Kinawi, Z. Hussain, L. Niepel, “Locating Paired-Dominating Set in Triangular and King Grids”, Kuwait Journal of Science, 2018.

 

  1. Z. Hussain, A. Shamaei, “Higher dimensional Eisenstein–Jacobi networks”, Journal of Parallel and Distributed Computing, Volume 102, Pages 91–102, April 2017.

 

  1. B. F. AlBdaiwi, Z. Hussain, A. Cerný, R. Aldred, “Edge-Disjoint Node-Independent Spanning Trees in Dense Gaussian Networks”, The Journal of Supercomputing, 2016.

 

  1. Z. Hussain, “Better traffic distribution one-to-all broadcast in higher dimensional Gaussian networks”, The Journal of Supercomputing, Volume 71, Issue 12, pp 4381-4399, December 2015.

 

  1. Z. Hussain, B. Bose, A. Al-Dhelaan, “Edge disjoint Hamiltonian cycles in Eisenstein-Jacobi networks”, Journal of Parallel and Distributed Computing, Volume 86 Issue C, Pages 62-70, December 2015.

 

  1. Z. Hussain, B. Bose, A. Al-Dhelaan, “Generalized Hypercubes: Edge Disjoint Hamiltonian Cycles and Gray Codes”, IEEE Transactions on Computers, vol.63, no.2, pp.375,382, Feb. 2014.

 

 

Conferences

  1. Z. Hussain, “An Improved One-to-All Broadcasting in Higher Dimensional Eisenstein-Jacobi Networks”, 26th Euromicro International Conference on Parallel, Distributed, and Network-Based Processing (PDP2018), Pages 34-44, Cambridge, UK, March 21-23, 2018.

 

  1. Z. Hussain, B. AlBdaiwi, H. Aboelfotoh, “Parallel Construction of Edge-Disjoint Node-Independent Spanning Trees in Dense Gaussian Networks”, The 23rd Int'l Conf on Parallel and Distributed Processing Techniques and Applications (PDPTA), Pages 117-122, Las Vegas, USA, July 17-20, 2017.

 

  1. Z. Hussain, B. AlBdaiwi, A. Cerny, “Node-Independent Spanning Trees in Gaussian Networks”, Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications (PDPTA), Pages 24-29, Las Vegas, Nevada, USA, July 25-27, 2016.

 

  1. Z. Hussain, L. Niepel, M. Kinawi, “Minimal locating pair-domination sets in hexagonal, triangular, and king grids”, Contemporary Mathematics and its Application, Kuwait University, Kuwait, Nov. 2014.