COMPARISON AND ENUMERATION OF CHEMICAL GRAPHS
Tatsuya Akutsu, Hiroshi Nagamochi · Computational and Structural Biotechnology Journal · 2013
Cited by 32Open access
Author · Kyoto University
Hiroshi Nagamochi
- Works
- 465
- Cited by
- 5,119
- h-index
- 32
Most-cited papers
A Method for Inferring Polymers Based on Linear Regression and Integer Programming
Ryota Ido, Shengjuan Cao, Jianshen Zhu et al. · IEEE/ACM Transactions on Computational Biology and Bioinformatics · 2024
Cited by 5
Augmenting Edge-Connectivity over the Entire Range in O(nm) Time
Hiroshi Nagamochi, Toshihide Ibaraki · 1996
Cited by 2
Convex drawings of graphs with non-convex boundary
Seok-Hee Hong, Hiroshi Nagamochi · 2006
Cited by 0
A primaldual approximation algorithm for the survivable network design problem in hypergraph
Liang Zhao, Hiroshi Nagamochi, Toshihide Ibaraki · 2001
Cited by 0
一次元連続ビンパッキング問題に対する厳密解法 (21世紀の数理計画 : アルゴリズムとモデリング)
Yohei Arahori, Takashi Imamichi, Hiroshi Nagamochi · Institutional Repositories DataBase (IRDB) · 2010
Cited by 0Open access
ジャンケンのトーナメント表現と意味のある拡張(アルゴリズムと計算量理論)
Hiro Ito, Hiroshi Nagamochi · Institutional Repositories DataBase (IRDB) · 1995
Cited by 0Open access
ある種の平面有向ネットワークの多品種流問題について(計算アルゴリズムと計算量の基礎理論)
Hiroshi Nagamochi, Toshihide Ibaraki, TOSHIHARU HASEGAWA · Institutional Repositories DataBase (IRDB) · 1987
Cited by 0Open access
指定された全域木を含む最小2辺連結部分グラフを求める近似アルゴリズム (新しいパラダイムとしてのアルゴリズム工学)
Hiroshi Nagamochi · Institutional Repositories DataBase (IRDB) · 1999
Cited by 0Open access
ある種の平面有向ネットワークの多品種流問題に対する実行可能性の判定法(計算アルゴリズムと計算量の基礎理論)
Hiroshi Nagamochi, Toshihide Ibaraki · Institutional Repositories DataBase (IRDB) · 1988
Cited by 0Open access
Visual Analysis of Hierarchical Data Using 2.5D Drawing with Minimum Occlusion
Kazuya Haraguchi, Seok-Hee Hong, Hiroshi Nagamochi · 2013
Cited by 0