永持 仁

最終更新日時: 2016/07/20 16:23:34

印刷する

氏名(漢字/フリガナ/アルファベット表記)
永持 仁/ナガモチ ヒロシ/Hiroshi Nagamochi
所属部署・職名(部局/所属/講座等/職名)
情報学研究科/数理工学専攻応用数学講座/教授
学部兼担
部局 所属 講座等 職名
工学部 工学部 情報学科
連絡先住所
種別 住所(日本語) 住所(英語)
職場 〒606-8501 京都府京都市左京区吉田本町 Yoshida-Honmachi, Sakyo-ku, Kyoto 606-8501, Japan
所属学会(国内)
学会名(日本語) 学会名(英語)
電子情報通信学会 Operation Research Society of Japan
情報処理学会 Institute of Electronics, Information and Communication Engineers
日本オペレーションズリサーチ学会 Information Processing Society of Japan
日本応用数理学会 The Japan Society for Industrial and Applied Mathematics
取得学位
学位名(日本語) 学位名(英語) 大学(日本語) 大学(英語) 取得区分
工学修士 京都大学
工学博士 京都大学
出身大学院・研究科等
大学名(日本語) 大学名(英語) 研究科名(日本語) 研究科名(英語) 専攻名(日本語) 専攻名(英語) 修了区分
京都大学 大学院工学研究科修士課程数理工学専攻 修了
京都大学 大学院工学研究科博士課程数理工学専攻 修了
出身学校・専攻等
大学名(日本語) 大学名(英語) 学部名(日本語) 学部名(英語) 学科名(日本語) 学科名(英語) 卒業区分
京都大学 農学部農業工学科 卒業
プロフィール
(日本語)
1988年京都大学大学院工学研究科 博士課程修了。工学博士。豊橋技術科学大学、京都大学,豊橋技術科学大学を経て,2004年より京都大学大学院情報学研究科(数理工学専攻)教授。専門は離散最適化,とりわけ、グラフアルゴリズム,図形パッキング問題,スケジューリング,列挙アルゴリズムなどに従事ししている。主著に Algorithmic Aspects of Graph Connectivities Cambridge University Press, 2008)や「グラフ理論 連結構造とその応用」(朝倉書店, 2010年)がある。日本オペレーションズ・リサーチ学会,電子情報通信学会,情報処理学会,日本応用数理学会各会員。
(英語)
He received the D.E. degrees from Kyoto University in 1988. He became a Professor in the Department of Applied Mathematics and Physics, Graduate School of Informatics, Kyoto University in 2004 after serving for Toyohashi University of Technology. His research interests include Discrete Optimization, Packing Problem, Graph Algorithms, Scheduling, Packing Problem Chemical Graphs, etc. He is a member of the Operation Research Society of Japan, Institute of Electronics, Information and Communication Engineers, Information Processing Society of Japan, and The Japan Society for Industrial and Applied Mathematics. He wrote over 150 journal papers and two books, Algorithmic Aspects of Graph Connectivities (Cambridge University Press, 2008), and Graph Theory: Connectivity Structure and Its Applications (in Japanese) (Asakura Shoten, 2010).
研究分野(キーワード)
キーワード(日本語) キーワード(英語)
組み合せ最適化 Compinatorial Optimization
アルゴリズム Algorithms
離散構造 Discrete structure
離散最適化 Discrete optimization
論文
著者 著者(日本語) 著者(英語) タイトル タイトル(日本語) タイトル(英語) 書誌情報等 出版年月 査読の有無 記述言語 掲載種別 公開
M. Oomine,永持 仁 M. Oomine,永持 仁 M. Oomine,NAGAMOCHI Hiroshi Characterizing Output Locations of GSP Mechanisms to Obnoxious Facility Game in Trees Characterizing Output Locations of GSP Mechanisms to Obnoxious Facility Game in Trees Characterizing Output Locations of GSP Mechanisms to Obnoxious Facility Game in Trees IEICE Transactions Inf. and Syst.,E99-D,3 2016/03 英語 公開
Ken Iwaide.永持 仁 Ken Iwaide.永持 仁 Ken Iwaide,NAGAMOCHI Hiroshi An Improved Algorithm for Parameterized Edge Dominating Set Problem An Improved Algorithm for Parameterized Edge Dominating Set Problem An Improved Algorithm for Parameterized Edge Dominating Set Problem J. Graph Algorithms Appl.,20,1,23-58 2016 英語 公開
永持 仁 永持 仁 Mingyu Xiao,NAGAMOCHI Hiroshi An Exact Algorithm for TSP in Degree-3 Graphs Via Circuit Procedure and Amortization on Connectivity Structure An Exact Algorithm for TSP in Degree-3 Graphs Via Circuit Procedure and Amortization on Connectivity Structure An Exact Algorithm for TSP in Degree-3 Graphs Via Circuit Procedure and Amortization on Connectivity Structure Algorithmica,74,2,713-741 2016 英語 公開
Mingyu Xiao,永持 仁 Mingyu Xiao,永持 仁 Mingyu Xiao,NAGAMOCHI Hiroshi An exact algorithm for maximum independent set in degree-5 graphs An exact algorithm for maximum independent set in degree-5 graphs An exact algorithm for maximum independent set in degree-5 graphs Discrete Applied Mathematics,199,137-155 2016 英語 公開
M. Xiao,永持 仁 M. Xiao,永持 仁 M. Xiao,NAGAMOCHI Hiroshi An Improved Exact Algorithm for TSP in Graphs of Maximum Degree 4 An Improved Exact Algorithm for TSP in Graphs of Maximum Degree 4 An Improved Exact Algorithm for TSP in Graphs of Maximum Degree 4 Theory of Computing Systems,58,2,241-272 2016 英語 公開
Masataka Ikeda,NAGAMOCHI Hiroshi Masataka Ikeda,NAGAMOCHI Hiroshi Some Reduction Procedure for Computing Pathwidth of Undirected Graphs Some Reduction Procedure for Computing Pathwidth of Undirected Graphs Some Reduction Procedure for Computing Pathwidth of Undirected Graphs IEICE Transactions,98-D,3,503-511 2015 英語 公開
Mingyu Xiao,NAGAMOCHI Hiroshi Mingyu Xiao,NAGAMOCHI Hiroshi A refined exact algorithm for Edge Dominating Set A refined exact algorithm for Edge Dominating Set A refined exact algorithm for Edge Dominating Set Theor. Comput. Sci.,560,207-216 2014 英語 公開
Masaki Suzuki,NAGAMOCHI Hiroshi Masaki Suzuki,NAGAMOCHI Hiroshi Efficient enumeration of monocyclic chemical graphs with given path frequencies Efficient enumeration of monocyclic chemical graphs with given path frequencies Efficient enumeration of monocyclic chemical graphs with given path frequencies J. Cheminformatics,6,1,31-31 2014 英語 公開
Toshihiro Shimizu Takuro Fukunaga,NAGAMOCHI Hiroshi Toshihiro Shimizu Takuro Fukunaga,NAGAMOCHI Hiroshi Toshihiro Shimizu Takuro Fukunaga,NAGAMOCHI Hiroshi Unranking of small combinations from large sets Unranking of small combinations from large sets Unranking of small combinations from large sets J. Discrete Algorithms,29,8-20 2014 英語 公開
永持 仁 永持 仁 Kazumasa Okumoto, Takuro Fukunaga, Hiroshi Nagamochi: Divide-and-Conquer Algorithms for Partitioning Hypergraphs and Submodular Systems. Divide-and-Conquer Algorithms for Partitioning Hypergraphs and Submodular Systems. Divide-and-Conquer Algorithms for Partitioning Hypergraphs and Submodular Systems. Algorithmica,62,3-4,787-806 2012 英語 公開
永持 仁 永持 仁 Seok-Hee Hong, Hiroshi Nagamochi: A Linear-Time Algorithm for Star-Shaped Drawings of Planar Graphs with the Minimum Number of Concave Corners. A Linear-Time Algorithm for Star-Shaped Drawings of Planar Graphs with the Minimum Number of Concave Corners. A Linear-Time Algorithm for Star-Shaped Drawings of Planar Graphs with the Minimum Number of Concave Corners. Algorithmica,62,3-4,1122-1158 2012 英語 公開
Y. Karuno; H. Nagamochi; J. Uchida Y. Karuno; H. Nagamochi; J. Uchida Selective vehicle scheduling on paths with a due date involving criterion Selective vehicle scheduling on paths with a due date involving criterion Nihon Kikai Gakkai Ronbunshu, C Hen/Transactions of the Japan Society of Mechanical Engineers, Part C,73,3,911-918 2007 日本語 公開
Y. Karuno; H. Nagamochi; Y. Ohshima Y. Karuno; H. Nagamochi; Y. Ohshima A dynamic programming approach for a food packing problem A dynamic programming approach for a food packing problem Nihon Kikai Gakkai Ronbunshu, C Hen/Transactions of the Japan Society of Mechanical Engineers, Part C,72,4,1390-1397 2006 日本語 公開
石井利昌;永持仁;西垣豊;高橋健吾;武田真人 石井利昌;永持仁;西垣豊;高橋健吾;武田真人 タンク繰りにおける経路探索法 タンク繰りにおける経路探索法 システム制御情報学会論文誌,18,6,213-221 2005/06 日本語 公開
永持 仁 永持 仁 グラフの最小分割問題に対するアルゴリズム(<小特集>LAシンポジウム(計算機科学基礎理論ワークショップ)論文小特集) グラフの最小分割問題に対するアルゴリズム(<小特集>LAシンポジウム(計算機科学基礎理論ワークショップ)論文小特集) 電子情報通信学会論文誌. D-I, 情報・システム, I-情報処理,86,2,53-68 2003/02/01 日本語 公開
永持 仁 永持 仁 数理工学のすすめ--木を見て森を見る 数理工学のすすめ--木を見て森を見る 理系への数学,31,8,62-66 1998/08 日本語 公開
永持仁;牧野和久;ZENG D‐Z;村田真紀;茨木俊秀 永持仁;牧野和久;ZENG D‐Z;村田真紀;茨木俊秀 Convexity of Elementary Flow Games. Convexity of Elementary Flow Games. 電子情報通信学会論文誌 D-1,J81-D-1,6,666-676 1998/06 日本語 公開
永持仁 永持仁 グラフの連結度増大問題 グラフの連結度増大問題 応用数理,8,1,20-29 1998/03 日本語 公開
嘉藤学;河北隆二;永持仁;尾家祐二 嘉藤学;河北隆二;永持仁;尾家祐二 格子型光波ネットワークの再構成アルゴリズムについて 格子型光波ネットワークの再構成アルゴリズムについて 電子情報通信学会論文誌 B-1,J80-B-1,10,709-718 1997/10 日本語 公開
永持 仁 永持 仁 サブツアー交換交叉に対する2つのコメント(共著) サブツアー交換交叉に対する2つのコメント(共著) 人工知能学会論文誌,10/3, 464-467 1995 日本語 公開
永持 仁 永持 仁 基数3のカットセット数を最小にする2-辺連結グラフ 基数3のカットセット数を最小にする2-辺連結グラフ 電子情報通信学会論文誌 A 基礎・境界,73,7,1281-1285 1990/07 日本語 公開
永持 仁 永持 仁 組合せ最適化におけるTardosの新解法 (最近の数理計画特集) 組合せ最適化におけるTardosの新解法 (最近の数理計画特集) システム・制御・情報,34,4,232-240 1990/04 日本語 公開
永持 仁 永持 仁 与えられた基数のカットセット数を最小にするグラフ 与えられた基数のカットセット数を最小にするグラフ 電子情報通信学会論文誌 A 基礎・境界,72,10,1601-1610 1989/10 日本語 公開
永持 仁 永持 仁 ある種の平面有向ネットワーク上の多品種流問題の実行可能性判定法(共著) ある種の平面有向ネットワーク上の多品種流問題の実行可能性判定法(共著) 電子情報通信学会誌,J71-A/3, 804-810 1988 日本語 公開
永持 仁 永持 仁 ある種の平面有向ネットワーク上の多品種流問題に対する最大流ー最小カットの定理(共著) ある種の平面有向ネットワーク上の多品種流問題に対する最大流ー最小カットの定理(共著) 電子情報通信学会誌,J71-A/1, 71-82 1988 日本語 公開
永持仁;茨木俊秀;長谷川利治 永持仁;茨木俊秀;長谷川利治 ある種の平面有向ネットワーク上の多品種流問題について ある種の平面有向ネットワーク上の多品種流問題について 電子情報通信学会論文誌 A,70,2,228-238 1987/02 日本語 公開
永持 仁 永持 仁 平面有向ネットワークのクラスCUに対する多品種流問題(共著) 平面有向ネットワークのクラスCUに対する多品種流問題(共著) 電子情報通信学会誌,J71-A/9, 1328-1339 1987 日本語 公開
永持 仁 永持 仁 確率付きネットワーク上の期待最大流について(共著) 確率付きネットワーク上の期待最大流について(共著) 電子情報通信学会誌,J72-A/10, 1611-1620 日本語 公開
M. Xiao; H. Nagamochi M. Xiao; H. Nagamochi Confining sets and avoiding bottleneck cases: A simple maximum independent set algorithm in degree-3 graphs Confining sets and avoiding bottleneck cases: A simple maximum independent set algorithm in degree-3 graphs ,469,92-104 2013 英語 公開
M. Xiao; T. Fukunaga; H. Nagamochi M. Xiao; T. Fukunaga; H. Nagamochi FPTASs for trimming weighted trees FPTASs for trimming weighted trees ,469,105-118 2013 英語 公開
A. Shurbevski; H. Nagamochi; Y. Karuno A. Shurbevski; H. Nagamochi; Y. Karuno Better approximation algorithms for grasp-and-delivery robot routing problems Better approximation algorithms for grasp-and-delivery robot routing problems ,E96-D,3,450-456 2013 英語 公開
M. Xiao; H. Nagamochi M. Xiao; H. Nagamochi Exact algorithms for annotated edge dominating set in graphs with degree bounded by 3 Exact algorithms for annotated edge dominating set in graphs with degree bounded by 3 ,E96-D,3,408-418 2013 英語 公開
M. Xiao; H. Nagamochi M. Xiao; H. Nagamochi Parameterized edge dominating set in graphs with degree bounded by 3 Parameterized edge dominating set in graphs with degree bounded by 3 ,508,2-15 2013 英語 公開
Y. Zhao; M. Hayashida; J. Jindalertudomdee; H. Nagamochi; T. Akutsu Y. Zhao; M. Hayashida; J. Jindalertudomdee; H. Nagamochi; T. Akutsu Breadth-first search approach to enumeration of tree-like chemical compounds Breadth-first search approach to enumeration of tree-like chemical compounds ,11,6 2013 英語 公開
M. Xiao; H. Nagamochi M. Xiao; H. Nagamochi An FPT algorithm for edge subset feedback edge set An FPT algorithm for edge subset feedback edge set ,112,1-2,5-9 2012 英語 公開
T. Imada; H. Nagamochi T. Imada; H. Nagamochi Indexing all rooted subgraphs of a rooted graph Indexing all rooted subgraphs of a rooted graph ,E95-D,3,712-721 2012 英語 公開
S.-H. Hong; H. Nagamochi S.-H. Hong; H. Nagamochi Minimum cost star-shaped drawings of plane graphs with a fixed embedding and concave corner constraints Minimum cost star-shaped drawings of plane graphs with a fixed embedding and concave corner constraints ,445,36-51 2012 英語 公開
Y. Arahori; T. Imamichi; H. Nagamochi Y. Arahori; T. Imamichi; H. Nagamochi An exact strip packing algorithm based on canonical forms An exact strip packing algorithm based on canonical forms ,39,12,2991-3011 2012 英語 公開
A. Shurbevski; Y. Karuno; H. Nagamochi A. Shurbevski; Y. Karuno; H. Nagamochi A dynamic programming based improvement heuristic for a repetitive routing problem of grasp-and-delivery robots A dynamic programming based improvement heuristic for a repetitive routing problem of grasp-and-delivery robots ,6,5,611-621 2012 英語 公開
Y. Zhao; M. Hayashida; J.C. Nacher; H. Nagamochi; T. Akutsu Y. Zhao; M. Hayashida; J.C. Nacher; H. Nagamochi; T. Akutsu Protein complex prediction via improved verification methods using constrained domain-domain matching Protein complex prediction via improved verification methods using constrained domain-domain matching ,8,3-4,210-227 2012 英語 公開
H. Aota; T. Fukunaga; H. Nagamochi H. Aota; T. Fukunaga; H. Nagamochi An approximation algorithm for locating maximal disks within convex polygons An approximation algorithm for locating maximal disks within convex polygons ,21,6,661-684 2011/12 英語 公開
S.-H. Hong; H. Nagamochi S.-H. Hong; H. Nagamochi Extending Steinitz\\'s theorem to upward star-shaped polyhedra and spherical polyhedra Extending Steinitz\\'s theorem to upward star-shaped polyhedra and spherical polyhedra ,61,4,1022-1076 2011/12 英語 公開
T. Imada; S. Ota; H. Nagamochi; T. Akutsu T. Imada; S. Ota; H. Nagamochi; T. Akutsu Efficient enumeration of stereoisomers of outerplanar chemical graphs using dynamic programming Efficient enumeration of stereoisomers of outerplanar chemical graphs using dynamic programming ,51,11,2788-2807 2011/11 英語 公開
T. Akutsu; H. Nagamochi T. Akutsu; H. Nagamochi Kernel methods for chemical compounds: From classification to design Kernel methods for chemical compounds: From classification to design ,E94D,10,1846-1853 2011/10 英語 公開
K. Matsumoto; S. Umetani; H. Nagamochi K. Matsumoto; S. Umetani; H. Nagamochi On the one-dimensional stock cutting problem in the paper tube industry On the one-dimensional stock cutting problem in the paper tube industry ,14,3,281-290 2011/06 英語 公開
H. Nagamochi H. Nagamochi Coprobber guarding game with cycle robber-region Coprobber guarding game with cycle robber-region ,412,4-5,383-390 2011/02/04 英語 公開
E. Morsy; H. Nagamochi E. Morsy; H. Nagamochi Approximating capacitated tree-routings in networks Approximating capacitated tree-routings in networks ,21,2,254-267 2011/02 英語 公開
B. Zhuang; H. Nagamochi B. Zhuang; H. Nagamochi Generation of symmetric and asymmetric biconnected rooted triangulated planar graphs Generation of symmetric and asymmetric biconnected rooted triangulated planar graphs ,E94D,2,200-210 2011/02 英語 公開
B. Zhuang; H. Nagamochi B. Zhuang; H. Nagamochi Generation of symmetric and asymmetric biconnected rooted outerplanar graphs Generation of symmetric and asymmetric biconnected rooted outerplanar graphs ,E94D,2,211-219 2011/02 英語 公開
S. Imahori; Y. Karuno; H. Nagamochi; X. Wang S. Imahori; Y. Karuno; H. Nagamochi; X. Wang Kansei engineering, humans and computers: Efficient dynamic programming algorithms for combinatorial food packing problems Kansei engineering, humans and computers: Efficient dynamic programming algorithms for combinatorial food packing problems ,3,3,228-245 2011 英語 公開
Y. Karuno; H. Nagamochi; A. Shurbevski Y. Karuno; H. Nagamochi; A. Shurbevski An approximation algorithm with factor two for a repetitive routing problem of grasp-and-delivery robots An approximation algorithm with factor two for a repetitive routing problem of grasp-and-delivery robots ,15,8,1103-1108 2011 英語 公開
S. Karakawa; E. Morsy; H. Nagamochi S. Karakawa; E. Morsy; H. Nagamochi Minmax tree cover in the euclidean space Minmax tree cover in the euclidean space ,15,3,345-371 2011 英語 公開
T. Imada; S. Ota; H. Nagamochi; T. Akutsu T. Imada; S. Ota; H. Nagamochi; T. Akutsu Efficient enumeration of stereoisomers of tree structured molecules using dynamic programming Efficient enumeration of stereoisomers of tree structured molecules using dynamic programming ,49,4,910-970 2011 英語 公開
T. Ibaraki; T. Imamichi; Y. Koga; H. Nagamochi; K. Nonobe; M. Yagiura T. Ibaraki; T. Imamichi; Y. Koga; H. Nagamochi; K. Nonobe; M. Yagiura Efficient branch-and-bound algorithms for weighted MAX-2-SAT Efficient branch-and-bound algorithms for weighted MAX-2-SAT ,127,2,297-343 2011 英語 公開
S.-H. Hong; H. Nagamochi S.-H. Hong; H. Nagamochi A Linear-Time Algorithm for Star-Shaped Drawings of Planar Graphs with the Minimum Number of Concave Corners A Linear-Time Algorithm for Star-Shaped Drawings of Planar Graphs with the Minimum Number of Concave Corners ,1-37 2011 英語 公開
S.-H. Hong; H. Nagamochi S.-H. Hong; H. Nagamochi Guest editors\\' foreword Guest editors\\' foreword ,21,3,251-252 2011 英語 公開
S.-H. Hong; H. Nagamochi S.-H. Hong; H. Nagamochi Editorial: ISAAC 2008 special issue Editorial: ISAAC 2008 special issue ,61,4,777-778 2011 英語 公開
T. Ohshima; P. Eumthurapojn; L. Zhao; H. Nagamochi T. Ohshima; P. Eumthurapojn; L. Zhao; H. Nagamochi An A* algorithm framework for the point-to-point time-dependent shortest path problem An A* algorithm framework for the point-to-point time-dependent shortest path problem ,7033 LNCS,154-163 2011 英語 公開
M. Shimizu; H. Nagamochi; T. Akutsu M. Shimizu; H. Nagamochi; T. Akutsu Enumerating tree-like chemical graphs with given upper and lower bounds on path frequencies. Enumerating tree-like chemical graphs with given upper and lower bounds on path frequencies. ,12 Suppl 14,S3 2011 英語 公開
T. Fukunaga; H. Nagamochi T. Fukunaga; H. Nagamochi Network design with weighted degree constraints Network design with weighted degree constraints ,7,4,246-255 2010/11 英語 公開
S. Ota; E. Morsy; H. Nagamochi S. Ota; E. Morsy; H. Nagamochi A plane graph representation of triconnected graphs A plane graph representation of triconnected graphs ,411,44-46,3979-3993 2010/10/25 英語 公開
S.-H. Hong; H. Nagamochi S.-H. Hong; H. Nagamochi A linear-time algorithm for symmetric convex drawings of internally triconnected plane graphs A linear-time algorithm for symmetric convex drawings of internally triconnected plane graphs ,58,2,433-460 2010/10 英語 公開
S.-H. Hong; H. Nagamochi S.-H. Hong; H. Nagamochi Approximation algorithms for minimizing edge crossings in radial drawings Approximation algorithms for minimizing edge crossings in radial drawings ,58,2,478-497 2010/10 英語 公開
Y. Ishida; Y. Kato; L. Zhao; H. Nagamochi; T. Akutsu Y. Ishida; Y. Kato; L. Zhao; H. Nagamochi; T. Akutsu Branch-and-bound algorithms for enumerating treelike chemical graphs with given path frequency using detachment-cut Branch-and-bound algorithms for enumerating treelike chemical graphs with given path frequency using detachment-cut ,50,5,934-946 2010/05 英語 公開
T. Ishii; Y. Akiyama; H. Nagamochi T. Ishii; Y. Akiyama; H. Nagamochi Minimum augmentation of edge-connectivity between vertices and sets of vertices in undirected graphs Minimum augmentation of edge-connectivity between vertices and sets of vertices in undirected graphs ,56,4,413-436 2010/04 英語 公開
E. Morsy; H. Nagamochi E. Morsy; H. Nagamochi Approximation to the minimum cost edge installation problem Approximation to the minimum cost edge installation problem ,E93A,4,778-786 2010/04 英語 公開
S.-H. Hong; H. Nagamochi S.-H. Hong; H. Nagamochi An algorithm for constructing star-shaped drawings of plane graphs An algorithm for constructing star-shaped drawings of plane graphs ,43,2,191-206 2010/02 英語 公開
H. Nagamochi H. Nagamochi Minimum degree orderings Minimum degree orderings ,56,1,17-34 2010/01 英語 公開
Y. Karuno; H. Nagamochi; X. Wang Y. Karuno; H. Nagamochi; X. Wang Optimization problems and algorithms in double-layered food packing systems* Optimization problems and algorithms in double-layered food packing systems* ,4,3,605-615 2010 英語 公開
B. Zhuang; H. Nagamochi B. Zhuang; H. Nagamochi Enumerating rooted graphs with reflectional block structures Enumerating rooted graphs with reflectional block structures ,6078 LNCS,49-60 2010 英語 公開
B. Zhuang; H. Nagamochi B. Zhuang; H. Nagamochi Generating internally triconnected rooted plane graphs Generating internally triconnected rooted plane graphs ,6108 LNCS,467-478 2010 英語 公開
K. Haraguchi; S.-H. Hong; H. Nagamochi K. Haraguchi; S.-H. Hong; H. Nagamochi Multiclass visual classifier based on bipartite graph representation of decision tables Multiclass visual classifier based on bipartite graph representation of decision tables ,6073 LNCS,169-183 2010 英語 公開
E. Morsy; H. Nagamochi E. Morsy; H. Nagamochi On the approximation of the generalized capacitated tree-routing problem On the approximation of the generalized capacitated tree-routing problem ,8,3,311-320 2010 英語 公開
S.-H. Hong; H. Nagamochi S.-H. Hong; H. Nagamochi Convex drawings of hierarchical planar graphs and clustered planar graphs Convex drawings of hierarchical planar graphs and clustered planar graphs ,8,3,282-295 2010 英語 公開
B. Zhuang; H. Nagamochi B. Zhuang; H. Nagamochi Constant time generation of biconnected rooted plane graphs Constant time generation of biconnected rooted plane graphs ,6213 LNCS,113-123 2010 英語 公開
M. Xiao; T. Fukunaga; H. Nagamochi M. Xiao; T. Fukunaga; H. Nagamochi FPTAS\\'s for some cut problems in weighted trees FPTAS\\'s for some cut problems in weighted trees ,6213 LNCS,210-221 2010 英語 公開
K. Okumoto; T. Fukunaga; H. Nagamochi K. Okumoto; T. Fukunaga; H. Nagamochi Divide-and-Conquer Algorithms for Partitioning Hypergraphs and Submodular Systems Divide-and-Conquer Algorithms for Partitioning Hypergraphs and Submodular Systems ,1-20 2010 英語 公開
B. Zhuang; H. Nagamochi B. Zhuang; H. Nagamochi Listing triconnected rooted plane graphs Listing triconnected rooted plane graphs ,6509 LNCS,PART 2,347-361 2010 英語 公開
B. Zhuang; H. Nagamochi B. Zhuang; H. Nagamochi Generating trees on multisets Generating trees on multisets ,6506 LNCS,PART 1,182-193 2010 英語 公開
T. Imamichi; M. Yagiura; H. Nagamochi T. Imamichi; M. Yagiura; H. Nagamochi An iterated local search algorithm based on nonlinear programming for the irregular strip packing problem An iterated local search algorithm based on nonlinear programming for the irregular strip packing problem ,6,4,345-361 2009/11 英語 公開
M. Kenmochi; T. Imamichi; K. Nonobe; M. Yagiura; H. Nagamochi M. Kenmochi; T. Imamichi; K. Nonobe; M. Yagiura; H. Nagamochi Exact algorithms for the two-dimensional strip packing problem with and without rotations Exact algorithms for the two-dimensional strip packing problem with and without rotations ,198,1,73-83 2009/10/01 英語 公開
T. Fukunaga; H. Nagamochi T. Fukunaga; H. Nagamochi Network design with edge-connectivity and degree constraints Network design with edge-connectivity and degree constraints ,45,3,512-532 2009/10 英語 公開
A. Kawaguchi; H. Nagamochi A. Kawaguchi; H. Nagamochi Drawing slicing graphs with face areas Drawing slicing graphs with face areas ,410,11,1061-1072 2009/03/06 英語 公開
T. Fukunaga; H. Nagamochi T. Fukunaga; H. Nagamochi Eulerian detachments with local edge-connectivity Eulerian detachments with local edge-connectivity ,157,4,691-698 2009/02/28 英語 公開
H. Nagamochi H. Nagamochi A detachment algorithm for inferring a graph from path frequency A detachment algorithm for inferring a graph from path frequency ,53,2,207-224 2009/02 英語 公開
UCHIDA Jun;KARUNO Yoshiyuki;NAGAMOCHI Hiroshi UCHIDA Jun;KARUNO Yoshiyuki;NAGAMOCHI Hiroshi Scheduling Capacitated One-Way Vehicles on Paths with Deadlines Scheduling Capacitated One-Way Vehicles on Paths with Deadlines ,2,1,20-26 2009/01/31 英語 公開
M. Sakashita; K. Makino; H. Nagamochi; S. Fujishige M. Sakashita; K. Makino; H. Nagamochi; S. Fujishige Minimum transversals in posimodular systems Minimum transversals in posimodular systems ,23,2,858-871 2009 英語 公開
T. Fukunaga; H. Nagamochi T. Fukunaga; H. Nagamochi Network design with weighted degree constraints Network design with weighted degree constraints ,5431 LNCS,214-225 2009 英語 公開
S. Karakawa; E. Morsy; H. Nagamochi S. Karakawa; E. Morsy; H. Nagamochi Minmax tree cover in the euclidean space Minmax tree cover in the euclidean space ,5431 LNCS,202-213 2009 英語 公開
T. Imamichi; Y. Arahori; J. Gim; S.-H. Hong; H. Nagamochi T. Imamichi; Y. Arahori; J. Gim; S.-H. Hong; H. Nagamochi Removing node overlaps using multi-sphere scheme Removing node overlaps using multi-sphere scheme ,5417 LNCS,296-301 2009 英語 公開
H. Nagamochi H. Nagamochi Cop-robber guarding game with cycle robber region Cop-robber guarding game with cycle robber region ,5598 LNCS,74-84 2009 英語 公開
S.-H. Hong; H. Nagamochi S.-H. Hong; H. Nagamochi Upward star-shaped polyhedral graphs Upward star-shaped polyhedral graphs ,5878 LNCS,913-922 2009 英語 公開
K. Okumoto; T. Fukunaga; H. Nagamochi K. Okumoto; T. Fukunaga; H. Nagamochi Divide-and-conquer algorithms for partitioning hypergraphs and submodular systems Divide-and-conquer algorithms for partitioning hypergraphs and submodular systems ,5878 LNCS,55-64 2009 英語 公開
Y. Nakao; H. Nagamochi Y. Nakao; H. Nagamochi Worst case analysis for pickup and delivery problems with consecutive pickups and deliveries Worst case analysis for pickup and delivery problems with consecutive pickups and deliveries ,5878 LNCS,554-563 2009 英語 公開
S.-H. Hong; H. Nagamochi S.-H. Hong; H. Nagamochi New approximation to the one-sided radial crossing minimization New approximation to the one-sided radial crossing minimization ,13,2,179-196 2009 英語 公開
T. Imamichi; H. Nagamochi T. Imamichi; H. Nagamochi Performance analysis of a collision detection algorithm of spheres based on slab partitioning Performance analysis of a collision detection algorithm of spheres based on slab partitioning ,E91A,9,2308-2313 2008/09 英語 公開
Y. Nakao; H. Nagamochi Y. Nakao; H. Nagamochi Worst case analysis for pickup and delivery problems with transfer Worst case analysis for pickup and delivery problems with transfer ,E91A,9,2328-2334 2008/09 英語 公開
H. Fujiwara; J. Wang; L. Zhao; H. Nagamochi; T. Akutsu H. Fujiwara; J. Wang; L. Zhao; H. Nagamochi; T. Akutsu Enumerating treelike chemical graphs with given path frequency Enumerating treelike chemical graphs with given path frequency ,48,7,1345-1357 2008/07 英語 公開
S.-H. Hong; H. Nagamochi S.-H. Hong; H. Nagamochi Convex drawings of graphs with non-convex boundary constraints Convex drawings of graphs with non-convex boundary constraints ,156,12,2368-2380 2008/06/28 英語 公開
H. Nagamochi; T. Ohnishi H. Nagamochi; T. Ohnishi Approximating a vehicle scheduling problem with time windows and handling times Approximating a vehicle scheduling problem with time windows and handling times ,393,1-3,133-146 2008/03/20 英語 公開
HAYASHIDA Morihiro;AKUTSU Tatsuya;NAGAMOCHI Hiroshi HAYASHIDA Morihiro;AKUTSU Tatsuya;NAGAMOCHI Hiroshi A Clustering Method for Analysis of Sequence Similarity Networks of Proteins Using Maximal Components of Graphs A Clustering Method for Analysis of Sequence Similarity Networks of Proteins Using Maximal Components of Graphs ,49,SIG5(TBIO4),15-24 2008/03/15 英語 公開
E. Morsy; H. Nagamochi E. Morsy; H. Nagamochi An improved approximation algorithm for capacitated multicast routings in networks An improved approximation algorithm for capacitated multicast routings in networks ,390,1,81-91 2008/01/22 英語 公開
S.-H. Hong; H. Nagamochi S.-H. Hong; H. Nagamochi Approximating crossing minimization in radial layouts Approximating crossing minimization in radial layouts ,4957 LNCS,461-472 2008 英語 公開
E. Morsy; H. Nagamochi E. Morsy; H. Nagamochi Approximating the generalized capacitated tree-routing problem Approximating the generalized capacitated tree-routing problem ,5092 LNCS,621-630 2008 英語 公開
S.-H. Hong; H. Nagamochi S.-H. Hong; H. Nagamochi Star-shaped drawings of graphs with fixed embedding and concave corner constraints Star-shaped drawings of graphs with fixed embedding and concave corner constraints ,5092 LNCS,405-414 2008 英語 公開
T. Fukunaga; H. Nagamochi T. Fukunaga; H. Nagamochi Approximating minimum cost multigraphs of specified edge-connectivity under degree bounds Approximating minimum cost multigraphs of specified edge-connectivity under degree bounds ,50,4,339-349 2007/12 英語 公開
Y. Karuno; H. Nagamochi; X. Wang Y. Karuno; H. Nagamochi; X. Wang Bi-criteria food packing by dynamic programming Bi-criteria food packing by dynamic programming ,50,4,376-389 2007/12 英語 公開
H. Nagamochi; K. Okada H. Nagamochi; K. Okada Approximating the minmax rooted-tree cover in a tree Approximating the minmax rooted-tree cover in a tree ,104,5,173-178 2007/11/30 英語 公開
T. Ishii; H. Fujita; H. Nagamochi T. Ishii; H. Fujita; H. Nagamochi The source location problem with local 3-vertex-connectivity requirements The source location problem with local 3-vertex-connectivity requirements ,155,18,2523-2538 2007/11/01 英語 公開
A. Berger; T. Fukunaga; H. Nagamochi; O. Parekh A. Berger; T. Fukunaga; H. Nagamochi; O. Parekh Approximability of the capacitated b-edge dominating set problem Approximability of the capacitated b-edge dominating set problem ,385,1-3,202-213 2007/10/15 英語 公開
K. Hirata; T. Matsuda; H. Nagamochi; T. Takine K. Hirata; T. Matsuda; H. Nagamochi; T. Takine Contention-free λ-planes in optically burst-switched WDM networks Contention-free λ-planes in optically burst-switched WDM networks ,E90B,9,2524-2531 2007/09 英語 公開
T. Fukunaga; H. Nagamochi T. Fukunaga; H. Nagamochi Generalizing the induced matching by edge capacity constraints Generalizing the induced matching by edge capacity constraints ,4,2,198-205 2007/06/01 英語 公開
T. Ishii; K. Iwata; H. Nagamochi T. Ishii; K. Iwata; H. Nagamochi Bisecting a 4-connected graph with three resource sets Bisecting a 4-connected graph with three resource sets ,155,11,1441-1450 2007/06 英語 公開
H. Nagamochi; K. Kuroya H. Nagamochi; K. Kuroya Drawing c-planar biconnected clustered graphs Drawing c-planar biconnected clustered graphs ,155,9,1155-1174 2007/05/01 英語 公開
E. Mosry; H. Nagamochi E. Mosry; H. Nagamochi Approximation algorithms for multicast routings in a network with multi-sources Approximation algorithms for multicast routings in a network with multi-sources ,E90A,5,900-906 2007/05 英語 公開
H. Nagamochi; Y. Kamidoi H. Nagamochi; Y. Kamidoi Minimum cost subpartitions in graphs Minimum cost subpartitions in graphs ,102,2-3,79-84 2007/04/30 英語 公開
T. Ishii; H. Fujita; H. Nagamochi T. Ishii; H. Fujita; H. Nagamochi Minimum cost source location problem with local 3-vertex-connectivity requirements Minimum cost source location problem with local 3-vertex-connectivity requirements ,372,1,81-93 2007/03/06 英語 公開
H. Nagamochi; Y. Abe H. Nagamochi; Y. Abe An approximation algorithm for dissecting a rectangle into rectangles with specified areas An approximation algorithm for dissecting a rectangle into rectangles with specified areas ,155,4,523-537 2007/02/15 英語 公開
H. Nagamochi H. Nagamochi Computing a minimum cut in a graph with dynamic edges incident to a designated vertex Computing a minimum cut in a graph with dynamic edges incident to a designated vertex ,E90D,2,428-431 2007/02 英語 公開
T. Fukunaga; H. Nagamochi T. Fukunaga; H. Nagamochi Approximating a generalization of metric TSP Approximating a generalization of metric TSP ,E90D,2,432-439 2007/02 英語 公開
Nakao, Yoshitaka; Nagamochi, Hiroshi Nakao, Yoshitaka; Nagamochi, Hiroshi A DP-based Heuristic Algorithm for the Discrete Split Delivery Vehicle Routing Problem A DP-based Heuristic Algorithm for the Discrete Split Delivery Vehicle Routing Problem ,1,2,217-226 2007 英語 公開
H. Nagamochi H. Nagamochi Algorithms for the minimum partitioning problems in graphs Algorithms for the minimum partitioning problems in graphs ,90,10,63-78 2007 英語 公開
M. Yagiura; A. Komiya; K. Kojima; K. Nonobe; H. Nagamochi; T. Ibaraki; F. Glover M. Yagiura; A. Komiya; K. Kojima; K. Nonobe; H. Nagamochi; T. Ibaraki; F. Glover A path relinking approach for the multi-resource generalized quadratic assignment problem A path relinking approach for the multi-resource generalized quadratic assignment problem ,4638 LNCS,121-135 2007 英語 公開
H. Ito; H. Nagamochi H. Ito; H. Nagamochi Two equivalent measures on weighted hypergraphs Two equivalent measures on weighted hypergraphs ,154,16,2330-2334 2006/11/01 英語 公開
H. Nagamochi H. Nagamochi Sparse connectivity certificates via MA orderings in graphs Sparse connectivity certificates via MA orderings in graphs ,154,16,2411-2417 2006/11/01 英語 公開
H. Nagamochi H. Nagamochi Packing soft rectangles Packing soft rectangles ,17,5,1165-1178 2006/10 英語 公開
T. Ishii; S. Yamamoto; H. Nagamochi T. Ishii; S. Yamamoto; H. Nagamochi Augmenting forests to meet odd diameter requirements Augmenting forests to meet odd diameter requirements ,3,2,154-164 2006/06/01 英語 公開
H. Nagamochi; T. Kawada H. Nagamochi; T. Kawada Minmax subtree cover problem on cacti Minmax subtree cover problem on cacti ,154,8,1254-1263 2006/05/15 英語 公開
H. Nagamochi H. Nagamochi A fast edge-splitting algorithm in edge-weighted graphs A fast edge-splitting algorithm in edge-weighted graphs ,E89A,5,1263-1268 2006/05 英語 公開
T. Ishii; H. Nagamochi; T. Ibaraki T. Ishii; H. Nagamochi; T. Ibaraki Augmenting a (k - 1)-vertex-connected multigraph to an ℓ-edge-connected and k-vertex-connected multigraph Augmenting a (k - 1)-vertex-connected multigraph to an ℓ-edge-connected and k-vertex-connected multigraph ,44,3,257-280 2006/04 英語 公開
H. Nagamochi H. Nagamochi Increasing the edge-connectivity by contracting a vertex subset in graphs Increasing the edge-connectivity by contracting a vertex subset in graphs ,E89D,2,744-750 2006/02 英語 公開
P. Eades; Q. Feng; X. Lin; H. Nagamochi P. Eades; Q. Feng; X. Lin; H. Nagamochi Straight-line drawing algorithms for hierarchical graphs and clustered graphs Straight-line drawing algorithms for hierarchical graphs and clustered graphs ,44,1,1-32 2006/01 英語 公開
Y. Kamidoit; N. Yoshidat; H. Nagamochi Y. Kamidoit; N. Yoshidat; H. Nagamochi A deterministic algorithm for finding all minimum k-way cuts A deterministic algorithm for finding all minimum k-way cuts ,36,5,1329-1341 2006 英語 公開
T. Fukunaga; H. Nagamochi T. Fukunaga; H. Nagamochi Some Theorems on Detachments Preserving Local-Edge-Connectivity Some Theorems on Detachments Preserving Local-Edge-Connectivity ,24,173-180 2006 英語 公開
H. Nagamochi; K. Iwata; T. Ishii H. Nagamochi; K. Iwata; T. Ishii A robust algorithm for bisecting a triconnected graph with two resource sets A robust algorithm for bisecting a triconnected graph with two resource sets ,341,1-3,364-378 2005/09/05 英語 公開
H. Nagamochi H. Nagamochi A 4/3-approximation for the minimum 2-local-vertex-connectivity augmentation in a connected graph A 4/3-approximation for the minimum 2-local-vertex-connectivity augmentation in a connected graph ,56,2,77-95 2005/08 英語 公開
H. Nagamochi H. Nagamochi Packing unit squares in a rectangle Packing unit squares in a rectangle ,12,1 2005/07/29 英語 公開
H. Nagamochi H. Nagamochi Approximating the minmax rooted-subtree cover problem Approximating the minmax rooted-subtree cover problem ,E88A,5,1335-1338 2005/05 英語 公開
H. Nagamochi H. Nagamochi An improved bound on the one-sided minimum crossing number in two-layered drawings An improved bound on the one-sided minimum crossing number in two-layered drawings ,33,4,565-591 2005/04 英語 公開
H. Nagamochi H. Nagamochi On computing minimum (s,t)-cuts in digraphs On computing minimum (s,t)-cuts in digraphs ,93,5,231-237 2005/03/16 英語 公開
H. Nagamochi H. Nagamochi On the one-sided crossing minimization in a bipartite graph with large degrees On the one-sided crossing minimization in a bipartite graph with large degrees ,332,1-3,417-446 2005/02/28 英語 公開
L. Zhao; H. Nagamochi; T. Ibaraki L. Zhao; H. Nagamochi; T. Ibaraki Greedy splitting algorithms for approximating multiway partition problems Greedy splitting algorithms for approximating multiway partition problems ,102,1,167-183 2005/01 英語 公開
H. Nagamochi H. Nagamochi On 2-approximation to the vertex-connectivity in graphs On 2-approximation to the vertex-connectivity in graphs ,E88D,1,12-16 2005/01 英語 公開
Y. Karuno, Hiroshi Nagamochi Y. Karuno, Hiroshi Nagamochi Scheduling vehicles on trees Scheduling vehicles on trees 2005 英語 公開
H. Nagamochi H. Nagamochi Graph algorithms for network connectivity problems Graph algorithms for network connectivity problems ,47,4,199-223 2004/12 英語 公開
L. Zhao; H. Nagamochi; T. Ibaraki L. Zhao; H. Nagamochi; T. Ibaraki On generalized greedy splitting algorithms for multiway partition problems On generalized greedy splitting algorithms for multiway partition problems ,143,1-3,130-143 2004/09/30 英語 公開
H. Nagamochi; N. Yamada H. Nagamochi; N. Yamada Counting edge crossings in a 2-layered drawing Counting edge crossings in a 2-layered drawing ,91,5,221-225 2004/09/15 英語 公開
H. Nagamochi; K. Okada H. Nagamochi; K. Okada A faster 2-approximation algorithm for the minmax p -traveling salesmen problem on a tree A faster 2-approximation algorithm for the minmax p -traveling salesmen problem on a tree ,140,1-3,103-114 2004/05/15 英語 公開
H. Nagamochi; T. Suzuki; T. Ishii H. Nagamochi; T. Suzuki; T. Ishii A simple recognition of maximal planar graphs A simple recognition of maximal planar graphs ,89,5,223-226 2004/03/16 英語 公開
Y. Karuno; H. Nagamochi Y. Karuno; H. Nagamochi An approximability result of the multi-vehicle scheduling problem on a path with release and handling times An approximability result of the multi-vehicle scheduling problem on a path with release and handling times ,312,2-3,267-280 2004/01/30 英語 公開
H. Nagamochi; K. Kuroya H. Nagamochi; K. Kuroya Convex drawing for c-planar biconnected clustered graphs Convex drawing for c-planar biconnected clustered graphs ,2912,369-380 2004 英語 公開
H. Nagamochi H. Nagamochi An improved approximation to the one-sided bilayer drawing An improved approximation to the one-sided bilayer drawing ,2912,406-418 2004 英語 公開
H. Nagamochi; Y. Nishida; T. Ibaraki H. Nagamochi; Y. Nishida; T. Ibaraki Approximability of the Minimum Maximal Matching Problem in Planar Graphs Approximability of the Minimum Maximal Matching Problem in Planar Graphs ,E86A,12,3251-3258 2003/12 英語 公開
Karuno, Y; Nagamochi, H Karuno, Y; Nagamochi, H 2-Approximation algorithms for the multi-vehicle scheduling problem on a path with release and handling times 2-Approximation algorithms for the multi-vehicle scheduling problem on a path with release and handling times ,129,2-3,433-447 2003/08/01 英語 公開
Nagamochi, H; Ishii, T Nagamochi, H; Ishii, T On the minimum local-vertex-connectivity augmentation in graphs On the minimum local-vertex-connectivity augmentation in graphs ,129,2-3,475-486 2003/08/01 英語 公開
H. Nagamochi; P. Eades H. Nagamochi; P. Eades An edge-splitting algorithm in planar graphs An edge-splitting algorithm in planar graphs ,7,2,137-159 2003/06 英語 公開
L. Zhao; H. Nagamochi; T. Ibaraki L. Zhao; H. Nagamochi; T. Ibaraki A linear time 5/3-approximation for the minimum strongly-connected spanning subgraph problem A linear time 5/3-approximation for the minimum strongly-connected spanning subgraph problem ,86,2,63-70 2003/04/30 英語 公開
L. Zhao; H. Nagamochi; T. Ibaraki L. Zhao; H. Nagamochi; T. Ibaraki A primal-dual approximation algorithm for the survivable network design problem in hypergraphs A primal-dual approximation algorithm for the survivable network design problem in hypergraphs ,126,2-3,275-289 2003/03/15 英語 公開
Nagamochi, H; Nakamura, S; Ishii, T Nagamochi, H; Nakamura, S; Ishii, T Constructing a cactus for minimum cuts of a graph in O (mn+n(2) log n) time and O(m) Space Constructing a cactus for minimum cuts of a graph in O (mn+n(2) log n) time and O(m) Space ,E86D,2,179-185 2003/02 英語 公開
永持 仁 永持 仁 Algorithms for the minimum partitioning problems in graphs Algorithms for the minimum partitioning problems in graphs 2003 英語 公開
H. Nagamochi H. Nagamochi An approximation for finding a smallest 2-edge-connected subgraph containing a specified spanning tree An approximation for finding a smallest 2-edge-connected subgraph containing a specified spanning tree ,126,1,83-113 2003 英語 公開
H. Nagamochi; T. Ibaraki H. Nagamochi; T. Ibaraki Graph connectivity and its augmentation: Applications of MA orderings Graph connectivity and its augmentation: Applications of MA orderings ,123,1-3,447-472 2002/11/15 英語 公開
Y. Karuno; H. Nagamochi; T. Ibaraki Y. Karuno; H. Nagamochi; T. Ibaraki Better Approximation Ratios for the Single-Vehicle Scheduling Problems on Line-Shaped Networks Better Approximation Ratios for the Single-Vehicle Scheduling Problems on Line-Shaped Networks ,39,4,203-209 2002/07 英語 公開
T. Fujito; H. Nagamochi T. Fujito; H. Nagamochi A 2-approximation algorithm for the minimum weight edge dominating set problem A 2-approximation algorithm for the minimum weight edge dominating set problem ,118,3,199-207 2002/05/15 英語 公開
L. Zhao; H. Nagamochi; T. Ibaraki L. Zhao; H. Nagamochi; T. Ibaraki A note on approximating the survivable network design problem in hypergraphs A note on approximating the survivable network design problem in hypergraphs ,E85D,2,322-326 2002/02 英語 公開
H. Nagamochi; T. Jordán; Y. Nakao; T. Ibaraki H. Nagamochi; T. Jordán; Y. Nakao; T. Ibaraki Convex embeddings and bisections of 3-connected graphs Convex embeddings and bisections of 3-connected graphs ,22,4,537-554 2002 英語 公開
H. Ito; H. Nagamochi H. Ito; H. Nagamochi Comparing hypergraphs by areas of hyperedges drawn on a convex polygon Comparing hypergraphs by areas of hyperedges drawn on a convex polygon ,2866,176-181 2002 英語 公開
Y. Karuno; H. Nagamochi Y. Karuno; H. Nagamochi A better approximation for the two-stage assembly scheduling problem with two machines at the first stage A better approximation for the two-stage assembly scheduling problem with two machines at the first stage ,2518 LNCS,199-210 2002 英語 公開
永持 仁 永持 仁 On the minimum edge- and vertex-connectivity augmentation in multigraphs, "jointly worked " On the minimum edge- and vertex-connectivity augmentation in multigraphs, "jointly worked " 2002 英語 公開
H. Nagamochi; T. Ishii; H. Ito H. Nagamochi; T. Ishii; H. Ito Minimum cost source location problem with vertex-connectivity requirements in digraphs Minimum cost source location problem with vertex-connectivity requirements in digraphs ,80,6,287-293 2001/12/31 英語 公開
L. Zhao; H. Nagamochi; T. Ibaraki L. Zhao; H. Nagamochi; T. Ibaraki Approximating the Minimum k-way Cut in a Graph via Minimum 3-way Cuts Approximating the Minimum k-way Cut in a Graph via Minimum 3-way Cuts ,5,4,397-410 2001/12 英語 公開
T. Hasunuma; H. Nagamochi T. Hasunuma; H. Nagamochi Independent spanning trees with small depths in iterated line digraphs Independent spanning trees with small depths in iterated line digraphs ,110,2-3,189-211 2001/06/15 英語 公開
H. Nagamochi; T. Shiraki; T. Ibaraki H. Nagamochi; T. Shiraki; T. Ibaraki Augmenting a Submodular and Posi-modular Set Function by a Multigraph Augmenting a Submodular and Posi-modular Set Function by a Multigraph ,5,2,175-212 2001/06 英語 公開
T. Ishii; H. Nagamochi; T. Ibaraki T. Ishii; H. Nagamochi; T. Ibaraki Multigraph augmentation under biconnectivity and general edge-connectivity requirements Multigraph augmentation under biconnectivity and general edge-connectivity requirements ,37,3,144-155 2001/05 英語 公開
H. Nagamochi; K. Mochizuki; T. Ibaraki H. Nagamochi; K. Mochizuki; T. Ibaraki Solving the single-vehicle scheduling problems for all home locations under depth-first routing on a tree Solving the single-vehicle scheduling problems for all home locations under depth-first routing on a tree ,E84A,5,1135-1143 2001/05 英語 公開
H. Nagamochi; T. Hasunuma H. Nagamochi; T. Hasunuma An Efficient script N signScript C sign Algorithm for a Sparse k-Edge-Connectivity Certificate An Efficient script N signScript C sign Algorithm for a Sparse k-Edge-Connectivity Certificate ,38,2,354-373 2001/02 英語 公開
H. Nagamochi; M. Miller; Slamin H. Nagamochi; M. Miller; Slamin Bounds on the number of isolates in sum graph labeling Bounds on the number of isolates in sum graph labeling ,240,1-3,175-185 2001 英語 公開
永持 仁 永持 仁 A 2-approximation algorithm for the multi-vehicle scheduling on a path with release and handling times, "jointly worked " A 2-approximation algorithm for the multi-vehicle scheduling on a path with release and handling times, "jointly worked " 2001 英語 公開
永持 仁 永持 仁 A primal-dual approximation algorithm for the survivable network design problem in hypergraphs, "jointly worked " A primal-dual approximation algorithm for the survivable network design problem in hypergraphs, "jointly worked " 2001 英語 公開
永持 仁 永持 仁 A unified framework for approximating some partition problems via greedy splitting, "jointly worked " A unified framework for approximating some partition problems via greedy splitting, "jointly worked " 2001 英語 公開
永持 仁 永持 仁 Bounds on sum number in graphs, "jointly worked " Bounds on sum number in graphs, "jointly worked " 2001 英語 公開
Hiroshi Nagamochi, M. Miller, Slamin Hiroshi Nagamochi, M. Miller, Slamin Bounds on sum number in graphs Bounds on sum number in graphs 2001 英語 公開
H. Nagamochi; T. Ibaraki H. Nagamochi; T. Ibaraki Polyhedral structure of submodular and posi-modular systems Polyhedral structure of submodular and posi-modular systems ,107,1-3,165-189 2000/12/21 英語 公開
H. Nagamochi; T. Ibaraki H. Nagamochi; T. Ibaraki A fast algorithm for computing minimum 3-way and 4-way cuts A fast algorithm for computing minimum 3-way and 4-way cuts ,88,3,507-520 2000/09 英語 公開
H. Nagamochi; S. Katayama; T. Ibaraki H. Nagamochi; S. Katayama; T. Ibaraki A Faster Algorithm for Computing Minimum 5-Way and 6-Way Cuts in Graphs A Faster Algorithm for Computing Minimum 5-Way and 6-Way Cuts in Graphs ,4,2,151-169 2000/06 英語 公開
H. Nagamochi; Y. Nakao; T. Ibaraki H. Nagamochi; Y. Nakao; T. Ibaraki A Fast Algorithm for Cactus Representations of Minimum Cuts A Fast Algorithm for Cactus Representations of Minimum Cuts ,17,2,245-264 2000/06 英語 公開
X. Deng; T. Ibaraki; H. Nagamochi; W. Zang X. Deng; T. Ibaraki; H. Nagamochi; W. Zang Totally balanced combinatorial optimization games Totally balanced combinatorial optimization games ,87,3,441-452 2000/05 英語 公開
H. Nagamochi; K. Seki; T. Ibaraki H. Nagamochi; K. Seki; T. Ibaraki A 7/3-approximation for the minimum weight 3-connected spanning subgraph problem A 7/3-approximation for the minimum weight 3-connected spanning subgraph problem ,E83A,4,687-691 2000/04 英語 公開
T. Ishii; H. Nagamochi; T. Baraki T. Ishii; H. Nagamochi; T. Baraki Optimal Augmentation of a 2-Vertex-Connected Multigraph to an ℓ-Edge-Connected and 3-Vertex-Connected Multigraph Optimal Augmentation of a 2-Vertex-Connected Multigraph to an ℓ-Edge-Connected and 3-Vertex-Connected Multigraph ,4,1,35-77 2000/03 英語 公開
Nagamochi, H Nagamochi, H Recent development of graph connectivity augmentation algorithms Recent development of graph connectivity augmentation algorithms ,E83D,3,372-383 2000/03 英語 公開
Nagamochi, H; Nakamura, S; Ibaraki, T Nagamochi, H; Nakamura, S; Ibaraki, T A simplified (O)over-tilde(nm) time edge-splitting algorithm in undirected graphs A simplified (O)over-tilde(nm) time edge-splitting algorithm in undirected graphs ,26,1,50-67 2000/01 英語 公開
Zhao, L; Nagamochi, H; Ibaraki, T; Aggarwal, A; Rangan, CP Zhao, L; Nagamochi, H; Ibaraki, T; Aggarwal, A; Rangan, CP Approximating the minimum k-way cut in a graph via minimum 3-way cuts Approximating the minimum k-way cut in a graph via minimum 3-way cuts ,1741,373-382 2000 英語 公開
Nagamochi, H; Jordan, T; Nakao, Y; Ibaraki, T; Aggarwal, A; Rangan, CP Nagamochi, H; Jordan, T; Nakao, Y; Ibaraki, T; Aggarwal, A; Rangan, CP Bisecting two subsets in 3-connected graphs Bisecting two subsets in 3-connected graphs ,1741,425-434 2000 英語 公開
H. Nagamochi; S. Nakamura; T. Ibaraki H. Nagamochi; S. Nakamura; T. Ibaraki A simplified Õ(nm) time edge-splitting algorithm in undirected graphs A simplified Õ(nm) time edge-splitting algorithm in undirected graphs ,26,1,50-67 2000 英語 公開
永持 仁 永持 仁 Simultaneous augmentation of two graphs to an l-edge-connected graph and a biconnected graph, "jointly worked " Simultaneous augmentation of two graphs to an l-edge-connected graph and a biconnected graph, "jointly worked " 2000 英語 公開
H. Nagamochi; T. Ishii; T. Ibaraki H. Nagamochi; T. Ishii; T. Ibaraki A simple proof of a minimum cut algorithm and its applications A simple proof of a minimum cut algorithm and its applications ,E82A,10,2231-2236 1999/10 英語 公開
H. Nagamochi; T. Ibaraki H. Nagamochi; T. Ibaraki An Approximation of the Minimum Vertex Cover in a Graph An Approximation of the Minimum Vertex Cover in a Graph ,16,3,369-375 1999/10 英語 公開
X. Deng; T. Ibaraki; H. Nagamochi X. Deng; T. Ibaraki; H. Nagamochi Algorithmic aspects of the core of combinatorial optimization games Algorithmic aspects of the core of combinatorial optimization games ,24,3,751-766 1999/08 英語 公開
H. Nagamochi; T. Ibaraki H. Nagamochi; T. Ibaraki Augmenting Edge-Connectivity over the Entire Range in Õ(nm) Time Augmenting Edge-Connectivity over the Entire Range in Õ(nm) Time ,30,2,253-301 1999/02 英語 公開
Ishii, T; Nagamochi, H; Ibaraki, T; Nesetril, J Ishii, T; Nagamochi, H; Ibaraki, T; Nesetril, J Augmentin a (k-1)-vertex-connected multigraph to an l-edge-connected and k-vertex-connected multigraph Augmentin a (k-1)-vertex-connected multigraph to an l-edge-connected and k-vertex-connected multigraph ,1643,414-425 1999 英語 公開
NAGAMOCHI H;KATAYAMA S;IBARAKI T NAGAMOCHI H;KATAYAMA S;IBARAKI T A Faster Algorithm for Computing Minimum 5-Way and 6-Way Cuts in Graphs. A Faster Algorithm for Computing Minimum 5-Way and 6-Way Cuts in Graphs. ,1627,164-173 1999 英語 公開
M. Kato; R. Kawakita; H. Nagamochi; Y. Oie M. Kato; R. Kawakita; H. Nagamochi; Y. Oie A reconfigurative algorithm for torus lightwave networks A reconfigurative algorithm for torus lightwave networks ,82,6,34-44 1999 英語 公開
永持 仁 永持 仁 An approximation for finding a smallest 2-edge-connected subgraph containing a specified spanning tree, "jointly worked " An approximation for finding a smallest 2-edge-connected subgraph containing a specified spanning tree, "jointly worked " 1999 英語 公開
永持 仁 永持 仁 Drawing clustered graphs on an orthogonal grid, "jointly worked " Drawing clustered graphs on an orthogonal grid, "jointly worked " 1999 英語 公開
P. Eades, Q. Feng and Hiroshi Nagamochi P. Eades, Q. Feng and Hiroshi Nagamochi Drawing clustered graphs on an orthogonal grid Drawing clustered graphs on an orthogonal grid 1999 英語 公開
A. Frank; T. Ibaraki; H. Nagamochi A. Frank; T. Ibaraki; H. Nagamochi Two arc-disjoint paths in Eulerian digraphs Two arc-disjoint paths in Eulerian digraphs ,11,4,557-589 1998/11 英語 公開
H. Nagamochi; T. Ibaraki H. Nagamochi; T. Ibaraki A note on minimizing submodular functions A note on minimizing submodular functions ,67,5,239-244 1998/09/15 英語 公開
永持 仁 永持 仁 Independent spanning trees with small depths in iterated line digraphs Independent spanning trees with small depths in iterated line digraphs 1998 英語 公開
T. Ibaraki; A.V. Karzanov; H. Nagamochi T. Ibaraki; A.V. Karzanov; H. Nagamochi A fast algorithm for finding a maximum free multiflow in an inner Eulerian network and some generalizations A fast algorithm for finding a maximum free multiflow in an inner Eulerian network and some generalizations ,18,1,61-83 1998 英語 公開
Nagamochi, H; Eades, P; Bixby, RE; Boyd, EA; RiosMercado, RZ Nagamochi, H; Eades, P; Bixby, RE; Boyd, EA; RiosMercado, RZ Edge-splitting and edge-connectivity augmentation in planar graphs Edge-splitting and edge-connectivity augmentation in planar graphs ,1412,96-111 1998 英語 公開
T. Ishii; H. Nagamochi; T. Ibaraki T. Ishii; H. Nagamochi; T. Ibaraki K-edge and 3-vertex connectivity augmentation in an arbitrary multigraph K-edge and 3-vertex connectivity augmentation in an arbitrary multigraph ,1533,159-168 1998 英語 公開
H. Nagamochi; T. Ibaraki H. Nagamochi; T. Ibaraki Polyhedral structure of submodular and posi-modular systems Polyhedral structure of submodular and posi-modular systems ,1533,169-178 1998 英語 公開
H. Nagamochi; T. Hasunuma H. Nagamochi; T. Hasunuma An efficient NC algorithm for a sparse k-edge-connectivity certificate An efficient NC algorithm for a sparse k-edge-connectivity certificate ,1533,447-456 1998 英語 公開
H. Nagamochi; K. Mochizuki; T. Ibaraki H. Nagamochi; K. Mochizuki; T. Ibaraki Complexity of the single vehicle scheduling problem on graphs Complexity of the single vehicle scheduling problem on graphs ,35,4,256-276 1997/11 英語 公開
H. Nagamochi; K. Nishimura; T. Ibaraki H. Nagamochi; K. Nishimura; T. Ibaraki Computing all small cuts in AN undirected network Computing all small cuts in AN undirected network ,10,3,469-481 1997/08 英語 公開
H. Nagamochi; D.-Z. Zeng; N. Kabutoya; T. Ibaraki H. Nagamochi; D.-Z. Zeng; N. Kabutoya; T. Ibaraki Complexity of the minimum base game on matroids Complexity of the minimum base game on matroids ,22,1,146-164 1997/02 英語 公開
Y. Karuno; H. Nagamochi; T. Ibaraki Y. Karuno; H. Nagamochi; T. Ibaraki Vehicle scheduling on a tree with release and handling times Vehicle scheduling on a tree with release and handling times ,69,193-207 1997 英語 公開
ISHII T;NAGAMOCHI H;IBARAKI T ISHII T;NAGAMOCHI H;IBARAKI T Augmenting Edge and Vertex Connectivities Simultaneously. Augmenting Edge and Vertex Connectivities Simultaneously. ,1350,102-111 1997 英語 公開
H. Nagamochi; T. Ibaraki H. Nagamochi; T. Ibaraki Deterministic Õ(nm) time edge-splitting in undirected graphs Deterministic Õ(nm) time edge-splitting in undirected graphs ,1,1,5-46 1997 英語 公開
Y. Karuno; H. Nagamochi; T. Ibaraki Y. Karuno; H. Nagamochi; T. Ibaraki Vehicle scheduling on a tree to minimize maximum lateness Vehicle scheduling on a tree to minimize maximum lateness ,39,3,345-355 1996/09 英語 公開
H. Nagamochi; T. Kameda H. Nagamochi; T. Kameda Constructing cactus representation for all minimum cuts in an undirected network Constructing cactus representation for all minimum cuts in an undirected network ,39,2,135-158 1996/06 英語 公開
KARUNO Y;NAGAMOCHI H;IBARAKI T KARUNO Y;NAGAMOCHI H;IBARAKI T Computational Complexity of the Traveling Salesman Problem on a Line with Deadlines and General Handling Times. Computational Complexity of the Traveling Salesman Problem on a Line with Deadlines and General Handling Times. ,45,19-22 1996 英語 公開
T. Ibaraki; H. Nagamochi; T. Kameda T. Ibaraki; H. Nagamochi; T. Kameda Optimal coteries for rings and related networks Optimal coteries for rings and related networks ,8,4,191-201 1995/06 英語 公開
NAGAMOCHI H;IBARAKI T NAGAMOCHI H;IBARAKI T A Faster Edge Splitting Algorithm in Multigraphs and its Application to the Edge-Connectivity Augmentation Problem. A Faster Edge Splitting Algorithm in Multigraphs and its Application to the Edge-Connectivity Augmentation Problem. ,920,403-413 1995 英語 公開
永持 仁 永持 仁 Two arc-disjoint paths in Eulerian digraphs, "jointly worked " Two arc-disjoint paths in Eulerian digraphs, "jointly worked " 1995 英語 公開
H. Nagamochi; T. Ono; T. Ibaraki H. Nagamochi; T. Ono; T. Ibaraki Implementing an efficient minimum capacity cut algorithm Implementing an efficient minimum capacity cut algorithm ,67,3,325-341 1994/12/14 英語 公開
HARADA, H; SUN, Z; NAGAMOCHI, H HARADA, H; SUN, Z; NAGAMOCHI, H AN EXACT LOWER-BOUND ON THE NUMBER OF CUT-SETS IN MULTIGRAPHS AN EXACT LOWER-BOUND ON THE NUMBER OF CUT-SETS IN MULTIGRAPHS ,24,8,429-443 1994/12 英語 公開
H. Nagamochi; T. Kameda H. Nagamochi; T. Kameda Canonical cactus representation for minimum cuts Canonical cactus representation for minimum cuts ,11,3,343-361 1994 英語 公開
永持 仁 永持 仁 Computing all small cuts in undirected networks, "jointly worked " Computing all small cuts in undirected networks, "jointly worked " 1994 英語 公開
FRANK, A; IBARAKI, T; NAGAMOCHI, H FRANK, A; IBARAKI, T; NAGAMOCHI, H ON SPARSE SUBGRAPHS PRESERVING CONNECTIVITY PROPERTIES ON SPARSE SUBGRAPHS PRESERVING CONNECTIVITY PROPERTIES ,17,3,275-281 1993/07 英語 公開
KARUNO Y;NAGAMOCHI H;IBARAKI T KARUNO Y;NAGAMOCHI H;IBARAKI T Vehicle Scheduling on a Tree with Release and Handling Times. Vehicle Scheduling on a Tree with Release and Handling Times. ,762,486-495 1993 英語 公開
永持 仁 永持 仁 Computing k-edge-connected components in multigraphs, "jointly worked " Computing k-edge-connected components in multigraphs, "jointly worked " 1993 英語 公開
Hiroshi Nagamochi; Toshihide Ibaraki Hiroshi Nagamochi; Toshihide Ibaraki On Onaga\\'s upper bound on the mean values of probabilistic maximum flows On Onaga\\'s upper bound on the mean values of probabilistic maximum flows ,41,2,225-229 1992/06 英語 公開
NAGAMOCHI, H; IBARAKI, T NAGAMOCHI, H; IBARAKI, T COMPUTING EDGE-CONNECTIVITY IN MULTIGRAPHS AND CAPACITATED GRAPHS COMPUTING EDGE-CONNECTIVITY IN MULTIGRAPHS AND CAPACITATED GRAPHS ,5,1,54-66 1992/02 英語 公開
Hiroshi Nagamochi; Toshihide Ibaraki Hiroshi Nagamochi; Toshihide Ibaraki Linear-time algorithm for finding a sparse k-connected spanning subgraph of a k-connected graph Linear-time algorithm for finding a sparse k-connected spanning subgraph of a k-connected graph ,7,5-6,583-596 1992 英語 公開
H. Nagamochi; T. Ibaraki H. Nagamochi; T. Ibaraki A linear time algorithm for computing 3-edge-connected components in a multigraph A linear time algorithm for computing 3-edge-connected components in a multigraph ,9,2,163-180 1992 英語 公開
IBARAKI T;NAGAMOCHI H;KAMEDA T IBARAKI T;NAGAMOCHI H;KAMEDA T Optimal Coteries for Rings and Related Networks. Optimal Coteries for Rings and Related Networks. ,12th,650-656 1992 英語 公開
Hiroshi Nagamochi; Zheng Sun; Toshihide Ibaraki Hiroshi Nagamochi; Zheng Sun; Toshihide Ibaraki Counting the number of minimum cuts in undirected multigraphs Counting the number of minimum cuts in undirected multigraphs ,40,5,610-614 1991/12 英語 公開
NAGAMOCHI, H; IBARAKI, T NAGAMOCHI, H; IBARAKI, T MAXIMUM FLOWS IN PROBABILISTIC NETWORKS MAXIMUM FLOWS IN PROBABILISTIC NETWORKS ,21,6,645-666 1991/10 英語 公開
NAGAMOCHI, H; FUKUSHIMA, M; IBARAKI, T NAGAMOCHI, H; FUKUSHIMA, M; IBARAKI, T RELAXATION METHODS FOR THE STRICTLY CONVEX MULTICOMMODITY FLOW PROBLEM WITH CAPACITY CONSTRAINTS ON INDIVIDUAL COMMODITIES RELAXATION METHODS FOR THE STRICTLY CONVEX MULTICOMMODITY FLOW PROBLEM WITH CAPACITY CONSTRAINTS ON INDIVIDUAL COMMODITIES ,20,4,409-426 1990/07 英語 公開
H. Nagamochi; T. Ibaraki H. Nagamochi; T. Ibaraki Multicommodity flows in certain planar directed networks Multicommodity flows in certain planar directed networks ,27,1-2,125-145 1990/05 英語 公開
永持 仁 永持 仁 Computing the edge-connectivity of multigraphs and capacitated graphs, "jointly worked " Computing the edge-connectivity of multigraphs and capacitated graphs, "jointly worked " 1990 英語 公開
永持 仁 永持 仁 Multiple graphs minimizing the number of minimum cut-sets, "jointly worked " Multiple graphs minimizing the number of minimum cut-sets, "jointly worked " 1990 英語 公開
H. Nagamochi; T. Ibaraki H. Nagamochi; T. Ibaraki On max-flow min-cut and integral flow properties for multicommodity flows in directed networks On max-flow min-cut and integral flow properties for multicommodity flows in directed networks ,31,6,279-285 1989/06/19 英語 公開
永持 仁 永持 仁 Augmenting edge-connectivity over the entire range in Õ(nm) time, "jointly worked " Augmenting edge-connectivity over the entire range in Õ(nm) time, "jointly worked " 英語 公開
永持 仁 永持 仁 Deterministic Õ(nm) time edge-splitting in undirected graphs, "jointly worked " Deterministic Õ(nm) time edge-splitting in undirected graphs, "jointly worked " 英語 公開

  • <<
  • >>
  • 表示
タイトル言語:
Misc
著者 著者(日本語) 著者(英語) タイトル タイトル(日本語) タイトル(英語) 書誌情報等 出版年月 査読の有無 記述言語 掲載種別 公開
Fei He, Akiyoshi Hanai,永持 仁,Tatsuya Akutsu Fei He, Akiyoshi Hanai,永持 仁,Tatsuya Akutsu Fei He, Akiyoshi Hanai,NAGAMOCHI Hiroshi .Tatsuya Akutsu Enumerating Naphthalene Isomers of Tree-like Chemical Graphs. Enumerating Naphthalene Isomers of Tree-like Chemical Graphs. Enumerating Naphthalene Isomers of Tree-like Chemical Graphs. BIOINFORMATICS,3,258-265 2016/02 英語 公開
Morito Oomine, Aleksandar Shurbevski,永持 仁 Morito Oomine, Aleksandar Shurbevski,永持 仁 Morito Oomine, Aleksandar Shurbevski,NAGAMOCHI Hiroshi Parameterization of Strategy-Proof Mechanisms in the Obnoxious Facility Game Parameterization of Strategy-Proof Mechanisms in the Obnoxious Facility Game Parameterization of Strategy-Proof Mechanisms in the Obnoxious Facility Game Lecture Notes in Computer Science,9627,286-297 2016 英語 公開
永持 仁 永持 仁 N. Md Yunos, A. Shurbevski,NAGAMOCHI Hiroshi A Polynomial-Space Exact Algorithm for TSP in Degree-6 Graphs A Polynomial-Space Exact Algorithm for TSP in Degree-6 Graphs A Polynomial-Space Exact Algorithm for TSP in Degree-6 Graphs The 18th Japan Conference on Discrete and Computational Geometry and Graphs,102-103 2015/09 英語 公開
Fei He,永持 仁 Fei He,永持 仁 Fei He,NAGAMOCHI Hiroshi A Method for Generating Colorings over Graph Automorphism A Method for Generating Colorings over Graph Automorphism A Method for Generating Colorings over Graph Automorphism he 12th International Symposium on Operations Research and its Applications in Engineering, Technology and Management,70-81 2015/08 英語 公開
永持 仁 永持 仁 N. Md Yunos, A. Shurbevski,NAGAMOCHI Hiroshi A Polynomial-Space Exact Algorithm for TSP in Degree-5 Graphs A Polynomial-Space Exact Algorithm for TSP in Degree-5 Graphs A Polynomial-Space Exact Algorithm for TSP in Degree-5 Graphs The 12th International Symposium on Operations Research and its Applications in Engineering, Technology and Management,45-58 2015/08 英語 公開
永持 仁 永持 仁 Seok-Hee Hong,NAGAMOCHI Hiroshi Testing Full Outer-2-Planarity in Linear Time Testing Full Outer-2-Planarity in Linear Time Testing Full Outer-2-Planarity in Linear Time 41st International Workshop on Graph-Theoretic Concepts in Computer Science 2015/06 英語 公開
永持 仁 永持 仁 Ken Iwaide, Hiroshi Nagamochi: An Improved Algorithm for Parameterized Edge Dominating Set Problem. An Improved Algorithm for Parameterized Edge Dominating Set Problem. An Improved Algorithm for Parameterized Edge Dominating Set Problem. WALCOM 2015:,234-245 2015 英語 公開
永持 仁 永持 仁 Seok-Hee Hong, ,NAGAMOCHI Hiroshi Simpler Algorithms for Testing Two-Page Book Embedding of Partitioned Graphs Simpler Algorithms for Testing Two-Page Book Embedding of Partitioned Graphs Simpler Algorithms for Testing Two-Page Book Embedding of Partitioned Graphs COCOON 2014:,477-488 2014 英語 公開
永持 仁 永持 仁 Mingyu Xiao,NAGAMOCHI Hiroshi Complexity and Kernels for Bipartition into Degree-bounded Induced Graphs Complexity and Kernels for Bipartition into Degree-bounded Induced Graphs Complexity and Kernels for Bipartition into Degree-bounded Induced Graphs ISAAC 2014,429-440 2014 英語 公開
永持 仁 永持 仁 NAGAMOCHI Hiroshi Linear Layouts in Submodular Systems Linear Layouts in Submodular Systems Linear Layouts in Submodular Systems ISAAC 2012:,475-484 2012 英語 公開
Hiroshi Nagamochi; Toshihide Ibaraki Hiroshi Nagamochi; Toshihide Ibaraki Deterministic qq(nm) time edge-splitting in undirected graphs Deterministic qq(nm) time edge-splitting in undirected graphs Deterministic qq(nm) time edge-splitting in undirected graphs ,64-73 1996 英語 公開
永持 仁 永持 仁 アルゴリズム辞典(共著) アルゴリズム辞典(共著) 共立出版, 1995 日本語 公開
A. Shurbevski; H. Nagamochi; Y. Karuno A. Shurbevski; H. Nagamochi; Y. Karuno Approximating the bipartite TSP and its biased generalization Approximating the bipartite TSP and its biased generalization ,8344 LNCS,56-67 2014 英語 公開
M. Xiao; H. Nagamochi M. Xiao; H. Nagamochi An exact algorithm for maximum independent set in degree-5 graphs An exact algorithm for maximum independent set in degree-5 graphs ,7924 LNCS,72-83 2013 英語 公開
M. Xiao; H. Nagamochi M. Xiao; H. Nagamochi An improved exact algorithm for undirected feedback vertex set An improved exact algorithm for undirected feedback vertex set ,8287 LNCS,153-164 2013 英語 公開
M. Xiao; H. Nagamochi M. Xiao; H. Nagamochi Exact algorithms for maximum independent set Exact algorithms for maximum independent set ,8283 LNCS,328-338 2013 英語 公開
M. Xiao; H. Nagamochi M. Xiao; H. Nagamochi An exact algorithm for TSP in degree-3 graphs via circuit procedure and amortization on connectivity structure An exact algorithm for TSP in degree-3 graphs via circuit procedure and amortization on connectivity structure ,7876 LNCS,96-107 2013 英語 公開
C. Zhang; H. Nagamochi C. Zhang; H. Nagamochi The next-to-shortest path in undirected graphs with nonnegative weights The next-to-shortest path in undirected graphs with nonnegative weights ,128,13-20 2012 英語 公開
K. Ibara; H. Nagamochi K. Ibara; H. Nagamochi Characterizing mechanisms in obnoxious facility game Characterizing mechanisms in obnoxious facility game ,7402 LNCS,301-311 2012 英語 公開
M. Xiao; H. Nagamochi M. Xiao; H. Nagamochi An improved exact algorithm for TSP in degree-4 graphs An improved exact algorithm for TSP in degree-4 graphs ,7434 LNCS,74-85 2012 英語 公開
M. Xiao; H. Nagamochi M. Xiao; H. Nagamochi A refined exact algorithm for edge dominating set A refined exact algorithm for edge dominating set ,7287 LNCS,360-372 2012 英語 公開
H. Nagamochi H. Nagamochi Submodular minimization via pathwidth Submodular minimization via pathwidth ,7287 LNCS,584-593 2012 英語 公開
M. Shimizu, H. Nagamochi and T. Akutsu M. Shimizu, H. Nagamochi and T. Akutsu Enumerating tree-like chemical graphs with given upper and lower bounds on path frequencies. Enumerating tree-like chemical graphs with given upper and lower bounds on path frequencies. ,12,14 2011/12/14 英語 公開
A.r Shurbevski, H. Nagamochi, Y. Karuno A.r Shurbevski, H. Nagamochi, Y. Karuno Heuristics for a repetitive routing problem of a single grasp-and-delivery robot with an asymmetric edge cost function Heuristics for a repetitive routing problem of a single grasp-and-delivery robot with an asymmetric edge cost function 2011/09 英語 公開
L. Zhao, P. Eumthurapojn, H. Nagamochi L. Zhao, P. Eumthurapojn, H. Nagamochi A practical speed-up technique for A* algorithms A practical speed-up technique for A* algorithms 2011/04 英語 公開
T. Hasunuma; H. Nagamochi T. Hasunuma; H. Nagamochi Improved bounds for minimum fault-tolerant gossip graphs Improved bounds for minimum fault-tolerant gossip graphs ,6986 LNCS,203-214 2011 英語 公開
M. Xiao; H. Nagamochi M. Xiao; H. Nagamochi Further improvement on maximum independent set in degree-4 graphs Further improvement on maximum independent set in degree-4 graphs ,6831 LNCS,163-178 2011 英語 公開
M. Xiao; H. Nagamochi M. Xiao; H. Nagamochi Parameterized edge dominating set in cubic graphs (extended abstract) Parameterized edge dominating set in cubic graphs (extended abstract) ,6681,100-112 2011 英語 公開
Y. Karuno, H. Nagamochi Y. Karuno, H. Nagamochi Network transformation heuristics for multi-story storage rack problems Network transformation heuristics for multi-story storage rack problems 2011 英語 公開
A. Shurbevski, Y. Karuno, H. Nagamochi A. Shurbevski, Y. Karuno, H. Nagamochi Improved implementation of an approximation algorithm with factor two for a cyclic routing problem of grasp-and-delivery robots Improved implementation of an approximation algorithm with factor two for a cyclic routing problem of grasp-and-delivery robots 2011 英語 公開
Y. Karuno; H. Nagamochi; A. Nakashima; K. Yamashita Y. Karuno; H. Nagamochi; A. Nakashima; K. Yamashita Heuristics for scheduling problems on identical machines like storage allocation Heuristics for scheduling problems on identical machines like storage allocation ,863-868 2010 英語 公開
Mingyu Xiao, Takuro Fukunaga, Hiroshi Nagamochi Mingyu Xiao, Takuro Fukunaga, Hiroshi Nagamochi FPTAS's for Some Cut Problems in Weighted Trees. FPTAS's for Some Cut Problems in Weighted Trees. 2010 英語 公開
Y. Karuno; H. Nagamochi; A. Shurbevski Y. Karuno; H. Nagamochi; A. Shurbevski Approximation algorithms for a cyclic routing problem of grasp-and-delivery robots Approximation algorithms for a cyclic routing problem of grasp-and-delivery robots ,94-99 2010 英語 公開
K. Haraguchi, S.-H. Hong, Hiroshi Nagamochi K. Haraguchi, S.-H. Hong, Hiroshi Nagamochi Multiclass visual classifier based on bipartite graph representation of decision tables Multiclass visual classifier based on bipartite graph representation of decision tables 2010 英語 公開
Yoshiyuki Karuno, Kougaku Yamashita, Eishi Chiba, Hiroshi Nagamochi Yoshiyuki Karuno, Kougaku Yamashita, Eishi Chiba, Hiroshi Nagamochi 4C1 SCHEDULING MULTIPROCESSOR TASKS WITH PROMPT SERVICE CONSTRAINTS ON ALIGNED IDENTICAL PROCESSORS 4C1 SCHEDULING MULTIPROCESSOR TASKS WITH PROMPT SERVICE CONSTRAINTS ON ALIGNED IDENTICAL PROCESSORS ,2009,203-208 2009/07/04 英語 公開
K. Haraguchi; S.-H. Hong; H. Nagamochi K. Haraguchi; S.-H. Hong; H. Nagamochi Bipartite graph representation of multiple decision table classifiers Bipartite graph representation of multiple decision table classifiers ,5792 LNCS,46-60 2009 英語 公開
T. Imada; S. Ota; H. Nagamochi; T. Akutsu T. Imada; S. Ota; H. Nagamochi; T. Akutsu Enumerating stereoisomers of tree structured molecules using dynamic programming Enumerating stereoisomers of tree structured molecules using dynamic programming ,5878 LNCS,14-23 2009 英語 公開
J. Wang; J. Gim; M. Sasaki; L. Zhao; H. Nagamochi J. Wang; J. Gim; M. Sasaki; L. Zhao; H. Nagamochi Efficient approximate algorithms for the beacon placement and its dual problem (abstract) Efficient approximate algorithms for the beacon placement and its dual problem (abstract) 2009 英語 公開
T. Imamichi, Y. Arahori, Hiroshi Nagamochi T. Imamichi, Y. Arahori, Hiroshi Nagamochi Efficient branch-and-bound algorithms for one-dimensional contiguous bin packing problem and two-dimensional strip packing problem, Efficient branch-and-bound algorithms for one-dimensional contiguous bin packing problem and two-dimensional strip packing problem, 2009 英語 公開
S. Umetani, K. Matsumoto, Hiroshi Nagamochi, S. Umetani, K. Matsumoto, Hiroshi Nagamochi, One-dimensional cutting stock problem for a paper tube industry One-dimensional cutting stock problem for a paper tube industry 2009 英語 公開
S.-H. Hong, Hiroshi Nagamochi S.-H. Hong, Hiroshi Nagamochi Toward characterization of vertex-edge graphs of three-dimensional nonconvex polyhedra, Toward characterization of vertex-edge graphs of three-dimensional nonconvex polyhedra, 2009 英語 公開
Yoshiyuki Karuno, Kougaku Yamashita, Eishi Chiba, Hiroshi Nagamochi Yoshiyuki Karuno, Kougaku Yamashita, Eishi Chiba, Hiroshi Nagamochi Combinatorial optimization problems and algorithms in double-layered food packing equipments Combinatorial optimization problems and algorithms in double-layered food packing equipments 2009 英語 公開
J. Wang, J. Gim, M. Sasaki, L. Zhao, Hiroshi Nagamochi J. Wang, J. Gim, M. Sasaki, L. Zhao, Hiroshi Nagamochi Efficient approximate algorithms for the beacon placement and its dual problem, Efficient approximate algorithms for the beacon placement and its dual problem, 2009 英語 公開
K. Haraguchi, S.-H. Hong, Hiroshi Nagamochi K. Haraguchi, S.-H. Hong, Hiroshi Nagamochi Visualized Multiple Decision Table Classifiers without Discretization Visualized Multiple Decision Table Classifiers without Discretization 2009 英語 公開
K. Haraguchi, S.-H. Hong, Hiroshi Nagamochi, K. Haraguchi, S.-H. Hong, Hiroshi Nagamochi, Visualization can improve multiple decision table classifiers Visualization can improve multiple decision table classifiers 2009 英語 公開
K. Okumoto, T. Fukunaga, Hiroshi Nagamochi, K. Okumoto, T. Fukunaga, Hiroshi Nagamochi, Divide-and-conquer algorithms for partitioning hypergraphs and submodular systems, Divide-and-conquer algorithms for partitioning hypergraphs and submodular systems, 2009 英語 公開
S. Karakawa, E. Morsy, Hiroshi Nagamochi S. Karakawa, E. Morsy, Hiroshi Nagamochi Minmax tree cover in the Euclidean space Minmax tree cover in the Euclidean space 2009 英語 公開
T. Fukunaga, Hiroshi Nagamochi T. Fukunaga, Hiroshi Nagamochi Network design with weighted degree constraints Network design with weighted degree constraints 2009 英語 公開
Hiroshi Nagamochi, Hiroshi Nagamochi, Cop-robber guarding game with cycle robber region Cop-robber guarding game with cycle robber region 2009 英語 公開
Y. Nakao, Hiroshi Nagamochi Y. Nakao, Hiroshi Nagamochi Worst case analysis for pickup and delivery problems with consecutive pickups and deliveries Worst case analysis for pickup and delivery problems with consecutive pickups and deliveries 2009 英語 公開
S.-H. Hong, Hiroshi Nagamochi S.-H. Hong, Hiroshi Nagamochi Upward star-shaped polyhedral graphs Upward star-shaped polyhedral graphs 2009 英語 公開
T. Fukunaga; M.M. Halldórsson; H. Nagamochi T. Fukunaga; M.M. Halldórsson; H. Nagamochi Robust cost colorings Robust cost colorings ,1204-1212 2008 英語 公開
M. Sasaki; L. Zhao; H. Nagamochi M. Sasaki; L. Zhao; H. Nagamochi Security-aware beacon based network monitoring Security-aware beacon based network monitoring ,527-531 2008 英語 公開
T. Imamichi; H. Nagamochi T. Imamichi; H. Nagamochi Designing algorithms with multi-sphere scheme Designing algorithms with multi-sphere scheme ,125-130 2008 英語 公開
Jaeseong Gim, Yohei Arahori, Takashi Imamichi, Seok-Hee Hong, Hiroshi Nagamochi Jaeseong Gim, Yohei Arahori, Takashi Imamichi, Seok-Hee Hong, Hiroshi Nagamochi Overlap removal in label layouts by a multi-sphere scheme, Overlap removal in label layouts by a multi-sphere scheme, 2008 英語 公開
K. Haraguchi, Seok-Hee Hong, Hiroshi Nagamochi, K. Haraguchi, Seok-Hee Hong, Hiroshi Nagamochi, Visual analysis of hierarchical data using 2.5D drawing with minimum occlusion Visual analysis of hierarchical data using 2.5D drawing with minimum occlusion 2008 英語 公開
E. Morsy, Hiroshi Nagamochi E. Morsy, Hiroshi Nagamochi Approximating the generalized capacitated tree-routing Approximating the generalized capacitated tree-routing 2008 英語 公開
L. Zhao, T. Ohshima, Hiroshi Nagamochi L. Zhao, T. Ohshima, Hiroshi Nagamochi A* algorithm for the time-dependent shortest path problem A* algorithm for the time-dependent shortest path problem 2008 英語 公開
T. Imamichi, Hiroshi Nagamochi T. Imamichi, Hiroshi Nagamochi A fast collision detection algorithm for a multi-sphere scheme A fast collision detection algorithm for a multi-sphere scheme 2008 英語 公開
Y. Ishida, L. Zhao, Hiroshi Nagamochi, T. Akutsu Y. Ishida, L. Zhao, Hiroshi Nagamochi, T. Akutsu Improved algorithm for enumerating tree-likee chemical graphs, Improved algorithm for enumerating tree-likee chemical graphs, 2008 英語 公開
Shinji IMAHORI, Yoshiyuki KARUNO, Hiroshi NAGAMOCHI, Xiaoming WANG Shinji IMAHORI, Yoshiyuki KARUNO, Hiroshi NAGAMOCHI, Xiaoming WANG Efficient algorithms for combinatorial food packing problems Efficient algorithms for combinatorial food packing problems 2008 英語 公開
S.-H. Hong, Hiroshi Nagamochi, S.-H. Hong, Hiroshi Nagamochi, Approximating crossing minimization in radial layouts Approximating crossing minimization in radial layouts 2008 英語 公開
S.-H. Hong, Hiroshi Nagamochi S.-H. Hong, Hiroshi Nagamochi Star-shaped drawings of graphs with fixed embedding and concave corner constraints Star-shaped drawings of graphs with fixed embedding and concave corner constraints 2008 英語 公開
T. Imamichi, Y. Arahori, J. Gim, S.-H. Hong, Hiroshi Nagamochi T. Imamichi, Y. Arahori, J. Gim, S.-H. Hong, Hiroshi Nagamochi Removing node overlaps using multi-sphere scheme Removing node overlaps using multi-sphere scheme 2008 英語 公開
T. Fukunaga, Hiroshi Nagamochi T. Fukunaga, Hiroshi Nagamochi The set connector problems in graphs The set connector problems in graphs 2007 英語 公開
T. Imamichi, Hiroshi Nagamochi, T. Imamichi, Hiroshi Nagamochi, Packing sets of circles with shape-memory, Packing sets of circles with shape-memory, 2007 英語 公開
S.-H. Hong, Hiroshi Nagamochi, S.-H. Hong, Hiroshi Nagamochi, Fully convex drawings of clustered planar graphs Fully convex drawings of clustered planar graphs 2007 英語 公開
T. Imamichi, Hiroshi Nagamochi T. Imamichi, Hiroshi Nagamochi An Iterated Local Search Algorithm in a Multi-sphere Scheme for 2D and 3D Packing Problems, An Iterated Local Search Algorithm in a Multi-sphere Scheme for 2D and 3D Packing Problems, 2007 英語 公開
H. Fujiwara, L. Zhao, Hiroshi Nagamochi, T. Akutsu, W. Jiexun, H. Fujiwara, L. Zhao, Hiroshi Nagamochi, T. Akutsu, W. Jiexun, Enumerating tree-like chemical structures from feature vector Enumerating tree-like chemical structures from feature vector 2007 英語 公開
T. Imamichi, Hiroshi Nagamochi T. Imamichi, Hiroshi Nagamochi A multi-sphere scheme for 2D and 3D packing problems A multi-sphere scheme for 2D and 3D packing problems 2007 英語 公開
M. Yagiura, A. Komiya, K. Kojima, K. Nonobe, Hiroshi Nagamochi, Toshihide Ibaraki, F. Glover, M. Yagiura, A. Komiya, K. Kojima, K. Nonobe, Hiroshi Nagamochi, Toshihide Ibaraki, F. Glover, A path relinking approach for the multi-resource generalized assignment problem A path relinking approach for the multi-resource generalized assignment problem 2007 英語 公開
S.-H. Hong, Hiroshi Nagamochi, S.-H. Hong, Hiroshi Nagamochi, Star-shaped drawings of planar graphs Star-shaped drawings of planar graphs 2007 英語 公開
Hiroshi Nagamochi, Hiroshi Nagamochi, Minimum degree orderings, Minimum degree orderings, 2007 英語 公開
T. Fukunaga, M. Halldorsson, Hiroshi Nagamochi, T. Fukunaga, M. Halldorsson, Hiroshi Nagamochi, Rent-or-buy scheduling and cost coloring problems Rent-or-buy scheduling and cost coloring problems 2007 英語 公開
M. Hayashida; T. Akutsu; H. Nagamochi M. Hayashida; T. Akutsu; H. Nagamochi A novel clustering method for analysis of biological networks using maximal components of graphs A novel clustering method for analysis of biological networks using maximal components of graphs ,5,257-266 2007 英語 公開
A. Kawaguchi; H. Nagamochi A. Kawaguchi; H. Nagamochi Orthogonal drawings for plane graphs with specified face areas Orthogonal drawings for plane graphs with specified face areas ,4484 LNCS,584-594 2007 英語 公開
L. Zhao; A. Shimae; H. Nagamochi L. Zhao; A. Shimae; H. Nagamochi Linear-tree rule structure for firewall optimization Linear-tree rule structure for firewall optimization ,67-72 2007 英語 公開
J. Uchida; Y. Karuno; H. Nagamochi J. Uchida; Y. Karuno; H. Nagamochi Heuristics for a scheduling problem of minimizing the number of one-way vehicles on paths with deadlines Heuristics for a scheduling problem of minimizing the number of one-way vehicles on paths with deadlines ,2633-2638 2007 英語 公開
K. Haraguchi; H. Nagamochi K. Haraguchi; H. Nagamochi Extension of ICF classifiers to real world data sets Extension of ICF classifiers to real world data sets ,4570 LNAI,776-785 2007 英語 公開
H. Nagamochi H. Nagamochi Approximating minimum k-partitions in submodular systems Approximating minimum k-partitions in submodular systems ,119-128 2007 英語 公開
E. Morsy, Hiroshi Nagamochi E. Morsy, Hiroshi Nagamochi Approximating capacitated tree-routings in networks, Approximating capacitated tree-routings in networks, 2007 英語 公開
J. Wang, L. Zhao, Hiroshi Nagamochi, T. Akutsu J. Wang, L. Zhao, Hiroshi Nagamochi, T. Akutsu An efficient enumeration of colored outerplanar graphs An efficient enumeration of colored outerplanar graphs 2007 英語 公開
S.-H. Hong, Hiroshi Nagamochi S.-H. Hong, Hiroshi Nagamochi A linear time algorithm for symmetric convex drawings of triconnected planar graphs, A linear time algorithm for symmetric convex drawings of triconnected planar graphs, 2007 英語 公開
Imamichi Takashi;Nagamochi Hiroshi;Yagiura Mutsunori Imamichi Takashi;Nagamochi Hiroshi;Yagiura Mutsunori 5B2 AN ITERATED LOCAL SEARCH ALGORITHM BASED ON NONLINEAR PROGRAMMING FOR THE IRREGULAR STRIP PACKING PROBLEM(Technical session 5B: Packing problem) 5B2 AN ITERATED LOCAL SEARCH ALGORITHM BASED ON NONLINEAR PROGRAMMING FOR THE IRREGULAR STRIP PACKING PROBLEM(Technical session 5B: Packing problem) ,2006,132-137 2006/07/18 英語 公開
Ibaraki Toshihide;Ishikawa Akihiro;Nagamochi Hiroshi;Nonobe Koji;Yagiura Mutsunori Ibaraki Toshihide;Ishikawa Akihiro;Nagamochi Hiroshi;Nonobe Koji;Yagiura Mutsunori 6B2 AN ITERATED LOCAL SEARCH ALGORITHM FOR THE MULTI-RESOURCE GENERALIZED ASSIGNMENT PROBLEM WITH FLEXIBLE ASSIGNMENT COST(Technical session 6B: General model for scheduling and assignment problem) 6B2 AN ITERATED LOCAL SEARCH ALGORITHM FOR THE MULTI-RESOURCE GENERALIZED ASSIGNMENT PROBLEM WITH FLEXIBLE ASSIGNMENT COST(Technical session 6B: General model for scheduling and assignment problem) ,2006,160-165 2006/07/18 英語 公開
Nakao Yoshitaka;Nagamochi Hiroshi Nakao Yoshitaka;Nagamochi Hiroshi 2B1 A DP-BASED HEURISTIC ALGORITHM FOR THE DISCRETE SPLIT DELIVERY VEHICLE ROUTING PROBLEM(Technical session 2B: Vehicle scheduling and communication) 2B1 A DP-BASED HEURISTIC ALGORITHM FOR THE DISCRETE SPLIT DELIVERY VEHICLE ROUTING PROBLEM(Technical session 2B: Vehicle scheduling and communication) ,2006,42-47 2006/07/18 英語 公開
Morsy Ehab;Nagamochi Hiroshi Morsy Ehab;Nagamochi Hiroshi 1A2 AN IMPROVED APPROXIMATION ALGORITHM FOR CAPACITATED MULTICAST ROUTINGS IN NETWORKS(Technical session 1A: Combinatorial optimization) 1A2 AN IMPROVED APPROXIMATION ALGORITHM FOR CAPACITATED MULTICAST ROUTINGS IN NETWORKS(Technical session 1A: Combinatorial optimization) ,2006,12-17 2006/07/18 英語 公開
T. Imamichi, M. Yagiura, Hiroshi Nagamochi T. Imamichi, M. Yagiura, Hiroshi Nagamochi An iterated local search algorithm based on nonlinear programming for the irregular strip packing problem An iterated local search algorithm based on nonlinear programming for the irregular strip packing problem 2006 英語 公開
M. Yagiura, Toshihide Ibaraki, T. Imamichi, Y. Koga, Hiroshi Nagamochi,K. Nonobe M. Yagiura, Toshihide Ibaraki, T. Imamichi, Y. Koga, Hiroshi Nagamochi,K. Nonobe Efficient branch-and-bound algorithms for weighted MAX-2-SAT Efficient branch-and-bound algorithms for weighted MAX-2-SAT 2006 英語 公開
T. Fukunaga, Hiroshi Nagamochi T. Fukunaga, Hiroshi Nagamochi Network design with edge-connectivity and degree constraints Network design with edge-connectivity and degree constraints 2006 英語 公開
Hiroshi Nagamochi Hiroshi Nagamochi A detachment algorithm for inferring a graph from path frequency A detachment algorithm for inferring a graph from path frequency 2006 英語 公開
T. Fukunaga, Hiroshi Nagamochi T. Fukunaga, Hiroshi Nagamochi Some theorems on detachments preserving local-edge-connectivity Some theorems on detachments preserving local-edge-connectivity 2006 英語 公開
K. Hirata; T. Matsuda; H. Nagamochi; T. Takine K. Hirata; T. Matsuda; H. Nagamochi; T. Takine Contention-free λ-planes in optically burst-switched WDM networks Contention-free λ-planes in optically burst-switched WDM networks 2006 英語 公開
S.-H. Hong, Hiroshi Nagamochi S.-H. Hong, Hiroshi Nagamochi Convex drawings with non-convex boundary, Convex drawings with non-convex boundary, 2006 英語 公開
T. Fukunaga, Hiroshi Nagamoch T. Fukunaga, Hiroshi Nagamoch Approximating minimum cost multigraphs of specified edge-connectivity under degree bounds, Approximating minimum cost multigraphs of specified edge-connectivity under degree bounds, 2006 英語 公開
S.-H. Hong, Hiroshi Nagamochi S.-H. Hong, Hiroshi Nagamochi Convex drawings of hierarchical plane graphs Convex drawings of hierarchical plane graphs 2006 英語 公開
M. Sakashita, K. Makino, Hiroshi Nagamochi, S. Fujishige M. Sakashita, K. Makino, Hiroshi Nagamochi, S. Fujishige Minimum transversals in posi-modular systems Minimum transversals in posi-modular systems 2006 英語 公開
Kouji Hirata, Takahiro Matsuda, Hiroshi Nagamochi, Tetsuya Takine Kouji Hirata, Takahiro Matsuda, Hiroshi Nagamochi, Tetsuya Takine Contention-Free lambda-Planes in Optically Burst-Switched WDM Contention-Free lambda-Planes in Optically Burst-Switched WDM 2006 英語 公開
Y. Koga, M. Yagiura, K. Nonobe, T. Imamichi, Hiroshi Nagamochi, Toshihide Ibaraki, Y. Koga, M. Yagiura, K. Nonobe, T. Imamichi, Hiroshi Nagamochi, Toshihide Ibaraki, Efficient branch-and-bound algorithms for weighted MAX-2-SAT Efficient branch-and-bound algorithms for weighted MAX-2-SAT 2005 英語 公開
T. Fukunaga; H. Nagamochi T. Fukunaga; H. Nagamochi Approximation algorithms for the b-edge dominating set problem and its related problems Approximation algorithms for the b-edge dominating set problem and its related problems ,3595,747-756 2005 英語 公開
T. Ishii; K. Iwata; H. Nagamochi T. Ishii; K. Iwata; H. Nagamochi Bisecting a four-connected graph with three resource sets Bisecting a four-connected graph with three resource sets ,3827,176-185 2005 英語 公開
T. Ishii, H. Fujita, Hiroshi Nagamochi, T. Ishii, H. Fujita, Hiroshi Nagamochi, Minimum cost source location problem with local 3-vertex-connectivity requirements, Minimum cost source location problem with local 3-vertex-connectivity requirements, 2005 英語 公開
T. Ishii, K. Iwata, Hiroshi Nagamochi, T. Ishii, K. Iwata, Hiroshi Nagamochi, Bisecting a four-connected graph with three resource sets, Bisecting a four-connected graph with three resource sets, 2005 英語 公開
K. Haraguchi, Hiroshi Nagamochi, Toshihide Ibaraki K. Haraguchi, Hiroshi Nagamochi, Toshihide Ibaraki Compactness of classifiers by iterative compositions of features Compactness of classifiers by iterative compositions of features 2005 英語 公開
T. Fukunaga, Hiroshi Nagamochi, T. Fukunaga, Hiroshi Nagamochi, Edge packing problem with edge capacity constraints Edge packing problem with edge capacity constraints 2005 英語 公開
Y. Kamidoi, N. Yoshida, Hiroshi Nagamochi, Y. Kamidoi, N. Yoshida, Hiroshi Nagamochi, A deterministic algorithm for finding all minimum k-way cuts, A deterministic algorithm for finding all minimum k-way cuts, 2005 英語 公開
T. Imamichi, M. Kenmochi, K. Nonobe, M. Yagiura, Hiroshi Nagamochi T. Imamichi, M. Kenmochi, K. Nonobe, M. Yagiura, Hiroshi Nagamochi Branch-and-bound algorithms for rectangular strip packing and perfect packing problems, Branch-and-bound algorithms for rectangular strip packing and perfect packing problems, 2005 英語 公開
M. Kenmochi, T. Imamichi, K. Nonobe, M. Yagiura, Hiroshi Nagamochi, M. Kenmochi, T. Imamichi, K. Nonobe, M. Yagiura, Hiroshi Nagamochi, Exact algorithms for the 2-dimensional strip packing problem with rotations, Exact algorithms for the 2-dimensional strip packing problem with rotations, 2005 英語 公開
M. Nishihara, M. Yagiura, Toshihide Ibaraki, Hiroshi Nagamochi M. Nishihara, M. Yagiura, Toshihide Ibaraki, Hiroshi Nagamochi The relation between option pricing and optimization problems The relation between option pricing and optimization problems 2005 英語 公開
Hiroshi Nagamochi Hiroshi Nagamochi Heuristics for the Minmax Subtree Cover in Graphs Heuristics for the Minmax Subtree Cover in Graphs 2005 英語 公開
Y. Karuno, Hiroshi Nagamochi Y. Karuno, Hiroshi Nagamochi Minimizing capacitated tree covers of graphs Minimizing capacitated tree covers of graphs 2005 英語 公開
K. Haraguchi, Hiroshi Nagamochi, Toshihide Ibaraki K. Haraguchi, Hiroshi Nagamochi, Toshihide Ibaraki Experimental studies on representation complexity and error rates of iteratively composed features, Experimental studies on representation complexity and error rates of iteratively composed features, 2005 英語 公開
H. Nagamochi; T. Kawada H. Nagamochi; T. Kawada Approximating the minmax subtree cover problem in a cactus Approximating the minmax subtree cover problem in a cactus ,3341,705-716 2004 英語 公開
Hiroshi Nagamochi Hiroshi Nagamochi An improved approximation to the one-sided bilayer drawing An improved approximation to the one-sided bilayer drawing 2003 英語 公開
Hiroshi Nagamochi, K. Kuroya, Hiroshi Nagamochi, K. Kuroya, Convex drawing for c-planar biconnected clustered graphs Convex drawing for c-planar biconnected clustered graphs 2003 英語 公開
H. Nagamochi; K. Okada H. Nagamochi; K. Okada Polynomial time 2-approximation algorithms for the minmax subtree cover problem Polynomial time 2-approximation algorithms for the minmax subtree cover problem ,2906,138-147 2003 英語 公開
H. Nagamochi; Y. Abe H. Nagamochi; Y. Abe An approximation algorithm for dissecting a rectangle into rectangles with specified areas An approximation algorithm for dissecting a rectangle into rectangles with specified areas ,2906,280-289 2003 英語 公開
Y. Karuno; H. Nagamochi Y. Karuno; H. Nagamochi A better approximation for the two-machine flowshop scheduling problem with time lags A better approximation for the two-machine flowshop scheduling problem with time lags ,2906,309-318 2003 英語 公開
T. Ishii; S. Yamamoto; H. Nagamochi T. Ishii; S. Yamamoto; H. Nagamochi Augmenting forests to meet odd diameter requirements Augmenting forests to meet odd diameter requirements ,2906,434-443 2003 英語 公開
T. Ishii; Y. Akiyama; H. Nagamochi T. Ishii; Y. Akiyama; H. Nagamochi Minimum augmentation of edge-connectivity between vertices and sets of vertices in undirected graphs Minimum augmentation of edge-connectivity between vertices and sets of vertices in undirected graphs ,78,243-266 2003 英語 公開
永持 仁 永持 仁 A simple and robust algorithm for bisecting a triconnected graph with two resource sets, "jointly worked " A simple and robust algorithm for bisecting a triconnected graph with two resource sets, "jointly worked " 2003 英語 公開
永持 仁 永持 仁 A simple recognition of maximal planar graphs, "jointly worked " A simple recognition of maximal planar graphs, "jointly worked " 2003 英語 公開
永持 仁 永持 仁 Can a hypergraph cover every convex polygon?, "jointly worked " Can a hypergraph cover every convex polygon?, "jointly worked " 2003 英語 公開
永持 仁 永持 仁 Computing extreme sets in graphs and its applications Computing extreme sets in graphs and its applications 2003 英語 公開
永持 仁 永持 仁 Source location problem with local 3-vertex-connectivity requirements, "jointly worked " Source location problem with local 3-vertex-connectivity requirements, "jointly worked " 2003 英語 公開
Hiroshi Nagamochi, N. Yamada Hiroshi Nagamochi, N. Yamada Fast algorithms for counting bilayer crossings Fast algorithms for counting bilayer crossings 2003 英語 公開
H. Ito, Hiroshi Nagamochi H. Ito, Hiroshi Nagamochi Comparing hypergraphs by areas of hyperedges drawn on a convex polygon Comparing hypergraphs by areas of hyperedges drawn on a convex polygon 2002 英語 公開
H. Ito; H. Nagamochi; Y. Sugiyama; M. Fujita H. Ito; H. Nagamochi; Y. Sugiyama; M. Fujita File transfer tree problems File transfer tree problems ,2518,441-452 2002 英語 公開
Y. Karuno; H. Nagamochi Y. Karuno; H. Nagamochi A Polynomial Time Approximation Scheme for the Multi-vehicle Scheduling Problem on a Path with Release and Handling Times A Polynomial Time Approximation Scheme for the Multi-vehicle Scheduling Problem on a Path with Release and Handling Times ,2223,36-47 2001 英語 公開
H. Nagamochi; T. Ishii H. Nagamochi; T. Ishii On the minimum local-vertex-connectivity augmentation in graphs On the minimum local-vertex-connectivity augmentation in graphs ,2223,124-135 2001 英語 公開
L. Zhao; H. Nagamochi; T. Ibaraki L. Zhao; H. Nagamochi; T. Ibaraki A unified framework for approximating multiway partition problemsExtended Abstract A unified framework for approximating multiway partition problemsExtended Abstract ,2223,682-694 2001 英語 公開
Liang Zhao,Hiroshi Nagamochi,T. Ibaraki Liang Zhao,Hiroshi Nagamochi,T. Ibaraki A primal-dual approximation algorithm for the survival network design problem in hypergraphs A primal-dual approximation algorithm for the survival network design problem in hypergraphs 2001 英語 公開
Y. Karuno, Hiroshi Nagamochi Y. Karuno, Hiroshi Nagamochi A 2-approximation algorithm for the multi-vehicle scheduling on a path with release and handling times A 2-approximation algorithm for the multi-vehicle scheduling on a path with release and handling times 2001 英語 公開
Ishii, T; Nagamochi, H; Halldorsson, MM Ishii, T; Nagamochi, H; Halldorsson, MM On the minimum augmentation of an l-connected graph to a k-connected graph On the minimum augmentation of an l-connected graph to a k-connected graph ,1851,286-299 2000 英語 公開
T. Ishii, Hiroshi Nagamochi, T. Ishii, Hiroshi Nagamochi, Simultaneous augmentation of two graphs to an l-edge-connected graph and a biconnected graph Simultaneous augmentation of two graphs to an l-edge-connected graph and a biconnected graph 2000 英語 公開
Hiroshi Nagamochi,Takashi Shiraki,T. Ibaraki Hiroshi Nagamochi,Takashi Shiraki,T. Ibaraki Augmenting a submodular and posi-modular set function by a multigraph Augmenting a submodular and posi-modular set function by a multigraph 1999 英語 公開
Hiroshi Nagamochi,T. Ibaraki Hiroshi Nagamochi,T. Ibaraki An Approximation for Finding a Smallest 2-Edge-Connected Subgraph Containing a Specified Spanning Tree An Approximation for Finding a Smallest 2-Edge-Connected Subgraph Containing a Specified Spanning Tree 1999 英語 公開
Liang Zhao,Hiroshi Nagamochi,T. Ibaraki Liang Zhao,Hiroshi Nagamochi,T. Ibaraki Approximating the minimum k-way cut in a graph via minimum 3-way cuts Approximating the minimum k-way cut in a graph via minimum 3-way cuts 1999 英語 公開
Hiroshi Nagamochi,Tibor Jordan,Y. Nakao,T. Ibaraki Hiroshi Nagamochi,Tibor Jordan,Y. Nakao,T. Ibaraki Bisecting two subsets in 3-connected graphs Bisecting two subsets in 3-connected graphs 1999 英語 公開
Nagamochi, H; Ibaraki, T; Cornuejols, G; Burkard, RE; Woeginger, GJ Nagamochi, H; Ibaraki, T; Cornuejols, G; Burkard, RE; Woeginger, GJ A fast algorithm for computing minimum 3-way and 4-way cuts A fast algorithm for computing minimum 3-way and 4-way cuts ,1610,377-390 1999 英語 公開
永持 仁 永持 仁 Augmenting a submodular and posi-modular set function by a multigraph, "jointly worked " Augmenting a submodular and posi-modular set function by a multigraph, "jointly worked " 1999 英語 公開
Hiroshi Nagamochi,Shigeki Katayama,T. Ibaraki Hiroshi Nagamochi,Shigeki Katayama,T. Ibaraki Faster Algorithm for Computing Minimum 5-Way and 6-Way Cuts Faster Algorithm for Computing Minimum 5-Way and 6-Way Cuts 1999 英語 公開
永持 仁 永持 仁 Optimal augmentation of a biconnected graph to a k-edge-connected and triconnected graph, "jointly worked " Optimal augmentation of a biconnected graph to a k-edge-connected and triconnected graph, "jointly worked " 1998 英語 公開
Xiaotie Deng; Toshihide Ibaraki; Hiroshi Nagamochi Xiaotie Deng; Toshihide Ibaraki; Hiroshi Nagamochi Combinatorial optimization games Combinatorial optimization games ,720-729 1997 英語 公開
Hiroshi Nagamochi; Takashi Shiraki; Toshihide Ibaraki Hiroshi Nagamochi; Takashi Shiraki; Toshihide Ibaraki Computing edge-connectivity augmentation function in O(nm) time Computing edge-connectivity augmentation function in O(nm) time ,649-658 1997 英語 公開
永持 仁 永持 仁 Complexity of the single vehicle scheduling problem on graphs, "jointly worked " Complexity of the single vehicle scheduling problem on graphs, "jointly worked " 1995 英語 公開

  • <<
  • >>
  • 表示
