M. H.
Alsuwaiyel, Algorithms: Design Techniques and
Analysis, World Scientific Publishers.
English
Edition:
https://www.wspc.com.sg/compsci/4002.html
Chinese
Edition:
http://product.china-pub.com/8065
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.
M. H. Alsuwaiyel,"On computing an optimal permutation of ranks
for multiselection", Computers and
Mathematics with Applications, 60, 2010, 2200-2203.
M. H. Alsuwaiyel,
ÒOn the Average Distance of the Hypercube TreeÓ, International Journal of Computer Mathematics, Vol. 87, No. 6, 2010, 1208–1216.
M. H. Alsuwaiyel, ÒA Random Algorithm for MultiselectionÓ, Journal
of Discrete
Mathematics and Applications, Vol. 16, No. 2 (2006),
175-180.
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.
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.
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.
M. H. Alsuwaiyel, ÒAn optimal parallel algorithm for the multiselection problem,'' Parallel Computing, Vol 27(6), 2001, pp 861-865.
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.
M. H. Alsuwaiyel, ÒTwo Algorithms for the Sum of Diameters Problem,'' International Journal of Computational Geometry &
Applications, 7 (5) (October 1997), 493-508.
M. H. Alsuwaiyel, ÒFinding a Shortest Hamiltonian Path
inside a Simple Polygon,'' Journal
of Information Processing Letters, 59 (1996), 207-210.
M. H. Alsuwaiyel and D.T. Lee, ÒMinimal Link Visibility Paths inside a Simple PolygonÓ,Computational Geometry: Theory and Applications, 3 (1993), 1-25.
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.
Ahmed Al-Herz, M. H. Alsuwaiyel,
ÒApproximation algorithms for independent dominating sets in odd graphsÓ, the
25th Conference of European Chapter on Combinatorial Optimization (ECCO12),
2012.
M. H. Alsuwaiyel, ÒOn Bipartitioning
a Convex PolygonÓ, Proc. Of the
IASTED International Conference on Signal Processing, Pattern Recognition and
Applications, Crete, Greece, June 2002, 670-672.
M. H. Alsuwaiyel,
ÒAn Efficient and Adaptive Algorithms for Multiselection
on the PRAM,Ó Proc. Of the
International Conference on Software Engineering, Artificial Intelligence,
Networking and Parallel/Distributed Computing (SNPDÕ01) Nagoya, Japan, 2001, 160-143.
M. H. Alsuwaiyel and
M. Gavrilova, "On the Distance Transform of
Binary Images", The 2000
International Conference on Imaging Science, Systems and Technology,
2000, 83-86.
A. F. Ahmad and M. H. Alsuwaiyel, ÒAlgorithms for the Multiselection Problem on the Linear Array and
Mesh of Processors'', The
Twelfth International Conference on Parallel and Distributed Computing and
Systems, Nov. 2000, 119-122.
M. H. Alsuwaiyel, ÒOn the Multiselection
Problem,'' International
Conference on Parallel and Distributed Processing Techniques and Applications,
Vol. 3, 2000, 1439-1441.
M. H. Alsuwaiyel, ÒAn Improved Parallel
Algorithm for a Geometric Matching Problem with Applications,'' International Conference on Parallel and
Distributed Processing Techniques and Applications,1999,
1697-1701.
M. H. Alsuwaiyel, ÒA Parallel Algorithm for
Partitioning a Point Set to Minimize the Maximum of Diameters,'' International Conference on Parallel and
Distributed Processing Techniques and Applications,1998,
698-701.
M. H. Alsuwaiyel, ÒPartitioning a Convex
Polygon to Minimize the Maximum of Diameters,'' The 1998 International Conference on Imaging
Science, Systems and Technology, 1998, 572-575.
M. H. Alsuwaiyel, ÒOn the Sum of Diameters Problem,'' The 1998 International Conference on Imaging
Science, Systems and Technology, 1998, 317-321.
M. H. Alsuwaiyel and D.T. Lee, Òome NP-complete Combinatorial Problems in Computational GeometryÓ, Proc. Int'l Comp. Symp, Hsinchu, Taiwan, R.O.C., Dec. 1990, 1-10.
M. H. Alsuwaiyel and D.T. Lee, ÒPacking with Is-Oriented RectanglesÓ,Proc. 15th IFIP Conference on System Modelling and Optimization., Zurich, Switzerland, Sep. 1991.