Tetsuo Asano

<h2 id="education-and-career">Education and career</h2>
<p>Asano was a student at <a href="/facts/Osaka_University/rcFrxvSY">Osaka University</a>, earning bachelor's, masters, and doctoral degrees there in 1972, 1974, and 1977. He was on the faculty of <a href="/facts/Osaka_Electro-Communication_University/SsREs2N5">Osaka Electro-Communication University</a> from 1977 until 1998, when he joined JAIST. From 2012 to 2014 he was dean of the School of Information Science at JAIST. He became president of JAIST in April 2014.<a class="footnote-ref" id="fnref:3" href="#fn:3"><sup>3</sup></a>
</p>
<h2 id="awards-and-honors">Awards and honors</h2>
<p>In 2001 he was elected as a fellow of the <a href="/facts/Association_for_Computing_Machinery/abI2atlP">Association for Computing Machinery</a><a class="footnote-ref" id="fnref:4" href="#fn:4"><sup>4</sup></a> "for his contributions to discrete algorithms on computational geometry and their practical applications to computer vision and VLSI design."<a class="footnote-ref" id="fnref:5" href="#fn:5"><sup>5</sup></a> He is also a fellow of the <a href="/facts/Institute_of_Electronics,_Information_and_Communication_Engineers/DDkC9wfy">Institute of Electronics, Information and Communication Engineers</a> and of the <a href="/facts/Information_Processing_Society_of_Japan/2TdmbyWR">Information Processing Society of Japan</a>.<a class="footnote-ref" id="fnref:6" href="#fn:6"><sup>6</sup></a>
</p>
<h2 id="selected-publications">Selected publications</h2>
<ul><li>Asano, T.; Bhattacharya, B.; Keil, M.; <a href="/facts/Frances_Yao/wu1IUg1r">Yao, F.</a> (1988), "Clustering algorithms based on minimum and maximum spanning trees", <a href="/facts/Symposium_on_Computational_Geometry/wGEQJSPR"><i>Proceedings of the Fourth Annual Symposium on Computational Geometry (SCG '88)</i></a>, ACM, pp. 252–257, <a href="/facts/Doi_(identifier)/muM9Etpq">doi</a>:<a href="https://doi.org/10.1145%2F73393.73419">10.1145/73393.73419</a>, <a href="/facts/ISBN_(identifier)/15AdSPa9">ISBN</a> 978-0897912709, <a href="/facts/S2CID_(identifier)/ldJsHa2Y">S2CID</a> <a href="https://api.semanticscholar.org/CorpusID:5820268">5820268</a>.</li>
<li>Asano, Takao; Asano, Tetsuo; <a href="/facts/Leonidas_J._Guibas/TQc1VkYm">Guibas, Leonidas</a>; <a href="/facts/John_Hershberger/0q5mr1cd">Hershberger, John</a>; Imai, Hiroshi (November 1986), "Visibility of disjoint polygons", <i><a href="/facts/Algorithmica/EqSt27Q2">Algorithmica</a></i>, 1 (1–4): 49–63, <a href="/facts/Doi_(identifier)/muM9Etpq">doi</a>:<a href="https://doi.org/10.1007%2FBF01840436">10.1007/BF01840436</a>, <a href="/facts/S2CID_(identifier)/ldJsHa2Y">S2CID</a> <a href="https://api.semanticscholar.org/CorpusID:33957067">33957067</a></li>
<li>Asano, Tetsuo; Ranjan, Desh; Roos, Thomas; <a href="/facts/Emo_Welzl/HRS841Kr">Welzl, Emo</a>; Widmayer, Peter (1997), "Space-filling curves and their use in the design of geometric data structures", <i><a href="/facts/Theoretical_Computer_Science_(journal)/Apbc0PDL">Theoretical Computer Science</a></i>, 181 (1): 3–15, <a href="/facts/Doi_(identifier)/muM9Etpq">doi</a>:<a href="https://doi.org/10.1016%2FS0304-3975%2896%2900259-9">10.1016/S0304-3975(96)00259-9</a>.</li></ul>

<h2 id="external-links">External links</h2>
<ul><li><a href="https://scholar.google.com/citations?user=Oad1ijkAAAAJ">Google scholar profile</a></li>
<li><a href="https://researchmap.jp/read0121088">ResearchMap profile</a></li></ul>

<h2 id="references">References</h2>

<ol>
<li id="fn:1"><p>Keynote speaker profile, Australasian Computer Science Week 2006, retrieved 2014-03-25. <a href="http://www.comp.utas.edu.au/acsw06/speaker-cats.html" target="_blank">http://www.comp.utas.edu.au/acsw06/speaker-cats.html</a> <a href="#fnref:1" class="footnote-back-ref">↩</a></p></li>
<li id="fn:2"><p>Faculty profile, JAIST, retrieved 2014-03-25. <a href="http://www.jaist.ac.jp/profiles/info_e.php?profile_id=00033" target="_blank">http://www.jaist.ac.jp/profiles/info_e.php?profile_id=00033</a> <a href="#fnref:2" class="footnote-back-ref">↩</a></p></li>
<li id="fn:3"><p>Faculty profile, JAIST, retrieved 2014-03-25. <a href="http://www.jaist.ac.jp/profiles/info_e.php?profile_id=00033" target="_blank">http://www.jaist.ac.jp/profiles/info_e.php?profile_id=00033</a> <a href="#fnref:3" class="footnote-back-ref">↩</a></p></li>
<li id="fn:4"><p>Keynote speaker profile, Australasian Computer Science Week 2006, retrieved 2014-03-25. <a href="http://www.comp.utas.edu.au/acsw06/speaker-cats.html" target="_blank">http://www.comp.utas.edu.au/acsw06/speaker-cats.html</a> <a href="#fnref:4" class="footnote-back-ref">↩</a></p></li>
<li id="fn:5"><p>ACM Fellow award citation, retrieved 2014-03-25. <a href="http://awards.acm.org/award_winners/asano_1637115.cfm" target="_blank">http://awards.acm.org/award_winners/asano_1637115.cfm</a> <a href="#fnref:5" class="footnote-back-ref">↩</a></p></li>
<li id="fn:6"><p>Faculty profile, JAIST, retrieved 2014-03-25. <a href="http://www.jaist.ac.jp/profiles/info_e.php?profile_id=00033" target="_blank">http://www.jaist.ac.jp/profiles/info_e.php?profile_id=00033</a> <a href="#fnref:6" class="footnote-back-ref">↩</a></p></li>
</ol>

Tetsuo Asano open-in-new

Tetsuo Asano