タイトル言語:
書籍等出版物
著者 著者(日本語) 著者(英語) タイトル タイトル(日本語) タイトル(英語) 出版社 出版年月 記述言語 担当区分 公開
茨木 俊秀, 永持 仁 茨木 俊秀, 永持 仁 グラフ理論 連結構造とその応用 グラフ理論 連結構造とその応用 基礎数理講座, 朝倉書店 2010 日本語 公開
永持 仁 永持 仁 アルゴリズム工学―計算困難問題への挑戦―、第4.1章 グラフの連結度(共著) アルゴリズム工学―計算困難問題への挑戦―、第4.1章 グラフの連結度(共著) 共立出版,/ , 104-109 2001 日本語 公開
永持 仁 (分担執筆/62著者) 永持 仁 (分担執筆/62著者) アルゴリズム工学 - 計算困難問題への挑戦 - アルゴリズム工学 - 計算困難問題への挑戦 - 共立出版 2001 日本語 公開
茨木俊秀, 永持仁 茨木俊秀, 永持仁 「数理工学のすすめ」 「数理工学のすすめ」 現代数学社 2000 日本語 公開
永持仁(4著者) 永持仁(4著者) 離散構造とアルゴリズム VI 離散構造とアルゴリズム VI 近代科学社 1999 日本語 公開
永持 仁 永持 仁 離散構造とアルゴリズムⅥ、第3章「グラフの連結度増大問題とその周辺」 離散構造とアルゴリズムⅥ、第3章「グラフの連結度増大問題とその周辺」 近代科学社(インプレス) 1999 日本語 公開
永持 仁 (3共訳者) 永持 仁 (3共訳者) アルゴリズム入門 - 設計と解析 - アルゴリズム入門 - 設計と解析 - 星雲社 1998 日本語 公開
永持 仁 永持 仁 アルゴリズム入門 ―設計と解析―(共著) アルゴリズム入門 ―設計と解析―(共著) アジソン・ウエスレイ社, 1998 日本語 公開
永持 仁 永持 仁 数理工学のすすめ/木を見て森を見る 数理工学のすすめ/木を見て森を見る 現代数学社 1998 日本語 公開
永持 仁 永持 仁 新版情報処理ハンドブック(共著) 新版情報処理ハンドブック(共著) オーム社 1995 共著 公開
永持 仁 永持 仁 アルゴリズム辞典(共著) アルゴリズム辞典(共著) 共立出版 1995 共著 公開
永持 仁 永持 仁 離散構造とアルゴリズムⅡ、第4章「グラフの最小カット」 離散構造とアルゴリズムⅡ、第4章「グラフの最小カット」 近代科学社,155-208 1992 日本語 公開
Hiroshi Nagamochi, Toshihide Ibaraki Hiroshi Nagamochi, Toshihide Ibaraki Algorithmic Aspects of Graph Connectivities Algorithmic Aspects of Graph Connectivities Encyclopedia of Mathematics and Its Applications, Cambridge University Press 2008 英語 公開

  • <<
  • >>
  • 表示
