Muhammad H. Alsuwaiyel

19 papers Misc 3Journal 12
YearRankTypeTitle / Venue / Authors
2022 — book
Parallel Algorithms
Muhammad H. Alsuwaiyel
2021 — book
Algorithms - Design Techniques and Analysis, Second Edition
Algorithms, 2nd Edition
Muhammad H. Alsuwaiyel
2016 — book
Algorithms - Design Techniques and Analysis (Revised Edition)
Algorithms, Revised Edition
Muhammad H. Alsuwaiyel
2011 J jnl
On the
Int. J. Comput. Math.
Muhammad H. Alsuwaiyel
2010 J jnl
On computing an optimal permutation of ranks for multiselection.
Comput. Math. Appl.
Muhammad H. Alsuwaiyel
2010 J jnl
On the average distance of the hypercube tree.
Int. J. Comput. Math.
Muhammad H. Alsuwaiyel
2003 J jnl
Computing the Euclidean Distance Transform on a Linear Array of Processors.
J. Supercomput.
Marina L. Gavrilova, Muhammad H. Alsuwaiyel
2002 J jnl
An improved parallel algorithm for a geometric matching problem with application to trapezoid graphs.
Parallel Algorithms Appl.
Muhammad H. Alsuwaiyel
2002 Misc conf
Performance Analysis of a Fast Distance Transform Algorithm in the Euclidean Metric.
PDPTA
Marina L. Gavrilova, Muhammad H. Alsuwaiyel, Juraj Pivovarov
2001 J jnl
A Parallel Algorithm for Partitioning a Point Set to Minimize the Maximum of Diameters.
J. Parallel Distributed Comput.
Muhammad H. Alsuwaiyel
2001 J jnl
An optimal parallel algorithm for the multiselection problem.
Parallel Comput.
Muhammad H. Alsuwaiyel
2001 J jnl
Two Algorithms for Computing the Euclidean Distance Transform.
Int. J. Image Graph.
Marina L. Gavrilova, Muhammad H. Alsuwaiyel
2000 Misc conf
On the Multiselection Problem.
PDPTA
Muhammad H. Alsuwaiyel
1999 — book
Algorithms - Design Techniques and Analysis
Muhammad H. Alsuwaiyel
1999 Misc conf
An Improved Parallel Algorithm for a Geometric Matching Problem with Applications.
PDPTA
Muhammad H. Alsuwaiyel
1997 J jnl
Two Algorithms for the Sum of Diameters Problem and a Related Problem.
Int. J. Comput. Geom. Appl.
Muhammad H. Alsuwaiyel
1996 J jnl
Finding a Shortest Hamiltonian Path Inside a Simple Polygon.
Inf. Process. Lett.
Muhammad H. Alsuwaiyel
1995 J jnl
Finding an Approximate Minimum-Link Visibility Path Inside a Simple Polygon.
Inf. Process. Lett.
Muhammad H. Alsuwaiyel, D. T. Lee
1993 J jnl
Minimal Link Visibility Paths Inside a Simple Polygon.
Comput. Geom.
Muhammad H. Alsuwaiyel, D. T. Lee