<?xml version="1.0"?>
<dblpperson name="Muhammad H. Alsuwaiyel" pid="86/5000" n="19">
<person key="homepages/86/5000" mdate="2015-08-12">
<author pid="86/5000">Muhammad H. Alsuwaiyel</author>
<note type="affiliation">King Fahd University of Petroleum and Minerals, Dhahran, Saudi Arabia</note>
</person>
<r><book key="books/ws/Alsuwaiyel22" mdate="2023-04-03">
<author pid="86/5000">Muhammad H. Alsuwaiyel</author>
<title>Parallel Algorithms</title>
<publisher>WorldScientific</publisher>
<year>2022</year>
<series href="db/series/lnsc/index.html">Lecture Notes Series on Computing</series>
<volume>16</volume>
<pages>1-400</pages>
<isbn>9789811252976</isbn>
<isbn>9789811252983</isbn>
<isbn>9789811252990</isbn>
<ee>https://doi.org/10.1142/12744</ee>
</book>
</r>
<r><book key="books/ws/Alsuwaiyel21" mdate="2023-04-03">
<author pid="86/5000">Muhammad H. Alsuwaiyel</author>
<title>Algorithms - Design Techniques and Analysis, Second Edition</title>
<booktitle>Algorithms, 2nd Edition</booktitle>
<publisher>WorldScientific</publisher>
<year>2021</year>
<series href="db/series/lnsc/index.html">Lecture Notes Series on Computing</series>
<volume>15</volume>
<pages>1-756</pages>
<isbn>9789811238642</isbn>
<isbn>9789811238659</isbn>
<isbn>9789811238666</isbn>
<ee>https://doi.org/10.1142/12324</ee>
</book>
</r>
<r><book key="books/ws/Alsuwaiyel16" mdate="2024-04-18">
<author pid="86/5000">Muhammad H. Alsuwaiyel</author>
<title>Algorithms - Design Techniques and Analysis (Revised Edition)</title>
<booktitle>Algorithms, Revised Edition</booktitle>
<publisher>WorldScientific</publisher>
<year>2016</year>
<series href="db/series/lnsc/index.html">Lecture Notes Series on Computing</series>
<volume>14</volume>
<pages>1-572</pages>
<isbn>9789814723640</isbn>
<isbn>9789814723657</isbn>
<isbn>9789814723664</isbn>
<ee>https://doi.org/10.1142/9804</ee>
</book>
</r>
<r><article key="journals/ijcm/Alsuwaiyel11" mdate="2017-05-28">
<author pid="86/5000">Muhammad H. Alsuwaiyel</author>
<title>On the <i>k</i>-ary hypercube tree and its average distance.</title>
<pages>2258-2274</pages>
<year>2011</year>
<volume>88</volume>
<journal>Int. J. Comput. Math.</journal>
<number>11</number>
<ee>https://doi.org/10.1080/00207160.2010.544722</ee>
<url>db/journals/ijcm/ijcm88.html#Alsuwaiyel11</url>
</article>
</r>
<r><article key="journals/cma/Alsuwaiyel10" mdate="2021-02-11">
<author pid="86/5000">Muhammad H. Alsuwaiyel</author>
<title>On computing an optimal permutation of ranks for multiselection.</title>
<pages>2200-2203</pages>
<year>2010</year>
<volume>60</volume>
<journal>Comput. Math. Appl.</journal>
<number>8</number>
<ee type="oa">https://doi.org/10.1016/j.camwa.2010.07.040</ee>
<url>db/journals/cma/cma60.html#Alsuwaiyel10</url>
</article>
</r>
<r><article key="journals/ijcm/Alsuwaiyel10" mdate="2017-05-28">
<author pid="86/5000">Muhammad H. Alsuwaiyel</author>
<title>On the average distance of the hypercube tree.</title>
<pages>1208-1216</pages>
<year>2010</year>
<volume>87</volume>
<journal>Int. J. Comput. Math.</journal>
<number>6</number>
<ee>https://doi.org/10.1080/00207160802195415</ee>
<url>db/journals/ijcm/ijcm87.html#Alsuwaiyel10</url>
</article>
</r>
<r><article key="journals/tjs/GavrilovaA03" mdate="2022-06-23">
<author orcid="0000-0002-5338-1834" pid="93/3657">Marina L. Gavrilova</author>
<author pid="86/5000">Muhammad H. Alsuwaiyel</author>
<title>Computing the Euclidean Distance Transform on a Linear Array of Processors.</title>
<pages>177-185</pages>
<year>2003</year>
<volume>25</volume>
<journal>J. Supercomput.</journal>
<number>2</number>
<ee>https://doi.org/10.1023/A:1023948712732</ee>
<url>db/journals/tjs/tjs25.html#GavrilovaA03</url>
</article>
</r>
<r><article key="journals/paapp/Alsuwaiyel02" mdate="2017-05-20">
<author pid="86/5000">Muhammad H. Alsuwaiyel</author>
<title>An improved parallel algorithm for a geometric matching problem with application to trapezoid graphs.</title>
<pages>147-155</pages>
<year>2002</year>
<volume>17</volume>
<journal>Parallel Algorithms Appl.</journal>
<number>2</number>
<url>db/journals/paapp/paapp17.html#Alsuwaiyel02</url>
<ee>https://doi.org/10.1080/10637190208941437</ee>
</article>
</r>
<r><inproceedings key="conf/pdpta/GavrilovaAP02" mdate="2004-03-12">
<author pid="93/3657">Marina L. Gavrilova</author>
<author pid="86/5000">Muhammad H. Alsuwaiyel</author>
<author pid="15/4515">Juraj Pivovarov</author>
<title>Performance Analysis of a Fast Distance Transform Algorithm in the Euclidean Metric.</title>
<pages>1261-1270</pages>
<year>2002</year>
<crossref>conf/pdpta/2002-3</crossref>
<booktitle>PDPTA</booktitle>
<url>db/conf/pdpta/pdpta2002-3.html#GavrilovaAP02</url>
</inproceedings>
</r>
<r><article key="journals/ijig/GavrilovaA01" mdate="2020-03-24">
<author pid="93/3657">Marina L. Gavrilova</author>
<author pid="86/5000">Muhammad H. Alsuwaiyel</author>
<title>Two Algorithms for Computing the Euclidean Distance Transform.</title>
<pages>635-645</pages>
<year>2001</year>
<volume>1</volume>
<journal>Int. J. Image Graph.</journal>
<number>4</number>
<url>db/journals/ijig/ijig1.html#GavrilovaA01</url>
<ee>https://doi.org/10.1142/S0219467801000359</ee>
</article>
</r>
<r><article key="journals/jpdc/Alsuwaiyel01" mdate="2020-02-22">
<author pid="86/5000">Muhammad H. Alsuwaiyel</author>
<title>A Parallel Algorithm for Partitioning a Point Set to Minimize the Maximum of Diameters.</title>
<pages>662-666</pages>
<year>2001</year>
<volume>61</volume>
<journal>J. Parallel Distributed Comput.</journal>
<number>5</number>
<ee>https://doi.org/10.1006/jpdc.2000.1706</ee>
<url>db/journals/jpdc/jpdc61.html#Alsuwaiyel01</url>
</article>
</r>
<r><article key="journals/pc/Alsuwaiyel01" mdate="2025-01-19">
<author pid="86/5000">Muhammad H. Alsuwaiyel</author>
<title>An optimal parallel algorithm for the multiselection problem.</title>
<pages>861-865</pages>
<year>2001</year>
<volume>27</volume>
<journal>Parallel Comput.</journal>
<number>6</number>
<url>db/journals/pc/pc27.html#Alsuwaiyel01</url>
<ee>https://doi.org/10.1016/S0167-8191(00)00095-8</ee>
<ee>https://www.wikidata.org/entity/Q127883884</ee>
</article>
</r>
<r><inproceedings key="conf/pdpta/Alsuwaiyel00" mdate="2003-12-05">
<author pid="86/5000">Muhammad H. Alsuwaiyel</author>
<title>On the Multiselection Problem.</title>
<year>2000</year>
<crossref>conf/pdpta/2000</crossref>
<booktitle>PDPTA</booktitle>
<url>db/conf/pdpta/pdpta2000.html#Alsuwaiyel00</url>
</inproceedings>
</r>
<r><book key="books/ws/Alsuwaiyel99" mdate="2023-04-03">
<author pid="86/5000">Muhammad H. Alsuwaiyel</author>
<title>Algorithms - Design Techniques and Analysis</title>
<publisher>World Scientific</publisher>
<year>1999</year>
<pages>1-544</pages>
<series href="db/series/lnsc/index.html">Lecture Notes Series on Computing</series>
<volume>7</volume>
<isbn>981-02-3740-5</isbn>
<ee>https://doi.org/10.1142/4002</ee>
</book>
</r>
<r><inproceedings key="conf/pdpta/Alsuwaiyel99" mdate="2004-04-20">
<author pid="86/5000">Muhammad H. Alsuwaiyel</author>
<title>An Improved Parallel Algorithm for a Geometric Matching Problem with Applications.</title>
<pages>1697-1701</pages>
<year>1999</year>
<crossref>conf/pdpta/1999</crossref>
<booktitle>PDPTA</booktitle>
<url>db/conf/pdpta/pdpta1999-3.html#Alsuwaiyel99</url>
</inproceedings>
</r>
<r><article key="journals/ijcga/Alsuwaiyel97" mdate="2020-06-04">
<author pid="86/5000">Muhammad H. Alsuwaiyel</author>
<title>Two Algorithms for the Sum of Diameters Problem and a Related Problem.</title>
<pages>493-508</pages>
<year>1997</year>
<volume>7</volume>
<journal>Int. J. Comput. Geom. Appl.</journal>
<number>5</number>
<url>db/journals/ijcga/ijcga7.html#Alsuwaiyel97</url>
<ee>https://doi.org/10.1142/S0218195997000302</ee>
</article>
</r>
<r><article key="journals/ipl/Alsuwaiyel96" mdate="2017-05-26">
<author pid="86/5000">Muhammad H. Alsuwaiyel</author>
<title>Finding a Shortest Hamiltonian Path Inside a Simple Polygon.</title>
<pages>207-210</pages>
<year>1996</year>
<volume>59</volume>
<journal>Inf. Process. Lett.</journal>
<number>4</number>
<url>db/journals/ipl/ipl59.html#Alsuwaiyel96</url>
<ee>https://doi.org/10.1016/0020-0190(96)00103-2</ee>
</article>
</r>
<r><article key="journals/ipl/AlsuwaiyelL95" mdate="2017-05-26">
<author pid="86/5000">Muhammad H. Alsuwaiyel</author>
<author pid="l/DTLee">D. T. Lee</author>
<title>Finding an Approximate Minimum-Link Visibility Path Inside a Simple Polygon.</title>
<pages>75-79</pages>
<year>1995</year>
<volume>55</volume>
<journal>Inf. Process. Lett.</journal>
<number>2</number>
<url>db/journals/ipl/ipl55.html#AlsuwaiyelL95</url>
<ee>https://doi.org/10.1016/0020-0190(95)00072-K</ee>
</article>
</r>
<r><article key="journals/comgeo/AlsuwaiyelL93" mdate="2021-02-11">
<author pid="86/5000">Muhammad H. Alsuwaiyel</author>
<author pid="l/DTLee">D. T. Lee</author>
<title>Minimal Link Visibility Paths Inside a Simple Polygon.</title>
<pages>1-25</pages>
<year>1993</year>
<volume>3</volume>
<journal>Comput. Geom.</journal>
<url>db/journals/comgeo/comgeo3.html#AlsuwaiyelL93</url>
<ee type="oa">https://doi.org/10.1016/0925-7721(93)90027-4</ee>
</article>
</r>
<coauthors n="3" nc="1">
<co c="0"><na f="g/Gavrilova:Marina_L=" pid="93/3657">Marina L. Gavrilova</na></co>
<co c="-1"><na f="l/Lee:D=_T=" pid="l/DTLee">D. T. Lee</na></co>
<co c="0"><na f="p/Pivovarov:Juraj" pid="15/4515">Juraj Pivovarov</na></co>
</coauthors>
</dblpperson>

