The SCEAS System
| |||||||

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

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |