2003 | ||
---|---|---|
12 | EE | Marina L. Gavrilova, Muhammad H. Alsuwaiyel: Computing the Euclidean Distance Transform on a Linear Array of Processors. The Journal of Supercomputing 25(2): 177-185 (2003) |
2002 | ||
11 | Marina L. Gavrilova, Muhammad H. Alsuwaiyel, Juraj Pivovarov: Performance Analysis of a Fast Distance Transform Algorithm in the Euclidean Metric. PDPTA 2002: 1261-1270 | |
10 | Muhammad H. Alsuwaiyel: An improved parallel algorithm for a geometric matching problem with application to trapezoid graphs. Parallel Algorithms Appl. 17(2): 147-155 (2002) | |
2001 | ||
9 | Marina L. Gavrilova, Muhammad H. Alsuwaiyel: Two Algorithms for Computing the Euclidean Distance Transform. Int. J. Image Graphics 1(4): 635-645 (2001) | |
8 | EE | Muhammad H. Alsuwaiyel: A Parallel Algorithm for Partitioning a Point Set to Minimize the Maximum of Diameters. J. Parallel Distrib. Comput. 61(5): 662-666 (2001) |
7 | Muhammad H. Alsuwaiyel: An optimal parallel algorithm for the multiselection problem. Parallel Computing 27(6): 861-865 (2001) | |
2000 | ||
6 | Muhammad H. Alsuwaiyel: On the Multiselection Problem. PDPTA 2000 | |
1999 | ||
5 | Muhammad H. Alsuwaiyel: An Improved Parallel Algorithm for a Geometric Matching Problem with Applications. PDPTA 1999: 1697-1701 | |
1997 | ||
4 | Muhammad H. Alsuwaiyel: Two Algorithms for the Sum of Diameters Problem and a Related Problem. Int. J. Comput. Geometry Appl. 7(5): 493-508 (1997) | |
1996 | ||
3 | EE | Muhammad H. Alsuwaiyel: Finding a Shortest Hamiltonian Path Inside a Simple Polygon. Inf. Process. Lett. 59(4): 207-210 (1996) |
1995 | ||
2 | EE | Muhammad H. Alsuwaiyel, D. T. Lee: Finding an Approximate Minimum-Link Visibility Path Inside a Simple Polygon. Inf. Process. Lett. 55(2): 75-79 (1995) |
1993 | ||
1 | Muhammad H. Alsuwaiyel, D. T. Lee: Minimal Link Visibility Paths Inside a Simple Polygon. Comput. Geom. 3: 1-25 (1993) |
1 | Marina L. Gavrilova | [9] [11] [12] |
2 | D. T. Lee | [1] [2] |
3 | Juraj Pivovarov | [11] |