Journal publications

 

M. H. Alsuwaiyel, “On the k-ary hypercube tree and its average distance”, International Journal of Computer Mathematics, Vol.88, No. 11, 2011, 2258-2274. Download.

 

M. H. Alsuwaiyel,"On computing an optimal permutation of ranks for multiselection", Computers and Mathematics with Applications, 60, 2010, 2200-2203. Download.

 

M. H. Alsuwaiyel, “On the Average Distance of the Hypercube Tree”, International Journal of Computer Mathematics, Vol. 87, No. 6, 2010, 1208–1216. Download.

 

M. H. Alsuwaiyel, “A Random Algorithm for Multiselection”, Journal of Discrete Mathematics and Applications, Vol. 16, No. 2 (2006), 175-180. Download.

 

M. Gavrilova and M. H. Alsuwaiyel, “Computing the Euclidean Distance Transform on a Linear Array of Processors”, The Journal of Supercomputing, 25(2), June 2003, 177-185. Download.

 

M. Gavrilova and M. H. Alsuwaiyel, “Two Algorithms For Computing The Euclidean Distance Transform,'' International Journal of Image and Graphics, Vol. 1, No. 4 (2002) 635-645. Download.

M. H. Alsuwaiyel, “An Improved Parallel Algorithm for a Geometric Matching Problem with Application to Trapezoid Graphs,'' Journal of Parallel Algorithms and Applications, Vol 27(6), 2001, 861-865. Download.

 

M. H. Alsuwaiyel, “An optimal parallel algorithm for the multiselection problem,'' Parallel Computing, Vol 27(6), 2001, pp 861-865. Download.

 

M. H. Alsuwaiyel, “A Parrallel Algorithm for Partitioning a Point Set to Minimize the Maximum of Diameters'', Journal of Parallel and Distributed Computing, Vol 27(6), May 2001, 861-865. Download.

 

M. H. Alsuwaiyel, “Two Algorithms for the Sum of Diameters Problem,'' International Journal of Computational Geometry & Applications, 7 (5) (October 1997), 493-508. Download.

 

M. H. Alsuwaiyel, “Finding a Shortest Hamiltonian Path inside a Simple Polygon,'' Journal of Information Processing Letters, 59 (1996), 207-210. Download.

 

M. H. Alsuwaiyel and D.T. Lee, “Minimal Link Visibility Paths inside a Simple Polygon”,Computational Geometry: Theory and Applications, 3 (1993), 1-25. Download.

 

M. H. Alsuwaiyel and D.T. Lee, “Finding an Approximate Minimum-Link Visibility Path inside a Simple Polygon”, Journal of Information Processing Letters, 55 (1995), 5-79. Download.