Advanced search: Search from
Select basic information for advanced search
| Free word |
|---|
Rchr
J-GLOBAL ID：200901063433739078
Update date: Jan. 30, 2024 Asano Tetsuo
アサノ テツオ | Asano Tetsuo
金沢大学 その他
About 金沢大学 その他
Job title： 監事
Homepage URL (1)： http://www.jaist.ac.jp/~t-asano/
Research theme for competitive and other funds (23)：
- 2020 - 2023 Desigining algorithms for commodities transportation on a planar graph modeling a map
- 2012 - 2017 A Multifaced Approach Toward Understanding the Limitations of Compuation
- 2012 - 2017 Exploring the Limits of Computation in the Scenario of Constrained Work Space
- 2011 - 2015 Development of General Computation Models for Many-core Environments
- 2011 - 2015 Development of Algorithmic Paradigms on Memory-Constrained Computation
Show all
- Tetsuo Asano. Minimizing Maximum Unmet Demand by Transportations Between Adjacent Nodes Characterized by Supplies and Demands. International Journal of Foundations of Computer Science. 2023
- Tetsuo Asano. Transportation Problem Allowing Sending and Bringing Back. International Journal of Foundations of Computer Science. 2023
- Tetsuo Asano. Transportation problem on a graph. Japan Journal of Industrial and Applied Mathematics. 2023
- T. Asano, L. Buzer, S. Bereg. A new algorithmic framework for basic problems on binary images. DISCRETE APPLIED MATHEMATICS. 2017. 216. 376-392
- Tetsuo Asano, Kevin Buchin, Maike Buchin, Matias Korman, Wolfgang Mulzer, Guenter Rote, Andre Schulz. Reprint of: Memory-constrained algorithms for simple polygons. COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS. 2014. 47. 3. 469-479
- 早川 裕真, 浅野 哲夫. 重みつき障害物を含む平面上での最短経路アルゴリズム. 研究報告アルゴリズム(AL). 2015. 2015. 8. 1-8
- Shigeki Nakamura, Tetsuo Asano, Siu-wing Cheng. An Algorithm for Finding the Point Minimizing the Distance Error to Given Points. IPSJ SIG Notes. 2014. 2014. 13. 1-8
- Tetsuo Asano, Taisuke Izumi, Masashi Kiyomi, Matsuo Konagaya, Hirotaka Ono, Yota Otachi, Pascal Schweitzer, Jun Tarui, Ryuhei Uehara. Depth-First Search Using O(n) Bits. ALGORITHMS AND COMPUTATION, ISAAC 2014. 2014. 8889. 553-564
- SEII Takahiro, ASANO Tetsuo. Adjustable Work Space Algorithm of Arrangement of lines. IEICE technical report. Theoretical foundations of Computing. 2013. 113. 371. 69-72
- KONAGAYA Matsuo, ASANO Tetsuo, CHEONG Otfried, WON BAE Sang. An Adjustable Work Space Algorithm for Finding a Shortest Path in a Simple Polygon. IEICE technical report. Theoretical foundations of Computing. 2013. 113. 371. 59-62
- アルゴリズムイントロダクション
近代科学社 2013 ISBN:9784764904088 - アルゴリズムとデータ構造 : 基礎のツールボックス
丸善出版 2012 ISBN:9784621061879 - 基礎・ソート・データ構造・数学
近代科学社 2012 ISBN:9784764904064 - 高度な設計と解析手法・高度なデータ構造・グラフアルゴリズム
近代科学社 2012 ISBN:9784764904071 - コンピュータ・ジオメトリ : 計算幾何学 : アルゴリズムと応用
近代科学社 2010 ISBN:9784764903883
- - 1977 Osaka University
- - 1974 Osaka University
- - 1972 Osaka University School of Engineering Science Direct Affiliates
- B.E., M.E.and Ph.D.from Osaka University (1972,1974,1977)
- 工学修士 (大阪大学)
- 工学博士 (大阪大学)
※ Researcher’s information displayed in J-GLOBAL is based on the information registered in researchmap. For details, see here.
Return to Previous Page