タイトル言語:
学術賞等
賞の名称(日本語) 賞の名称(英語) 授与組織名(日本語) 授与組織名(英語) 年月
研究賞 情報処理学会 1990
研究賞(アルゴリズム研究会) 情報処理学会 1990
論文賞 電子情報通信学会 1998
論文賞 電子情報通信学会 1998
論文賞 電子情報通信学会 1999
第14回 日本IBM科学賞(コンピューターサインス分野) 2000
文献賞 文献賞日本オペレーションズ・リサーチ学会 2006
学会賞 (学術賞) スケジューリング学会 2006
業績賞 電子情報通信学会 2010
外部資金:競争的資金・科学研究費補助金
種別 代表/分担 テーマ(日本語) テーマ(英語) 期間
奨励研究(A) 組み合せ構造をもつ問題を解くアルゴリズムの研究 1998〜1998
特定領域研究 グラフ・ネットワーク問題を解くアルゴリズムの開発 1999〜1999
基盤研究(C) グラフ理論に基づく近似アルゴリズムの構築とネットワーク問題への応用 2004〜2004
特定領域研究 グラフ構造を有する問題に対する近似アルゴリズムの設計 2004〜2004
特定領域研究 グラフ構造を有する問題に対する近似アルゴリズムの設計 2005〜2005
基盤研究(C) グラフ・ネットワークの連結特性の解析とアルゴリズム設計への 応用 2005〜2005
特定領域研究 グラフ構造を有する問題に対する近似アルゴリズムの設計 2006〜2006
基盤研究(C) グラフ・ネットワークの連結特性の解析とアルゴリズム設計への 応用 2006〜2006
基盤研究(C) 図形充填問題に対するプラットフォームモデルの構築 2008〜2010
基盤研究(C) 代表 ネットワーク構造への変換に基づくアルゴリズム設計技術 2011〜2013
基盤研究(C) 代表 グラフ最適化問題に対する高速アルゴリズムの理論設計と実装開発 (平成26年度分) 2014/04/01〜2015/03/31
基盤研究(C) 代表 グラフ最適化問題に対する高速アルゴリズムの理論設計と実装開発 (平成27年度分) 2015/04/01〜2016/03/31

  • <<
  • >>
  • 表示
