Rchr
J-GLOBAL ID:200901055270625093   Update date: Sep. 30, 2022

Nagoya Takayuki

ナゴヤ タカユキ | Nagoya Takayuki
Affiliation and department:
Research field  (1): Information theory
Research keywords  (5): 組合せ最適化 ,  計算量 ,  アルゴリズム ,  algorithm ,  computational complexity
Research theme for competitive and other funds  (5):
  • 2014 - 2016 手書き板書方式ビデオ教材共同開発のためのシステム基盤構築
  • 2014 - 2016 制約付きグラフ同型性判定問題に関する研究
  • 2012 - 2014 グラフ最適化問題に対する近似アルゴリズムの研究
  • 2010 - 2012 グラフ同型性判定問題の計算量の解析および効率的なアルゴリズムの提案
  • Design and Analysis of Graph Algorithms
Papers (23):
MISC (14):
  • TODA Seinosuke. A dynamic programmming algorithm for computing automorphism groups of a given set of matrices. IEICE technical report. 2007. 107. 73. 35-42
  • TODA Seinosuke. A simple algorithm for testing isomorphism of chordal graphs. IEICE technical report. 2006. 106. 29. 57-62
  • TODA Seinosuke. Computing automorphism groups of chordal graphs whose simplicial components are of small size (Preliminary Note). IEICE technical report. Theoretical foundations of Computing. 2005. 105. 144. 37-42
  • TODA Seinosuke. Computational Complexity of Graph Isomorphism Problem. IEICE technical report. Theoretical foundations of Computing. 2002. 101. 708. 15-24
  • TODA Seinosuke. Computational Complexity of Graph Isomorphism Problem. The Transactions of the Institute of Electronics,Information and Communication Engineers. 2002. 85. 2. 100-115
more...
Education (1):
  • - 2002 The University of Electro-Communications
Professional career (1):
  • 博士(理学) (電気通信大学)
Association Membership(s) (3):
INFORMATION PROCESSING SOCIETY OF JAPAN ,  European Association for Theoretical Computer Science ,  電子情報通信学会
※ Researcher’s information displayed in J-GLOBAL is based on the information registered in researchmap. For details, see here.

Return to Previous Page