Zaid A. Hussain

According to our database, Zaid A. Hussain authored at least 9 papers between 2014 and 2025.

Collaborative distances:

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

2025

A Reliable Network Coverage Using Different Spanning Trees in Hexagonal Networks.

Zaid A. Hussain, Fawaz Alazemi, Bader F. AlBdaiwi

Proceedings of the IEEE International Conference on Communications, 2025

2024

Completely independent spanning trees in Eisenstein-Jacobi networks.

Zaid A. Hussain, Fawaz Alazemi, Bader F. AlBdaiwi

J. Supercomput., July, 2024

2022

Independent spanning trees in Eisenstein-Jacobi networks.

Zaid A. Hussain, Hosam M. F. AboElFotoh, Bader F. AlBdaiwi

J. Supercomput., 2022

2017

Higher dimensional Eisenstein-Jacobi networks.

Zaid A. Hussain, Arash Shamaei

J. Parallel Distributed Comput., 2017

Node-independent spanning trees in Gaussian networks.

Zaid A. Hussain, Bader F. AlBdaiwi, Anton Cerný

J. Parallel Distributed Comput., 2017

2016

Edge-disjoint node-independent spanning trees in dense Gaussian networks.

Bader F. AlBdaiwi, Zaid A. Hussain, Anton Cerný, Robert E. L. Aldred

J. Supercomput., 2016

2015

Better traffic distribution one-to-all broadcast in higher dimensional Gaussian networks.

Zaid A. Hussain

J. Supercomput., 2015

Edge disjoint Hamiltonian cycles in Eisenstein-Jacobi networks.

Zaid A. Hussain, Bella Bose, Abdullah Al-Dhelaan

J. Parallel Distributed Comput., 2015

2014

Generalized Hypercubes: Edge-Disjoint Hamiltonian Cycles and Gray Codes.

Zaid A. Hussain, Bella Bose, Abdullah Al-Dhelaan

IEEE Trans. Computers, 2014