外部資金:競争的資金・科学研究費補助金以外
制度名 代表者名 研究課題(日本語) 研究課題(英語) 期間
離散最適化アルゴリズム Algorithms for Discrete optimization
ネットワーク問題に対する効率の良いアルゴリズムの開発 Development of Efficient Algorithms for Network Problems 1988〜
担当科目
講義名(日本語) 講義名(英語) 開講期 学部/研究科 年度
グラフ理論(数理) 前期 工学部 2011/04〜2012/03
離散数理特論 後期 情報学研究科 2011/04〜2012/03
数理工学特別研究1 通年 情報学研究科 2011/04〜2012/03
数理工学特別研究1 前期集中 情報学研究科 2011/04〜2012/03
数理工学特別研究1 後期集中 情報学研究科 2011/04〜2012/03
数理工学特別研究2 通年 情報学研究科 2011/04〜2012/03
数理工学特別研究2 後期集中 情報学研究科 2011/04〜2012/03
数理工学特別セミナー 通年 情報学研究科 2011/04〜2012/03
応用数学特別セミナー 後期 情報学研究科 2011/04〜2012/03
数理工学概論 前期 工学部 2011/04〜2012/03
最適化 Optimization 後期 経営管理教育部 2011/04〜2012/03
最適化(数理) 後期 工学部 2011/04〜2012/03
計画数学通論 後期 情報学研究科 2011/04〜2012/03
応用数学特別セミナー Seminar on Applied Mathematics, Advanced 後期 情報学研究科 2012/04〜2013/03
数理工学特別セミナー Seminar on Applied Mathematics and Physics, Advanced 通年 情報学研究科 2012/04〜2013/03
数理工学特別研究2 Advanced Study in Applied Mathematics and Physics II 後期前期 情報学研究科 2012/04〜2013/03
数理工学特別研究2 Advanced Study in Applied Mathematics and Physics II 後期集中 情報学研究科 2012/04〜2013/03
数理工学特別研究2 Advanced Study in Applied Mathematics and Physics II 通年 情報学研究科 2012/04〜2013/03
数理工学特別研究1 Advanced Study in Applied Mathematics and Physics I 前期集中 情報学研究科 2012/04〜2013/03
数理工学特別研究1 Advanced Study in Applied Mathematics and Physics I 後期集中 情報学研究科 2012/04〜2013/03
数理工学特別研究1 Advanced Study in Applied Mathematics and Physics I 通年 情報学研究科 2012/04〜2013/03
数理科学英語 English for Mathematical Science 後期 工学部 2012/04〜2013/03
最適化 Optimization 後期 工学部 2012/04〜2013/03
最適化 Optimization 後期 経営管理教育部 2012/04〜2013/03
グラフ理論 Graph Theory 前期 工学部 2012/04〜2013/03
科学英語(数理) Scientific English 後期 全学共通科目 2012/04〜2013/03
計画数学通論 Operations Research, Advanced 後期 情報学研究科 2012/04〜2013/03
離散数理特論 Discrete Mathematics, Advanced 後期 情報学研究科 2012/04〜2013/03
グラフ理論 Graph Theory 前期 工学部 2013/04〜2014/03
最適化 Optimization 後期 工学部 2013/04〜2014/03
数理科学英語 English for Mathematical Science 後期 工学部 2013/04〜2014/03
離散数理特論 Discrete Mathematics, Advanced 後期 情報学研究科 2013/04〜2014/03
数理工学特別研究1 Advanced Study in Applied Mathematics and Physics I 通年 情報学研究科 2013/04〜2014/03
数理工学特別研究2 Advanced Study in Applied Mathematics and Physics II 通年 情報学研究科 2013/04〜2014/03
数理工学特別セミナー Seminar on Applied Mathematics and Physics, Advanced 通年 情報学研究科 2013/04〜2014/03
応用数学特別セミナー Seminar on Applied Mathematics, Advanced 後期 情報学研究科 2013/04〜2014/03
最適化 Optimization 後期 経営管理教育部 2013/04〜2014/03
科学英語(数理) Scientific English 後期 全学共通科目 2013/04〜2014/03
グラフ理論 Graph Theory 前期 工学部 2014/04〜2015/03
最適化 Optimization 後期 工学部 2014/04〜2015/03
数理科学英語 English for Mathematical Science 後期 工学部 2014/04〜2015/03
離散数理特論 Discrete Mathematics, Advanced 後期 情報学研究科 2014/04〜2015/03
計画数学通論 Operations Research, Advanced 後期 情報学研究科 2014/04〜2015/03
数理工学特別研究1 Advanced Study in Applied Mathematics and Physics I 通年 情報学研究科 2014/04〜2015/03
数理工学特別研究2 Advanced Study in Applied Mathematics and Physics II 通年 情報学研究科 2014/04〜2015/03
数理工学特別セミナー Seminar on Applied Mathematics and Physics, Advanced 通年 情報学研究科 2014/04〜2015/03
応用数学特別セミナー Seminar on Applied Mathematics, Advanced 後期 情報学研究科 2014/04〜2015/03
最適化 Optimization 後期 経営管理教育部 2014/04〜2015/03
科学英語(数理) Scientific English 後期 全学共通科目 2014/04〜2015/03
特別研究1 Graduation Thesis 1 前期集中 工学部 2014/04〜2015/03
特別研究1 Graduation Thesis 1 後期集中 工学部 2014/04〜2015/03
特別研究2 Graduation Thesis 2 前期集中 工学部 2014/04〜2015/03
特別研究2 Graduation Thesis 2 後期集中 工学部 2014/04〜2015/03
応用数学特別セミナー Seminar on Applied Mathematics, Advanced 後期 情報学研究科 2015/04〜2016/03
数理工学特別セミナー Seminar on Applied Mathematics and Physics, Advanced 通年 情報学研究科 2015/04〜2016/03
数理工学特別研究2 Advanced Study in Applied Mathematics and Physics II 通年 情報学研究科 2015/04〜2016/03
数理工学特別研究1 Advanced Study in Applied Mathematics and Physics I 通年 情報学研究科 2015/04〜2016/03
最適化 Optimization 後期 工学部 2015/04〜2016/03
最適化 Optimization 後期 経営管理教育部 2015/04〜2016/03
グラフ理論 Graph Theory 前期 工学部 2015/04〜2016/03
離散数理特論 Discrete Mathematics, Advanced 後期 情報学研究科 2015/04〜2016/03
応用数学特別セミナー Seminar on Applied Mathematics, Advanced 後期 情報学研究科 2016/04〜2017/03
数理工学特別セミナー Seminar on Applied Mathematics and Physics, Advanced 通年 情報学研究科 2016/04〜2017/03
数理工学特別研究2 Advanced Study in Applied Mathematics and Physics II 通年 情報学研究科 2016/04〜2017/03
数理工学特別研究1 Advanced Study in Applied Mathematics and Physics I 通年 情報学研究科 2016/04〜2017/03
最適化 Optimization 後期 工学部 2016/04〜2017/03
最適化 Optimization 後期 経営管理教育部 2016/04〜2017/03
グラフ理論 Graph Theory 前期 工学部 2016/04〜2017/03
計画数学通論 Operations Research, Advanced 後期 情報学研究科 2016/04〜2017/03
離散数理特論 Discrete Mathematics, Advanced 後期 情報学研究科 2016/04〜2017/03

  • <<
  • >>
  • 表示
全学運営(役職等)
役職名 期間
発明評価委員会(ソフトウェア・コンテンツ分野拠点) 委員 2009/04/01〜2010/03/31
発明評価委員会(メディカル・バイオ分野拠点) 委員 2010/04/01〜2011/03/31
ジュニアキャンパス実施検討会 委員 2010/04/01〜2011/03/31
ジュニアキャンパス実施検討会 2010/04/01〜2014/03/31
ジュニアキャンパス実施検討会 2012/04/01〜2014/03/31
国際交流委員会 委員 2013/07/01〜2015/06/30
ジュニアキャンパス実施検討会 委員 2014/04/01〜2016/03/31
ジュニアキャンパス実施検討会 委員 2010/04/01〜2016/03/31
部局運営(役職等)
役職名 期間
専攻長会議 2011/04/01〜2012/03/31
情報セキュリティ委員委員 2011/04/01〜2012/03/31
企画委員会委員 2012/04/01〜2015/03/31
評価・広報委員会委員 2015/04/01〜2016/03/31
評価・広報委員会副委員長 2016/04/01〜2017/03/31