<?xml version="1.0"?>
<dblpperson name="D. T. Lee" pid="l/DTLee" n="264">
<person key="homepages/l/DTLee" mdate="2025-05-13">
<author pid="l/DTLee">D. T. Lee</author>
<author pid="l/DTLee">Der-Tsai Lee</author>
<note type="uname">&#26446;&#24503;&#36001;</note>
<note type="affiliation">Academia Sinica, Institute of Information Science, Taipei, Taiwan</note>
<note label="former" type="affiliation">Northwestern University, Department of Electrical and Computer Engineering, Evanston, IL, USA</note>
<note label="former" type="affiliation">National Science Foundation, Division of Computer and Computation Research, Washington, DC, USA</note>
<note label="former, PhD 1978" type="affiliation">University of Illinois at Urbana-Champaign, IL, USA</note>
<url>https://www.iis.sinica.edu.tw/~dtlee/</url>
<url>https://scholar.google.com/citations?user=ZQuppV0AAAAJ</url>
<url>https://dl.acm.org/profile/81100397910</url>
<url>https://zbmath.org/authors/?q=ai:lee.der-tsai</url>
<url>https://en.wikipedia.org/wiki/Der-Tsai_Lee</url>
<url>https://orcid.org/0000-0003-3894-5192</url>
<url>https://www.wikidata.org/entity/Q5261122</url>
<url>http://isni.org/isni/0000000114726222</url>
<url>https://viaf.org/viaf/51923906</url>
<url>https://id.loc.gov/authorities/names/nb2010020824</url>
<url>https://d-nb.info/gnd/122392612</url>
<url>https://mathgenealogy.org/id.php?id=179559</url>
</person>
<r><article key="journals/tcs/YuLL21" mdate="2020-12-31">
<author orcid="0000-0002-0540-7614" pid="18/2869">Hung-I Yu</author>
<author pid="04/1009">Tien-Ching Lin</author>
<author pid="l/DTLee">D. T. Lee</author>
<title>Finding maximum sum segments in sequences with uncertainty.</title>
<pages>221-235</pages>
<year>2021</year>
<volume>850</volume>
<journal>Theor. Comput. Sci.</journal>
<ee>https://doi.org/10.1016/j.tcs.2020.11.005</ee>
<url>db/journals/tcs/tcs850.html#YuLL21</url>
</article>
</r>
<r><article key="journals/algorithmica/KaoTL19" mdate="2025-01-19">
<author orcid="0000-0002-7238-3093" pid="29/2488">Mong-Jen Kao</author>
<author pid="140/7557">Hai-Lun Tu</author>
<author pid="l/DTLee">D. T. Lee</author>
<title>O(f) Bi-criteria Approximation for Capacitated Covering with Hard Capacities.</title>
<pages>1800-1817</pages>
<year>2019</year>
<volume>81</volume>
<journal>Algorithmica</journal>
<number>5</number>
<ee>https://doi.org/10.1007/s00453-018-0506-6</ee>
<ee>https://www.wikidata.org/entity/Q129348481</ee>
<url>db/journals/algorithmica/algorithmica81.html#KaoTL19</url>
</article>
</r>
<r><article key="journals/tcs/KaoSLL19" mdate="2025-01-19">
<author orcid="0000-0002-7238-3093" pid="29/2488">Mong-Jen Kao</author>
<author pid="210/4309">Jia-Yau Shiau</author>
<author pid="84/3209">Ching-Chi Lin</author>
<author pid="l/DTLee">D. T. Lee</author>
<title>Tight approximation for partial vertex cover with hard capacities.</title>
<pages>61-72</pages>
<year>2019</year>
<volume>778</volume>
<journal>Theor. Comput. Sci.</journal>
<ee>https://doi.org/10.1016/j.tcs.2019.01.027</ee>
<ee>https://www.wikidata.org/entity/Q128539943</ee>
<url>db/journals/tcs/tcs778.html#KaoSLL19</url>
</article>
</r>
<r><article key="journals/ijcga/YuLL18" mdate="2022-06-23">
<author orcid="0000-0002-0540-7614" pid="18/2869">Hung-I Yu</author>
<author pid="04/1009">Tien-Ching Lin</author>
<author orcid="0000-0003-3894-5192" pid="l/DTLee">D. T. Lee</author>
<title>The (1|1)-Centroid Problem in the Plane with Distance Constraints.</title>
<year>2018</year>
<volume>28</volume>
<journal>Int. J. Comput. Geom. Appl.</journal>
<number>2</number>
<ee>https://doi.org/10.1142/S0218195918600014</ee>
<url>db/journals/ijcga/ijcga28.html#YuLL18</url>
<pages>81-109</pages>
</article>
</r>
<r><article key="journals/tcs/YuLL18" mdate="2017-12-28">
<author orcid="0000-0002-0540-7614" pid="18/2869">Hung-I Yu</author>
<author pid="46/2794">Cheng-Chung Li</author>
<author pid="l/DTLee">D. T. Lee</author>
<title>The multi-service center problem.</title>
<pages>58-74</pages>
<year>2018</year>
<volume>705</volume>
<journal>Theor. Comput. Sci.</journal>
<ee>https://doi.org/10.1016/j.tcs.2017.09.034</ee>
<url>db/journals/tcs/tcs705.html#YuLL18</url>
</article>
</r>
<r><inproceedings key="conf/intcompsymp/TuKL18" mdate="2019-07-18">
<author pid="140/7557">Hai-Lun Tu</author>
<author pid="29/2488">Mong-Jen Kao</author>
<author pid="l/DTLee">D. T. Lee</author>
<title>An O(f) Bi-approximation for Weighted Capacitated Covering with Hard Capacity.</title>
<pages>468-475</pages>
<year>2018</year>
<booktitle>ICS</booktitle>
<ee>https://doi.org/10.1007/978-981-13-9190-3_51</ee>
<crossref>conf/intcompsymp/2018</crossref>
<url>db/conf/intcompsymp/ics2018.html#TuKL18</url>
</inproceedings>
</r>
<r><inproceedings key="conf/intcompsymp/YuKL18" mdate="2019-08-08">
<author orcid="0000-0002-0540-7614" pid="18/2869">Hung-I Yu</author>
<author orcid="0000-0002-7238-3093" pid="29/2488">Mong-Jen Kao</author>
<author orcid="0000-0003-3894-5192" pid="l/DTLee">D. T. Lee</author>
<title>The Multi-service Location Problems.</title>
<pages>507-515</pages>
<year>2018</year>
<booktitle>ICS</booktitle>
<ee>https://doi.org/10.1007/978-981-13-9190-3_56</ee>
<crossref>conf/intcompsymp/2018</crossref>
<url>db/conf/intcompsymp/ics2018.html#YuKL18</url>
</inproceedings>
</r>
<r><proceedings key="conf/isaac/2018" mdate="2025-11-21">
<editor pid="10/4757">Wen-Lian Hsu</editor>
<editor pid="l/DTLee">Der-Tsai Lee</editor>
<editor pid="72/3143">Chung-Shou Liao</editor>
<title>29th International Symposium on Algorithms and Computation, ISAAC 2018, Jiaoxi, Yilan, Taiwan, December 16-19, 2018</title>
<booktitle>ISAAC</booktitle>
<publisher>Schloss Dagstuhl - Leibniz-Zentrum f&#252;r Informatik</publisher>
<series href="db/series/lipics/index.html">LIPIcs</series>
<volume>123</volume>
<year>2018</year>
<isbn>978-3-95977-094-1</isbn>
<ee type="oa">http://www.dagstuhl.de/dagpub/978-3-95977-094-1</ee>
<url>db/conf/isaac/isaac2018.html</url>
</proceedings>
</r>
<r><inproceedings key="conf/bigdataconf/ChungHLL17" mdate="2023-09-30">
<author pid="17/7757">Wei-Chun Chung</author>
<author pid="89/1350">Jan-Ming Ho</author>
<author orcid="0000-0002-4733-9488" pid="87/820">Chung-Yen Lin</author>
<author pid="l/DTLee">D. T. Lee</author>
<title>CloudEC: A MapReduce-based algorithm for correcting errors in next-generation sequencing big data.</title>
<pages>2836-2842</pages>
<year>2017</year>
<booktitle>IEEE BigData</booktitle>
<ee>https://doi.org/10.1109/BigData.2017.8258251</ee>
<crossref>conf/bigdataconf/2017</crossref>
<url>db/conf/bigdataconf/bigdataconf2017.html#ChungHLL17</url>
</inproceedings>
</r>
<r><inproceedings key="conf/isaac/ShiauKLL17" mdate="2018-08-23">
<author pid="210/4309">Jia-Yau Shiau</author>
<author pid="29/2488">Mong-Jen Kao</author>
<author pid="84/3209">Ching-Chi Lin</author>
<author pid="l/DTLee">D. T. Lee</author>
<title>Tight Approximation for Partial Vertex Cover with Hard Capacities.</title>
<pages>64:1-64:13</pages>
<year>2017</year>
<booktitle>ISAAC</booktitle>
<ee type="oa">https://doi.org/10.4230/LIPIcs.ISAAC.2017.64</ee>
<crossref>conf/isaac/2017</crossref>
<url>db/conf/isaac/isaac2017.html#ShiauKLL17</url>
</inproceedings>
</r>
<r><article key="journals/comgeo/DaiKL16" mdate="2021-02-11">
<author pid="129/1277">Bang-Sin Dai</author>
<author pid="29/2488">Mong-Jen Kao</author>
<author pid="l/DTLee">D. T. Lee</author>
<title>Optimal time-convex hull for a straight-line highway in L<sub>p</sub>-metrics.</title>
<pages>1-20</pages>
<year>2016</year>
<volume>53</volume>
<journal>Comput. Geom.</journal>
<ee type="oa">https://doi.org/10.1016/j.comgeo.2015.10.007</ee>
<url>db/journals/comgeo/comgeo53.html#DaiKL16</url>
</article>
</r>
<r><article key="journals/tcs/SuLL16" mdate="2021-02-17">
<author pid="72/8236">Yu-Hsuan Su</author>
<author pid="84/3209">Ching-Chi Lin</author>
<author pid="l/DTLee">D. T. Lee</author>
<title>Broadcasting in weighted trees under the postal model.</title>
<pages>73-81</pages>
<year>2016</year>
<volume>621</volume>
<journal>Theor. Comput. Sci.</journal>
<ee type="oa">https://doi.org/10.1016/j.tcs.2016.01.031</ee>
<url>db/journals/tcs/tcs621.html#SuLL16</url>
</article>
</r>
<r><inproceedings key="conf/aspdac/SuHL16" mdate="2019-09-25">
<author pid="177/5304">Yi-Siang Su</author>
<author orcid="0000-0001-7348-5625" pid="63/4181">Tsung-Yi Ho</author>
<author pid="l/DTLee">Der-Tsai Lee</author>
<title>A routability-driven flow routing algorithm for programmable microfluidic devices.</title>
<pages>605-610</pages>
<year>2016</year>
<booktitle>ASP-DAC</booktitle>
<ee>https://doi.org/10.1109/ASPDAC.2016.7428078</ee>
<crossref>conf/aspdac/2016</crossref>
<url>db/conf/aspdac/aspdac2016.html#SuHL16</url>
</inproceedings>
</r>
<r><inproceedings key="conf/icpr/JhuoWCL16" mdate="2017-05-24">
<author pid="80/7642">I-Hong Jhuo</author>
<author pid="59/3954">Li Weng</author>
<author pid="34/1311">Wen-Huang Cheng</author>
<author pid="l/DTLee">D. T. Lee</author>
<title>A feature fusion framework for hashing.</title>
<pages>2288-2293</pages>
<year>2016</year>
<booktitle>ICPR</booktitle>
<ee>https://doi.org/10.1109/ICPR.2016.7899977</ee>
<crossref>conf/icpr/2016</crossref>
<url>db/conf/icpr/icpr2016.html#JhuoWCL16</url>
</inproceedings>
</r>
<r><inproceedings key="conf/isaac/KaoTL16" mdate="2018-08-23">
<author pid="29/2488">Mong-Jen Kao</author>
<author pid="140/7557">Hai-Lun Tu</author>
<author pid="l/DTLee">D. T. Lee</author>
<title>O(f) Bi-Approximation for Capacitated Covering with Hard Capacities.</title>
<pages>40:1-40:12</pages>
<year>2016</year>
<booktitle>ISAAC</booktitle>
<ee type="oa">https://doi.org/10.4230/LIPIcs.ISAAC.2016.40</ee>
<crossref>conf/isaac/2016</crossref>
<url>db/conf/isaac/isaac2016.html#KaoTL16</url>
</inproceedings>
</r>
<r><inproceedings key="conf/isaac/YuLL16" mdate="2018-08-23">
<author pid="18/2869">Hung-I Yu</author>
<author pid="04/1009">Tien-Ching Lin</author>
<author pid="l/DTLee">Der-Tsai Lee</author>
<title>The (1|1)-Centroid Problem on the Plane Concerning Distance Constraints.</title>
<pages>64:1-64:12</pages>
<year>2016</year>
<booktitle>ISAAC</booktitle>
<ee type="oa">https://doi.org/10.4230/LIPIcs.ISAAC.2016.64</ee>
<crossref>conf/isaac/2016</crossref>
<url>db/conf/isaac/isaac2016.html#YuLL16</url>
</inproceedings>
</r>
<r><article publtype="informal" key="journals/corr/YuLL16d" mdate="2018-08-13">
<author pid="18/2869">Hung-I Yu</author>
<author pid="04/1009">Tien-Ching Lin</author>
<author pid="l/DTLee">D. T. Lee</author>
<title>The (1|1)<sub>R</sub>-Centroid Problem on the Plane.</title>
<year>2016</year>
<volume>abs/1608.03680</volume>
<journal>CoRR</journal>
<ee type="oa">http://arxiv.org/abs/1608.03680</ee>
<url>db/journals/corr/corr1608.html#YuLL16d</url>
</article>
</r>
<r><article publtype="informal" key="journals/corr/KaoTL16" mdate="2018-08-13">
<author pid="29/2488">Mong-Jen Kao</author>
<author pid="140/7557">Hai-Lun Tu</author>
<author pid="l/DTLee">D. T. Lee</author>
<title>O(f) Bi-Approximation for Capacitated Covering with Hard Capacities.</title>
<year>2016</year>
<volume>abs/1609.02640</volume>
<journal>CoRR</journal>
<ee type="oa">http://arxiv.org/abs/1609.02640</ee>
<url>db/journals/corr/corr1609.html#KaoTL16</url>
</article>
</r>
<r><article key="journals/algorithmica/LiuPL15" mdate="2021-09-14">
<author orcid="0000-0001-9683-5982" pid="82/1212">Chih-Hung Liu 0001</author>
<author orcid="0000-0003-0144-7384" pid="93/4868">Evanthia Papadopoulou</author>
<author pid="l/DTLee">Der-Tsai Lee</author>
<title>The k-Nearest-Neighbor Voronoi Diagram Revisited.</title>
<pages>429-449</pages>
<year>2015</year>
<volume>71</volume>
<journal>Algorithmica</journal>
<number>2</number>
<ee>https://doi.org/10.1007/s00453-013-9809-9</ee>
<url>db/journals/algorithmica/algorithmica71.html#LiuPL15</url>
</article>
</r>
<r><article key="journals/algorithmica/KaoCL15" mdate="2023-01-19">
<author pid="29/2488">Mong-Jen Kao</author>
<author pid="59/2816">Han-Lin Chen</author>
<author pid="l/DTLee">D. T. Lee</author>
<title>Capacitated Domination: Problem Complexity and Approximation Algorithms.</title>
<pages>1-43</pages>
<year>2015</year>
<volume>72</volume>
<journal>Algorithmica</journal>
<number>1</number>
<ee>https://doi.org/10.1007/s00453-013-9844-6</ee>
<url>db/journals/algorithmica/algorithmica72.html#KaoCL15</url>
</article>
</r>
<r><article key="journals/tcs/ChenKLRW15" mdate="2021-02-17">
<author orcid="0000-0001-8114-9760" pid="70/1961">Jian-Jia Chen</author>
<author pid="29/2488">Mong-Jen Kao</author>
<author pid="l/DTLee">D. T. Lee</author>
<author orcid="0000-0002-3794-4406" pid="99/44">Ignaz Rutter</author>
<author orcid="0000-0002-9141-7076" pid="w/DorotheaWagner">Dorothea Wagner</author>
<title>Online dynamic power management with hard real-time guarantees.</title>
<pages>46-64</pages>
<year>2015</year>
<volume>595</volume>
<journal>Theor. Comput. Sci.</journal>
<ee type="oa">https://doi.org/10.1016/j.tcs.2015.06.014</ee>
<url>db/journals/tcs/tcs595.html#ChenKLRW15</url>
</article>
</r>
<r><article key="journals/algorithmica/ChaoHL14" mdate="2018-06-26">
<author orcid="0000-0003-2837-1279" pid="c/KunMaoChao">Kun-Mao Chao</author>
<author pid="19/2124">Tsan-sheng Hsu</author>
<author pid="l/DTLee">D. T. Lee</author>
<title>Preface Algorithms and Computation (ISAAC 2012).</title>
<pages>694-695</pages>
<year>2014</year>
<volume>70</volume>
<journal>Algorithmica</journal>
<number>4</number>
<ee type="oa">https://doi.org/10.1007/s00453-014-9933-1</ee>
<url>db/journals/algorithmica/algorithmica70.html#ChaoHL14</url>
</article>
</r>
<r><article key="journals/mva/JhuoYGLJLC14" mdate="2025-01-13">
<author pid="80/7642">I-Hong Jhuo</author>
<author pid="20/9998">Guangnan Ye</author>
<author pid="63/7642">Shenghua Gao</author>
<author pid="98/1737-1">Dong Liu 0001</author>
<author pid="24/5818">Yu-Gang Jiang 0001</author>
<author pid="l/DTLee">D. T. Lee</author>
<author pid="c/ShihFuChang">Shih-Fu Chang</author>
<title>Discovering joint audio-visual codewords for video event detection.</title>
<pages>33-47</pages>
<year>2014</year>
<volume>25</volume>
<journal>Mach. Vis. Appl.</journal>
<number>1</number>
<ee>https://doi.org/10.1007/s00138-013-0567-0</ee>
<url>db/journals/mva/mva25.html#JhuoYGLJLC14</url>
</article>
</r>
<r><article key="journals/tcad/LiuLCLW14" mdate="2021-09-14">
<author orcid="0000-0001-9683-5982" pid="82/1212">Chih-Hung Liu 0001</author>
<author pid="145/9179">Chun-Xun Lin</author>
<author pid="62/11467">I-Che Chen</author>
<author pid="l/DTLee">D. T. Lee</author>
<author pid="59/527">Ting-Chi Wang</author>
<title>Efficient Multilayer Obstacle-Avoiding Rectilinear Steiner Tree Construction Based on Geometric Reduction.</title>
<pages>1928-1941</pages>
<year>2014</year>
<volume>33</volume>
<journal>IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.</journal>
<number>12</number>
<ee>https://doi.org/10.1109/TCAD.2014.2363390</ee>
<url>db/journals/tcad/tcad33.html#LiuLCLW14</url>
</article>
</r>
<r><article key="journals/tcs/ChaoHL14" mdate="2021-02-17">
<author orcid="0000-0003-2837-1279" pid="c/KunMaoChao">Kun-Mao Chao</author>
<author pid="19/2124">Tsan-sheng Hsu</author>
<author pid="l/DTLee">D. T. Lee</author>
<title>Algorithms and Computation (ISAAC 2012).</title>
<pages>1-2</pages>
<year>2014</year>
<volume>544</volume>
<journal>Theor. Comput. Sci.</journal>
<ee type="oa">https://doi.org/10.1016/j.tcs.2014.06.034</ee>
<url>db/journals/tcs/tcs544.html#ChaoHL14</url>
</article>
</r>
<r><inproceedings key="conf/accv/JhuoGZLM14" mdate="2018-09-25">
<author pid="80/7642">I-Hong Jhuo</author>
<author pid="63/7642">Shenghua Gao</author>
<author pid="94/5815">Liansheng Zhuang</author>
<author pid="l/DTLee">D. T. Lee</author>
<author pid="69/1112-1">Yi Ma 0001</author>
<title>Unsupervised Feature Learning for RGB-D Image Classification.</title>
<pages>276-289</pages>
<year>2014</year>
<booktitle>ACCV (1)</booktitle>
<ee>https://doi.org/10.1007/978-3-319-16865-4_18</ee>
<crossref>conf/accv/2014-1</crossref>
<url>db/conf/accv/accv2014-1.html#JhuoGZLM14</url>
</inproceedings>
</r>
<r><inproceedings key="conf/bigdataconf/ChungCLH14" mdate="2023-03-24">
<author pid="17/7757">Wei-Chun Chung</author>
<author pid="12/443">Yu-Jung Chang</author>
<author pid="l/DTLee">D. T. Lee</author>
<author pid="89/1350">Jan-Ming Ho</author>
<title>Using geometric structures to improve the error correction algorithm of high-throughput sequencing data on MapReduce framework.</title>
<pages>784-789</pages>
<year>2014</year>
<booktitle>IEEE BigData</booktitle>
<ee>https://doi.org/10.1109/BigData.2014.7004306</ee>
<ee>https://doi.ieeecomputersociety.org/10.1109/BigData.2014.7004306</ee>
<crossref>conf/bigdataconf/2014</crossref>
<url>db/conf/bigdataconf/bigdataconf2014.html#ChungCLH14</url>
</inproceedings>
</r>
<r><inproceedings key="conf/dac/LinLCLH14" mdate="2021-09-14">
<author pid="145/9179">Chun-Xun Lin</author>
<author orcid="0000-0001-9683-5982" pid="82/1212">Chih-Hung Liu 0001</author>
<author pid="62/11467">I-Che Chen</author>
<author pid="l/DTLee">D. T. Lee</author>
<author orcid="0000-0001-7348-5625" pid="63/4181">Tsung-Yi Ho</author>
<title>An Efficient Bi-criteria Flow Channel Routing Algorithm For Flow-based Microfluidic Biochips.</title>
<pages>141:1-141:6</pages>
<year>2014</year>
<booktitle>DAC</booktitle>
<ee>https://doi.org/10.1145/2593069.2593084</ee>
<crossref>conf/dac/2014</crossref>
<url>db/conf/dac/dac2014.html#LinLCLH14</url>
</inproceedings>
</r>
<r><inproceedings key="conf/icpr/JhuoL14" mdate="2023-03-24">
<author pid="80/7642">I-Hong Jhuo</author>
<author pid="l/DTLee">D. T. Lee</author>
<title>Video Event Detection via Multi-modality Deep Learning.</title>
<pages>666-671</pages>
<year>2014</year>
<booktitle>ICPR</booktitle>
<ee>https://doi.org/10.1109/ICPR.2014.125</ee>
<ee>https://doi.ieeecomputersociety.org/10.1109/ICPR.2014.125</ee>
<crossref>conf/icpr/2014</crossref>
<url>db/conf/icpr/icpr2014.html#JhuoL14</url>
</inproceedings>
</r>
<r><inproceedings key="conf/stacs/ChenKLRW14" mdate="2023-09-30">
<author orcid="0000-0001-8114-9760" pid="70/1961">Jian-Jia Chen</author>
<author pid="29/2488">Mong-Jen Kao</author>
<author pid="l/DTLee">D. T. Lee</author>
<author orcid="0000-0002-3794-4406" pid="99/44">Ignaz Rutter</author>
<author pid="w/DorotheaWagner">Dorothea Wagner</author>
<title>Online Dynamic Power Management with Hard Real-Time Guarantees.</title>
<pages>226-238</pages>
<year>2014</year>
<booktitle>STACS</booktitle>
<ee type="oa">https://doi.org/10.4230/LIPIcs.STACS.2014.226</ee>
<crossref>conf/stacs/2014</crossref>
<url>db/conf/stacs/stacs2014.html#ChenKLRW14</url>
</inproceedings>
</r>
<r><book key="books/daglib/0031977" mdate="2017-06-13">
<author pid="27/2235">Franz Aurenhammer</author>
<author pid="k/RolfKlein">Rolf Klein</author>
<author pid="l/DTLee">Der-Tsai Lee</author>
<title>Voronoi Diagrams and Delaunay Triangulations.</title>
<pages>I-VIII, 1-337</pages>
<publisher>World Scientific</publisher>
<year>2013</year>
<isbn>978-981-4447-63-8</isbn>
<ee>https://doi.org/10.1142/8685</ee>
</book>
</r>
<r><article key="journals/algorithmica/LiaoL13" mdate="2017-05-17">
<author pid="72/3143">Chung-Shou Liao</author>
<author pid="l/DTLee">D. T. Lee</author>
<title>Power Domination in Circular-Arc Graphs.</title>
<pages>443-466</pages>
<year>2013</year>
<volume>65</volume>
<journal>Algorithmica</journal>
<number>2</number>
<ee>https://doi.org/10.1007/s00453-011-9599-x</ee>
<url>db/journals/algorithmica/algorithmica65.html#LiaoL13</url>
</article>
</r>
<r><article key="journals/ijcga/ChaoHL13" mdate="2020-06-04">
<author orcid="0000-0003-2837-1279" pid="c/KunMaoChao">Kun-Mao Chao</author>
<author pid="19/2124">Tsan-sheng Hsu</author>
<author pid="l/DTLee">Der-Tsai Lee</author>
<title>Guest Editors' Foreword.</title>
<pages>425-426</pages>
<year>2013</year>
<volume>23</volume>
<journal>Int. J. Comput. Geom. Appl.</journal>
<number>6</number>
<ee>https://doi.org/10.1142/S0218195913020032</ee>
<url>db/journals/ijcga/ijcga23.html#ChaoHL13</url>
</article>
</r>
<r><article key="journals/jco/KaoKKLRW13" mdate="2022-10-02">
<author pid="29/2488">Mong-Jen Kao</author>
<author orcid="0000-0003-0846-9615" pid="56/6619">Bastian Katz</author>
<author pid="50/3558">Marcus Krug</author>
<author pid="l/DTLee">D. T. Lee</author>
<author orcid="0000-0002-3794-4406" pid="99/44">Ignaz Rutter</author>
<author pid="w/DorotheaWagner">Dorothea Wagner</author>
<title>The density maximization problem in graphs.</title>
<pages>723-754</pages>
<year>2013</year>
<volume>26</volume>
<journal>J. Comb. Optim.</journal>
<number>4</number>
<ee>https://doi.org/10.1007/s10878-012-9465-z</ee>
<url>db/journals/jco/jco26.html#KaoKKLRW13</url>
</article>
</r>
<r><inproceedings key="conf/bigdataconf/ChungCCLH13" mdate="2021-03-31">
<author pid="17/7757">Wei-Chun Chung</author>
<author pid="12/443">Yu-Jung Chang</author>
<author pid="04/6670">Chien-Chih Chen</author>
<author pid="l/DTLee">Der-Tsai Lee</author>
<author pid="89/1350">Jan-Ming Ho</author>
<title>Optimizing a MapReduce module of preprocessing high-throughput DNA sequencing data.</title>
<pages>1-6</pages>
<year>2013</year>
<booktitle>IEEE BigData</booktitle>
<ee>https://doi.org/10.1109/BigData.2013.6691694</ee>
<crossref>conf/bigdataconf/2013</crossref>
<url>db/conf/bigdataconf/bigdataconf2013.html#ChungCCLH13</url>
</inproceedings>
</r>
<r><inproceedings key="conf/bigdataconf/ChenCCLH13" mdate="2021-03-31">
<author pid="04/6670">Chien-Chih Chen</author>
<author pid="12/443">Yu-Jung Chang</author>
<author pid="17/7757">Wei-Chun Chung</author>
<author pid="l/DTLee">Der-Tsai Lee</author>
<author pid="89/1350">Jan-Ming Ho</author>
<title>CloudRS: An error correction algorithm of high-throughput sequencing data based on scalable framework.</title>
<pages>717-722</pages>
<year>2013</year>
<booktitle>IEEE BigData</booktitle>
<ee>https://doi.org/10.1109/BigData.2013.6691642</ee>
<crossref>conf/bigdataconf/2013</crossref>
<url>db/conf/bigdataconf/bigdataconf2013.html#ChenCCLH13</url>
</inproceedings>
</r>
<r><inproceedings key="conf/soda/LiuL13" mdate="2021-09-14">
<author pid="82/1212">Chih-Hung Liu 0001</author>
<author pid="l/DTLee">D. T. Lee</author>
<title>Higher-Order Geodesic Voronoi Diagrams in a Polygonal Domain with Holes.</title>
<pages>1633-1645</pages>
<year>2013</year>
<booktitle>SODA</booktitle>
<ee type="oa">https://doi.org/10.1137/1.9781611973105.117</ee>
<crossref>conf/soda/2013</crossref>
<url>db/conf/soda/soda2013.html#LiuL13</url>
</inproceedings>
</r>
<r><inproceedings key="conf/wads/DaiKL13" mdate="2017-05-21">
<author pid="129/1277">Bang-Sin Dai</author>
<author pid="29/2488">Mong-Jen Kao</author>
<author pid="l/DTLee">D. T. Lee</author>
<title>Optimal Time-Convex Hull under the L p Metrics.</title>
<pages>268-279</pages>
<year>2013</year>
<booktitle>WADS</booktitle>
<ee>https://doi.org/10.1007/978-3-642-40104-6_24</ee>
<crossref>conf/wads/2013</crossref>
<url>db/conf/wads/wads2013.html#DaiKL13</url>
</inproceedings>
</r>
<r><article publtype="informal" key="journals/corr/abs-1301-3252" mdate="2018-08-13">
<author pid="29/2488">Mong-Jen Kao</author>
<author pid="l/DTLee">Der-Tsai Lee</author>
<author pid="w/DorotheaWagner">Dorothea Wagner</author>
<title>Approximating Metrics by Tree Metrics of Small Distance-Weighted Average Stretch</title>
<ee type="oa">http://arxiv.org/abs/1301.3252</ee>
<year>2013</year>
<journal>CoRR</journal>
<volume>abs/1301.3252</volume>
<url>db/journals/corr/corr1301.html#abs-1301-3252</url>
</article>
</r>
<r><article publtype="informal" key="journals/corr/abs-1304-1590" mdate="2019-09-17">
<author orcid="0000-0001-8114-9760" pid="70/1961">Jian-Jia Chen</author>
<author pid="29/2488">Mong-Jen Kao</author>
<author pid="l/DTLee">D. T. Lee</author>
<author pid="99/44">Ignaz Rutter</author>
<author pid="w/DorotheaWagner">Dorothea Wagner</author>
<title>Online Power-Managing Strategy with Hard Real-Time Guarantees</title>
<ee type="oa">http://arxiv.org/abs/1304.1590</ee>
<year>2013</year>
<journal>CoRR</journal>
<volume>abs/1304.1590</volume>
<url>db/journals/corr/corr1304.html#abs-1304-1590</url>
</article>
</r>
<r><article publtype="informal" key="journals/corr/abs-1304-7833" mdate="2018-08-13">
<author pid="129/1277">Bang-Sin Dai</author>
<author pid="29/2488">Mong-Jen Kao</author>
<author pid="l/DTLee">D. T. Lee</author>
<title>Optimal Time-Convex Hull under the Lp Metrics</title>
<ee type="oa">http://arxiv.org/abs/1304.7833</ee>
<year>2013</year>
<journal>CoRR</journal>
<volume>abs/1304.7833</volume>
<url>db/journals/corr/corr1304.html#abs-1304-7833</url>
</article>
</r>
<r><article key="journals/ijcga/Wulff-NilsenGKLLLPY12" mdate="2020-06-04">
<author pid="79/1632">Christian Wulff-Nilsen</author>
<author pid="59/4119">Ansgar Gr&#252;ne</author>
<author pid="k/RolfKlein">Rolf Klein</author>
<author pid="76/5590">Elmar Langetepe</author>
<author pid="l/DTLee">D. T. Lee</author>
<author pid="04/1009">Tien-Ching Lin</author>
<author orcid="0000-0002-1777-9394" pid="91/6695">Sheung-Hung Poon</author>
<author pid="97/1063">Teng-Kai Yu</author>
<title>Computing the Stretch factor and Maximum Detour of Paths, Trees, and cycles in the normed Space.</title>
<pages>45-60</pages>
<year>2012</year>
<volume>22</volume>
<journal>Int. J. Comput. Geom. Appl.</journal>
<number>1</number>
<ee>https://doi.org/10.1142/S0218195912600035</ee>
<ee>https://www.wikidata.org/entity/Q62041788</ee>
<url>db/journals/ijcga/ijcga22.html#Wulff-NilsenGKLLLPY12</url>
</article>
</r>
<r><article key="journals/tcad/LiuKLLWY12" mdate="2021-09-14">
<author orcid="0000-0001-9683-5982" pid="82/1212">Chih-Hung Liu 0001</author>
<author orcid="0000-0002-3021-8321" pid="57/264">Sy-Yen Kuo</author>
<author pid="l/DTLee">D. T. Lee</author>
<author pid="115/8620">Chun-Syun Lin</author>
<author pid="32/8358">Jung-Hung Weng</author>
<author orcid="0000-0002-3704-0917" pid="18/4080">Shih-Yi Yuan</author>
<title>Obstacle-Avoiding Rectilinear Steiner Tree Construction: A Steiner-Point-Based Algorithm.</title>
<pages>1050-1060</pages>
<year>2012</year>
<volume>31</volume>
<journal>IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.</journal>
<number>7</number>
<ee>https://doi.org/10.1109/TCAD.2012.2185050</ee>
<url>db/journals/tcad/tcad31.html#LiuKLLWY12</url>
</article>
</r>
<r><inproceedings key="conf/aina/TungLL12" mdate="2023-03-24">
<author pid="83/3056">Tsai-Yeh Tung</author>
<author pid="36/3190">Laurent Lin</author>
<author pid="l/DTLee">D. T. Lee</author>
<title>Pandora Messaging: An Enhanced Self-Message-Destructing Secure Instant Messaging Architecture for Mobile Devices.</title>
<pages>720-725</pages>
<year>2012</year>
<booktitle>AINA Workshops</booktitle>
<ee>https://doi.org/10.1109/WAINA.2012.112</ee>
<ee>https://doi.ieeecomputersociety.org/10.1109/WAINA.2012.112</ee>
<crossref>conf/aina/2012w</crossref>
<url>db/conf/aina/ainaw2012.html#TungLL12</url>
</inproceedings>
</r>
<r><inproceedings key="conf/cvpr/JhuoLLC12" mdate="2023-03-24">
<author pid="80/7642">I-Hong Jhuo</author>
<author pid="98/1737-1">Dong Liu 0001</author>
<author pid="l/DTLee">D. T. Lee</author>
<author pid="c/ShihFuChang">Shih-Fu Chang</author>
<title>Robust visual domain adaptation with low-rank reconstruction.</title>
<pages>2168-2175</pages>
<year>2012</year>
<booktitle>CVPR</booktitle>
<ee>https://doi.org/10.1109/CVPR.2012.6247924</ee>
<ee>https://doi.ieeecomputersociety.org/10.1109/CVPR.2012.6247924</ee>
<crossref>conf/cvpr/2012</crossref>
<url>db/conf/cvpr/cvpr2012.html#JhuoLLC12</url>
</inproceedings>
</r>
<r><inproceedings key="conf/dac/LiuCL12" mdate="2021-09-14">
<author orcid="0000-0001-9683-5982" pid="82/1212">Chih-Hung Liu 0001</author>
<author pid="62/11467">I-Che Chen</author>
<author pid="l/DTLee">D. T. Lee</author>
<title>An efficient algorithm for multi-layer obstacle-avoiding rectilinear Steiner tree construction.</title>
<pages>613-622</pages>
<year>2012</year>
<booktitle>DAC</booktitle>
<ee>https://doi.org/10.1145/2228360.2228471</ee>
<crossref>conf/dac/2012</crossref>
<url>db/conf/dac/dac2012.html#LiuCL12</url>
</inproceedings>
</r>
<r><inproceedings key="conf/mir/YeJLJLC12" mdate="2025-01-13">
<author pid="20/9998">Guangnan Ye</author>
<author pid="80/7642">I-Hong Jhuo</author>
<author pid="98/1737-1">Dong Liu 0001</author>
<author pid="24/5818">Yu-Gang Jiang 0001</author>
<author pid="l/DTLee">D. T. Lee</author>
<author pid="c/ShihFuChang">Shih-Fu Chang</author>
<title>Joint audio-visual bi-modal codewords for video event detection.</title>
<pages>39</pages>
<year>2012</year>
<booktitle>ICMR</booktitle>
<ee>https://doi.org/10.1145/2324796.2324843</ee>
<crossref>conf/mir/2012</crossref>
<url>db/conf/mir/icmr2012.html#YeJLJLC12</url>
</inproceedings>
</r>
<r><inproceedings key="conf/soca/ChungWKLH12" mdate="2023-03-24">
<author pid="17/7757">Wei-Chun Chung</author>
<author orcid="0000-0002-6468-0952" pid="52/6359">Chi-Jen Wu</author>
<author pid="24/3629">Chin-Fu Ku</author>
<author pid="l/DTLee">Der-Tsai Lee</author>
<author pid="89/1350">Jan-Ming Ho</author>
<title>DR. ION: Disaster rescue over information-oriented network.</title>
<pages>1-4</pages>
<year>2012</year>
<booktitle>SOCA</booktitle>
<ee>https://doi.org/10.1109/SOCA.2012.6449428</ee>
<ee>https://doi.ieeecomputersociety.org/10.1109/SOCA.2012.6449428</ee>
<crossref>conf/soca/2012</crossref>
<url>db/conf/soca/soca2012.html#ChungWKLH12</url>
</inproceedings>
</r>
<r><inproceedings key="conf/swat/GemsaLLW12" mdate="2021-09-14">
<author pid="94/7963">Andreas Gemsa</author>
<author pid="l/DTLee">D. T. Lee</author>
<author orcid="0000-0001-9683-5982" pid="82/1212">Chih-Hung Liu 0001</author>
<author pid="w/DorotheaWagner">Dorothea Wagner</author>
<title>Higher Order City Voronoi Diagrams.</title>
<pages>59-70</pages>
<year>2012</year>
<booktitle>SWAT</booktitle>
<ee>https://doi.org/10.1007/978-3-642-31155-0_6</ee>
<crossref>conf/swat/2012</crossref>
<url>db/conf/swat/swat2012.html#GemsaLLW12</url>
</inproceedings>
</r>
<r><proceedings key="conf/isaac/2012" mdate="2019-05-14">
<editor pid="c/KunMaoChao">Kun-Mao Chao</editor>
<editor pid="19/2124">Tsan-sheng Hsu</editor>
<editor pid="l/DTLee">Der-Tsai Lee</editor>
<title>Algorithms and Computation - 23rd International Symposium, ISAAC 2012, Taipei, Taiwan, December 19-21, 2012. Proceedings</title>
<year>2012</year>
<publisher>Springer</publisher>
<series href="db/series/lncs/index.html">Lecture Notes in Computer Science</series>
<volume>7676</volume>
<ee>https://doi.org/10.1007/978-3-642-35261-4</ee>
<isbn>978-3-642-35260-7</isbn>
<booktitle>ISAAC</booktitle>
<url>db/conf/isaac/isaac2012.html</url>
</proceedings>
</r>
<r><article publtype="informal" key="journals/corr/abs-1204-4374" mdate="2021-09-14">
<author pid="94/7963">Andreas Gemsa</author>
<author pid="l/DTLee">D. T. Lee</author>
<author pid="82/1212">Chih-Hung Liu 0001</author>
<author pid="w/DorotheaWagner">Dorothea Wagner</author>
<title>Higher Order City Voronoi Diagrams</title>
<ee type="oa">http://arxiv.org/abs/1204.4374</ee>
<year>2012</year>
<journal>CoRR</journal>
<volume>abs/1204.4374</volume>
<url>db/journals/corr/corr1204.html#abs-1204-4374</url>
</article>
</r>
<r><article key="journals/algorithmica/KaoLL11" mdate="2017-05-17">
<author pid="29/2488">Mong-Jen Kao</author>
<author pid="72/3143">Chung-Shou Liao</author>
<author pid="l/DTLee">D. T. Lee</author>
<title>Capacitated Domination Problem.</title>
<pages>274-300</pages>
<year>2011</year>
<volume>60</volume>
<journal>Algorithmica</journal>
<number>2</number>
<ee>https://doi.org/10.1007/s00453-009-9336-x</ee>
<url>db/journals/algorithmica/algorithmica60.html#KaoLL11</url>
</article>
</r>
<r><inproceedings key="conf/aaai/JhuoL11" mdate="2023-09-04">
<author pid="80/7642">I-Hong Jhuo</author>
<author pid="l/DTLee">D. T. Lee</author>
<title>Multiple-Instance Learning: Multiple Feature Selection on Instance Representation.</title>
<year>2011</year>
<booktitle>AAAI</booktitle>
<ee type="oa">https://doi.org/10.1609/aaai.v25i1.8030</ee>
<crossref>conf/aaai/2011</crossref>
<url>db/conf/aaai/aaai2011.html#JhuoL11</url>
<pages>1794-1795</pages>
</inproceedings>
</r>
<r><inproceedings key="conf/cccg/KaoKKLNRW11" mdate="2023-01-19">
<author pid="29/2488">Mong-Jen Kao</author>
<author pid="56/6619">Bastian Katz</author>
<author pid="50/3558">Marcus Krug</author>
<author pid="l/DTLee">D. T. Lee</author>
<author pid="41/4420">Martin N&#246;llenburg</author>
<author pid="99/44">Ignaz Rutter</author>
<author pid="w/DorotheaWagner">Dorothea Wagner</author>
<title>Connecting Two Trees with Optimal Routing Cost.</title>
<year>2011</year>
<booktitle>CCCG</booktitle>
<ee type="oa">http://www.cccg.ca/proceedings/2011/papers/paper35.pdf</ee>
<crossref>conf/cccg/2011</crossref>
<url>db/conf/cccg/cccg2011.html#KaoKKLNRW11</url>
</inproceedings>
</r>
<r><inproceedings key="conf/cocoon/KaoKKLRW11" mdate="2018-11-02">
<author pid="29/2488">Mong-Jen Kao</author>
<author pid="56/6619">Bastian Katz</author>
<author pid="50/3558">Marcus Krug</author>
<author pid="l/DTLee">D. T. Lee</author>
<author orcid="0000-0002-3794-4406" pid="99/44">Ignaz Rutter</author>
<author pid="w/DorotheaWagner">Dorothea Wagner</author>
<title>The Density Maximization Problem in Graphs.</title>
<pages>25-36</pages>
<year>2011</year>
<booktitle>COCOON</booktitle>
<ee>https://doi.org/10.1007/978-3-642-22685-4_3</ee>
<crossref>conf/cocoon/2011</crossref>
<url>db/conf/cocoon/cocoon2011.html#KaoKKLRW11</url>
</inproceedings>
</r>
<r><inproceedings key="conf/esa/LiuPL11" mdate="2023-03-21">
<author orcid="0000-0001-9683-5982" pid="82/1212">Chih-Hung Liu 0001</author>
<author orcid="0000-0003-0144-7384" pid="93/4868">Evanthia Papadopoulou</author>
<author pid="l/DTLee">D. T. Lee</author>
<title>An Output-Sensitive Approach for the L 1/L &#8734; k-Nearest-Neighbor Voronoi Diagram.</title>
<pages>70-81</pages>
<year>2011</year>
<booktitle>ESA</booktitle>
<ee>https://doi.org/10.1007/978-3-642-23719-5_7</ee>
<crossref>conf/esa/2011</crossref>
<url>db/conf/esa/esa2011.html#LiuPL11</url>
</inproceedings>
</r>
<r><inproceedings key="conf/isaac/KaoL11" mdate="2017-05-19">
<author pid="29/2488">Mong-Jen Kao</author>
<author pid="l/DTLee">D. T. Lee</author>
<title>Capacitated Domination: Constant Factor Approximations for Planar Graphs.</title>
<pages>494-503</pages>
<year>2011</year>
<booktitle>ISAAC</booktitle>
<ee>https://doi.org/10.1007/978-3-642-25591-5_51</ee>
<crossref>conf/isaac/2011</crossref>
<url>db/conf/isaac/isaac2011.html#KaoL11</url>
</inproceedings>
</r>
<r><inproceedings key="conf/isaac/YuLL11" mdate="2017-05-19">
<author pid="18/2869">Hung-I Yu</author>
<author pid="04/1009">Tien-Ching Lin</author>
<author pid="l/DTLee">D. T. Lee</author>
<title>Finding Maximum Sum Segments in Sequences with Uncertainty.</title>
<pages>734-743</pages>
<year>2011</year>
<booktitle>ISAAC</booktitle>
<ee>https://doi.org/10.1007/978-3-642-25591-5_75</ee>
<crossref>conf/isaac/2011</crossref>
<url>db/conf/isaac/isaac2011.html#YuLL11</url>
</inproceedings>
</r>
<r><article publtype="informal" key="journals/corr/abs-1108-4606" mdate="2018-08-13">
<author pid="29/2488">Mong-Jen Kao</author>
<author pid="l/DTLee">D. T. Lee</author>
<title>Capacitated Domination: Constant Factor Approximation for Planar Graphs</title>
<ee type="oa">http://arxiv.org/abs/1108.4606</ee>
<year>2011</year>
<journal>CoRR</journal>
<volume>abs/1108.4606</volume>
<url>db/journals/corr/corr1108.html#abs-1108-4606</url>
</article>
</r>
<r><article key="journals/tcs/LinL10" mdate="2021-02-17">
<author pid="04/1009">Tien-Ching Lin</author>
<author pid="l/DTLee">D. T. Lee</author>
<title>Efficient algorithms for the sum selection problem and k maximum sums problem.</title>
<pages>986-994</pages>
<year>2010</year>
<volume>411</volume>
<journal>Theor. Comput. Sci.</journal>
<number>7-9</number>
<ee type="oa">https://doi.org/10.1016/j.tcs.2009.11.005</ee>
<url>db/journals/tcs/tcs411.html#LinL10</url>
</article>
</r>
<r><inproceedings key="conf/cocoon/SuLL10" mdate="2017-05-23">
<author pid="72/8236">Yu-Hsuan Su</author>
<author pid="84/3209">Ching-Chi Lin</author>
<author pid="l/DTLee">D. T. Lee</author>
<title>Broadcasting in Heterogeneous Tree Networks.</title>
<pages>368-377</pages>
<year>2010</year>
<booktitle>COCOON</booktitle>
<ee>https://doi.org/10.1007/978-3-642-14031-0_40</ee>
<crossref>conf/cocoon/2010</crossref>
<url>db/conf/cocoon/cocoon2010.html#SuLL10</url>
</inproceedings>
</r>
<r><inproceedings key="conf/icpr/JhuoL10" mdate="2023-03-24">
<author pid="80/7642">I-Hong Jhuo</author>
<author pid="l/DTLee">D. T. Lee</author>
<title>Boosted Multiple Kernel Learning for Scene Category Recognition.</title>
<pages>3504-3507</pages>
<year>2010</year>
<booktitle>ICPR</booktitle>
<ee>https://doi.org/10.1109/ICPR.2010.855</ee>
<ee>https://doi.ieeecomputersociety.org/10.1109/ICPR.2010.855</ee>
<crossref>conf/icpr/2010</crossref>
<url>db/conf/icpr/icpr2010.html#JhuoL10</url>
</inproceedings>
</r>
<r><inproceedings key="conf/isaac/GruneLYKLLP10" mdate="2019-09-16">
<author pid="59/4119">Ansgar Gr&#252;ne</author>
<author pid="04/1009">Tien-Ching Lin</author>
<author pid="97/1063">Teng-Kai Yu</author>
<author pid="k/RolfKlein">Rolf Klein</author>
<author pid="76/5590">Elmar Langetepe</author>
<author pid="l/DTLee">D. T. Lee</author>
<author orcid="0000-0002-1777-9394" pid="91/6695">Sheung-Hung Poon</author>
<title>Spanning Ratio and Maximum Detour of Rectilinear Paths in the <i>L</i><sub>1</sub> Plane.</title>
<pages>121-131</pages>
<year>2010</year>
<booktitle>ISAAC (2)</booktitle>
<ee>https://doi.org/10.1007/978-3-642-17514-5_11</ee>
<ee>https://www.wikidata.org/entity/Q62041818</ee>
<crossref>conf/isaac/2010-2</crossref>
<url>db/conf/isaac/isaac2010-2.html#GruneLYKLLP10</url>
</inproceedings>
</r>
<r><inproceedings key="conf/ispa/YuLCZ10" mdate="2023-03-23">
<author pid="97/1063">Teng-Kai Yu</author>
<author pid="l/DTLee">D. T. Lee</author>
<author pid="70/7545">Shih-Ming Chang</author>
<author pid="127/0551">Justin Zhan</author>
<title>Multi-party k-Means Clustering with Privacy Consideration.</title>
<pages>200-207</pages>
<year>2010</year>
<booktitle>ISPA</booktitle>
<ee>https://doi.org/10.1109/ISPA.2010.8</ee>
<ee>https://doi.ieeecomputersociety.org/10.1109/ISPA.2010.8</ee>
<crossref>conf/ispa/2010</crossref>
<url>db/conf/ispa/ispa2010.html#YuLCZ10</url>
</inproceedings>
</r>
<r><inproceedings key="conf/mm/JhuoL10" mdate="2018-11-06">
<author pid="80/7642">I-Hong Jhuo</author>
<author pid="l/DTLee">D. T. Lee</author>
<title>Boosting-based multiple kernel learning for image re-ranking.</title>
<pages>1159-1162</pages>
<year>2010</year>
<booktitle>ACM Multimedia</booktitle>
<ee>https://doi.org/10.1145/1873951.1874175</ee>
<crossref>conf/mm/2010</crossref>
<url>db/conf/mm/mm2010.html#JhuoL10</url>
</inproceedings>
</r>
<r><inproceedings key="conf/mmm/JhuoCL10" mdate="2022-10-02">
<author pid="80/7642">I-Hong Jhuo</author>
<author orcid="0000-0003-3951-7931" pid="c/TsuhanChen">Tsuhan Chen</author>
<author pid="l/DTLee">D. T. Lee</author>
<title>Scene Location Guide by Image-Based Retrieval.</title>
<pages>196-206</pages>
<year>2010</year>
<booktitle>MMM</booktitle>
<ee>https://doi.org/10.1007/978-3-642-11301-7_22</ee>
<crossref>conf/mmm/2010</crossref>
<url>db/conf/mmm/mmm2010.html#JhuoCL10</url>
</inproceedings>
</r>
<r><proceedings key="conf/faw/2010" mdate="2019-05-14">
<editor pid="l/DTLee">Der-Tsai Lee</editor>
<editor pid="c/DannyZChen">Danny Z. Chen</editor>
<editor pid="75/3547">Shi Ying</editor>
<title>Frontiers in Algorithmics, 4th International Workshop, FAW 2010, Wuhan, China, August 11-13, 2010. Proceedings</title>
<volume>6213</volume>
<year>2010</year>
<isbn>978-3-642-14552-0</isbn>
<ee>https://doi.org/10.1007/978-3-642-14553-7</ee>
<booktitle>FAW</booktitle>
<series href="db/series/lncs/index.html">Lecture Notes in Computer Science</series>
<publisher>Springer</publisher>
<url>db/conf/faw/faw2010.html</url>
</proceedings>
</r>
<r><article key="journals/algorithmica/ChenL09" mdate="2017-05-17">
<author pid="c/DannyZChen">Danny Z. Chen</author>
<author pid="l/DTLee">D. T. Lee</author>
<title>Guest Editors' Forward.</title>
<pages>155-156</pages>
<year>2009</year>
<volume>53</volume>
<journal>Algorithmica</journal>
<number>2</number>
<ee>https://doi.org/10.1007/s00453-008-9186-y</ee>
<url>db/journals/algorithmica/algorithmica53.html#ChenL09</url>
</article>
</r>
<r><article key="journals/algorithmica/LeeLL09" mdate="2017-05-17">
<author pid="l/DTLee">D. T. Lee</author>
<author pid="04/1009">Tien-Ching Lin</author>
<author pid="l/HsuehILu">Hsueh-I Lu</author>
<title>Fast Algorithms for the Density Finding Problem.</title>
<pages>298-313</pages>
<year>2009</year>
<volume>53</volume>
<journal>Algorithmica</journal>
<number>3</number>
<ee>https://doi.org/10.1007/s00453-007-9023-8</ee>
<url>db/journals/algorithmica/algorithmica53.html#LeeLL09</url>
</article>
</r>
<r><article key="journals/bioinformatics/ChuLLLS09" mdate="2020-03-02">
<author pid="29/7252">Te-Chin Chu</author>
<author pid="52/1134">Tsunglin Liu</author>
<author pid="l/DTLee">D. T. Lee</author>
<author pid="06/1480">Greg C. Lee</author>
<author pid="64/5278">Arthur Chun-Chieh Shih</author>
<title>GR-Aligner: an algorithm for aligning pairwise genomic sequences containing rearrangement events.</title>
<pages>2188-2193</pages>
<year>2009</year>
<volume>25</volume>
<journal>Bioinform.</journal>
<number>17</number>
<ee>https://doi.org/10.1093/bioinformatics/btp372</ee>
<ee>https://www.wikidata.org/entity/Q48273223</ee>
<url>db/journals/bioinformatics/bioinformatics25.html#ChuLLLS09</url>
</article>
</r>
<r><article key="journals/ijcga/ChenL09" mdate="2020-06-04">
<author pid="c/DannyZChen">Danny Z. Chen</author>
<author pid="l/DTLee">D. T. Lee</author>
<title>Editors' Foreword.</title>
<pages>213-214</pages>
<year>2009</year>
<volume>19</volume>
<journal>Int. J. Comput. Geom. Appl.</journal>
<number>3</number>
<ee>https://doi.org/10.1142/S0218195909002915</ee>
<url>db/journals/ijcga/ijcga19.html#ChenL09</url>
</article>
</r>
<r><article key="journals/tvcg/WeiTLHL09" mdate="2019-10-19">
<author orcid="0000-0003-2169-2408" pid="97/5340">Jyh-Da Wei</author>
<author pid="37/5659">Ming-Hung Tsai</author>
<author pid="97/1502">Gen-Cher Lee</author>
<author pid="79/507">Jeng-Hung Huang</author>
<author pid="l/DTLee">Der-Tsai Lee</author>
<title>GeoBuilder: A Geometric Algorithm Visualization and Debugging System for 2D and 3D Geometric Computing.</title>
<pages>234-248</pages>
<year>2009</year>
<volume>15</volume>
<journal>IEEE Trans. Vis. Comput. Graph.</journal>
<number>2</number>
<ee>https://doi.org/10.1109/TVCG.2008.93</ee>
<ee>http://doi.ieeecomputersociety.org/10.1109/TVCG.2008.93</ee>
<ee>https://www.wikidata.org/entity/Q33400242</ee>
<url>db/journals/tvcg/tvcg15.html#WeiTLHL09</url>
</article>
</r>
<r><inproceedings key="conf/csie/WeiCTL09" mdate="2023-03-23">
<author orcid="0000-0003-2169-2408" pid="97/5340">Jyh-Da Wei</author>
<author pid="57/455">Tai-Yu Chen</author>
<author pid="83/3056">Tsai-Yeh Tung</author>
<author pid="l/DTLee">D. T. Lee</author>
<title>Integration of a Concept Map Generator and a Knowledge-Portal-Based E-learning System.</title>
<pages>356-360</pages>
<year>2009</year>
<booktitle>CSIE (7)</booktitle>
<ee>https://doi.org/10.1109/CSIE.2009.924</ee>
<ee>https://doi.ieeecomputersociety.org/10.1109/CSIE.2009.924</ee>
<crossref>conf/csie/2009</crossref>
<url>db/conf/csie/csie2009-7.html#WeiCTL09</url>
</inproceedings>
</r>
<r><inproceedings key="conf/isaac/SeoLL09" mdate="2018-08-07">
<author pid="67/9765">Dae-Young Seo</author>
<author pid="l/DTLee">D. T. Lee</author>
<author pid="04/1009">Tien-Ching Lin</author>
<title>Geometric Minimum Diameter Minimum Cost Spanning Tree Problem.</title>
<pages>283-292</pages>
<year>2009</year>
<booktitle>ISAAC</booktitle>
<ee>https://doi.org/10.1007/978-3-642-10631-6_30</ee>
<crossref>conf/isaac/2009</crossref>
<url>db/conf/isaac/isaac2009.html#SeoLL09</url>
</inproceedings>
</r>
<r><inproceedings key="conf/isaac/LinL09" mdate="2017-05-19">
<author pid="04/1009">Tien-Ching Lin</author>
<author pid="l/DTLee">D. T. Lee</author>
<title>Optimal Randomized Algorithm for the Density Selection Problem.</title>
<pages>1004-1013</pages>
<year>2009</year>
<booktitle>ISAAC</booktitle>
<ee>https://doi.org/10.1007/978-3-642-10631-6_101</ee>
<crossref>conf/isaac/2009</crossref>
<url>db/conf/isaac/isaac2009.html#LinL09</url>
</inproceedings>
</r>
<r><article key="journals/tcs/AmatoLPT08" mdate="2021-02-17">
<author pid="a/NMAmato">Nancy M. Amato</author>
<author pid="l/DTLee">Der-Tsai Lee</author>
<author pid="95/3178">Andrea Pietracaprina</author>
<author pid="t/RobertoTamassia">Roberto Tamassia</author>
<title>Preface.</title>
<pages>97-98</pages>
<year>2008</year>
<volume>408</volume>
<journal>Theor. Comput. Sci.</journal>
<number>2-3</number>
<ee type="oa">https://doi.org/10.1016/j.tcs.2008.08.001</ee>
<url>db/journals/tcs/tcs408.html#AmatoLPT08</url>
</article>
</r>
<r><inproceedings key="conf/fuzzIEEE/WangCL08" mdate="2017-05-21">
<author pid="61/4893">Ying-Chung Wang</author>
<author pid="27/2182">Chiang-Ju Chien</author>
<author pid="l/DTLee">Der-Tsai Lee</author>
<title>An output recurrent fuzzy neural network based iterative learning control for nonlinear systems.</title>
<pages>1563-1569</pages>
<year>2008</year>
<booktitle>FUZZ-IEEE</booktitle>
<ee>https://doi.org/10.1109/FUZZY.2008.4630580</ee>
<crossref>conf/fuzzIEEE/2008</crossref>
<url>db/conf/fuzzIEEE/fuzzIEEE2008.html#WangCL08</url>
</inproceedings>
</r>
<r><inproceedings key="conf/icarcv/WangCL08" mdate="2017-05-23">
<author pid="61/4893">Ying-Chung Wang</author>
<author pid="27/2182">Chiang-Ju Chien</author>
<author pid="l/DTLee">Der-Tsai Lee</author>
<title>Reinforcement fuzzy-neural adaptive iterative learning control for nonlinear systems.</title>
<pages>733-738</pages>
<year>2008</year>
<booktitle>ICARCV</booktitle>
<ee>https://doi.org/10.1109/ICARCV.2008.4795608</ee>
<crossref>conf/icarcv/2008</crossref>
<url>db/conf/icarcv/icarcv2008.html#WangCL08</url>
</inproceedings>
</r>
<r><proceedings key="conf/isw/2008" mdate="2019-05-14">
<editor pid="93/2842">Tzong-Chen Wu</editor>
<editor pid="31/3229">Chin-Laung Lei</editor>
<editor pid="r/VincentRijmen">Vincent Rijmen</editor>
<editor pid="l/DTLee">Der-Tsai Lee</editor>
<title>Information Security, 11th International Conference, ISC 2008, Taipei, Taiwan, September 15-18, 2008. Proceedings</title>
<volume>5222</volume>
<year>2008</year>
<isbn>978-3-540-85884-3</isbn>
<booktitle>ISC</booktitle>
<series href="db/series/lncs/index.html">Lecture Notes in Computer Science</series>
<publisher>Springer</publisher>
<ee>https://doi.org/10.1007/978-3-540-85886-7</ee>
<url>db/conf/isw/isc2008.html</url>
</proceedings>
</r>
<r><article key="journals/bmcbi/HsuLLTLLYSHSLCLLSYCKH07" mdate="2025-05-01">
<author pid="h/ChunNanHsu">Chun-Nan Hsu</author>
<author orcid="0000-0003-4893-3101" pid="50/2813">Jin-Mei Lai</author>
<author pid="63/2830">Chia-Hung Liu</author>
<author pid="85/3287">Huei-Hun Tseng</author>
<author pid="42/7104">Chih-Yun Lin</author>
<author orcid="0000-0003-1294-1142" pid="58/5026">Kuan-Ting Lin</author>
<author pid="58/7112">Hsu-Hua Yeh</author>
<author pid="17/6103">Ting-Yi Sung</author>
<author pid="10/4757">Wen-Lian Hsu</author>
<author orcid="0000-0002-8342-9800" pid="00/7108">Li-Jen Su</author>
<author pid="83/6556">Sheng-An Lee</author>
<author pid="41/7101">Chang-Han Chen</author>
<author pid="97/1502">Gen-Cher Lee</author>
<author pid="l/DTLee">D. T. Lee</author>
<author pid="34/3150">Yow-Ling Shiue</author>
<author pid="34/7107">Chang-Wei Yeh</author>
<author orcid="0000-0002-1401-2403" pid="77/5424">Chao-Hui Chang</author>
<author pid="34/4269">Cheng-Yan Kao</author>
<author orcid="0000-0003-4898-4937" pid="55/919">Chi-Ying F. Huang</author>
<title>Detection of the inferred interaction network in hepatocellular carcinoma from EHCO (Encyclopedia of Hepatocellular Carcinoma genes Online).</title>
<year>2007</year>
<volume>8</volume>
<journal>BMC Bioinform.</journal>
<ee type="oa">https://doi.org/10.1186/1471-2105-8-66</ee>
<ee>https://www.wikidata.org/entity/Q33275840</ee>
<url>db/journals/bmcbi/bmcbi8.html#HsuLLTLLYSHSLCLLSYCKH07</url>
</article>
</r>
<r><article key="journals/bmcbi/ShihLPW07" mdate="2020-03-15">
<author pid="64/5278">Arthur Chun-Chieh Shih</author>
<author pid="l/DTLee">D. T. Lee</author>
<author pid="95/2866">Chin-Lin Peng</author>
<author orcid="0000-0002-5603-1194" pid="83/614">Yu-Wei Wu</author>
<title><i>Phylo-mLogo</i>: an interactive and hierarchical multiple-logo visualization tool for alignment of many sequences.</title>
<year>2007</year>
<volume>8</volume>
<journal>BMC Bioinform.</journal>
<ee type="oa">https://doi.org/10.1186/1471-2105-8-63</ee>
<ee>https://www.wikidata.org/entity/Q30830208</ee>
<url>db/journals/bmcbi/bmcbi8.html#ShihLPW07</url>
</article>
</r>
<r><article key="journals/jpdc/HuangL07" mdate="2020-02-22">
<author pid="33/4933">Tzu-Lun Huang</author>
<author pid="l/DTLee">D. T. Lee</author>
<title>A distributed multicast routing algorithm for real-time applications in wide area networks.</title>
<pages>516-530</pages>
<year>2007</year>
<volume>67</volume>
<journal>J. Parallel Distributed Comput.</journal>
<number>5</number>
<ee>https://doi.org/10.1016/j.jpdc.2007.01.007</ee>
<url>db/journals/jpdc/jpdc67.html#HuangL07</url>
</article>
</r>
<r><article key="journals/tcs/LinL07" mdate="2021-02-17">
<author pid="04/1009">Tien-Ching Lin</author>
<author pid="l/DTLee">D. T. Lee</author>
<title>Randomized algorithm for the sum selection problem.</title>
<pages>151-156</pages>
<year>2007</year>
<volume>377</volume>
<journal>Theor. Comput. Sci.</journal>
<number>1-3</number>
<ee type="oa">https://doi.org/10.1016/j.tcs.2007.02.027</ee>
<url>db/journals/tcs/tcs377.html#LinL07</url>
</article>
</r>
<r><article key="journals/tvt/LeeSLW07" mdate="2020-06-25">
<author pid="l/DTLee">Der-Tsai Lee</author>
<author pid="27/1963">Shaw-Ji Shiah</author>
<author pid="04/5163">Chien-Ming Lee</author>
<author pid="61/4893">Ying-Chung Wang</author>
<title>State-of-Charge Estimation for Electric Scooters by Using Learning Mechanisms.</title>
<pages>544-556</pages>
<year>2007</year>
<volume>56</volume>
<journal>IEEE Trans. Veh. Technol.</journal>
<number>2</number>
<ee>https://doi.org/10.1109/TVT.2007.891433</ee>
<url>db/journals/tvt/tvt56.html#LeeSLW07</url>
</article>
</r>
<r><inproceedings key="conf/faw/YuLL07" mdate="2023-01-19">
<author pid="37/5550">Kuen-Lin Yu</author>
<author pid="72/3143">Chung-Shou Liao</author>
<author pid="l/DTLee">D. T. Lee</author>
<title>Maximizing the Number of Independent Labels in the Plane.</title>
<pages>136-147</pages>
<year>2007</year>
<crossref>conf/faw/2007</crossref>
<booktitle>FAW</booktitle>
<ee>https://doi.org/10.1007/978-3-540-73814-5_13</ee>
<url>db/conf/faw/faw2007.html#YuLL07</url>
</inproceedings>
</r>
<r><inproceedings key="conf/icdcsw/YuLLLK07" mdate="2023-03-24">
<author pid="91/1919">Chia-Mu Yu</author>
<author pid="46/2794">Cheng-Chung Li</author>
<author pid="40/4382">Chun-Shien Lu</author>
<author pid="l/DTLee">Der-Tsai Lee</author>
<author orcid="0000-0002-3021-8321" pid="57/264">Sy-Yen Kuo</author>
<title>Attack Probability Based Deterministic Key Predistribution Mechanism for Non-Uniform Sensor Deployment.</title>
<pages>18</pages>
<year>2007</year>
<crossref>conf/icdcsw/2007</crossref>
<booktitle>ICDCS Workshops</booktitle>
<ee>https://doi.org/10.1109/ICDCSW.2007.24</ee>
<ee>https://doi.ieeecomputersociety.org/10.1109/ICDCSW.2007.24</ee>
<url>db/conf/icdcsw/icdcsw2007.html#YuLLLK07</url>
</inproceedings>
</r>
<r><inproceedings key="conf/ike/WeiTCL07" mdate="2008-01-03">
<author pid="97/5340">Jyh-Da Wei</author>
<author pid="83/3056">Tsai-Yeh Tung</author>
<author pid="57/455">Tai-Yu Chen</author>
<author pid="l/DTLee">D. T. Lee</author>
<title>Integration of Knowledge Management and E-Learning - An Implementation Towards Learning by Teaching.</title>
<pages>414-420</pages>
<year>2007</year>
<crossref>conf/ike/2007</crossref>
<booktitle>IKE</booktitle>
<url>db/conf/ike/ike2007.html#WeiTCL07</url>
</inproceedings>
</r>
<r><inproceedings key="conf/iri/WeiCTL07" mdate="2019-10-19">
<author orcid="0000-0003-2169-2408" pid="97/5340">Jyh-Da Wei</author>
<author pid="57/455">Tai-Yu Chen</author>
<author pid="83/3056">Tsai-Yeh Tung</author>
<author pid="l/DTLee">D. T. Lee</author>
<title>A Visualization Tool to Construct the Reference-Based Relation Map for Group Knowledge of a Knowledge Portal.</title>
<pages>304-310</pages>
<year>2007</year>
<crossref>conf/iri/2007</crossref>
<booktitle>IRI</booktitle>
<ee>https://doi.org/10.1109/IRI.2007.4296638</ee>
<url>db/conf/iri/iri2007.html#WeiCTL07</url>
</inproceedings>
</r>
<r><inproceedings key="conf/isvd/YuL07" mdate="2023-03-24">
<author pid="97/1063">Teng-Kai Yu</author>
<author pid="l/DTLee">D. T. Lee</author>
<title>Time Convex Hull with a Highway.</title>
<pages>240-250</pages>
<year>2007</year>
<crossref>conf/isvd/2007</crossref>
<booktitle>ISVD</booktitle>
<ee>https://doi.org/10.1109/ISVD.2007.38</ee>
<ee>https://doi.ieeecomputersociety.org/10.1109/ISVD.2007.38</ee>
<url>db/conf/isvd/isvd2007.html#YuL07</url>
</inproceedings>
</r>
<r><article key="journals/bmcbi/ShihLLPCWWCSH06" mdate="2020-03-15">
<author pid="64/5278">Arthur Chun-Chieh Shih</author>
<author pid="l/DTLee">D. T. Lee</author>
<author pid="36/3190">Laurent Lin</author>
<author pid="95/2866">Chin-Lin Peng</author>
<author pid="89/3607">Shiang-Heng Chen</author>
<author orcid="0000-0002-5603-1194" pid="83/614">Yu-Wei Wu</author>
<author pid="21/2617">Chun-Yi Wong</author>
<author pid="46/5402">Meng-Yuan Chou</author>
<author pid="97/2915">Tze-Chang Shiao</author>
<author pid="97/1891">Mu-Fen Hsieh</author>
<title>SinicView: A visualization environment for comparisons of multiple nucleotide sequence alignment tools.</title>
<pages>103</pages>
<year>2006</year>
<volume>7</volume>
<journal>BMC Bioinform.</journal>
<ee type="oa">https://doi.org/10.1186/1471-2105-7-103</ee>
<ee>https://www.wikidata.org/entity/Q30810181</ee>
<url>db/journals/bmcbi/bmcbi7.html#ShihLLPCWWCSH06</url>
</article>
</r>
<r><article key="journals/comcom/HuangL06" mdate="2020-02-20">
<author pid="33/4933">Tzu-Lun Huang</author>
<author pid="l/DTLee">D. T. Lee</author>
<title>An iterative distributed algorithm for multi-constraint multicast routing.</title>
<pages>3647-3661</pages>
<year>2006</year>
<volume>29</volume>
<journal>Comput. Commun.</journal>
<number>17</number>
<ee>https://doi.org/10.1016/j.comcom.2006.06.004</ee>
<url>db/journals/comcom/comcom29.html#HuangL06</url>
</article>
</r>
<r><article key="journals/tip/HoHLL06" mdate="2023-09-14">
<author pid="89/4692">Jinn Ho</author>
<author orcid="0000-0002-5546-6575" pid="h/WenLiangHwang">Wen-Liang Hwang</author>
<author pid="17/6294">Henry Horng-Shing Lu</author>
<author pid="l/DTLee">D. T. Lee</author>
<title>Gridding spot centers of smoothly distorted microarray images.</title>
<pages>342-353</pages>
<year>2006</year>
<volume>15</volume>
<journal>IEEE Trans. Image Process.</journal>
<number>2</number>
<ee>https://doi.org/10.1109/TIP.2005.860610</ee>
<ee>https://www.wikidata.org/entity/Q51950742</ee>
<url>db/journals/tip/tip15.html#HoHLL06</url>
</article>
</r>
<r><inproceedings key="conf/compgeom/TsaiWHL06" mdate="2024-08-04">
<author pid="37/5659">Ming-Hung Tsai</author>
<author orcid="0000-0003-2169-2408" pid="97/5340">Jyh-Da Wei</author>
<author pid="79/507">Jeng-Hung Huang</author>
<author pid="l/DTLee">D. T. Lee</author>
<title>A portable geometric algorithm visualization system with dynamic camera positioning for tracking 3D objects.</title>
<pages>479-480</pages>
<year>2006</year>
<crossref>conf/compgeom/2006</crossref>
<booktitle>SCG</booktitle>
<ee>https://doi.org/10.1145/1137856.1137928</ee>
<url>db/conf/compgeom/compgeom2006.html#TsaiWHL06</url>
</inproceedings>
</r>
<r><inproceedings key="conf/isaac/LinL06" mdate="2017-05-19">
<author pid="04/1009">Tien-Ching Lin</author>
<author pid="l/DTLee">D. T. Lee</author>
<title>Efficient Algorithms for the Sum Selection Problem and K Maximum Sums Problem.</title>
<pages>460-473</pages>
<year>2006</year>
<crossref>conf/isaac/2006</crossref>
<booktitle>ISAAC</booktitle>
<ee>https://doi.org/10.1007/11940128_47</ee>
<url>db/conf/isaac/isaac2006.html#LinL06</url>
</inproceedings>
</r>
<r><inproceedings key="conf/iticse/ChenWHL06" mdate="2024-08-04">
<author pid="26/4228-2">Ming-Yu Chen 0002</author>
<author orcid="0000-0003-2169-2408" pid="97/5340">Jyh-Da Wei</author>
<author pid="79/507">Jeng-Hung Huang</author>
<author pid="l/DTLee">D. T. Lee</author>
<title>Design and applications of an algorithm benchmark system in a computational problem solving environment.</title>
<pages>123-127</pages>
<year>2006</year>
<crossref>conf/iticse/2006</crossref>
<booktitle>ITiCSE</booktitle>
<ee>https://doi.org/10.1145/1140124.1140159</ee>
<ee>https://doi.org/10.1145/1140123.1140159</ee>
<url>db/conf/iticse/iticse2006.html#ChenWHL06</url>
</inproceedings>
</r>
<r><inproceedings key="conf/seal/WeiL06" mdate="2024-08-04">
<author orcid="0000-0003-2169-2408" pid="97/5340">Jyh-Da Wei</author>
<author pid="l/DTLee">D. T. Lee</author>
<title>Priority-Based Genetic Local Search and Its Application to the Traveling Salesman Problem.</title>
<pages>424-432</pages>
<year>2006</year>
<crossref>conf/seal/2006</crossref>
<booktitle>SEAL</booktitle>
<ee>https://doi.org/10.1007/11903697_54</ee>
<url>db/conf/seal/seal2006.html#WeiL06</url>
</inproceedings>
</r>
<r><proceedings key="conf/ccs/2006" mdate="2020-11-10">
<editor pid="28/4018">Ferng-Ching Lin</editor>
<editor pid="l/DTLee">Der-Tsai Lee</editor>
<editor pid="15/4486">Bao-Shuh Paul Lin</editor>
<editor pid="s/ShiuhPyngShieh">Shiuhpyng Shieh</editor>
<editor pid="j/SushilJajodia">Sushil Jajodia</editor>
<title>Proceedings of the 2006 ACM Symposium on Information, Computer and Communications Security, ASIACCS 2006, Taipei, Taiwan, March 21-24, 2006</title>
<isbn>1-59593-272-0</isbn>
<year>2006</year>
<booktitle>AsiaCCS</booktitle>
<publisher>ACM</publisher>
<url>db/conf/ccs/ccs2006.html</url>
</proceedings>
</r>
<r><proceedings key="conf/cocoon/2006" mdate="2019-05-14">
<editor pid="c/DannyZChen">Danny Z. Chen</editor>
<editor pid="l/DTLee">D. T. Lee</editor>
<title>Computing and Combinatorics, 12th Annual International Conference, COCOON 2006, Taipei, Taiwan, August 15-18, 2006, Proceedings</title>
<booktitle>COCOON</booktitle>
<series href="db/series/lncs/index.html">Lecture Notes in Computer Science</series>
<volume>4112</volume>
<publisher>Springer</publisher>
<year>2006</year>
<isbn>3-540-36925-2</isbn>
<ee>https://doi.org/10.1007/11809678</ee>
<url>db/conf/cocoon/cocoon2006.html</url>
</proceedings>
</r>
<r><article key="journals/cn/HuangTLHLK05" mdate="2023-08-28">
<author pid="49/3977">Yao-Wen Huang</author>
<author pid="22/4057">Chung-Hung Tsai</author>
<author pid="46/6953">Tsung-Po Lin</author>
<author orcid="0000-0002-6766-4683" pid="72/7017">Shih-Kun Huang</author>
<author pid="l/DTLee">D. T. Lee</author>
<author orcid="0000-0002-3021-8321" pid="57/264">Sy-Yen Kuo</author>
<title>A testing framework for Web application security assessment.</title>
<pages>739-761</pages>
<year>2005</year>
<volume>48</volume>
<journal>Comput. Networks</journal>
<number>5</number>
<ee>https://doi.org/10.1016/j.comnet.2005.01.003</ee>
<ee>https://www.wikidata.org/entity/Q115063173</ee>
<url>db/journals/cn/cn48.html#HuangTLHLK05</url>
</article>
</r>
<r><article key="journals/ijcga/ChenLL05" mdate="2023-01-19">
<author pid="75/4638">Yu-Shin Chen</author>
<author pid="l/DTLee">D. T. Lee</author>
<author pid="72/3143">Chung-Shou Liao</author>
<title>Labeling Points on a Single Line.</title>
<pages>261-278</pages>
<year>2005</year>
<volume>15</volume>
<journal>Int. J. Comput. Geom. Appl.</journal>
<number>3</number>
<ee>https://doi.org/10.1142/S0218195905001695</ee>
<url>db/journals/ijcga/ijcga15.html#ChenLL05</url>
</article>
</r>
<r><article key="journals/jco/HsuTWL05" mdate="2023-10-17">
<author pid="19/2124">Tsan-sheng Hsu</author>
<author pid="33/4593">Kuo-Hui Tsai</author>
<author pid="39/2537-4">Da-Wei Wang 0004</author>
<author pid="l/DTLee">D. T. Lee</author>
<title>Two Variations of the Minimum Steiner Problem.</title>
<pages>101-120</pages>
<year>2005</year>
<volume>9</volume>
<journal>J. Comb. Optim.</journal>
<number>1</number>
<ee>https://doi.org/10.1007/s10878-005-5487-0</ee>
<url>db/journals/jco/jco9.html#HsuTWL05</url>
</article>
</r>
<r><article key="journals/tcad/HoCCL05" mdate="2020-09-24">
<author orcid="0000-0001-7348-5625" pid="63/4181">Tsung-Yi Ho</author>
<author orcid="0000-0002-0564-5719" pid="c/YaoWenChang">Yao-Wen Chang</author>
<author orcid="0000-0003-1152-171X" pid="74/4774">Sao-Jie Chen</author>
<author pid="l/DTLee">D. T. Lee</author>
<title>Crosstalk- and performance-driven multilevel full-chip routing.</title>
<pages>869-878</pages>
<year>2005</year>
<volume>24</volume>
<journal>IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.</journal>
<number>6</number>
<ee>https://doi.org/10.1109/TCAD.2005.847902</ee>
<url>db/journals/tcad/tcad24.html#HoCCL05</url>
</article>
</r>
<r><article key="journals/ton/HuangL05" mdate="2017-05-27">
<author pid="33/4933">Tzu-Lun Huang</author>
<author pid="l/DTLee">D. T. Lee</author>
<title>Comments and an improvement on &#34;A distributed algorithm of delay-bounded multicast routing for multimedia applications in wide area networks&#34;.</title>
<pages>1410-1411</pages>
<year>2005</year>
<volume>13</volume>
<journal>IEEE/ACM Trans. Netw.</journal>
<number>6</number>
<ee>https://doi.org/10.1109/TNET.2005.860091</ee>
<url>db/journals/ton/ton13.html#HuangL05</url>
</article>
</r>
<r><inproceedings key="conf/cocoon/LiaoL05" mdate="2017-05-23">
<author pid="72/3143">Chung-Shou Liao</author>
<author pid="l/DTLee">Der-Tsai Lee</author>
<title>Power Domination Problem in Graphs.</title>
<pages>818-828</pages>
<year>2005</year>
<crossref>conf/cocoon/2005</crossref>
<booktitle>COCOON</booktitle>
<ee>https://doi.org/10.1007/11533719_83</ee>
<url>db/conf/cocoon/cocoon2005.html#LiaoL05</url>
</inproceedings>
</r>
<r><inproceedings key="conf/csb/ShihLLPCWCS05" mdate="2023-03-23">
<author pid="64/5278">Arthur Chun-Chieh Shih</author>
<author pid="l/DTLee">D. T. Lee</author>
<author pid="36/3190">Laurent Lin</author>
<author pid="95/2866">Chin-Lin Peng</author>
<author pid="89/3607">Shiang-Heng Chen</author>
<author pid="21/2617">Chun-Yi Wong</author>
<author pid="46/5402">Meng-Yuan Chou</author>
<author pid="97/2915">Tze-Chang Shiao</author>
<title>SinicView: An Interactive Visualization Tool for Comparison of Multiple Sequence Alignment Results.</title>
<pages>269-270</pages>
<year>2005</year>
<crossref>conf/csb/2005w</crossref>
<booktitle>CSB Workshops</booktitle>
<ee>https://doi.org/10.1109/CSBW.2005.127</ee>
<ee>https://doi.ieeecomputersociety.org/10.1109/CSBW.2005.127</ee>
<url>db/conf/csb/csbw2005.html#ShihLLPCWCS05</url>
</inproceedings>
</r>
<r><inproceedings key="conf/dft/YuTHLLK05" mdate="2023-03-24">
<author pid="44/3505-1">Fang Yu 0001</author>
<author pid="22/4057">Chung-Hung Tsai</author>
<author pid="49/3977">Yao-Wen Huang</author>
<author pid="l/DTLee">D. T. Lee</author>
<author pid="03/106">Hung-Yau Lin</author>
<author pid="57/264">Sy-Yen Kuo</author>
<title>Efficient Exact Spare Allocation via Boolean Satisfiability.</title>
<pages>361-370</pages>
<year>2005</year>
<crossref>conf/dft/2005</crossref>
<booktitle>DFT</booktitle>
<ee>https://doi.org/10.1109/DFTVS.2005.32</ee>
<ee>https://doi.ieeecomputersociety.org/10.1109/DFTVS.2005.32</ee>
<url>db/conf/dft/dft2005.html#YuTHLLK05</url>
</inproceedings>
</r>
<r><inproceedings key="conf/eusipco/HoHLL05" mdate="2023-09-14">
<author pid="89/4692">Jinn Ho</author>
<author pid="h/WenLiangHwang">Wen-Liang Hwang</author>
<author pid="17/6294">Henry Horng-Shing Lu</author>
<author pid="l/DTLee">D. T. Lee</author>
<title>Gridding the spot centers of microarray images.</title>
<pages>1-4</pages>
<year>2005</year>
<booktitle>EUSIPCO</booktitle>
<ee>https://ieeexplore.ieee.org/document/7078020/</ee>
<crossref>conf/eusipco/2005</crossref>
<url>db/conf/eusipco/eusipco2005.html#HoHLL05</url>
</inproceedings>
</r>
<r><inproceedings key="conf/isaac/LinL05" mdate="2017-05-19">
<author pid="04/1009">Tien-Ching Lin</author>
<author pid="l/DTLee">D. T. Lee</author>
<title>Randomized Algorithm for the Sum Selection Problem.</title>
<pages>515-523</pages>
<year>2005</year>
<crossref>conf/isaac/2005</crossref>
<booktitle>ISAAC</booktitle>
<ee>https://doi.org/10.1007/11602613_52</ee>
<url>db/conf/isaac/isaac2005.html#LinL05</url>
</inproceedings>
</r>
<r><proceedings key="conf/icdat/2005" mdate="2023-06-02">
<editor pid="c/ALPChen">Arbee L. P. Chen</editor>
<editor pid="l/DTLee">Der-Tsai Lee</editor>
<title>Proceedings of the 3rd International Conference on Digital Archive Technologies, ICDAT 2005, Taipei, Taiwan, June 16-17, 2005.</title>
<booktitle>ICDAT</booktitle>
<year>2005</year>
<url>db/conf/icdat/icdat2005.html</url>
</proceedings>
</r>
<r><article key="journals/ijcga/LeeM04" mdate="2020-06-04">
<author pid="l/DTLee">D. T. Lee</author>
<author pid="m/JosephSBMitchell">Joseph S. B. Mitchell</author>
<title>A note from the editors-in-chief.</title>
<year>2004</year>
<volume>14</volume>
<journal>Int. J. Comput. Geom. Appl.</journal>
<number>1-2</number>
<ee>https://doi.org/10.1142/S0218195904001391</ee>
<url>db/journals/ijcga/ijcga14.html#LeeM04</url>
</article>
</r>
<r><article key="journals/ijcga/PapadopoulouL04" mdate="2021-07-25">
<author orcid="0000-0003-0144-7384" pid="93/4868">Evanthia Papadopoulou</author>
<author pid="l/DTLee">D. T. Lee</author>
<title>The hausdorff voronoi diagram of polygonal objects: a divide and conquer approach.</title>
<pages>421-452</pages>
<year>2004</year>
<volume>14</volume>
<journal>Int. J. Comput. Geom. Appl.</journal>
<number>6</number>
<ee>https://doi.org/10.1142/S0218195904001536</ee>
<url>db/journals/ijcga/ijcga14.html#PapadopoulouL04</url>
</article>
</r>
<r><article key="journals/jise/YuL04" mdate="2021-07-16">
<author pid="16/734">T. K. Yu</author>
<author pid="l/DTLee">D. T. Lee</author>
<title>On the Crossing Distribution Problem in Two Regions.</title>
<pages>1-25</pages>
<year>2004</year>
<volume>20</volume>
<journal>J. Inf. Sci. Eng.</journal>
<number>1</number>
<ee type="archive">http://www.iis.sinica.edu.tw/page/jise/2004/200401_01.html</ee>
<url>db/journals/jise/jise20.html#YuL04</url>
</article>
</r>
<r><article key="journals/tits/WuHL04" mdate="2023-01-19">
<author pid="21/2100">Chun-Hsin Wu</author>
<author pid="89/1350">Jan-Ming Ho</author>
<author pid="l/DTLee">D. T. Lee</author>
<title>Travel-time prediction with support vector regression.</title>
<pages>276-281</pages>
<year>2004</year>
<volume>5</volume>
<journal>IEEE Trans. Intell. Transp. Syst.</journal>
<number>4</number>
<ee>https://doi.org/10.1109/TITS.2004.837813</ee>
<url>db/journals/tits/tits5.html#WuHL04</url>
</article>
</r>
<r><inproceedings key="conf/cec/WeiL04" mdate="2023-01-19">
<author pid="97/5340">Jyh-Da Wei</author>
<author pid="l/DTLee">D. T. Lee</author>
<title>A new approach to the traveling salesman problem using genetic algorithms with priority encoding.</title>
<pages>1457-1464</pages>
<year>2004</year>
<crossref>conf/cec/2004</crossref>
<booktitle>IEEE Congress on Evolutionary Computation</booktitle>
<ee>https://doi.org/10.1109/CEC.2004.1331068</ee>
<url>db/conf/cec/cec2004.html#WeiL04</url>
</inproceedings>
</r>
<r><inproceedings key="conf/dsn/HuangYHTLK04" mdate="2023-03-24">
<author pid="49/3977">Yao-Wen Huang</author>
<author pid="44/3505-1">Fang Yu 0001</author>
<author pid="57/3796">Christian Hang</author>
<author pid="22/4057">Chung-Hung Tsai</author>
<author pid="l/DTLee">D. T. Lee</author>
<author pid="57/264">Sy-Yen Kuo</author>
<title>Verifying Web Applications Using Bounded Model Checking.</title>
<pages>199-208</pages>
<year>2004</year>
<crossref>conf/dsn/2004</crossref>
<booktitle>DSN</booktitle>
<ee>https://doi.org/10.1109/DSN.2004.1311890</ee>
<ee>https://doi.ieeecomputersociety.org/10.1109/DSN.2004.1311890</ee>
<url>db/conf/dsn/dsn2004.html#HuangYHTLK04</url>
</inproceedings>
</r>
<r><inproceedings key="conf/icarcv/WangCL04" mdate="2023-01-19">
<author pid="61/4893">Ying-Chung Wang</author>
<author pid="27/2182">Chiang-Ju Chien</author>
<author pid="l/DTLee">D. T. Lee</author>
<title>An adaptive PID-type iterative learning controller unknown nonlinear systems.</title>
<pages>607-612</pages>
<year>2004</year>
<booktitle>ICARCV</booktitle>
<ee>https://doi.org/10.1109/ICARCV.2004.1468896</ee>
<crossref>conf/icarcv/2004</crossref>
<url>db/conf/icarcv/icarcv2004.html#WangCL04</url>
</inproceedings>
</r>
<r><inproceedings key="conf/issre/HuangTLK04" mdate="2023-03-24">
<author pid="49/3977">Yao-Wen Huang</author>
<author pid="22/4057">Chung-Hung Tsai</author>
<author pid="l/DTLee">D. T. Lee</author>
<author pid="57/264">Sy-Yen Kuo</author>
<title>Non-Detrimental Web Application Security Scanning.</title>
<pages>219-230</pages>
<year>2004</year>
<crossref>conf/issre/2004</crossref>
<booktitle>ISSRE</booktitle>
<ee>https://doi.org/10.1109/ISSRE.2004.25</ee>
<ee>https://doi.ieeecomputersociety.org/10.1109/ISSRE.2004.25</ee>
<url>db/conf/issre/issre2004.html#HuangTLK04</url>
</inproceedings>
</r>
<r><inproceedings key="conf/www/HuangYHTLK04" mdate="2021-12-30">
<author pid="49/3977">Yao-Wen Huang</author>
<author pid="44/3505-1">Fang Yu 0001</author>
<author pid="57/3796">Christian Hang</author>
<author pid="22/4057">Chung-Hung Tsai</author>
<author pid="l/DTLee">Der-Tsai Lee</author>
<author pid="57/264">Sy-Yen Kuo</author>
<title>Securing web application code by static analysis and runtime protection.</title>
<pages>40-52</pages>
<year>2004</year>
<crossref>conf/www/2004</crossref>
<booktitle>WWW</booktitle>
<ee>https://doi.org/10.1145/988672.988679</ee>
<url>db/conf/www/www2004.html#HuangYHTLK04</url>
</inproceedings>
</r>
<r><incollection publtype="encyclopedia" key="reference/crc/Lee04" mdate="2023-01-19">
<author pid="l/DTLee">D. T. Lee</author>
<title>Interval, Segment, Range, and Priority Search Trees.</title>
<year>2004</year>
<booktitle>Handbook of Data Structures and Applications</booktitle>
<ee type="archive">https://doi.org/10.1201/9781420035179.ch18</ee>
<crossref>reference/crc/2004dsa</crossref>
<url>db/reference/crc/dsa2004.html#Lee04</url>
</incollection>
</r>
<r><article key="journals/ijcga/Lee03" mdate="2023-01-19">
<author pid="l/DTLee">D. T. Lee</author>
<title>Chief Editor's Notice.</title>
<pages>1-2</pages>
<year>2003</year>
<volume>13</volume>
<journal>Int. J. Comput. Geom. Appl.</journal>
<number>1</number>
<ee type="archive">http://www.worldscinet.com/ijcga/13/1301/S0218195903001037.html</ee>
<url>db/journals/ijcga/ijcga13.html#Lee03</url>
</article>
</r>
<r><article key="journals/jucs/LeeLH03" mdate="2023-09-07">
<author pid="l/DTLee">D. T. Lee</author>
<author pid="97/1502">Gen-Cher Lee</author>
<author pid="49/3977">Yao-Wen Huang</author>
<title>Knowledge Management for Computational Problem Solving.</title>
<pages>563-570</pages>
<year>2003</year>
<volume>9</volume>
<journal>J. Univers. Comput. Sci.</journal>
<number>6</number>
<ee type="oa">https://doi.org/10.3217/jucs-009-06-0563</ee>
<url>db/journals/jucs/jucs9.html#LeeLH03</url>
</article>
</r>
<r><inproceedings key="conf/iccad/HoCCL03" mdate="2023-03-24">
<author orcid="0000-0001-7348-5625" pid="63/4181">Tsung-Yi Ho</author>
<author pid="c/YaoWenChang">Yao-Wen Chang</author>
<author pid="74/4774">Sao-Jie Chen</author>
<author pid="l/DTLee">D. T. Lee</author>
<title>A Fast Crosstalk- and Performance-Driven Multilevel Routing System.</title>
<pages>382-387</pages>
<year>2003</year>
<crossref>conf/iccad/2003</crossref>
<booktitle>ICCAD</booktitle>
<ee>https://doi.ieeecomputersociety.org/10.1109/ICCAD.2003.1257806</ee>
<ee>https://dl.acm.org/citation.cfm?id=1009919</ee>
<url>db/conf/iccad/iccad2003.html#HoCCL03</url>
</inproceedings>
</r>
<r><inproceedings key="conf/amcc/LaiLLW02" mdate="2022-10-02">
<author pid="324/9590">Hsien-Chung Lai</author>
<author orcid="0000-0002-4935-8965" pid="30/794">Jing-Sin Liu</author>
<author pid="l/DTLee">D. T. Lee</author>
<author pid="72/2129">Li-Sheng Wang</author>
<title>Finding battery locations of electrical motorcycles for better perception of riding comfort.</title>
<pages>915-920</pages>
<year>2002</year>
<booktitle>ACC</booktitle>
<ee>https://doi.org/10.1109/ACC.2002.1023134</ee>
<crossref>conf/amcc/2002</crossref>
<url>db/conf/amcc/acc2002.html#LaiLLW02</url>
</inproceedings>
</r>
<r><inproceedings key="conf/isaac/PapadopoulouL02" mdate="2023-03-21">
<author orcid="0000-0003-0144-7384" pid="93/4868">Evanthia Papadopoulou</author>
<author pid="l/DTLee">D. T. Lee</author>
<title>The Min-Max Voronoi Diagram of Polygons and Applications in VLSI Manufacturing.</title>
<pages>511-522</pages>
<year>2002</year>
<crossref>conf/isaac/2002</crossref>
<booktitle>ISAAC</booktitle>
<ee>https://doi.org/10.1007/3-540-36136-7_45</ee>
<url>db/conf/isaac/isaac2002.html#PapadopoulouL02</url>
</inproceedings>
</r>
<r><inproceedings key="conf/ispan/HuangL02" mdate="2023-03-24">
<author pid="33/4933">Tzu-Lun Huang</author>
<author pid="l/DTLee">D. T. Lee</author>
<title>A Distributed Multicast Routing Algorithm for Real-Time Applications in Wide Area Networks.</title>
<pages>335-340</pages>
<ee>https://doi.org/10.1109/ISPAN.2002.1004303</ee>
<ee>https://doi.ieeecomputersociety.org/10.1109/ISPAN.2002.1004303</ee>
<year>2002</year>
<crossref>conf/ispan/2002</crossref>
<booktitle>ISPAN</booktitle>
<url>db/conf/ispan/ispan2002.html#HuangL02</url>
</inproceedings>
</r>
<r><article key="journals/ijcga/AokiL01" mdate="2023-03-21">
<author orcid="0000-0002-6662-8015" pid="a/KiyokoFAokiKinoshita">Kiyoko F. Aoki</author>
<author pid="l/DTLee">D. T. Lee</author>
<title>Towards Web-Based Computing.</title>
<pages>71-104</pages>
<year>2001</year>
<volume>11</volume>
<journal>Int. J. Comput. Geom. Appl.</journal>
<number>1</number>
<url>db/journals/ijcga/ijcga11.html#AokiL01</url>
<ee>https://doi.org/10.1142/S0218195901000407</ee>
</article>
</r>
<r><article key="journals/ijcga/PapadopoulouL01" mdate="2021-07-25">
<author orcid="0000-0003-0144-7384" pid="93/4868">Evanthia Papadopoulou</author>
<author pid="l/DTLee">D. T. Lee</author>
<title>The L<sub>infty</sub>-Voronoi Diagram of Segments and VLSI Applications.</title>
<pages>503-528</pages>
<year>2001</year>
<volume>11</volume>
<journal>Int. J. Comput. Geom. Appl.</journal>
<number>5</number>
<url>db/journals/ijcga/ijcga11.html#PapadopoulouL01</url>
<ee>https://doi.org/10.1142/S0218195901000626</ee>
</article>
</r>
<r><article key="journals/tsmc/MokWL01" mdate="2020-05-25">
<author pid="29/149">Swee M. Mok</author>
<author pid="129/6626">Chi-haur Wu</author>
<author pid="l/DTLee">D. T. Lee</author>
<title>Modeling automatic assembly and disassembly operations for virtual manufacturing.</title>
<pages>223-232</pages>
<year>2001</year>
<volume>31</volume>
<journal>IEEE Trans. Syst. Man Cybern. Part A</journal>
<number>3</number>
<url>db/journals/tsmc/tsmca31.html#MokWL01</url>
<ee>https://doi.org/10.1109/3468.925662</ee>
</article>
</r>
<r><article key="journals/algorithmica/AndrewsACL00" mdate="2017-05-17">
<author pid="79/2710">Marilyn G. Andrews</author>
<author pid="a/MikhailJAtallah">Mikhail J. Atallah</author>
<author pid="c/DannyZChen">Danny Z. Chen</author>
<author pid="l/DTLee">D. T. Lee</author>
<title>Parallel Algorithms for Maximum Matching in Complements of Interval Graphs and Related Problems.</title>
<pages>263-289</pages>
<year>2000</year>
<volume>26</volume>
<journal>Algorithmica</journal>
<number>2</number>
<ee>https://doi.org/10.1007/s004539910013</ee>
<url>db/journals/algorithmica/algorithmica26.html#AndrewsACL00</url>
</article>
</r>
<r><article key="journals/algorithmica/ChenL00" mdate="2017-05-17">
<author pid="03/2188">Hsiao-Feng Steven Chen</author>
<author pid="l/DTLee">D. T. Lee</author>
<title>A Faster One-Dimensional Topological Compaction Algorithm with Jog Insertion.</title>
<pages>390-421</pages>
<year>2000</year>
<volume>28</volume>
<journal>Algorithmica</journal>
<number>4</number>
<ee>https://doi.org/10.1007/s004530010044</ee>
<url>db/journals/algorithmica/algorithmica28.html#ChenL00</url>
</article>
</r>
<r><article key="journals/tvlsi/RoyL00" mdate="2020-10-11">
<author pid="183/5157">Kaushik Roy</author>
<author pid="l/DTLee">D. T. Lee</author>
<title>Guest editorial: low-power electronics and design.</title>
<pages>233-234</pages>
<year>2000</year>
<volume>8</volume>
<journal>IEEE Trans. Very Large Scale Integr. Syst.</journal>
<number>3</number>
<ee>https://doi.org/10.1109/TVLSI.2000.845890</ee>
<url>db/journals/tvlsi/tvlsi8.html#RoyL00</url>
</article>
</r>
<r><inproceedings key="conf/hpcn/AokiL00" mdate="2023-03-21">
<author orcid="0000-0002-6662-8015" pid="a/KiyokoFAokiKinoshita">Kiyoko F. Aoki</author>
<author pid="l/DTLee">D. T. Lee</author>
<title>A Web-Based Distributed Programming Environment.</title>
<pages>237-246</pages>
<ee>https://doi.org/10.1007/3-540-45492-6_24</ee>
<year>2000</year>
<crossref>conf/hpcn/2000</crossref>
<booktitle>HPCN Europe</booktitle>
<url>db/conf/hpcn/hpcn2000.html#AokiL00</url>
</inproceedings>
</r>
<r><inproceedings key="conf/icra/MokWL00" mdate="2017-05-22">
<author pid="29/149">Swee M. Mok</author>
<author pid="129/6626">Chi-haur Wu</author>
<author pid="l/DTLee">D. T. Lee</author>
<title>A System for Analyzing Automatic Assembly and Disassembly Operations.</title>
<pages>3695-3700</pages>
<year>2000</year>
<crossref>conf/icra/2000</crossref>
<booktitle>ICRA</booktitle>
<url>db/conf/icra/icra2000.html#MokWL00</url>
<ee>https://doi.org/10.1109/ROBOT.2000.845307</ee>
</inproceedings>
</r>
<r><proceedings key="conf/isaac/2000" mdate="2019-05-14">
<editor pid="l/DTLee">D. T. Lee</editor>
<editor pid="t/ShangHuaTeng">Shang-Hua Teng</editor>
<title>Algorithms and Computation, 11th International Conference, ISAAC 2000, Taipei, Taiwan, December 18-20, 2000, Proceedings</title>
<booktitle>ISAAC</booktitle>
<series href="db/series/lncs/index.html">Lecture Notes in Computer Science</series>
<volume>1969</volume>
<publisher>Springer</publisher>
<year>2000</year>
<isbn>3-540-41255-7</isbn>
<ee>https://doi.org/10.1007/3-540-40996-3</ee>
<url>db/conf/isaac/isaac2000.html</url>
</proceedings>
</r>
<r><article key="journals/algorithmica/FarrahiLS99" mdate="2017-05-17">
<author pid="28/2897">Amir H. Farrahi</author>
<author pid="l/DTLee">D. T. Lee</author>
<author pid="s/MajidSarrafzadeh">Majid Sarrafzadeh</author>
<title>Two-Way and Multiway Partitioning of a Set of Intervals for Clique-Width Maximization.</title>
<pages>187-210</pages>
<year>1999</year>
<volume>23</volume>
<journal>Algorithmica</journal>
<number>3</number>
<ee>https://doi.org/10.1007/PL00009257</ee>
<url>db/journals/algorithmica/algorithmica23.html#FarrahiLS99</url>
</article>
</r>
<r><article key="journals/ijcga/AichholzerACLP99" mdate="2024-05-07">
<author orcid="0000-0002-2364-0583" pid="33/289">Oswin Aichholzer</author>
<author pid="27/2235">Franz Aurenhammer</author>
<author pid="c/DannyZChen">Danny Z. Chen</author>
<author pid="l/DTLee">D. T. Lee</author>
<author orcid="0000-0003-0144-7384" pid="93/4868">Evanthia Papadopoulou</author>
<title>Skew Voronoi Diagrams.</title>
<pages>235-248</pages>
<year>1999</year>
<volume>9</volume>
<journal>Int. J. Comput. Geom. Appl.</journal>
<number>3</number>
<url>db/journals/ijcga/ijcga9.html#AichholzerACLP99</url>
<ee>https://doi.org/10.1142/S0218195999000169</ee>
</article>
</r>
<r><article key="journals/tcad/PapadopoulouL99" mdate="2021-07-25">
<author orcid="0000-0003-0144-7384" pid="93/4868">Evanthia Papadopoulou</author>
<author pid="l/DTLee">D. T. Lee</author>
<title>Critical area computation via Voronoi diagrams.</title>
<pages>463-474</pages>
<year>1999</year>
<volume>18</volume>
<journal>IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.</journal>
<number>4</number>
<ee>https://doi.org/10.1109/43.752929</ee>
<url>db/journals/tcad/tcad18.html#PapadopoulouL99</url>
</article>
</r>
<r><inproceedings key="conf/cira/MokWL99" mdate="2017-05-23">
<author pid="29/149">Swee M. Mok</author>
<author pid="129/6626">Chi-haur Wu</author>
<author pid="l/DTLee">D. T. Lee</author>
<title>A hierarchical workcell model for intelligent assembly and disassembly.</title>
<pages>125-130</pages>
<year>1999</year>
<booktitle>CIRA</booktitle>
<ee>https://doi.org/10.1109/CIRA.1999.809989</ee>
<crossref>conf/cira/1999</crossref>
<url>db/conf/cira/cira1999.html#MokWL99</url>
</inproceedings>
</r>
<r><inproceedings key="conf/icra/ChangWL99" mdate="2017-05-22">
<author pid="21/3411">Shih-Lang Chang</author>
<author pid="129/6626">Chi-haur Wu</author>
<author pid="l/DTLee">D. T. Lee</author>
<title>A Muscular-Like Compliance Control for Active Vehicle Suspension.</title>
<pages>3275-3280</pages>
<year>1999</year>
<crossref>conf/icra/1999</crossref>
<booktitle>ICRA</booktitle>
<url>db/conf/icra/icra1999-1.html#ChangWL99</url>
<ee>https://doi.org/10.1109/ROBOT.1999.774097</ee>
</inproceedings>
</r>
<r><inproceedings key="conf/wads/ChinLW99" mdate="2017-05-21">
<author pid="c/FrancisYLChin">Francis Y. L. Chin</author>
<author pid="l/DTLee">Der-Tsai Lee</author>
<author pid="29/6007">Cao An Wang</author>
<title>A Parallel Algorithm for Finding the Constrained Voronoi Diagram of Line Segments in the Plane.</title>
<pages>231-240</pages>
<ee>https://doi.org/10.1007/3-540-48447-7_24</ee>
<year>1999</year>
<crossref>conf/wads/1999</crossref>
<booktitle>WADS</booktitle>
<url>db/conf/wads/wads99.html#ChinLW99</url>
</inproceedings>
</r>
<r><proceedings key="conf/cocoon/99" mdate="2023-09-30">
<editor pid="21/1336">Takao Asano</editor>
<editor pid="09/1655">Hiroshi Imai</editor>
<editor pid="l/DTLee">D. T. Lee</editor>
<editor pid="n/ShinIchiNakano">Shin-Ichi Nakano</editor>
<editor orcid="0000-0002-9400-8729" pid="89/1729">Takeshi Tokuyama</editor>
<title>Computing and Combinatorics, 5th Annual International Conference, COCOON '99, Tokyo, Japan, July 26-28, 1999, Proceedings</title>
<series href="db/series/lncs/index.html">Lecture Notes in Computer Science</series>
<booktitle>COCOON</booktitle>
<volume>1627</volume>
<publisher>Springer</publisher>
<year>1999</year>
<isbn>3-540-66200-6</isbn>
<ee>https://doi.org/10.1007/3-540-48686-0</ee>
<url>db/conf/cocoon/cocoon99.html</url>
</proceedings>
</r>
<r><article key="journals/algorithmica/PapadopoulouL98" mdate="2021-07-25">
<author orcid="0000-0003-0144-7384" pid="93/4868">Evanthia Papadopoulou</author>
<author pid="l/DTLee">D. T. Lee</author>
<title>A New Approach for the Geodesic Voronoi Diagram of Points in a Simple Polygon and Other Restricted Polygonal Domains.</title>
<pages>319-352</pages>
<year>1998</year>
<volume>20</volume>
<journal>Algorithmica</journal>
<number>4</number>
<url>db/journals/algorithmica/algorithmica20.html#PapadopoulouL98</url>
<ee>https://doi.org/10.1007/PL00009199</ee>
</article>
</r>
<r><article key="journals/ijcga/TsengHL98" mdate="2020-06-04">
<author pid="82/474">L. H. Tseng</author>
<author pid="89/1766">Paul J. Heffernan</author>
<author pid="l/DTLee">D. T. Lee</author>
<title>Two-Guard Walkability of Simple Polygons.</title>
<pages>85-116</pages>
<year>1998</year>
<volume>8</volume>
<journal>Int. J. Comput. Geom. Appl.</journal>
<number>1</number>
<url>db/journals/ijcga/ijcga8.html#TsengHL98</url>
<ee>https://doi.org/10.1142/S0218195998000060</ee>
</article>
</r>
<r><article key="journals/ijcga/LeeSS98" mdate="2020-06-04">
<author pid="l/DTLee">D. T. Lee</author>
<author pid="74/1876">Chin-Fang Shen</author>
<author pid="08/2995">Dennis S. Sheu</author>
<title>Geosheet: A Distributed Visualization Tool for Geometric Algorithms.</title>
<pages>119-156</pages>
<year>1998</year>
<volume>8</volume>
<journal>Int. J. Comput. Geom. Appl.</journal>
<number>2</number>
<url>db/journals/ijcga/ijcga8.html#LeeSS98</url>
<ee>https://doi.org/10.1142/S0218195998000084</ee>
</article>
</r>
<r><article key="journals/networks/ChenLSS98" mdate="2019-08-07">
<author pid="c/DannyZChen">Danny Z. Chen</author>
<author pid="l/DTLee">D. T. Lee</author>
<author pid="46/927-1">R. Sridhar 0001</author>
<author pid="79/956">Chandra N. Sekharan</author>
<title>Solving the all-pair shortest path query problem on interval and circular-arc graphs.</title>
<pages>249-258</pages>
<year>1998</year>
<volume>31</volume>
<journal>Networks</journal>
<number>4</number>
<ee>https://doi.org/10.1002/(SICI)1097-0037(199807)31:4&#60;249::AID-NET5&#62;3.0.CO;2-D</ee>
<url>db/journals/networks/networks31.html#ChenLSS98</url>
</article>
</r>
<r><article key="journals/tcad/ChenL98" mdate="2020-09-24">
<author pid="03/2188">Hsiao-Feng Steven Chen</author>
<author pid="l/DTLee">D. T. Lee</author>
<title>On crossing minimization problem.</title>
<pages>406-418</pages>
<year>1998</year>
<volume>17</volume>
<journal>IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.</journal>
<number>5</number>
<ee>https://doi.org/10.1109/43.703928</ee>
<url>db/journals/tcad/tcad17.html#ChenL98</url>
</article>
</r>
<r><inproceedings key="conf/ispd/PapadopoulouL98" mdate="2023-03-21">
<author orcid="0000-0003-0144-7384" pid="93/4868">Evanthia Papadopoulou</author>
<author pid="l/DTLee">D. T. Lee</author>
<title>Critical area computation - a new approach.</title>
<pages>89-94</pages>
<year>1998</year>
<crossref>conf/ispd/1998</crossref>
<booktitle>ISPD</booktitle>
<ee>https://doi.org/10.1145/274535.274548</ee>
<url>db/conf/ispd/ispd1998.html#PapadopoulouL98</url>
</inproceedings>
</r>
<r><article key="journals/algorithmica/TsaiL97" mdate="2017-05-17">
<author pid="33/4593">Kuo-Hui Tsai</author>
<author pid="l/DTLee">D. T. Lee</author>
<title>k Best Cuts for Circular-Arc Graphs.</title>
<pages>198-216</pages>
<year>1997</year>
<volume>18</volume>
<journal>Algorithmica</journal>
<number>2</number>
<url>db/journals/algorithmica/algorithmica18.html#TsaiL97</url>
<ee>https://doi.org/10.1007/BF02526033</ee>
</article>
</r>
<r><article key="journals/ijcga/LeeYW97" mdate="2020-06-04">
<author pid="l/DTLee">D. T. Lee</author>
<author pid="60/6711">Chung-Do Yang</author>
<author pid="w/CKWong">C. K. Wong</author>
<title>Finding Rectilinear Paths Among Obstacles in a Two-Layer Interconnection Model.</title>
<pages>581-598</pages>
<year>1997</year>
<volume>7</volume>
<journal>Int. J. Comput. Geom. Appl.</journal>
<number>6</number>
<url>db/journals/ijcga/ijcga7.html#LeeYW97</url>
<ee>https://doi.org/10.1142/S0218195997000363</ee>
</article>
</r>
<r><article key="journals/tc/YangLW97" mdate="2017-05-20">
<author pid="60/6711">Chung-Do Yang</author>
<author pid="l/DTLee">D. T. Lee</author>
<author pid="w/CKWong">C. K. Wong</author>
<title>The Smallest Pair of Noncrossing Paths in a Rectilinear Polygon.</title>
<pages>930-941</pages>
<year>1997</year>
<volume>46</volume>
<journal>IEEE Trans. Computers</journal>
<number>8</number>
<url>db/journals/tc/tc46.html#YangLW97</url>
<ee>https://doi.org/10.1109/12.609280</ee>
<ee>http://doi.ieeecomputersociety.org/10.1109/12.609280</ee>
</article>
</r>
<r><inproceedings key="conf/compgeom/AichholzerACLMP97" mdate="2023-03-21">
<author pid="33/289">Oswin Aichholzer</author>
<author pid="27/2235">Franz Aurenhammer</author>
<author pid="c/DannyZChen">Danny Z. Chen</author>
<author pid="l/DTLee">D. T. Lee</author>
<author pid="20/1128">Asish Mukhopadhyay</author>
<author orcid="0000-0003-0144-7384" pid="93/4868">Evanthia Papadopoulou</author>
<title>Voronoi Diagrams for Direction-Sensitive Distances.</title>
<pages>418-420</pages>
<year>1997</year>
<crossref>conf/compgeom/1997</crossref>
<booktitle>SCG</booktitle>
<ee>https://doi.org/10.1145/262839.263045</ee>
<url>db/conf/compgeom/compgeom97.html#AichholzerACLMP97</url>
</inproceedings>
</r>
<r><inproceedings key="conf/isaac/ChenL97" mdate="2017-05-19">
<author pid="03/2188">Hsiao-Feng Steven Chen</author>
<author pid="l/DTLee">D. T. Lee</author>
<title>A Faster One-Dimensional Topological Compaction Algorithm.</title>
<pages>303-313</pages>
<year>1997</year>
<crossref>conf/isaac/1997</crossref>
<booktitle>ISAAC</booktitle>
<url>db/conf/isaac/isaac97.html#ChenL97</url>
<ee>https://doi.org/10.1007/3-540-63890-3_33</ee>
</inproceedings>
</r>
<r><proceedings key="conf/cocoon/1997" mdate="2019-05-14">
<editor pid="j/TaoJiang-1">Tao Jiang 0001</editor>
<editor pid="l/DTLee">D. T. Lee</editor>
<title>Computing and Combinatorics, Third Annual International Conference, COCOON '97, Shanghai, China, August 20-22, 1997, Proceedings</title>
<series href="db/series/lncs/index.html">Lecture Notes in Computer Science</series>
<booktitle>COCOON</booktitle>
<volume>1276</volume>
<publisher>Springer</publisher>
<year>1997</year>
<isbn>3-540-63357-X</isbn>
<ee>https://doi.org/10.1007/BFb0045065</ee>
<url>db/conf/cocoon/cocoon97.html</url>
</proceedings>
</r>
<r><incollection publtype="encyclopedia" key="books/crc/tucker97/Lee97" mdate="2017-07-09">
<author pid="l/DTLee">D. T. Lee</author>
<title>Computational Geometry.</title>
<pages>111-140</pages>
<year>1997</year>
<crossref>books/crc/tucker1997</crossref>
<booktitle>The Computer Science and Engineering Handbook</booktitle>
<url>db/books/collections/tucker97.html#Lee97</url>
</incollection>
</r>
<r><article key="journals/csur/Lee96" mdate="2018-11-06">
<author pid="l/DTLee">D. T. Lee</author>
<title>Computational Geometry.</title>
<pages>27-31</pages>
<year>1996</year>
<volume>28</volume>
<journal>ACM Comput. Surv.</journal>
<number>1</number>
<url>db/journals/csur/csur28.html#Lee96</url>
<ee>https://doi.org/10.1145/234313.234325</ee>
</article>
</r>
<r><article key="journals/dam/LeeYW96" mdate="2021-02-11">
<author pid="l/DTLee">D. T. Lee</author>
<author pid="60/6711">Chung-Do Yang</author>
<author pid="w/CKWong">C. K. Wong</author>
<title>Rectilinear Paths Among Rectilinear Obstacles.</title>
<pages>185-215</pages>
<year>1996</year>
<volume>70</volume>
<journal>Discret. Appl. Math.</journal>
<number>3</number>
<ee type="oa">https://doi.org/10.1016/0166-218X(96)80467-7</ee>
<url>db/journals/dam/dam70.html#LeeYW96</url>
</article>
</r>
<r><article key="journals/tcad/ChenL96" mdate="2020-09-24">
<author pid="03/2188">Hsiao-Feng Steven Chen</author>
<author pid="l/DTLee">D. T. Lee</author>
<title>A faster algorithm for rubber-band equivalent transformation for planar VLSI layouts.</title>
<pages>217-227</pages>
<year>1996</year>
<volume>15</volume>
<journal>IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.</journal>
<number>2</number>
<ee>https://doi.org/10.1109/43.486667</ee>
<url>db/journals/tcad/tcad15.html#ChenL96</url>
</article>
</r>
<r><inproceedings key="conf/cocoon/HsuTWL96" mdate="2023-10-17">
<author pid="19/2124">Tsan-sheng Hsu</author>
<author pid="33/4593">Kuo-Hui Tsai</author>
<author pid="39/2537-4">Da-Wei Wang 0004</author>
<author pid="l/DTLee">D. T. Lee</author>
<title>Steiner Problems on Directed Acyclic Graphs.</title>
<pages>21-30</pages>
<year>1996</year>
<crossref>conf/cocoon/1996</crossref>
<booktitle>COCOON</booktitle>
<url>db/conf/cocoon/cocoon96.html#HsuTWL96</url>
<ee>https://doi.org/10.1007/3-540-61332-3_135</ee>
</inproceedings>
</r>
<r><inproceedings key="conf/icra/WuCL96" mdate="2023-01-19">
<author pid="129/6626">Chi-haur Wu</author>
<author pid="21/3411">Shih-Lang Chang</author>
<author pid="l/DTLee">D. T. Lee</author>
<title>A study of neuromuscular-like control in rehabilitation robot.</title>
<pages>1178-1183</pages>
<year>1996</year>
<booktitle>ICRA</booktitle>
<ee>https://doi.org/10.1109/ROBOT.1996.506867</ee>
<crossref>conf/icra/1996</crossref>
<url>db/conf/icra/icra1996.html#WuCL96</url>
</inproceedings>
</r>
<r><inproceedings key="conf/isaac/LeeS96" mdate="2017-05-22">
<author pid="l/DTLee">D. T. Lee</author>
<author pid="03/5881">C. F. Shen</author>
<title>The Steiner Minimal Tree Problem in the lambda-Geormetry Plane.</title>
<pages>247-255</pages>
<year>1996</year>
<crossref>conf/isaac/1996</crossref>
<booktitle>ISAAC</booktitle>
<url>db/conf/isaac/isaac96.html#LeeS96</url>
<ee>https://doi.org/10.1007/BFb0009501</ee>
</inproceedings>
</r>
<r><inproceedings key="conf/wacg/Lee96" mdate="2017-05-22">
<author pid="l/DTLee">D. T. Lee</author>
<title>Geometric Algorithm Visualization, Current Status and Future.</title>
<pages>45-50</pages>
<year>1996</year>
<crossref>conf/wacg/1996</crossref>
<booktitle>WACG</booktitle>
<url>db/conf/wacg/wacg1996.html#Lee96</url>
<ee>https://doi.org/10.1007/BFb0014482</ee>
</inproceedings>
</r>
<r><article key="journals/algorithmica/RezendeL95" mdate="2017-05-17">
<author pid="41/3473">Pedro Jussieu de Rezende</author>
<author pid="l/DTLee">D. T. Lee</author>
<title>Point Set Pattern Matching in d-Dimensions.</title>
<pages>387-404</pages>
<year>1995</year>
<volume>13</volume>
<journal>Algorithmica</journal>
<number>4</number>
<url>db/journals/algorithmica/algorithmica13.html#RezendeL95</url>
<ee>https://doi.org/10.1007/BF01293487</ee>
</article>
</r>
<r><article key="journals/algorithmica/AtallahCL95" mdate="2017-05-17">
<author pid="a/MikhailJAtallah">Mikhail J. Atallah</author>
<author pid="c/DannyZChen">Danny Z. Chen</author>
<author pid="l/DTLee">D. T. Lee</author>
<title>An Optimal Algorithm for Shortest Paths on Weighted Interval and Circular-Arc Graphs, with Applications.</title>
<pages>429-441</pages>
<year>1995</year>
<volume>14</volume>
<journal>Algorithmica</journal>
<number>5</number>
<url>db/journals/algorithmica/algorithmica14.html#AtallahCL95</url>
<ee>https://doi.org/10.1007/BF01192049</ee>
</article>
</r>
<r><article key="journals/comgeo/AndrewsL95" mdate="2021-02-11">
<author pid="79/2710">Marilyn G. Andrews</author>
<author pid="l/DTLee">D. T. Lee</author>
<title>Parallel Algorithms on Circular-arc Graphs.</title>
<pages>117-141</pages>
<year>1995</year>
<volume>5</volume>
<journal>Comput. Geom.</journal>
<url>db/journals/comgeo/comgeo5.html#AndrewsL95</url>
<ee type="oa">https://doi.org/10.1016/0925-7721(94)00024-P</ee>
</article>
</r>
<r><article key="journals/comgeo/SwansonLW95" mdate="2021-02-11">
<author pid="68/6852">Kurt Swanson</author>
<author pid="l/DTLee">D. T. Lee</author>
<author pid="61/3650">Vanban L. Wu</author>
<title>An Optimal Algorithm for Roundness Determination on Convex Polygons.</title>
<pages>225-235</pages>
<year>1995</year>
<volume>5</volume>
<journal>Comput. Geom.</journal>
<url>db/journals/comgeo/comgeo5.html#SwansonLW95</url>
<ee type="oa">https://doi.org/10.1016/0925-7721(95)00004-6</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/siamcomp/YangLW95" mdate="2017-05-27">
<author pid="60/6711">Chung-Do Yang</author>
<author pid="l/DTLee">D. T. Lee</author>
<author pid="w/CKWong">C. K. Wong</author>
<title>Rectilinear Path Problems among Rectilinear Obstacles Revisited.</title>
<pages>457-472</pages>
<year>1995</year>
<volume>24</volume>
<journal>SIAM J. Comput.</journal>
<number>3</number>
<url>db/journals/siamcomp/siamcomp24.html#YangLW95</url>
<ee>https://doi.org/10.1137/S0097539792229672</ee>
</article>
</r>
<r><inproceedings key="conf/esa/PapadopoulouL95" mdate="2023-03-21">
<author orcid="0000-0003-0144-7384" pid="93/4868">Evanthia Papadopoulou</author>
<author pid="l/DTLee">D. T. Lee</author>
<title>Efficient Computation of the Geodesic Voronoi Diagram of Points in a Simple Polygon (Extended Abstract).</title>
<pages>238-251</pages>
<year>1995</year>
<crossref>conf/esa/1995</crossref>
<booktitle>ESA</booktitle>
<url>db/conf/esa/esa95.html#PapadopoulouL95</url>
<ee>https://doi.org/10.1007/3-540-60313-1_147</ee>
</inproceedings>
</r>
<r><inproceedings key="conf/ipps/AndrewsACL95" mdate="2023-03-24">
<author pid="79/2710">Marilyn G. Andrews</author>
<author pid="a/MikhailJAtallah">Mikhail J. Atallah</author>
<author pid="c/DannyZChen">Danny Z. Chen</author>
<author pid="l/DTLee">D. T. Lee</author>
<title>Parallel algorithms for maximum matching in interval graphs.</title>
<pages>84-92</pages>
<year>1995</year>
<crossref>conf/ipps/1995</crossref>
<booktitle>IPPS</booktitle>
<ee>https://doi.org/10.1109/IPPS.1995.395918</ee>
<ee>https://doi.ieeecomputersociety.org/10.1109/IPPS.1995.395918</ee>
<url>db/conf/ipps/ipps1995.html#AndrewsACL95</url>
</inproceedings>
</r>
<r><inproceedings key="conf/iscas/LeeSD95" mdate="2017-05-26">
<author pid="l/DTLee">D. T. Lee</author>
<author pid="74/1876">Chin-Fang Shen</author>
<author pid="98/4226">Cheng-Liang Ding</author>
<title>On Steiner Tree Problem with 45 Degree Routing.</title>
<pages>1680-1682</pages>
<year>1995</year>
<crossref>conf/iscas/1995</crossref>
<booktitle>ISCAS</booktitle>
<url>db/conf/iscas/iscas1995-3.html#LeeSD95</url>
<ee>https://doi.org/10.1109/ISCAS.1995.523734</ee>
</inproceedings>
</r>
<r><article key="journals/ijcga/SarrafzadehL94" mdate="2020-06-04">
<author pid="s/MajidSarrafzadeh">Majid Sarrafzadeh</author>
<author pid="l/DTLee">D. T. Lee</author>
<title>Restricted track assignment with applications.</title>
<pages>53-68</pages>
<year>1994</year>
<volume>4</volume>
<journal>Int. J. Comput. Geom. Appl.</journal>
<number>1</number>
<url>db/journals/ijcga/ijcga4.html#SarrafzadehL94</url>
<ee>https://doi.org/10.1142/S0218195994000057</ee>
</article>
</r>
<r><article key="journals/tc/LeeYW94" mdate="2017-05-20">
<author pid="l/DTLee">D. T. Lee</author>
<author pid="60/6711">Chung-Do Yang</author>
<author pid="w/CKWong">C. K. Wong</author>
<title>On Bends and Distances of Paths Among Obstacles in Two-Layer Interconnection Model.</title>
<pages>711-724</pages>
<year>1994</year>
<volume>43</volume>
<journal>IEEE Trans. Computers</journal>
<number>6</number>
<url>db/journals/tc/tc43.html#LeeYW94</url>
<ee>https://doi.org/10.1109/12.286304</ee>
<ee>http://doi.ieeecomputersociety.org/10.1109/12.286304</ee>
</article>
</r>
<r><inproceedings key="conf/cccg/PapadopoulouL94" mdate="2012-09-26">
<author pid="93/4868">Evanthia Papadopoulou</author>
<author pid="l/DTLee">D. T. Lee</author>
<title>Shortest Paths in a Simple Polygon in the Presence of Forbidden Vertices.</title>
<pages>110-115</pages>
<year>1994</year>
<crossref>conf/cccg/1994</crossref>
<booktitle>CCCG</booktitle>
<url>db/conf/cccg/cccg1994.html#PapadopoulouL94</url>
</inproceedings>
</r>
<r><inproceedings key="conf/ipps/ChenL94" mdate="2023-03-24">
<author pid="c/DannyZChen">Danny Z. Chen</author>
<author pid="l/DTLee">D. T. Lee</author>
<title>Solving the All-Pair Shortest Path Problem on Interval and Circular-Arc Graphs.</title>
<pages>224-228</pages>
<year>1994</year>
<crossref>conf/ipps/1994</crossref>
<booktitle>IPPS</booktitle>
<url>db/conf/ipps/ipps1994.html#ChenL94</url>
<ee>https://doi.org/10.1109/IPPS.1994.288297</ee>
<ee>https://doi.ieeecomputersociety.org/10.1109/IPPS.1994.288297</ee>
</inproceedings>
</r>
<r><inproceedings key="conf/isaac/TsaiL94" mdate="2017-05-19">
<author pid="33/4593">Kuo-Hui Tsai</author>
<author pid="l/DTLee">D. T. Lee</author>
<title>k-Best Cuts for Circular-Arc Graphs.</title>
<pages>550-558</pages>
<year>1994</year>
<crossref>conf/isaac/1994</crossref>
<booktitle>ISAAC</booktitle>
<url>db/conf/isaac/isaac94.html#TsaiL94</url>
<ee>https://doi.org/10.1007/3-540-58325-4_222</ee>
</inproceedings>
</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>
<r><article key="journals/ijcga/LeeS93" mdate="2020-06-04">
<author pid="l/DTLee">D. T. Lee</author>
<author pid="s/MajidSarrafzadeh">Majid Sarrafzadeh</author>
<title>Maximum independent set of a permutation graph in K tracks.</title>
<pages>291-304</pages>
<year>1993</year>
<volume>3</volume>
<journal>Int. J. Comput. Geom. Appl.</journal>
<number>3</number>
<url>db/journals/ijcga/ijcga3.html#LeeS93</url>
<ee>https://doi.org/10.1142/S021819599300018X</ee>
</article>
</r>
<r><article key="journals/ipl/LeeP93" mdate="2021-07-25">
<author pid="l/DTLee">D. T. Lee</author>
<author orcid="0000-0003-0144-7384" pid="93/4868">Evanthia Papadopoulou</author>
<title>The All-Pairs Quickest Path Problem.</title>
<pages>261-267</pages>
<year>1993</year>
<volume>45</volume>
<journal>Inf. Process. Lett.</journal>
<number>5</number>
<url>db/journals/ipl/ipl45.html#LeeP93</url>
<ee>https://doi.org/10.1016/0020-0190(93)90214-T</ee>
</article>
</r>
<r><inproceedings key="conf/esa/AtallahCL93" mdate="2017-05-20">
<author pid="a/MikhailJAtallah">Mikhail J. Atallah</author>
<author pid="c/DannyZChen">Danny Z. Chen</author>
<author pid="l/DTLee">D. T. Lee</author>
<title>An Optimal Algorithm for Shortest Paths on Weighted Interval and Circular-Arc Graphs, with Applications.</title>
<pages>13-24</pages>
<year>1993</year>
<crossref>conf/esa/1993</crossref>
<booktitle>ESA</booktitle>
<url>db/conf/esa/esa93.html#AtallahCL93</url>
<ee>https://doi.org/10.1007/3-540-57273-2_40</ee>
</inproceedings>
</r>
<r><book key="books/ws/93/SL1993" mdate="2023-04-03">
<editor pid="s/MajidSarrafzadeh">Majid Sarrafzadeh</editor>
<editor pid="l/DTLee">D. T. Lee</editor>
<title>Algorithmic Aspects of VLSI Layout</title>
<publisher>World Scientific</publisher>
<year>1993</year>
<volume>2</volume>
<series href="db/series/lnsc/index.html">Lecture Notes Series on Computing</series>
<isbn>978-981-02-1488-3</isbn>
<ee>https://doi.org/10.1142/2105</ee>
<url>db/books/collections/SL1993.html</url>
</book>
</r>
<r><article key="journals/ijcga/YangLW92" mdate="2020-06-04">
<author pid="60/6711">Chung-Do Yang</author>
<author pid="l/DTLee">D. T. Lee</author>
<author pid="w/CKWong">C. K. Wong</author>
<title>On bends and lengths of rectilinear paths: a graph theoretic approach.</title>
<pages>61-74</pages>
<year>1992</year>
<volume>2</volume>
<journal>Int. J. Comput. Geom. Appl.</journal>
<number>1</number>
<url>db/journals/ijcga/ijcga2.html#YangLW92</url>
<ee>https://doi.org/10.1142/S0218195992000056</ee>
</article>
</r>
<r><article key="journals/informs/ImaiLY92" mdate="2020-03-15">
<author pid="09/1655">Hiroshi Imai</author>
<author pid="l/DTLee">D. T. Lee</author>
<author pid="60/6711">Chung-Do Yang</author>
<title>1-Segment Center Problems.</title>
<pages>426-434</pages>
<year>1992</year>
<volume>4</volume>
<journal>INFORMS J. Comput.</journal>
<number>4</number>
<ee>https://doi.org/10.1287/ijoc.4.4.426</ee>
<url>db/journals/informs/informs4.html#ImaiLY92</url>
</article>
</r>
<r><article key="journals/pc/JeongCL92" mdate="2020-02-22">
<author pid="58/1148">Chang-Sung Jeong</author>
<author pid="07/3183">Jung-Ju Choi</author>
<author pid="l/DTLee">Der-Tsai Lee</author>
<title>Parallel enclosing rectangle on SIMD machines.</title>
<pages>221-229</pages>
<year>1992</year>
<volume>18</volume>
<journal>Parallel Comput.</journal>
<number>2</number>
<url>db/journals/pc/pc18.html#JeongCL92</url>
<ee>https://doi.org/10.1016/0167-8191(92)90081-H</ee>
</article>
</r>
<r><article key="journals/siamdm/LouSL92" mdate="2020-04-25">
<author pid="26/194">Ruey-Der Lou</author>
<author pid="s/MajidSarrafzadeh">Majid Sarrafzadeh</author>
<author pid="l/DTLee">D. T. Lee</author>
<title>An Optimal Algorithm for the Maximum Two-Chain Problem.</title>
<pages>285-304</pages>
<year>1992</year>
<volume>5</volume>
<journal>SIAM J. Discret. Math.</journal>
<number>2</number>
<url>db/journals/siamdm/siamdm5.html#LouSL92</url>
<ee>https://doi.org/10.1137/0405022</ee>
</article>
</r>
<r><inproceedings key="conf/isaac/Lee92" mdate="2017-05-19">
<author pid="l/DTLee">D. T. Lee</author>
<title>Rectilinear Paths among Rectilinear Obstacles.</title>
<pages>5-20</pages>
<year>1992</year>
<crossref>conf/isaac/1992</crossref>
<booktitle>ISAAC</booktitle>
<url>db/conf/isaac/isaac92.html#Lee92</url>
<ee>https://doi.org/10.1007/3-540-56279-6_53</ee>
</inproceedings>
</r>
<r><inproceedings key="conf/isaac/SarrafzadehL92" mdate="2017-05-19">
<author pid="s/MajidSarrafzadeh">Majid Sarrafzadeh</author>
<author pid="l/DTLee">D. T. Lee</author>
<title>Rstricted Track Assignment with Applications.</title>
<pages>449-458</pages>
<year>1992</year>
<crossref>conf/isaac/1992</crossref>
<booktitle>ISAAC</booktitle>
<url>db/conf/isaac/isaac92.html#SarrafzadehL92</url>
<ee>https://doi.org/10.1007/3-540-56279-6_97</ee>
</inproceedings>
</r>
<r><article key="journals/ijcga/LeeYC91" mdate="2020-06-04">
<author pid="l/DTLee">D. T. Lee</author>
<author pid="60/6711">Chung-Do Yang</author>
<author pid="55/2720">T. H. Chen</author>
<title>Shortest rectilinear paths among weighted obstacles.</title>
<pages>109-124</pages>
<year>1991</year>
<volume>1</volume>
<journal>Int. J. Comput. Geom. Appl.</journal>
<number>2</number>
<url>db/journals/ijcga/ijcga1.html#LeeYC91</url>
<ee>https://doi.org/10.1142/S0218195991000104</ee>
</article>
</r>
<r><article key="journals/pami/LeL91" mdate="2017-05-17">
<author pid="85/722">Van-Ban Le</author>
<author pid="l/DTLee">D. T. Lee</author>
<title>Out-of-Roundness Problem Revisited.</title>
<pages>217-223</pages>
<year>1991</year>
<volume>13</volume>
<journal>IEEE Trans. Pattern Anal. Mach. Intell.</journal>
<number>3</number>
<ee>https://doi.org/10.1109/34.75510</ee>
<ee>http://doi.ieeecomputersociety.org/10.1109/34.75510</ee>
<url>db/journals/pami/pami13.html#LeL91</url>
</article>
</r>
<r><article key="journals/siamcomp/HoLCW91" mdate="2017-05-27">
<author pid="89/1350">Jan-Ming Ho</author>
<author pid="l/DTLee">D. T. Lee</author>
<author pid="63/4629">Chia-Hsiang Chang</author>
<author pid="w/CKWong">C. K. Wong</author>
<title>Minimum Diameter Spanning Trees and Related Problems.</title>
<pages>987-997</pages>
<year>1991</year>
<volume>20</volume>
<journal>SIAM J. Comput.</journal>
<number>5</number>
<url>db/journals/siamcomp/siamcomp20.html#HoLCW91</url>
<ee>https://doi.org/10.1137/0220060</ee>
</article>
</r>
<r><article key="journals/tc/SarrafzadehL91" mdate="2017-05-20">
<author pid="s/MajidSarrafzadeh">Majid Sarrafzadeh</author>
<author pid="l/DTLee">D. T. Lee</author>
<title>Topological Via Minimization Revisited.</title>
<pages>1307-1312</pages>
<year>1991</year>
<volume>40</volume>
<journal>IEEE Trans. Computers</journal>
<number>11</number>
<url>db/journals/tc/tc40.html#SarrafzadehL91</url>
<ee>https://doi.org/10.1109/12.102839</ee>
<ee>http://doi.ieeecomputersociety.org/10.1109/12.102839</ee>
</article>
</r>
<r><inproceedings key="conf/isa/LeeS91" mdate="2017-05-20">
<author pid="l/DTLee">D. T. Lee</author>
<author pid="s/MajidSarrafzadeh">Majid Sarrafzadeh</author>
<title>Maximum Independent Set of a Permutation Graph in <i>k</i> Tracks.</title>
<pages>2-11</pages>
<year>1991</year>
<crossref>conf/isa/1991</crossref>
<booktitle>ISA</booktitle>
<url>db/conf/isa/isa1991.html#LeeS91</url>
<ee>https://doi.org/10.1007/3-540-54945-5_43</ee>
</inproceedings>
</r>
<r><inproceedings key="conf/wads/YangLW91" mdate="2017-05-20">
<author pid="60/6711">Chung-Do Yang</author>
<author pid="l/DTLee">D. T. Lee</author>
<author pid="w/CKWong">C. K. Wong</author>
<title>On Bends and Lengths of Rectilinear Paths: A Graph-Theoretic Approach.</title>
<pages>320-330</pages>
<year>1991</year>
<crossref>conf/wads/1991</crossref>
<booktitle>WADS</booktitle>
<url>db/conf/wads/wads91.html#YangLW91</url>
<ee>https://doi.org/10.1007/BFb0028272</ee>
</inproceedings>
</r>
<r><article key="journals/algorithmica/JeongL90" mdate="2017-05-17">
<author pid="93/5837">C. S. Jeong</author>
<author pid="l/DTLee">D. T. Lee</author>
<title>Parallel Geometric Algorithms on a Mesh-Connected Computer.</title>
<pages>155-177</pages>
<year>1990</year>
<volume>5</volume>
<journal>Algorithmica</journal>
<number>2</number>
<url>db/journals/algorithmica/algorithmica5.html#JeongL90</url>
<ee>https://doi.org/10.1007/BF01840383</ee>
</article>
</r>
<r><article key="journals/integration/LiaoLS90" mdate="2020-02-20">
<author pid="02/1902">Kuo-Feng Liao</author>
<author pid="l/DTLee">D. T. Lee</author>
<author pid="s/MajidSarrafzadeh">Majid Sarrafzadeh</author>
<title>Planar subset of multi-terminal nets.</title>
<pages>19-37</pages>
<year>1990</year>
<volume>10</volume>
<journal>Integr.</journal>
<number>1</number>
<ee>https://doi.org/10.1016/S0167-9260(05)80033-1</ee>
<url>db/journals/integration/integration10.html#LiaoLS90</url>
</article>
</r>
<r><article key="journals/siamcomp/LeeSW90" mdate="2017-05-27">
<author pid="l/DTLee">D. T. Lee</author>
<author pid="s/MajidSarrafzadeh">Majid Sarrafzadeh</author>
<author pid="67/6703">Ying-Fung Wu</author>
<title>Minimum Cuts for Circular-Arc Graphs.</title>
<pages>1041-1050</pages>
<year>1990</year>
<volume>19</volume>
<journal>SIAM J. Comput.</journal>
<number>6</number>
<url>db/journals/siamcomp/siamcomp19.html#LeeSW90</url>
<ee>https://doi.org/10.1137/0219071</ee>
</article>
</r>
<r><article key="journals/sigact/Lee90" mdate="2018-11-06">
<author pid="l/DTLee">D. T. Lee</author>
<title>NSF report - computer and computation research.</title>
<pages>13</pages>
<year>1990</year>
<volume>21</volume>
<journal>SIGACT News</journal>
<number>1</number>
<ee>https://doi.org/10.1145/379139.379165</ee>
<url>db/journals/sigact/sigact21.html#Lee90</url>
</article>
</r>
<r><article key="journals/sigact/Lee90a" mdate="2018-11-06">
<author pid="l/DTLee">D. T. Lee</author>
<title>NSF report - computer and computation research.</title>
<pages>16</pages>
<year>1990</year>
<volume>21</volume>
<journal>SIGACT News</journal>
<number>2</number>
<ee>https://doi.org/10.1145/379172.379177</ee>
<url>db/journals/sigact/sigact21.html#Lee90a</url>
</article>
</r>
<r><inproceedings key="conf/compgeom/LeeCY90" mdate="2021-06-14">
<author pid="l/DTLee">D. T. Lee</author>
<author pid="55/2720">T. H. Chen</author>
<author pid="60/6711">Chung-Do Yang</author>
<title>Shortest Rectilinear Paths among Weighted Obstacles.</title>
<pages>301-310</pages>
<year>1990</year>
<crossref>conf/compgeom/1990</crossref>
<booktitle>SCG</booktitle>
<ee>https://doi.org/10.1145/98524.98595</ee>
<url>db/conf/compgeom/compgeom90.html#LeeCY90</url>
</inproceedings>
</r>
<r><inproceedings key="conf/seke/HsuehL90" mdate="2007-06-01">
<author pid="59/6682">John C. C. Hsueh</author>
<author pid="l/DTLee">D. T. Lee</author>
<title>Knowledge-Based Programming for Call Processing Program in Telecommunication Switching System.</title>
<pages>110-115</pages>
<year>1990</year>
<crossref>conf/seke/1990</crossref>
<booktitle>SEKE</booktitle>
<url>db/conf/seke/seke1990.html#HsuehL90</url>
</inproceedings>
</r>
<r><inproceedings key="conf/soda/LouSL90" mdate="2012-12-07">
<author pid="26/194">Ruey-Der Lou</author>
<author pid="s/MajidSarrafzadeh">Majid Sarrafzadeh</author>
<author pid="l/DTLee">D. T. Lee</author>
<title>An Optimal Algorithm for the Maximum Two-Chain Problem.</title>
<pages>149-158</pages>
<year>1990</year>
<crossref>conf/soda/1990</crossref>
<booktitle>SODA</booktitle>
<url>db/conf/soda/soda90.html#LouSL90</url>
<ee>http://dl.acm.org/citation.cfm?id=320176.320193</ee>
</inproceedings>
</r>
<r><incollection key="books/sp/90/LeeL90" mdate="2019-07-31">
<author pid="l/DTLee">D. T. Lee</author>
<author pid="66/314">Arthur K. Lin</author>
<title>Computational Complexity of Art Gallery Problems.</title>
<pages>303-309</pages>
<year>1990</year>
<booktitle>Autonomous Robot Vehicles</booktitle>
<ee>https://doi.org/10.1007/978-1-4613-8997-2_23</ee>
<crossref>books/sp/90/CW1990</crossref>
<url>db/books/collections/CW1990.html#LeeL90</url>
</incollection>
</r>
<r><article key="journals/dcg/RezendeLW89" mdate="2020-03-12">
<author pid="41/3473">Pedro Jussieu de Rezende</author>
<author pid="l/DTLee">D. T. Lee</author>
<author pid="67/6703">Ying-Fung Wu</author>
<title>Rectilinear Shortest Paths in the presence of Rectangular Barriers.</title>
<pages>41-53</pages>
<year>1989</year>
<volume>4</volume>
<journal>Discret. Comput. Geom.</journal>
<url>db/journals/dcg/dcg4.html#RezendeLW89</url>
<ee type="oa">https://doi.org/10.1007/BF02187714</ee>
</article>
</r>
<r><article key="journals/ipl/LeeP89" mdate="2017-05-26">
<author pid="l/DTLee">D. T. Lee</author>
<author pid="p/FPPreparata">Franco P. Preparata</author>
<title>Parallel Batched Planar Point Location on the CCC.</title>
<pages>175-179</pages>
<year>1989</year>
<volume>33</volume>
<journal>Inf. Process. Lett.</journal>
<number>4</number>
<url>db/journals/ipl/ipl33.html#LeeP89</url>
<ee>https://doi.org/10.1016/0020-0190(89)90137-3</ee>
</article>
</r>
<r><article key="journals/jal/RamananBLL89" mdate="2022-01-12">
<author pid="66/1158">Prakash V. Ramanan</author>
<author pid="b/DonnaJBrown">Donna J. Brown</author>
<author pid="169/2196">C. C. Lee 0002</author>
<author pid="l/DTLee">D. T. Lee</author>
<title>On-Line Bin Packing in Linear Time.</title>
<pages>305-326</pages>
<year>1989</year>
<volume>10</volume>
<journal>J. Algorithms</journal>
<number>3</number>
<url>db/journals/jal/jal10.html#RamananBLL89</url>
<ee>https://doi.org/10.1016/0196-6774(89)90031-X</ee>
</article>
</r>
<r><article key="journals/sigact/Lee89" mdate="2018-11-06">
<author pid="l/DTLee">D. T. Lee</author>
<title>NSF report - computer and computation research.</title>
<pages>25</pages>
<year>1989</year>
<volume>20</volume>
<journal>SIGACT News</journal>
<number>4</number>
<ee>https://doi.org/10.1145/74074.74079</ee>
<url>db/journals/sigact/sigact20.html#Lee89</url>
</article>
</r>
<r><article key="journals/tcad/SarrafzadehL89" mdate="2020-09-24">
<author pid="s/MajidSarrafzadeh">Majid Sarrafzadeh</author>
<author pid="l/DTLee">D. T. Lee</author>
<title>A new approach to topological via minimization.</title>
<pages>890-900</pages>
<year>1989</year>
<volume>8</volume>
<journal>IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.</journal>
<number>8</number>
<ee>https://doi.org/10.1109/43.31548</ee>
<url>db/journals/tcad/tcad8.html#SarrafzadehL89</url>
</article>
</r>
<r><inproceedings key="conf/compgeom/HoL89" mdate="2021-06-14">
<author pid="89/1350">Jan-Ming Ho</author>
<author pid="l/DTLee">D. T. Lee</author>
<author pid="63/4629">Chia-Hsiang Chang</author>
<title>Bounded-Diameter Minimum Spanning Trees and Related Problems.</title>
<pages>276-282</pages>
<year>1989</year>
<crossref>conf/compgeom/1989</crossref>
<booktitle>SCG</booktitle>
<ee>https://doi.org/10.1145/73833.73864</ee>
<url>db/conf/compgeom/compgeom89.html#HoL89</url>
</inproceedings>
</r>
<r><inproceedings key="conf/compsac/LinJL89" mdate="2017-05-21">
<author pid="83/3256">Feng-Tyan Lin</author>
<author pid="51/1680">Jie-Yong Juang</author>
<author pid="l/DTLee">Der-Tsai Lee</author>
<title>Application of mathematical constraint resolution to decision support system.</title>
<pages>685-692</pages>
<year>1989</year>
<booktitle>COMPSAC</booktitle>
<ee>https://doi.org/10.1109/CMPSAC.1989.65166</ee>
<crossref>conf/compsac/1989</crossref>
<url>db/conf/compsac/compsac1989.html#LinJL89</url>
</inproceedings>
</r>
<r><inproceedings key="conf/siggraph/NichollLN87" mdate="2018-11-06">
<author pid="31/3914">Tina M. Nicholl</author>
<author pid="l/DTLee">D. T. Lee</author>
<author pid="30/4197">Robin A. Nicholl</author>
<title>An efficient new algorithm for 2-D line clipping: Its development and analysis.</title>
<pages>253-262</pages>
<year>1987</year>
<crossref>conf/siggraph/1987</crossref>
<booktitle>SIGGRAPH</booktitle>
<ee>https://doi.org/10.1145/37401.37432</ee>
<url>db/conf/siggraph/siggraph1987.html#NichollLN87</url>
</inproceedings>
</r>
<r><article key="journals/acta/LeeLW86" mdate="2022-01-12">
<author pid="169/2196">C. C. Lee 0002</author>
<author pid="l/DTLee">D. T. Lee</author>
<author pid="w/CKWong">C. K. Wong</author>
<title>Generating Binary Trees of Bounded Height.</title>
<pages>529-544</pages>
<year>1986</year>
<volume>23</volume>
<journal>Acta Informatica</journal>
<number>5</number>
<url>db/journals/acta/acta23.html#LeeLW86</url>
<ee>https://doi.org/10.1007/BF00288468</ee>
</article>
</r>
<r><article key="journals/algorithmica/LeeW86" mdate="2023-11-29">
<author pid="l/DTLee">D. T. Lee</author>
<author pid="67/6703">Ying-Fung Wu</author>
<title>Geometric Complexity of Some Loction Problems.</title>
<pages>193-211</pages>
<year>1986</year>
<volume>1</volume>
<journal>Algorithmica</journal>
<number>2</number>
<url>db/journals/algorithmica/algorithmica1.html#LeeW86</url>
<ee>https://doi.org/10.1007/BF01840442</ee>
</article>
</r>
<r><article key="journals/computing/ChazelleL86" mdate="2023-01-19">
<author pid="c/BernardChazelle">Bernard Marie Chazelle</author>
<author pid="l/DTLee">D. T. Lee</author>
<title>On a circle placement problem.</title>
<pages>1-16</pages>
<year>1986</year>
<volume>36</volume>
<journal>Computing</journal>
<number>1-2</number>
<ee>https://doi.org/10.1007/BF02238188</ee>
<url>db/journals/computing/computing36.html#ChazelleL86</url>
</article>
</r>
<r><article key="journals/cvgip/LeeL86" mdate="2023-01-19">
<author pid="l/DTLee">D. T. Lee</author>
<author pid="66/314">Arthur K. Lin</author>
<title>Computing the visibility polygon from an edge.</title>
<pages>1-19</pages>
<year>1986</year>
<volume>34</volume>
<journal>Comput. Vis. Graph. Image Process.</journal>
<number>1</number>
<ee>https://doi.org/10.1016/0734-189X(86)90044-7</ee>
<url>db/journals/cvgip/cvgip34.html#LeeL86</url>
</article>
</r>
<r><article key="journals/dcg/LeeL86" mdate="2020-03-12">
<author pid="l/DTLee">D. T. Lee</author>
<author pid="78/4810">A. K. Lin</author>
<title>Generalized Dalaunay Triangualtion for Planar Graphs.</title>
<pages>201-217</pages>
<year>1986</year>
<volume>1</volume>
<journal>Discret. Comput. Geom.</journal>
<url>db/journals/dcg/dcg1.html#LeeL86</url>
<ee type="oa">https://doi.org/10.1007/BF02187695</ee>
</article>
</r>
<r><article key="journals/siamcomp/ChazelleDL86" mdate="2017-05-27">
<author pid="c/BernardChazelle">Bernard Chazelle</author>
<author pid="d/RobertLScotDrysdale">Robert L. (Scot) Drysdale III</author>
<author pid="l/DTLee">D. T. Lee</author>
<title>Computing the Largest Empty Rectangle.</title>
<pages>300-315</pages>
<year>1986</year>
<volume>15</volume>
<journal>SIAM J. Comput.</journal>
<number>1</number>
<url>db/journals/siamcomp/siamcomp15.html#ChazelleDL86</url>
<ee>https://doi.org/10.1137/0215022</ee>
</article>
</r>
<r><article key="journals/tit/LeeL86" mdate="2020-03-10">
<author pid="l/DTLee">D. T. Lee</author>
<author pid="66/314">Arthur K. Lin</author>
<title>Computational complexity of art gallery problems.</title>
<pages>276-282</pages>
<year>1986</year>
<volume>32</volume>
<journal>IEEE Trans. Inf. Theory</journal>
<number>2</number>
<url>db/journals/tit/tit32.html#LeeL86</url>
<ee>https://doi.org/10.1109/TIT.1986.1057165</ee>
<ee>https://www.wikidata.org/entity/Q56504470</ee>
</article>
</r>
<r><inproceedings key="conf/mfcs/Lee86" mdate="2017-05-19">
<author pid="l/DTLee">D. T. Lee</author>
<title>Geometric Location Problems and Their Complexity.</title>
<pages>154-167</pages>
<year>1986</year>
<crossref>conf/mfcs/1986</crossref>
<booktitle>MFCS</booktitle>
<url>db/conf/mfcs/mfcs86.html#Lee86</url>
<ee>https://doi.org/10.1007/BFb0016240</ee>
</inproceedings>
</r>
<r><article key="journals/bit/ChazelleGL85" mdate="2021-06-22">
<author pid="c/BernardChazelle">Bernard Chazelle</author>
<author pid="g/LeonidasJGuibas">Leonidas J. Guibas</author>
<author pid="l/DTLee">D. T. Lee</author>
<title>The Power of Geometric Duality.</title>
<pages>76-90</pages>
<year>1985</year>
<volume>25</volume>
<journal>BIT</journal>
<number>1</number>
<url>db/journals/bit/bit25.html#ChazelleGL85</url>
<ee>https://doi.org/10.1007/BF01934990</ee>
<ee>https://www.wikidata.org/entity/Q55954534</ee>
</article>
</r>
<r><article key="journals/ipl/LeeC85" mdate="2017-05-26">
<author pid="l/DTLee">D. T. Lee</author>
<author pid="61/1734">Y. T. Ching</author>
<title>The Power of Geometric Duality Revisited.</title>
<pages>117-122</pages>
<year>1985</year>
<volume>21</volume>
<journal>Inf. Process. Lett.</journal>
<number>3</number>
<url>db/journals/ipl/ipl21.html#LeeC85</url>
<ee>https://doi.org/10.1016/0020-0190(85)90015-8</ee>
</article>
</r>
<r><article key="journals/jacm/LeeL85" mdate="2022-01-12">
<title>A Simple On-Line Bin-Packing Algorithm</title>
<author pid="169/2196">C. C. Lee 0002</author>
<author pid="l/DTLee">D. T. Lee</author>
<pages>562-572</pages>
<journal>J. ACM</journal>
<month>July</month>
<year>1985</year>
<volume>32</volume>
<number>3</number>
<url>db/journals/jacm/jacm32.html#LeeL85</url>
<ee>https://doi.org/10.1145/3828.3833</ee>
</article>
</r>
<r><article key="journals/pr/ChingL85" mdate="2020-02-24">
<author pid="61/1734">Y. T. Ching</author>
<author pid="l/DTLee">D. T. Lee</author>
<title>Finding the diameter of a set of lines.</title>
<pages>249-255</pages>
<year>1985</year>
<volume>18</volume>
<journal>Pattern Recognit.</journal>
<number>3-4</number>
<ee>https://doi.org/10.1016/0031-3203(85)90050-0</ee>
<url>db/journals/pr/pr18.html#ChingL85</url>
</article>
</r>
<r><article key="journals/pr/Lee85" mdate="2020-02-24">
<author pid="l/DTLee">D. T. Lee</author>
<title>Relative neighborhood graphs in the L<sup>i</sup>-metric.</title>
<pages>327-332</pages>
<year>1985</year>
<volume>18</volume>
<journal>Pattern Recognit.</journal>
<number>5</number>
<ee>https://doi.org/10.1016/0031-3203(85)90023-8</ee>
<url>db/journals/pr/pr18.html#Lee85</url>
</article>
</r>
<r><inproceedings key="conf/compgeom/RezendeLW85" mdate="2021-06-16">
<author pid="41/3473">Pedro Jussieu de Rezende</author>
<author pid="l/DTLee">D. T. Lee</author>
<author pid="67/6703">Ying-Fung Wu</author>
<title>Rectilinear shortest paths with rectangular barriers.</title>
<pages>204-213</pages>
<year>1985</year>
<booktitle>SCG</booktitle>
<ee>https://doi.org/10.1145/323233.323260</ee>
<crossref>conf/compgeom/1985</crossref>
<url>db/conf/compgeom/compgeom1985.html#RezendeLW85</url>
</inproceedings>
</r>
<r><article key="journals/bit/YehL84" mdate="2023-10-06">
<author pid="10/2190">Der-Yun Yeh</author>
<author pid="l/DTLee">D. T. Lee</author>
<title>Graph Algorithms on a Tree-Structured Parallel Computer.</title>
<pages>333-340</pages>
<year>1984</year>
<volume>24</volume>
<journal>BIT</journal>
<number>3</number>
<url>db/journals/bit/bit24.html#YehL84</url>
<ee>https://doi.org/10.1007/BF02136031</ee>
</article>
</r>
<r><article key="journals/dam/NaamadLH84" mdate="2021-02-11">
<author pid="13/87">Amnon Naamad</author>
<author pid="l/DTLee">D. T. Lee</author>
<author pid="10/4757">Wen-Lian Hsu</author>
<title>On the maximum empty rectangle problem.</title>
<pages>267-277</pages>
<year>1984</year>
<volume>8</volume>
<journal>Discret. Appl. Math.</journal>
<number>3</number>
<ee type="oa">https://doi.org/10.1016/0166-218X(84)90124-0</ee>
<url>db/journals/dam/dam8.html#NaamadLH84</url>
</article>
</r>
<r><article key="journals/ijpp/Lee84" mdate="2020-04-01">
<author pid="l/DTLee">D. T. Lee</author>
<title>An optimal time and minimal space algorithm for rectangle intersection problems.</title>
<pages>23-32</pages>
<year>1984</year>
<volume>13</volume>
<journal>Int. J. Parallel Program.</journal>
<number>1</number>
<ee>https://doi.org/10.1007/BF00989481</ee>
<url>db/journals/ijpp/ijpp13.html#Lee84</url>
</article>
</r>
<r><article key="journals/ipl/LeeL84" mdate="2022-01-12">
<author pid="169/2196">C. C. Lee 0002</author>
<author pid="l/DTLee">D. T. Lee</author>
<title>On a Circle-Cover Minimization Problem.</title>
<pages>109-115</pages>
<year>1984</year>
<volume>18</volume>
<journal>Inf. Process. Lett.</journal>
<number>2</number>
<url>db/journals/ipl/ipl18.html#LeeL84</url>
<ee>https://doi.org/10.1016/0020-0190(84)90033-4</ee>
</article>
</r>
<r><article key="journals/networks/LeeP84" mdate="2023-01-19">
<author pid="l/DTLee">D. T. Lee</author>
<author pid="p/FPPreparata">Franco P. Preparata</author>
<title>Euclidean shortest paths in the presence of rectilinear barriers.</title>
<pages>393-410</pages>
<year>1984</year>
<volume>14</volume>
<journal>Networks</journal>
<number>3</number>
<ee>https://doi.org/10.1002/net.3230140304</ee>
<ee>https://www.wikidata.org/entity/Q30047557</ee>
<url>db/journals/networks/networks14.html#LeeP84</url>
</article>
</r>
<r><article key="journals/tc/LeeL84" mdate="2017-05-20">
<author pid="l/DTLee">D. T. Lee</author>
<author pid="49/2011">Joseph Y.-T. Leung</author>
<title>On the 2-Dimensional Channel Assignment Problem.</title>
<pages>2-6</pages>
<year>1984</year>
<volume>33</volume>
<journal>IEEE Trans. Computers</journal>
<number>1</number>
<url>db/journals/tc/tc33.html#LeeL84</url>
<ee>https://doi.org/10.1109/TC.1984.5009310</ee>
<ee>http://doi.ieeecomputersociety.org/10.1109/TC.1984.5009310</ee>
</article>
</r>
<r><article key="journals/tc/LeeP84" mdate="2017-05-20">
<author pid="l/DTLee">D. T. Lee</author>
<author pid="p/FPPreparata">Franco P. Preparata</author>
<title>Computational Geometry - A Survey.</title>
<pages>1072-1101</pages>
<year>1984</year>
<volume>33</volume>
<journal>IEEE Trans. Computers</journal>
<number>12</number>
<url>db/journals/tc/tc33.html#LeeP84</url>
<ee>https://doi.org/10.1109/TC.1984.1676388</ee>
<ee>http://doi.ieeecomputersociety.org/10.1109/TC.1984.1676388</ee>
<note>Correction: IEEE Transactions on Computers 34(6): 584 (1995)</note>
</article>
</r>
<r><inproceedings key="conf/stacs/ChazelleDL84" mdate="2017-05-19">
<author pid="c/BernardChazelle">Bernard Chazelle</author>
<author pid="d/RobertLScotDrysdale">Robert L. (Scot) Drysdale III</author>
<author pid="l/DTLee">D. T. Lee</author>
<title>Computing the Largest Empty Rectangle.</title>
<pages>43-54</pages>
<year>1984</year>
<crossref>conf/stacs/1984</crossref>
<booktitle>STACS</booktitle>
<url>db/conf/stacs/stacs84.html#ChazelleDL84</url>
<ee>https://doi.org/10.1007/3-540-12920-0_4</ee>
</inproceedings>
</r>
<r><article key="journals/bit/NichollLLW83" mdate="2021-06-22">
<author pid="31/3914">Tina M. Nicholl</author>
<author pid="l/DTLee">D. T. Lee</author>
<author pid="68/1990">Yuh-Zen Liao</author>
<author pid="w/CKWong">Chak-Kuen Wong</author>
<title>On the X-Y Convex Hull of a Set of X-Y Polygons.</title>
<pages>456-471</pages>
<year>1983</year>
<volume>23</volume>
<journal>BIT</journal>
<number>4</number>
<url>db/journals/bit/bit23.html#NichollLLW83</url>
<ee>https://doi.org/10.1007/BF01933620</ee>
<ee>https://www.wikidata.org/entity/Q29543976</ee>
</article>
</r>
<r><article key="journals/cvgip/Lee83" mdate="2020-05-14">
<author pid="l/DTLee">D. T. Lee</author>
<title>Visibility of a simple polygon.</title>
<pages>207-221</pages>
<year>1983</year>
<volume>22</volume>
<journal>Comput. Vis. Graph. Image Process.</journal>
<number>2</number>
<ee>https://doi.org/10.1016/0734-189X(83)90065-8</ee>
<url>db/journals/cvgip/cvgip22.html#Lee83</url>
</article>
</r>
<r><article key="journals/ijpp/Lee83" mdate="2020-04-01">
<author pid="l/DTLee">D. T. Lee</author>
<title>On finding the convex hull of a simple polygon.</title>
<pages>87-98</pages>
<year>1983</year>
<volume>12</volume>
<journal>Int. J. Parallel Program.</journal>
<number>2</number>
<ee>https://doi.org/10.1007/BF00993195</ee>
<url>db/journals/ijpp/ijpp12.html#Lee83</url>
</article>
</r>
<r><article key="journals/jal/GuptaLW83" mdate="2020-10-05">
<author pid="55/607">Udaiprakash I. Gupta</author>
<author pid="l/DTLee">D. T. Lee</author>
<author pid="w/CKWong">C. K. Wong</author>
<title>Ranking and Unranking of B-Trees.</title>
<pages>51-60</pages>
<year>1983</year>
<volume>4</volume>
<journal>J. Algorithms</journal>
<number>1</number>
<url>db/journals/jal/jal4.html#GuptaLW83</url>
<ee>https://doi.org/10.1016/0196-6774(83)90034-2</ee>
</article>
</r>
<r><article key="journals/tcs/LeeLW83" mdate="2021-02-17">
<author pid="l/DTLee">D. T. Lee</author>
<author pid="l/CLLiu">C. L. Liu 0001</author>
<author pid="w/CKWong">C. K. Wong</author>
<title>(g 0, g 1, ... g k)-Trees and Unary OL Systems.</title>
<pages>209-217</pages>
<year>1983</year>
<volume>22</volume>
<journal>Theor. Comput. Sci.</journal>
<url>db/journals/tcs/tcs22.html#LeeLW83</url>
<ee type="oa">https://doi.org/10.1016/0304-3975(83)90145-7</ee>
</article>
</r>
<r><article key="journals/tit/GowdaKLN83" mdate="2020-03-10">
<author pid="17/4357">I. G. Gowda</author>
<author pid="19/1282">David G. Kirkpatrick</author>
<author pid="l/DTLee">D. T. Lee</author>
<author pid="13/87">Amnon Naamad</author>
<title>Dynamic Voronoi diagrams.</title>
<pages>724-730</pages>
<year>1983</year>
<volume>29</volume>
<journal>IEEE Trans. Inf. Theory</journal>
<number>5</number>
<url>db/journals/tit/tit29.html#GowdaKLN83</url>
<ee>https://doi.org/10.1109/TIT.1983.1056738</ee>
</article>
</r>
<r><inproceedings key="conf/focs/ChazelleGL83" mdate="2023-03-23">
<title>The Power of Geometric Duality</title>
<author pid="c/BernardChazelle">Bernard Chazelle</author>
<author pid="g/LeonidasJGuibas">Leonidas J. Guibas</author>
<author pid="l/DTLee">D. T. Lee</author>
<pages>217-225</pages>
<crossref>conf/focs/FOCS24</crossref>
<year>1983</year>
<booktitle>FOCS</booktitle>
<url>db/conf/focs/focs83.html#ChazelleGL83</url>
<ee>https://doi.org/10.1109/SFCS.1983.75</ee>
<ee>https://doi.ieeecomputersociety.org/10.1109/SFCS.1983.75</ee>
</inproceedings>
</r>
<r><article key="journals/jal/LeeP82" mdate="2017-05-28">
<author pid="l/DTLee">D. T. Lee</author>
<author pid="p/FPPreparata">Franco P. Preparata</author>
<title>An Improved Algorithm for the Rectangle Enclosure Problem.</title>
<pages>218-224</pages>
<year>1982</year>
<volume>3</volume>
<journal>J. Algorithms</journal>
<number>3</number>
<url>db/journals/jal/jal3.html#LeeP82</url>
<ee>https://doi.org/10.1016/0196-6774(82)90021-9</ee>
</article>
</r>
<r><article key="journals/networks/GuptaLL82" mdate="2020-10-05">
<author pid="55/607">Udaiprakash I. Gupta</author>
<author pid="l/DTLee">D. T. Lee</author>
<author pid="49/2011">Joseph Y.-T. Leung</author>
<title>Efficient algorithms for interval graphs and circular-arc graphs.</title>
<pages>459-467</pages>
<year>1982</year>
<volume>12</volume>
<journal>Networks</journal>
<number>4</number>
<ee>https://doi.org/10.1002/net.3230120410</ee>
<url>db/journals/networks/networks12.html#GuptaLL82</url>
</article>
</r>
<r><article key="journals/pami/Lee82" mdate="2020-05-30">
<author pid="l/DTLee">D. T. Lee</author>
<title>Medial Axis Transformation of a Planar Shape.</title>
<pages>363-369</pages>
<year>1982</year>
<volume>4</volume>
<journal>IEEE Trans. Pattern Anal. Mach. Intell.</journal>
<number>4</number>
<ee>https://doi.org/10.1109/TPAMI.1982.4767267</ee>
<ee>http://doi.ieeecomputersociety.org/10.1109/TPAMI.1982.4767267</ee>
<ee>https://www.wikidata.org/entity/Q52722211</ee>
<url>db/journals/pami/pami4.html#Lee82</url>
</article>
</r>
<r><article key="journals/siamcomp/GuptaLW82" mdate="2017-05-27">
<author pid="32/7010">Udai Gupta</author>
<author pid="l/DTLee">D. T. Lee</author>
<author pid="w/CKWong">C. K. Wong</author>
<title>Ranking and Unranking of 2-3 Trees.</title>
<pages>582-590</pages>
<year>1982</year>
<volume>11</volume>
<journal>SIAM J. Comput.</journal>
<number>3</number>
<url>db/journals/siamcomp/siamcomp11.html#GuptaLW82</url>
<ee>https://doi.org/10.1137/0211049</ee>
</article>
</r>
<r><article key="journals/tc/Lee82" mdate="2017-05-20">
<author pid="l/DTLee">Der-Tsai Lee</author>
<title>On <i>k</i>-Nearest Neighbor Voronoi Diagrams in the Plane.</title>
<pages>478-487</pages>
<year>1982</year>
<volume>31</volume>
<journal>IEEE Trans. Computers</journal>
<number>6</number>
<url>db/journals/tc/tc31.html#Lee82</url>
<ee>https://doi.org/10.1109/TC.1982.1676031</ee>
<ee>http://doi.ieeecomputersociety.org/10.1109/TC.1982.1676031</ee>
</article>
</r>
<r><article key="journals/tc/LeeS82" mdate="2017-05-20">
<author pid="l/DTLee">D. T. Lee</author>
<author pid="45/801">Charles B. Silio Jr.</author>
<title>An Optimal Illumination Region Algorithm for Convex Polygons.</title>
<pages>1225-1227</pages>
<year>1982</year>
<volume>31</volume>
<journal>IEEE Trans. Computers</journal>
<number>12</number>
<url>db/journals/tc/tc31.html#LeeS82</url>
<ee>https://doi.org/10.1109/TC.1982.1675946</ee>
<ee>http://doi.ieeecomputersociety.org/10.1109/TC.1982.1675946</ee>
</article>
</r>
<r><article key="journals/jal/LeeW81" mdate="2017-05-28">
<author pid="l/DTLee">D. T. Lee</author>
<author pid="w/CKWong">C. K. Wong</author>
<title>Finding Intersection of Rectangles by Range Search.</title>
<pages>337-347</pages>
<year>1981</year>
<volume>2</volume>
<journal>J. Algorithms</journal>
<number>4</number>
<url>db/journals/jal/jal2.html#LeeW81</url>
<ee>https://doi.org/10.1016/0196-6774(81)90033-X</ee>
</article>
</r>
<r><article key="journals/networks/SmithLL81" mdate="2017-05-28">
<author pid="s/JMacGregorSmith">J. MacGregor Smith</author>
<author pid="l/DTLee">D. T. Lee</author>
<author pid="87/2227">Judith Liebman</author>
<title>An O(<i>n</i> log <i>n</i>) heuristic for steiner minimal tree problems on the euclidean metric.</title>
<pages>23-39</pages>
<year>1981</year>
<volume>11</volume>
<journal>Networks</journal>
<number>1</number>
<ee>https://doi.org/10.1002/net.3230110104</ee>
<url>db/journals/networks/networks11.html#SmithLL81</url>
</article>
</r>
<r><article key="journals/siamcomp/LeeD81" mdate="2017-05-27">
<author pid="l/DTLee">D. T. Lee</author>
<author pid="d/RobertLScotDrysdale">Robert L. (Scot) Drysdale III</author>
<title>Generalization of Voronoi Diagrams in the Plane.</title>
<pages>73-87</pages>
<year>1981</year>
<volume>10</volume>
<journal>SIAM J. Comput.</journal>
<number>1</number>
<url>db/journals/siamcomp/siamcomp10.html#LeeD81</url>
<ee>https://doi.org/10.1137/0210006</ee>
</article>
</r>
<r><article key="journals/tc/LeeCW81" mdate="2017-05-20">
<author pid="l/DTLee">D. T. Lee</author>
<author pid="03/3069">Hsu Chang</author>
<author pid="w/CKWong">C. K. Wong</author>
<title>An On-Chip Compare/Steer Bubble Sorter.</title>
<pages>396-405</pages>
<year>1981</year>
<volume>30</volume>
<journal>IEEE Trans. Computers</journal>
<number>6</number>
<url>db/journals/tc/tc30.html#LeeCW81</url>
<ee>https://doi.org/10.1109/TC.1981.1675805</ee>
<ee>http://doi.ieeecomputersociety.org/10.1109/TC.1981.1675805</ee>
</article>
</r>
<r><article key="journals/tcs/GuptaLLPW81" mdate="2021-02-17">
<author pid="55/607">Udaiprakash I. Gupta</author>
<author pid="l/DTLee">D. T. Lee</author>
<author pid="49/2011">Joseph Y.-T. Leung</author>
<author pid="79/5565">J. W. Pruitt</author>
<author pid="w/CKWong">C. K. Wong</author>
<title>Record Allocation for Minimizing Seek Delay.</title>
<pages>307-319</pages>
<year>1981</year>
<volume>16</volume>
<journal>Theor. Comput. Sci.</journal>
<url>db/journals/tcs/tcs16.html#GuptaLLPW81</url>
<ee type="oa">https://doi.org/10.1016/0304-3975(81)90101-8</ee>
</article>
</r>
<r><inproceedings key="conf/siggraph/Lee81" mdate="2018-11-06">
<author pid="l/DTLee">D. T. Lee</author>
<title>Shading of regions on vector display devises.</title>
<pages>37-44</pages>
<year>1981</year>
<booktitle>SIGGRAPH</booktitle>
<ee>https://doi.org/10.1145/800224.806787</ee>
<crossref>conf/siggraph/1981</crossref>
<url>db/conf/siggraph/siggraph1981.html#Lee81</url>
</inproceedings>
</r>
<r><inproceedings key="conf/wg/LeeP81" mdate="2016-10-14">
<author pid="l/DTLee">D. T. Lee</author>
<author pid="p/FPPreparata">Franco P. Preparata</author>
<title>Euclidian Shortest Paths in the Presence of Parallel Rectilinear Barriers.</title>
<pages>303-314</pages>
<year>1981</year>
<booktitle>WG</booktitle>
<crossref>conf/wg/1981</crossref>
<url>db/conf/wg/wg81.html#LeeP81</url>
</inproceedings>
</r>
<r><article key="journals/ijpp/LeeS80" mdate="2021-06-01">
<author pid="l/DTLee">D. T. Lee</author>
<author pid="18/1491">Bruce J. Schachter</author>
<title>Two algorithms for constructing a Delaunay triangulation.</title>
<pages>219-242</pages>
<year>1980</year>
<volume>9</volume>
<journal>Int. J. Parallel Program.</journal>
<number>3</number>
<ee>https://doi.org/10.1007/BF00977785</ee>
<ee>https://www.wikidata.org/entity/Q105583229</ee>
<url>db/journals/ijpp/ijpp9.html#LeeS80</url>
</article>
</r>
<r><article key="journals/jacm/Lee80" mdate="2018-11-06">
<author pid="l/DTLee">D. T. Lee</author>
<title>Two-Dimensional Voronoi Diagrams in the L<sub>p</sub>-Metric.</title>
<pages>604-618</pages>
<year>1980</year>
<volume>27</volume>
<journal>J. ACM</journal>
<number>4</number>
<ee>https://doi.org/10.1145/322217.322219</ee>
<url>db/journals/jacm/jacm27.html#Lee80</url>
</article>
</r>
<r><article key="journals/siamcomp/LeeW80" mdate="2017-05-27">
<author pid="l/DTLee">D. T. Lee</author>
<author pid="w/CKWong">C. K. Wong</author>
<title>Voronoi Diagrams in L<sub>1</sub> (L<sub>infty</sub>) Metrics with 2-Dimensional Storage Applications.</title>
<pages>200-211</pages>
<year>1980</year>
<volume>9</volume>
<journal>SIAM J. Comput.</journal>
<number>1</number>
<url>db/journals/siamcomp/siamcomp9.html#LeeW80</url>
<ee>https://doi.org/10.1137/0209017</ee>
</article>
</r>
<r><article key="journals/tods/LeeW80" mdate="2018-11-14">
<author pid="l/DTLee">D. T. Lee</author>
<author pid="w/CKWong">C. K. Wong</author>
<title>Quintary Trees: A File Structure for Multidimensional Database Systems.</title>
<pages>339-353</pages>
<cdrom>TODS5/P339.PDF</cdrom>
<year>1980</year>
<volume>5</volume>
<journal>ACM Trans. Database Syst.</journal>
<number>3</number>
<url>db/journals/tods/tods5.html#LeeW80</url>
<ee>https://doi.org/10.1145/320613.320618</ee>
<ee>https://www.wikidata.org/entity/Q56573280</ee>
<cite>journals/cacm/Bentley75</cite>
<cite>...</cite>
<cite>journals/csur/BentleyF79</cite>
<cite>journals/acta/BentleyM80</cite>
<cite>...</cite>
<cite>journals/cj/CardenasS77</cite>
<cite>...</cite>
<cite>...</cite>
<cite>journals/tse/KashyapSY77</cite>
<cite>books/aw/Knuth73a</cite>
<cite>books/aw/Knuth73</cite>
<cite>journals/acta/LeeW77</cite>
<cite>...</cite>
<cite>conf/focs/Lueker78</cite>
<cite>journals/jal/Monier80</cite>
<cite>...</cite>
</article>
</r>
<r><article key="journals/ipl/YangL79" mdate="2017-05-26">
<author pid="34/480">C. C. Yang</author>
<author pid="l/DTLee">D. T. Lee</author>
<title>A Note on the all Nearest-Neighbor Problem for Convex Polygons.</title>
<pages>193-194</pages>
<year>1979</year>
<volume>8</volume>
<journal>Inf. Process. Lett.</journal>
<number>4</number>
<url>db/journals/ipl/ipl8.html#YangL79</url>
<ee>https://doi.org/10.1016/0020-0190(79)90021-8</ee>
</article>
</r>
<r><article key="journals/ipl/LeeY79" mdate="2017-05-26">
<author pid="l/DTLee">D. T. Lee</author>
<author pid="34/480">C. C. Yang</author>
<title>Location of Multiple Points in a Planar Subdivision.</title>
<pages>190-193</pages>
<year>1979</year>
<volume>9</volume>
<journal>Inf. Process. Lett.</journal>
<number>4</number>
<url>db/journals/ipl/ipl9.html#LeeY79</url>
<ee>https://doi.org/10.1016/0020-0190(79)90066-8</ee>
</article>
</r>
<r><article key="journals/jacm/LeeP79" mdate="2018-11-06">
<author pid="l/DTLee">D. T. Lee</author>
<author pid="p/FPPreparata">Franco P. Preparata</author>
<title>An Optimal Algorithm for Finding the Kernel of a Polygon.</title>
<pages>415-421</pages>
<year>1979</year>
<volume>26</volume>
<journal>J. ACM</journal>
<number>3</number>
<ee>https://doi.org/10.1145/322139.322142</ee>
<url>db/journals/jacm/jacm26.html#LeeP79</url>
</article>
</r>
<r><article key="journals/tc/GuptaLL79" mdate="2020-10-05">
<author pid="55/607">Udaiprakash I. Gupta</author>
<author pid="l/DTLee">D. T. Lee</author>
<author pid="49/2011">Joseph Y.-T. Leung</author>
<title>An Optimal Solution for the Channel-Assignment Problem.</title>
<pages>807-810</pages>
<year>1979</year>
<volume>28</volume>
<journal>IEEE Trans. Computers</journal>
<number>11</number>
<url>db/journals/tc/tc28.html#GuptaLL79</url>
<ee>https://doi.org/10.1109/TC.1979.1675260</ee>
<ee>http://doi.ieeecomputersociety.org/10.1109/TC.1979.1675260</ee>
</article>
</r>
<r><article key="journals/ipl/LeeP78" mdate="2017-05-26">
<author pid="l/DTLee">D. T. Lee</author>
<author pid="p/FPPreparata">Franco P. Preparata</author>
<title>The All Nearest-Neighbor Problem for Convex Polygons.</title>
<pages>189-192</pages>
<year>1978</year>
<volume>7</volume>
<journal>Inf. Process. Lett.</journal>
<number>4</number>
<url>db/journals/ipl/ipl7.html#LeeP78</url>
<ee>https://doi.org/10.1016/0020-0190(78)90066-2</ee>
</article>
</r>
<r><article key="journals/acta/LeeW77" mdate="2020-06-21">
<author pid="l/DTLee">D. T. Lee</author>
<author pid="w/CKWong">C. K. Wong</author>
<title>Worst-Case Analysis for Region and Partial Region Searches in Multidimensional Binary Search Trees and Balanced Quad Trees.</title>
<pages>23-29</pages>
<year>1977</year>
<volume>9</volume>
<journal>Acta Informatica</journal>
<url>db/journals/acta/acta9.html#LeeW77</url>
<ee>https://doi.org/10.1007/BF00263763</ee>
<ee>https://www.wikidata.org/entity/Q55920347</ee>
</article>
</r>
<r><article key="journals/siamcomp/LeeP77" mdate="2017-05-27">
<author pid="l/DTLee">D. T. Lee</author>
<author pid="p/FPPreparata">Franco P. Preparata</author>
<title>Location of a Point in a Planar Subdivision and Its Applications.</title>
<pages>594-606</pages>
<year>1977</year>
<volume>6</volume>
<journal>SIAM J. Comput.</journal>
<number>3</number>
<url>db/journals/siamcomp/siamcomp6.html#LeeP77</url>
<ee>https://doi.org/10.1137/0206043</ee>
</article>
</r>
<r><article key="journals/tc/LeeH76" mdate="2017-05-20">
<author pid="l/DTLee">Der-Tsai Lee</author>
<author pid="73/994">Se June Hong</author>
<title>An Algorithm for Transformation of an Arbitrary Switching Function to a Completely Symmetric Function.</title>
<pages>1117-1123</pages>
<year>1976</year>
<volume>25</volume>
<journal>IEEE Trans. Computers</journal>
<number>11</number>
<url>db/journals/tc/tc25.html#LeeH76</url>
<ee>https://doi.org/10.1109/TC.1976.1674562</ee>
<ee>http://doi.ieeecomputersociety.org/10.1109/TC.1976.1674562</ee>
</article>
</r>
<r><inproceedings key="conf/stoc/LeeP76" mdate="2018-11-06">
<title>Location of a Point in a Planar Subdivision and its Applications</title>
<author pid="l/DTLee">D. T. Lee</author>
<author pid="p/FPPreparata">Franco P. Preparata</author>
<pages>231-235</pages>
<crossref>conf/stoc/STOC8</crossref>
<year>1976</year>
<booktitle>STOC</booktitle>
<url>db/conf/stoc/stoc76.html#LeeP76</url>
<ee>https://doi.org/10.1145/800113.803653</ee>
</inproceedings>
</r>
<coauthors n="213" nc="9">
<co c="0"><na f="a/Aichholzer:Oswin" pid="33/289">Oswin Aichholzer</na></co>
<co c="-1"><na f="a/Alsuwaiyel:Muhammad_H=" pid="86/5000">Muhammad H. Alsuwaiyel</na></co>
<co c="0"><na f="a/Amato:Nancy_M=" pid="a/NMAmato">Nancy M. Amato</na></co>
<co c="0"><na f="a/Andrews:Marilyn_G=" pid="79/2710">Marilyn G. Andrews</na></co>
<co c="-1" n="2"><na f="a/Aoki=Kinoshita:Kiyoko_F=" pid="a/KiyokoFAokiKinoshita">Kiyoko F. Aoki-Kinoshita</na><na>Kiyoko F. Aoki</na></co>
<co c="0"><na f="a/Asano:Takao" pid="21/1336">Takao Asano</na></co>
<co c="0"><na f="a/Atallah:Mikhail_J=" pid="a/MikhailJAtallah">Mikhail J. Atallah</na></co>
<co c="0"><na f="a/Aurenhammer:Franz" pid="27/2235">Franz Aurenhammer</na></co>
<co c="0"><na f="b/Brown:Donna_J=" pid="b/DonnaJBrown">Donna J. Brown</na></co>
<co c="0"><na f="c/Chang:Chao=Hui" pid="77/5424">Chao-Hui Chang</na></co>
<co c="0"><na f="c/Chang:Chia=Hsiang" pid="63/4629">Chia-Hsiang Chang</na></co>
<co c="0"><na f="c/Chang:Hsu" pid="03/3069">Hsu Chang</na></co>
<co c="1"><na f="c/Chang:Shih=Fu" pid="c/ShihFuChang">Shih-Fu Chang</na></co>
<co c="3"><na f="c/Chang:Shih=Lang" pid="21/3411">Shih-Lang Chang</na></co>
<co c="0"><na f="c/Chang:Shih=Ming" pid="70/7545">Shih-Ming Chang</na></co>
<co c="0"><na f="c/Chang:Yao=Wen" pid="c/YaoWenChang">Yao-Wen Chang</na></co>
<co c="0"><na f="c/Chang:Yu=Jung" pid="12/443">Yu-Jung Chang</na></co>
<co c="0"><na f="c/Chao:Kun=Mao" pid="c/KunMaoChao">Kun-Mao Chao</na></co>
<co c="0" n="2"><na f="c/Chazelle:Bernard" pid="c/BernardChazelle">Bernard Chazelle</na><na>Bernard Marie Chazelle</na></co>
<co c="-1"><na f="c/Chen:Arbee_L=_P=" pid="c/ALPChen">Arbee L. P. Chen</na></co>
<co c="0"><na f="c/Chen:Chang=Han" pid="41/7101">Chang-Han Chen</na></co>
<co c="0"><na f="c/Chen:Chien=Chih" pid="04/6670">Chien-Chih Chen</na></co>
<co c="0" n="2"><na f="c/Chen:Danny_Ziyi" pid="c/DannyZChen">Danny Ziyi Chen</na><na>Danny Z. Chen</na></co>
<co c="0"><na f="c/Chen:Han=Lin" pid="59/2816">Han-Lin Chen</na></co>
<co c="-1"><na f="c/Chen:Hsiao=Feng_Steven" pid="03/2188">Hsiao-Feng Steven Chen</na></co>
<co c="0"><na f="c/Chen:I=Che" pid="62/11467">I-Che Chen</na></co>
<co c="0"><na f="c/Chen:Jian=Jia" pid="70/1961">Jian-Jia Chen</na></co>
<co c="0"><na f="c/Chen_0002:Ming=Yu" pid="26/4228-2">Ming-Yu Chen 0002</na></co>
<co c="0"><na f="c/Chen:Sao=Jie" pid="74/4774">Sao-Jie Chen</na></co>
<co c="0"><na f="c/Chen:Shiang=Heng" pid="89/3607">Shiang-Heng Chen</na></co>
<co c="0"><na f="c/Chen:T=_H=" pid="55/2720">T. H. Chen</na></co>
<co c="0"><na f="c/Chen:Tai=Yu" pid="57/455">Tai-Yu Chen</na></co>
<co c="1"><na f="c/Chen:Tsuhan" pid="c/TsuhanChen">Tsuhan Chen</na></co>
<co c="0"><na f="c/Chen:Yu=Shin" pid="75/4638">Yu-Shin Chen</na></co>
<co c="1"><na f="c/Cheng:Wen=Huang" pid="34/1311">Wen-Huang Cheng</na></co>
<co c="1"><na f="c/Chien:Chiang=Ju" pid="27/2182">Chiang-Ju Chien</na></co>
<co c="0"><na f="c/Chin:Francis_Y=_L=" pid="c/FrancisYLChin">Francis Y. L. Chin</na></co>
<co c="-1"><na f="c/Ching:Y=_T=" pid="61/1734">Y. T. Ching</na></co>
<co c="6"><na f="c/Choi:Jung=Ju" pid="07/3183">Jung-Ju Choi</na></co>
<co c="0"><na f="c/Chou:Meng=Yuan" pid="46/5402">Meng-Yuan Chou</na></co>
<co c="0"><na f="c/Chu:Te=Chin" pid="29/7252">Te-Chin Chu</na></co>
<co c="0"><na f="c/Chung:Wei=Chun" pid="17/7757">Wei-Chun Chung</na></co>
<co c="0"><na f="d/Dai:Bang=Sin" pid="129/1277">Bang-Sin Dai</na></co>
<co c="0"><na f="d/Ding:Cheng=Liang" pid="98/4226">Cheng-Liang Ding</na></co>
<co c="0" n="2"><na f="d/Drysdale:Robert_L=_Scot" pid="d/RobertLScotDrysdale">Robert L. Scot Drysdale</na><na>Robert L. (Scot) Drysdale III</na></co>
<co c="0"><na f="f/Farrahi:Amir_H=" pid="28/2897">Amir H. Farrahi</na></co>
<co c="1"><na f="g/Gao:Shenghua" pid="63/7642">Shenghua Gao</na></co>
<co c="0"><na f="g/Gemsa:Andreas" pid="94/7963">Andreas Gemsa</na></co>
<co c="0"><na f="g/Gowda:I=_G=" pid="17/4357">I. G. Gowda</na></co>
<co c="0"><na f="g/Gr=uuml=ne:Ansgar" pid="59/4119">Ansgar Gr&#252;ne</na></co>
<co c="0"><na f="g/Guibas:Leonidas_J=" pid="g/LeonidasJGuibas">Leonidas J. Guibas</na></co>
<co c="0"><na f="g/Gupta:Udai" pid="32/7010">Udai Gupta</na></co>
<co c="0"><na f="g/Gupta:Udaiprakash_I=" pid="55/607">Udaiprakash I. Gupta</na></co>
<co c="0"><na f="h/Hang:Christian" pid="57/3796">Christian Hang</na></co>
<co c="0"><na f="h/Heffernan:Paul_J=" pid="89/1766">Paul J. Heffernan</na></co>
<co c="0"><na f="h/Ho:Jan=Ming" pid="89/1350">Jan-Ming Ho</na></co>
<co c="0"><na f="h/Ho:Jinn" pid="89/4692">Jinn Ho</na></co>
<co c="0"><na f="h/Ho:Tsung=Yi" pid="63/4181">Tsung-Yi Ho</na></co>
<co c="-1"><na f="h/Hong:Se_June" pid="73/994">Se June Hong</na></co>
<co c="0"><na f="h/Hsieh:Mu=Fen" pid="97/1891">Mu-Fen Hsieh</na></co>
<co c="0"><na f="h/Hsu:Chun=Nan" pid="h/ChunNanHsu">Chun-Nan Hsu</na></co>
<co c="0"><na f="h/Hsu:Tsan=sheng" pid="19/2124">Tsan-sheng Hsu</na></co>
<co c="0"><na f="h/Hsu:Wen=Lian" pid="10/4757">Wen-Lian Hsu</na></co>
<co c="-1"><na f="h/Hsueh:John_C=_C=" pid="59/6682">John C. C. Hsueh</na></co>
<co c="0"><na f="h/Huang:Chi=Ying_F=" pid="55/919">Chi-Ying F. Huang</na></co>
<co c="0"><na f="h/Huang:Jeng=Hung" pid="79/507">Jeng-Hung Huang</na></co>
<co c="0"><na f="h/Huang:Shih=Kun" pid="72/7017">Shih-Kun Huang</na></co>
<co c="-1"><na f="h/Huang:Tzu=Lun" pid="33/4933">Tzu-Lun Huang</na></co>
<co c="0"><na f="h/Huang:Yao=Wen" pid="49/3977">Yao-Wen Huang</na></co>
<co c="0"><na f="h/Hwang:Wen=Liang" pid="h/WenLiangHwang">Wen-Liang Hwang</na></co>
<co c="0"><na f="i/Imai:Hiroshi" pid="09/1655">Hiroshi Imai</na></co>
<co c="2"><na f="j/Jajodia:Sushil" pid="j/SushilJajodia">Sushil Jajodia</na></co>
<co c="-1"><na f="j/Jeong:C=_S=" pid="93/5837">C. S. Jeong</na></co>
<co c="6"><na f="j/Jeong:Chang=Sung" pid="58/1148">Chang-Sung Jeong</na></co>
<co c="1"><na f="j/Jhuo:I=Hong" pid="80/7642">I-Hong Jhuo</na></co>
<co c="0"><na f="j/Jiang_0001:Tao" pid="j/TaoJiang-1">Tao Jiang 0001</na></co>
<co c="1"><na f="j/Jiang_0001:Yu=Gang" pid="24/5818">Yu-Gang Jiang 0001</na></co>
<co c="8"><na f="j/Juang:Jie=Yong" pid="51/1680">Jie-Yong Juang</na></co>
<co c="0"><na f="k/Kao:Cheng=Yan" pid="34/4269">Cheng-Yan Kao</na></co>
<co c="0"><na f="k/Kao:Mong=Jen" pid="29/2488">Mong-Jen Kao</na></co>
<co c="0"><na f="k/Katz:Bastian" pid="56/6619">Bastian Katz</na></co>
<co c="0"><na f="k/Kirkpatrick:David_G=" pid="19/1282">David G. Kirkpatrick</na></co>
<co c="0"><na f="k/Klein:Rolf" pid="k/RolfKlein">Rolf Klein</na></co>
<co c="0"><na f="k/Krug:Marcus" pid="50/3558">Marcus Krug</na></co>
<co c="0"><na f="k/Ku:Chin=Fu" pid="24/3629">Chin-Fu Ku</na></co>
<co c="0"><na f="k/Kuo:Sy=Yen" pid="57/264">Sy-Yen Kuo</na></co>
<co c="4"><na f="l/Lai:Hsien=Chung" pid="324/9590">Hsien-Chung Lai</na></co>
<co c="0"><na f="l/Lai:Jin=Mei" pid="50/2813">Jin-Mei Lai</na></co>
<co c="0"><na f="l/Langetepe:Elmar" pid="76/5590">Elmar Langetepe</na></co>
<co c="-1"><na f="l/Le:Van=Ban" pid="85/722">Van-Ban Le</na></co>
<co c="0" n="2"><na f="l/Lee_0001:Chi_Chung" pid="169/2196">Chi Chung Lee 0001</na><na>C. C. Lee 0002</na></co>
<co c="1"><na f="l/Lee:Chien=Ming" pid="04/5163">Chien-Ming Lee</na></co>
<co c="0"><na f="l/Lee:Gen=Cher" pid="97/1502">Gen-Cher Lee</na></co>
<co c="0"><na f="l/Lee:Greg_C=" pid="06/1480">Greg C. Lee</na></co>
<co c="0"><na f="l/Lee:Sheng=An" pid="83/6556">Sheng-An Lee</na></co>
<co c="0"><na f="l/Lei:Chin=Laung" pid="31/3229">Chin-Laung Lei</na></co>
<co c="0"><na f="l/Leung:Joseph_Y==T=" pid="49/2011">Joseph Y.-T. Leung</na></co>
<co c="0"><na f="l/Li:Cheng=Chung" pid="46/2794">Cheng-Chung Li</na></co>
<co c="0"><na f="l/Liao:Chung=Shou" pid="72/3143">Chung-Shou Liao</na></co>
<co c="0"><na f="l/Liao:Kuo=Feng" pid="02/1902">Kuo-Feng Liao</na></co>
<co c="0"><na f="l/Liao:Yuh=Zen" pid="68/1990">Yuh-Zen Liao</na></co>
<co c="5"><na f="l/Liebman:Judith" pid="87/2227">Judith Liebman</na></co>
<co c="-1"><na f="l/Lin:A=_K=" pid="78/4810">A. K. Lin</na></co>
<co c="-1"><na f="l/Lin:Arthur_K=" pid="66/314">Arthur K. Lin</na></co>
<co c="2"><na f="l/Lin:Bao=Shuh_Paul" pid="15/4486">Bao-Shuh Paul Lin</na></co>
<co c="0"><na f="l/Lin:Chih=Yun" pid="42/7104">Chih-Yun Lin</na></co>
<co c="0"><na f="l/Lin:Ching=Chi" pid="84/3209">Ching-Chi Lin</na></co>
<co c="0"><na f="l/Lin:Chun=Syun" pid="115/8620">Chun-Syun Lin</na></co>
<co c="0"><na f="l/Lin:Chun=Xun" pid="145/9179">Chun-Xun Lin</na></co>
<co c="0"><na f="l/Lin:Chung=Yen" pid="87/820">Chung-Yen Lin</na></co>
<co c="8"><na f="l/Lin:Feng=Tyan" pid="83/3256">Feng-Tyan Lin</na></co>
<co c="2"><na f="l/Lin:Ferng=Ching" pid="28/4018">Ferng-Ching Lin</na></co>
<co c="0"><na f="l/Lin:Hung=Yau" pid="03/106">Hung-Yau Lin</na></co>
<co c="0"><na f="l/Lin:Kuan=Ting" pid="58/5026">Kuan-Ting Lin</na></co>
<co c="0"><na f="l/Lin:Laurent" pid="36/3190">Laurent Lin</na></co>
<co c="0"><na f="l/Lin:Tien=Ching" pid="04/1009">Tien-Ching Lin</na></co>
<co c="0"><na f="l/Lin:Tsung=Po" pid="46/6953">Tsung-Po Lin</na></co>
<co c="0"><na f="l/Liu_0001:C=_L=" pid="l/CLLiu">C. L. Liu 0001</na></co>
<co c="0"><na f="l/Liu:Chia=Hung" pid="63/2830">Chia-Hung Liu</na></co>
<co c="0"><na f="l/Liu_0001:Chih=Hung" pid="82/1212">Chih-Hung Liu 0001</na></co>
<co c="1"><na f="l/Liu_0001:Dong" pid="98/1737-1">Dong Liu 0001</na></co>
<co c="4"><na f="l/Liu:Jing=Sin" pid="30/794">Jing-Sin Liu</na></co>
<co c="0"><na f="l/Liu:Tsunglin" pid="52/1134">Tsunglin Liu</na></co>
<co c="0"><na f="l/Lou:Ruey=Der" pid="26/194">Ruey-Der Lou</na></co>
<co c="0"><na f="l/Lu:Chun=Shien" pid="40/4382">Chun-Shien Lu</na></co>
<co c="0"><na f="l/Lu:Henry_Horng=Shing" pid="17/6294">Henry Horng-Shing Lu</na></co>
<co c="0"><na f="l/Lu:Hsueh=I" pid="l/HsuehILu">Hsueh-I Lu</na></co>
<co c="1"><na f="m/Ma_0001:Yi" pid="69/1112-1">Yi Ma 0001</na></co>
<co c="0"><na f="m/Mitchell:Joseph_S=_B=" pid="m/JosephSBMitchell">Joseph S. B. Mitchell</na></co>
<co c="3"><na f="m/Mok:Swee_M=" pid="29/149">Swee M. Mok</na></co>
<co c="0"><na f="m/Mukhopadhyay:Asish" pid="20/1128">Asish Mukhopadhyay</na></co>
<co c="0"><na f="n/Naamad:Amnon" pid="13/87">Amnon Naamad</na></co>
<co c="0"><na f="n/Nakano:Shin=Ichi" pid="n/ShinIchiNakano">Shin-Ichi Nakano</na></co>
<co c="0"><na f="n/Nicholl:Robin_A=" pid="30/4197">Robin A. Nicholl</na></co>
<co c="0"><na f="n/Nicholl:Tina_M=" pid="31/3914">Tina M. Nicholl</na></co>
<co c="0"><na f="n/N=ouml=llenburg:Martin" pid="41/4420">Martin N&#246;llenburg</na></co>
<co c="0"><na f="p/Papadopoulou:Evanthia" pid="93/4868">Evanthia Papadopoulou</na></co>
<co c="0"><na f="p/Peng:Chin=Lin" pid="95/2866">Chin-Lin Peng</na></co>
<co c="0"><na f="p/Pietracaprina:Andrea" pid="95/3178">Andrea Pietracaprina</na></co>
<co c="0"><na f="p/Poon:Sheung=Hung" pid="91/6695">Sheung-Hung Poon</na></co>
<co c="0"><na f="p/Preparata:Franco_P=" pid="p/FPPreparata">Franco P. Preparata</na></co>
<co c="0"><na f="p/Pruitt:J=_W=" pid="79/5565">J. W. Pruitt</na></co>
<co c="0"><na f="r/Ramanan:Prakash_V=" pid="66/1158">Prakash V. Ramanan</na></co>
<co c="0"><na f="r/Rezende:Pedro_Jussieu_de" pid="41/3473">Pedro Jussieu de Rezende</na></co>
<co c="0"><na f="r/Rijmen:Vincent" pid="r/VincentRijmen">Vincent Rijmen</na></co>
<co c="-1"><na f="r/Roy:Kaushik" pid="183/5157">Kaushik Roy</na></co>
<co c="0"><na f="r/Rutter:Ignaz" pid="99/44">Ignaz Rutter</na></co>
<co c="0"><na f="s/Sarrafzadeh:Majid" pid="s/MajidSarrafzadeh">Majid Sarrafzadeh</na></co>
<co c="-1"><na f="s/Schachter:Bruce_J=" pid="18/1491">Bruce J. Schachter</na></co>
<co c="0"><na f="s/Sekharan:Chandra_N=" pid="79/956">Chandra N. Sekharan</na></co>
<co c="0"><na f="s/Seo:Dae=Young" pid="67/9765">Dae-Young Seo</na></co>
<co c="-1"><na f="s/Shen:C=_F=" pid="03/5881">C. F. Shen</na></co>
<co c="0"><na f="s/Shen:Chin=Fang" pid="74/1876">Chin-Fang Shen</na></co>
<co c="0"><na f="s/Sheu:Dennis_S=" pid="08/2995">Dennis S. Sheu</na></co>
<co c="1"><na f="s/Shiah:Shaw=Ji" pid="27/1963">Shaw-Ji Shiah</na></co>
<co c="0"><na f="s/Shiao:Tze=Chang" pid="97/2915">Tze-Chang Shiao</na></co>
<co c="0"><na f="s/Shiau:Jia=Yau" pid="210/4309">Jia-Yau Shiau</na></co>
<co c="2" n="2"><na f="s/Shieh:Shiuh=Pyng" pid="s/ShiuhPyngShieh">Shiuh-Pyng Shieh</na><na>Shiuhpyng Shieh</na></co>
<co c="0"><na f="s/Shih:Arthur_Chun=Chieh" pid="64/5278">Arthur Chun-Chieh Shih</na></co>
<co c="0"><na f="s/Shiue:Yow=Ling" pid="34/3150">Yow-Ling Shiue</na></co>
<co c="-1"><na f="s/Silio_Jr=:Charles_B=" pid="45/801">Charles B. Silio Jr.</na></co>
<co c="5" n="2"><na f="s/Smith:James_MacGregor" pid="s/JMacGregorSmith">James MacGregor Smith</na><na>J. MacGregor Smith</na></co>
<co c="0"><na f="s/Sridhar_0001:R=" pid="46/927-1">R. Sridhar 0001</na></co>
<co c="0"><na f="s/Su:Li=Jen" pid="00/7108">Li-Jen Su</na></co>
<co c="0"><na f="s/Su:Yi=Siang" pid="177/5304">Yi-Siang Su</na></co>
<co c="0"><na f="s/Su:Yu=Hsuan" pid="72/8236">Yu-Hsuan Su</na></co>
<co c="0"><na f="s/Sung:Ting=Yi" pid="17/6103">Ting-Yi Sung</na></co>
<co c="7"><na f="s/Swanson:Kurt" pid="68/6852">Kurt Swanson</na></co>
<co c="0"><na f="t/Tamassia:Roberto" pid="t/RobertoTamassia">Roberto Tamassia</na></co>
<co c="0"><na f="t/Teng:Shang=Hua" pid="t/ShangHuaTeng">Shang-Hua Teng</na></co>
<co c="0"><na f="t/Tokuyama:Takeshi" pid="89/1729">Takeshi Tokuyama</na></co>
<co c="0"><na f="t/Tsai:Chung=Hung" pid="22/4057">Chung-Hung Tsai</na></co>
<co c="0"><na f="t/Tsai:Kuo=Hui" pid="33/4593">Kuo-Hui Tsai</na></co>
<co c="0"><na f="t/Tsai:Ming=Hung" pid="37/5659">Ming-Hung Tsai</na></co>
<co c="0"><na f="t/Tseng:Huei=Hun" pid="85/3287">Huei-Hun Tseng</na></co>
<co c="0"><na f="t/Tseng:L=_H=" pid="82/474">L. H. Tseng</na></co>
<co c="0"><na f="t/Tu:Hai=Lun" pid="140/7557">Hai-Lun Tu</na></co>
<co c="0"><na f="t/Tung:Tsai=Yeh" pid="83/3056">Tsai-Yeh Tung</na></co>
<co c="0"><na f="w/Wagner:Dorothea" pid="w/DorotheaWagner">Dorothea Wagner</na></co>
<co c="0"><na f="w/Wang:Cao_An" pid="29/6007">Cao An Wang</na></co>
<co c="0" n="2"><na f="w/Wang_0004:Dawei" pid="39/2537-4">Dawei Wang 0004</na><na>Da-Wei Wang 0004</na></co>
<co c="4"><na f="w/Wang:Li=Sheng" pid="72/2129">Li-Sheng Wang</na></co>
<co c="0"><na f="w/Wang:Ting=Chi" pid="59/527">Ting-Chi Wang</na></co>
<co c="1"><na f="w/Wang:Ying=Chung" pid="61/4893">Ying-Chung Wang</na></co>
<co c="0"><na f="w/Wei:Jyh=Da" pid="97/5340">Jyh-Da Wei</na></co>
<co c="0"><na f="w/Weng:Jung=Hung" pid="32/8358">Jung-Hung Weng</na></co>
<co c="1"><na f="w/Weng:Li" pid="59/3954">Li Weng</na></co>
<co c="0" n="2"><na f="w/Wong:Chak=Kuen" pid="w/CKWong">Chak-Kuen Wong</na><na>C. K. Wong</na></co>
<co c="0"><na f="w/Wong:Chun=Yi" pid="21/2617">Chun-Yi Wong</na></co>
<co c="3" n="2"><na f="w/Wu:Chi=Haur" pid="129/6626">Chi-Haur Wu</na><na>Chi-haur Wu</na></co>
<co c="0"><na f="w/Wu:Chi=Jen" pid="52/6359">Chi-Jen Wu</na></co>
<co c="0"><na f="w/Wu:Chun=Hsin" pid="21/2100">Chun-Hsin Wu</na></co>
<co c="0"><na f="w/Wu:Tzong=Chen" pid="93/2842">Tzong-Chen Wu</na></co>
<co c="7"><na f="w/Wu:Vanban_L=" pid="61/3650">Vanban L. Wu</na></co>
<co c="0"><na f="w/Wu:Ying=Fung" pid="67/6703">Ying-Fung Wu</na></co>
<co c="0"><na f="w/Wu:Yu=Wei" pid="83/614">Yu-Wei Wu</na></co>
<co c="0"><na f="w/Wulff=Nilsen:Christian" pid="79/1632">Christian Wulff-Nilsen</na></co>
<co c="-1"><na f="y/Yang:C=_C=" pid="34/480">C. C. Yang</na></co>
<co c="0"><na f="y/Yang:Chung=Do" pid="60/6711">Chung-Do Yang</na></co>
<co c="1"><na f="y/Ye:Guangnan" pid="20/9998">Guangnan Ye</na></co>
<co c="0"><na f="y/Yeh:Chang=Wei" pid="34/7107">Chang-Wei Yeh</na></co>
<co c="-1"><na f="y/Yeh:Der=Yun" pid="10/2190">Der-Yun Yeh</na></co>
<co c="0"><na f="y/Yeh:Hsu=Hua" pid="58/7112">Hsu-Hua Yeh</na></co>
<co c="0"><na f="y/Ying:Shi" pid="75/3547">Shi Ying</na></co>
<co c="0"><na f="y/Yu:Chia=Mu" pid="91/1919">Chia-Mu Yu</na></co>
<co c="0"><na f="y/Yu_0001:Fang" pid="44/3505-1">Fang Yu 0001</na></co>
<co c="0"><na f="y/Yu:Hung=I" pid="18/2869">Hung-I Yu</na></co>
<co c="0"><na f="y/Yu:Kuen=Lin" pid="37/5550">Kuen-Lin Yu</na></co>
<co c="-1"><na f="y/Yu:T=_K=" pid="16/734">T. K. Yu</na></co>
<co c="0"><na f="y/Yu:Teng=Kai" pid="97/1063">Teng-Kai Yu</na></co>
<co c="0"><na f="y/Yuan:Shih=Yi" pid="18/4080">Shih-Yi Yuan</na></co>
<co c="0" n="2"><na f="z/Zhan:Justin_Zhijun" pid="127/0551">Justin Zhijun Zhan</na><na>Justin Zhan</na></co>
<co c="1"><na f="z/Zhuang:Liansheng" pid="94/5815">Liansheng Zhuang</na></co>
</coauthors>
</dblpperson>

