Rchr
J-GLOBAL ID:200901053465877752
Update date: Feb. 14, 2024
AZUMA Itaru
アズマ イタル | AZUMA Itaru
Affiliation and department:
Job title:
Professor
Homepage URL (1):
http://rnc.r.dendai.ac.jp
Research field (4):
Information theory
, Biological, health, and medical informatics
, Information theory
, Information theory
Research keywords (6):
Computational Biology
, Bioinformatics
, NP-hardness
, Computational Complexity
, Algorithms
, Algorithms
Research theme for competitive and other funds (22):
- 2018 - 2023 Various Approaches to Computationally Hard Combinatorial Optimization Problems
- 2012 - 2016 計算困難な問題への科学と工学の両面からのアプローチ
- 2008 - 2012 計算困難な問題への混成アプローチ:近似,乱択,並列化
- 2005 - 2008 計算困難な問題への混成アプローチ:近似、並列化、Randmization
- 2004 - 2008 新世代の計算限界-その解明と打破-
- 2002 - 2005 A Hybrid Approach to Computationally Hard Problems : Combining Approximation, Parallelization, and Randomization
- 2001 - 2004 離散的な計算問題の計算量解析
- 2000 - 2002 計算困難な問題への混成アプローチ:近似,並列化,Randomization
- 1998 - 2001 実践的な計算量解析のための基礎研究
- 1998 - 2000 新しいパラダイムとしてのアルゴリズム工学:計算困難問題への挑戦
- 1999 - 1999 Nonplanar Topological Inference and Political-map Graphs
- 1999 - 1999 Nonplanar Topological Inference and Political-map Graphs
- 1998 - 1998 Planar Map Graphs
- 1998 - 1998 Planar Map Graphs
- 1996 - 1997 最適化問題の近似アルゴリズムとその並列化
- 1995 - 1996 計算問題の並列化可能性と並列化不能性
- 1995 - 1995 NC Algorithms for Finding a Maximal Set of Paths with Application to Compressing Strings
- 1995 - 1995 NC Algorithms for Finding a Maximal Set of Paths with Application to Compressing Strings
- 1994 - 1995 計算問題の並列化可能性と並列化不能性
- 1993 - 1994 計算問題の並列化可能性と並列化不能性
- 1993 - 1993 The Complexity of Selecting Maximal Solutions
- 1993 - 1993 The Complexity of Selecting Maximal Solutions
Show all
Papers (97):
-
Guangting Chen, Yong Chen, Zhi-Zhong Chen, Guohui Lin, Tian Liu, An Zhang:. Approximation algorithms for the maximally balanced connected graph tripartition problem. Journal of Combinatorial Optimization. 2022. 44. 3. 1753-1773
-
Zhi-Zhong Chen, F. Deng, and L. Wang. Identifying Duplications and Lateral Gene Transfers Simultaneously and Rapidly. Journal of Bioinformatics and Computational Biology. 2022. 20. 1. 2150033-1-2150033-26
-
Yong Chen, Zhi-Zhong Chen, Curtis Kennedy, Guohui Lin, Yao Xu, An Zhang. Approximation Algorithms for the Directed Path Partition Problems. Lecture Notes in Computer Science. 2021. 12874. 23-36
-
Yong Chen, Zhi-Zhong Chen, Guohui Lin, Lusheng Wang, An Zhang. A randomized approximation algorithm for metric triangle packing. Journal of Combinatorial Optimization. 2021. 41. 1. 12-27
-
Improved Practical Algorithms for rSPR Distance and Hybridization Number. Journal of Computational Biology. 2020. 27. 9. 1422-1432
more...
Books (2):
-
確率アルゴリズム
培風館 2006
-
確率アルゴリズム
共立出版株式会社 2001
Lectures and oral presentations (68):
-
Approximation algorithms for the directed path partition problems
(The 15th International Frontiers of Algorithmics Workshop (FAW'2021) 2021)
-
Various Approaches to Computationally Hard Problems
(2019)
-
A Randomized Approximatin Algorithm for rSPR Distance
(2015)
-
Randomized and Parameterized Algorithms for the Closest String Problem
(25th Annual International Symposium on Combinatorial Pattern Matching 2014)
-
Parameterized and Approximation Algorithms for Finding Two Disjoint Matchings
(7th Annual International Conference on Combinatorial Optimization and Applications 2013)
more...
Education (3):
- 1989 - 1992 The University of Electro-Communications Graduate School, Division of Electro Communications
- 1987 - 1989 The University of Electro-Communications Graduate School of Electro-Communications
- 1981 - 1985 西安電子科技大学 計算機系
Professional career (3):
- 工学博士 (電気通信大学大学院)
- 工学修士 (電気通信大学大学院)
- 工学学士 (西安電子科技大学)
Work history (1):
- 1992/04 - 1994/03 Research Assistant
Awards (2):
- 2002/02 - 第2回LA/EATCS-Japan発表論文賞
- 1998/10 - 情報処理学会山下記念研究賞
Association Membership(s) (4):
電子情報通信学会
, ACM
, SIAM
, LA シンポジウム
Return to Previous Page