永持 仁

最終更新日時: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,NAGAMOCHI Hiroshi Characterizing Output Locations of GSP Mechanisms to Obnoxious Facility Game in Trees IEICE Transactions Inf. and Syst.,E99-D,3 2016/03 英語
Ken Iwaide,NAGAMOCHI Hiroshi 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 Algorithmica,74,2,713-741 2016 英語
Mingyu Xiao,NAGAMOCHI Hiroshi An exact algorithm for maximum independent set in degree-5 graphs Discrete Applied Mathematics,199,137-155 2016 英語
M. Xiao,NAGAMOCHI Hiroshi 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 Some Reduction Procedure for Computing Pathwidth of Undirected Graphs IEICE Transactions,98-D,3,503-511 2015 英語
Mingyu Xiao,NAGAMOCHI Hiroshi A refined exact algorithm for Edge Dominating Set Theor. Comput. Sci.,560,207-216 2014 英語
Masaki Suzuki,NAGAMOCHI Hiroshi Efficient enumeration of monocyclic chemical graphs with given path frequencies J. Cheminformatics,6,1,31-31 2014 英語
Toshihiro Shimizu Takuro Fukunaga,NAGAMOCHI Hiroshi 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. 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. Algorithmica,62,3-4,1122-1158 2012 英語
Y. Karuno; H. Nagamochi; J. Uchida 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 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シンポジウム(計算機科学基礎理論ワークショップ)論文小特集) 電子情報通信学会論文誌. D-I, 情報・システム, I-情報処理,86,2,53-68 2003/02/01 日本語
永持 仁 数理工学のすすめ--木を見て森を見る 理系への数学,31,8,62-66 1998/08 日本語
永持仁;牧野和久;ZENG D‐Z;村田真紀;茨木俊秀 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つのコメント(共著) 人工知能学会論文誌,10/3, 464-467 1995 日本語
永持 仁 基数3のカットセット数を最小にする2-辺連結グラフ 電子情報通信学会論文誌 A 基礎・境界,73,7,1281-1285 1990/07 日本語
永持 仁 組合せ最適化における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に対する多品種流問題(共著) 電子情報通信学会誌,J71-A/9, 1328-1339 1987 日本語
永持 仁 確率付きネットワーク上の期待最大流について(共著) 電子情報通信学会誌,J72-A/10, 1611-1620 日本語
M. Xiao; H. Nagamochi Confining sets and avoiding bottleneck cases: A simple maximum independent set algorithm in degree-3 graphs Theoretical Computer Science,469,92-104 2013 英語
M. Xiao; T. Fukunaga; H. Nagamochi FPTASs for trimming weighted trees Theoretical Computer Science,469,105-118 2013 英語
A. Shurbevski; H. Nagamochi; Y. Karuno Better approximation algorithms for grasp-and-delivery robot routing problems IEICE Transactions on Information and Systems,E96-D,3,450-456 2013 英語
M. Xiao; H. Nagamochi Exact algorithms for annotated edge dominating set in graphs with degree bounded by 3 IEICE Transactions on Information and Systems,E96-D,3,408-418 2013 英語
M. Xiao; H. Nagamochi Parameterized edge dominating set in graphs with degree bounded by 3 Theoretical Computer Science,508,2-15 2013 英語
Y. Zhao; M. Hayashida; J. Jindalertudomdee; H. Nagamochi; T. Akutsu Breadth-first search approach to enumeration of tree-like chemical compounds Journal of Bioinformatics and Computational Biology,11,6 2013 英語
M. Xiao; H. Nagamochi An FPT algorithm for edge subset feedback edge set Information Processing Letters,112,1-2,5-9 2012 英語
T. Imada; H. Nagamochi Indexing all rooted subgraphs of a rooted graph IEICE Transactions on Information and Systems,E95-D,3,712-721 2012 英語
S.-H. Hong; H. Nagamochi Minimum cost star-shaped drawings of plane graphs with a fixed embedding and concave corner constraints Theoretical Computer Science,445,36-51 2012 英語
Y. Arahori; T. Imamichi; H. Nagamochi An exact strip packing algorithm based on canonical forms Computers and Operations Research,39,12,2991-3011 2012 英語
A. Shurbevski; Y. Karuno; H. Nagamochi A dynamic programming based improvement heuristic for a repetitive routing problem of grasp-and-delivery robots Journal of Advanced Mechanical Design, Systems and Manufacturing,6,5,611-621 2012 英語
Y. Zhao; M. Hayashida; J.C. Nacher; H. Nagamochi; T. Akutsu Protein complex prediction via improved verification methods using constrained domain-domain matching International Journal of Bioinformatics Research and Applications,8,3-4,210-227 2012 英語
H. Aota; T. Fukunaga; H. Nagamochi An approximation algorithm for locating maximal disks within convex polygons International Journal of Computational Geometry and Applications,21,6,661-684 2011/12 英語
S.-H. Hong; H. Nagamochi Extending Steinitz\\'s theorem to upward star-shaped polyhedra and spherical polyhedra Algorithmica (New York),61,4,1022-1076 2011/12 英語
T. Imada; S. Ota; H. Nagamochi; T. Akutsu Efficient enumeration of stereoisomers of outerplanar chemical graphs using dynamic programming Journal of Chemical Information and Modeling,51,11,2788-2807 2011/11 英語
T. Akutsu; H. Nagamochi Kernel methods for chemical compounds: From classification to design IEICE Transactions on Information and Systems,E94D,10,1846-1853 2011/10 英語
K. Matsumoto; S. Umetani; H. Nagamochi On the one-dimensional stock cutting problem in the paper tube industry Journal of Scheduling,14,3,281-290 2011/06 英語
H. Nagamochi Coprobber guarding game with cycle robber-region Theoretical Computer Science,412,4-5,383-390 2011/02/04 英語
E. Morsy; H. Nagamochi Approximating capacitated tree-routings in networks Journal of Combinatorial Optimization,21,2,254-267 2011/02 英語
B. Zhuang; H. Nagamochi Generation of symmetric and asymmetric biconnected rooted triangulated planar graphs IEICE Transactions on Information and Systems,E94D,2,200-210 2011/02 英語
B. Zhuang; H. Nagamochi Generation of symmetric and asymmetric biconnected rooted outerplanar graphs IEICE Transactions on Information and Systems,E94D,2,211-219 2011/02 英語
S. Imahori; Y. Karuno; H. Nagamochi; X. Wang Kansei engineering, humans and computers: Efficient dynamic programming algorithms for combinatorial food packing problems International Journal of Biometrics,3,3,228-245 2011 英語
Y. Karuno; H. Nagamochi; A. Shurbevski An approximation algorithm with factor two for a repetitive routing problem of grasp-and-delivery robots Journal of Advanced Computational Intelligence and Intelligent Informatics,15,8,1103-1108 2011 英語
S. Karakawa; E. Morsy; H. Nagamochi Minmax tree cover in the euclidean space Journal of Graph Algorithms and Applications,15,3,345-371 2011 英語
T. Imada; S. Ota; H. Nagamochi; T. Akutsu Efficient enumeration of stereoisomers of tree structured molecules using dynamic programming Journal of Mathematical Chemistry,49,4,910-970 2011 英語
T. Ibaraki; T. Imamichi; Y. Koga; H. Nagamochi; K. Nonobe; M. Yagiura Efficient branch-and-bound algorithms for weighted MAX-2-SAT Mathematical Programming,127,2,297-343 2011 英語
S.-H. Hong; H. Nagamochi A Linear-Time Algorithm for Star-Shaped Drawings of Planar Graphs with the Minimum Number of Concave Corners Algorithmica (New York),1-37 2011 英語
S.-H. Hong; H. Nagamochi Guest editors\\' foreword International Journal of Computational Geometry and Applications,21,3,251-252 2011 英語
S.-H. Hong; H. Nagamochi Editorial: ISAAC 2008 special issue Algorithmica (New York),61,4,777-778 2011 英語
T. Ohshima; P. Eumthurapojn; L. Zhao; H. Nagamochi An A* algorithm framework for the point-to-point time-dependent shortest path problem Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics),7033 LNCS,154-163 2011 英語
M. Shimizu; H. Nagamochi; T. Akutsu Enumerating tree-like chemical graphs with given upper and lower bounds on path frequencies. BMC bioinformatics,12 Suppl 14,S3 2011 英語
T. Fukunaga; H. Nagamochi Network design with weighted degree constraints Discrete Optimization,7,4,246-255 2010/11 英語
S. Ota; E. Morsy; H. Nagamochi A plane graph representation of triconnected graphs Theoretical Computer Science,411,44-46,3979-3993 2010/10/25 英語
S.-H. Hong; H. Nagamochi A linear-time algorithm for symmetric convex drawings of internally triconnected plane graphs Algorithmica (New York),58,2,433-460 2010/10 英語
S.-H. Hong; H. Nagamochi Approximation algorithms for minimizing edge crossings in radial drawings Algorithmica (New York),58,2,478-497 2010/10 英語
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 Journal of Chemical Information and Modeling,50,5,934-946 2010/05 英語
T. Ishii; Y. Akiyama; H. Nagamochi Minimum augmentation of edge-connectivity between vertices and sets of vertices in undirected graphs Algorithmica (New York),56,4,413-436 2010/04 英語
E. Morsy; H. Nagamochi Approximation to the minimum cost edge installation problem IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences,E93A,4,778-786 2010/04 英語
S.-H. Hong; H. Nagamochi An algorithm for constructing star-shaped drawings of plane graphs Computational Geometry: Theory and Applications,43,2,191-206 2010/02 英語
H. Nagamochi Minimum degree orderings Algorithmica (New York),56,1,17-34 2010/01 英語
Y. Karuno; H. Nagamochi; X. Wang Optimization problems and algorithms in double-layered food packing systems* Journal of Advanced Mechanical Design, Systems and Manufacturing,4,3,605-615 2010 英語
B. Zhuang; H. Nagamochi Enumerating rooted graphs with reflectional block structures Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics),6078 LNCS,49-60 2010 英語
B. Zhuang; H. Nagamochi Generating internally triconnected rooted plane graphs Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics),6108 LNCS,467-478 2010 英語
K. Haraguchi; S.-H. Hong; H. Nagamochi Multiclass visual classifier based on bipartite graph representation of decision tables Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics),6073 LNCS,169-183 2010 英語
E. Morsy; H. Nagamochi On the approximation of the generalized capacitated tree-routing problem Journal of Discrete Algorithms,8,3,311-320 2010 英語
S.-H. Hong; H. Nagamochi Convex drawings of hierarchical planar graphs and clustered planar graphs Journal of Discrete Algorithms,8,3,282-295 2010 英語
B. Zhuang; H. Nagamochi Constant time generation of biconnected rooted plane graphs Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics),6213 LNCS,113-123 2010 英語
M. Xiao; T. Fukunaga; H. Nagamochi FPTAS\\'s for some cut problems in weighted trees Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics),6213 LNCS,210-221 2010 英語
K. Okumoto; T. Fukunaga; H. Nagamochi Divide-and-Conquer Algorithms for Partitioning Hypergraphs and Submodular Systems Algorithmica (New York),1-20 2010 英語
B. Zhuang; H. Nagamochi Listing triconnected rooted plane graphs Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics),6509 LNCS,PART 2,347-361 2010 英語
B. Zhuang; H. Nagamochi Generating trees on multisets Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics),6506 LNCS,PART 1,182-193 2010 英語
T. Imamichi; M. Yagiura; H. Nagamochi An iterated local search algorithm based on nonlinear programming for the irregular strip packing problem Discrete Optimization,6,4,345-361 2009/11 英語
M. Kenmochi; T. Imamichi; K. Nonobe; M. Yagiura; H. Nagamochi Exact algorithms for the two-dimensional strip packing problem with and without rotations European Journal of Operational Research,198,1,73-83 2009/10/01 英語
T. Fukunaga; H. Nagamochi Network design with edge-connectivity and degree constraints Theory of Computing Systems,45,3,512-532 2009/10 英語
A. Kawaguchi; H. Nagamochi Drawing slicing graphs with face areas Theoretical Computer Science,410,11,1061-1072 2009/03/06 英語
T. Fukunaga; H. Nagamochi Eulerian detachments with local edge-connectivity Discrete Applied Mathematics,157,4,691-698 2009/02/28 英語
H. Nagamochi A detachment algorithm for inferring a graph from path frequency Algorithmica (New York),53,2,207-224 2009/02 英語
UCHIDA Jun;KARUNO Yoshiyuki;NAGAMOCHI Hiroshi Scheduling Capacitated One-Way Vehicles on Paths with Deadlines SICE J Control Meas Syst Integr,2,1,20-26 2009/01/31 英語
M. Sakashita; K. Makino; H. Nagamochi; S. Fujishige Minimum transversals in posimodular systems SIAM Journal on Discrete Mathematics,23,2,858-871 2009 英語
T. Fukunaga; H. Nagamochi Network design with weighted degree constraints Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics),5431 LNCS,214-225 2009 英語
S. Karakawa; E. Morsy; H. Nagamochi Minmax tree cover in the euclidean space Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics),5431 LNCS,202-213 2009 英語
T. Imamichi; Y. Arahori; J. Gim; S.-H. Hong; H. Nagamochi Removing node overlaps using multi-sphere scheme Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics),5417 LNCS,296-301 2009 英語
H. Nagamochi Cop-robber guarding game with cycle robber region Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics),5598 LNCS,74-84 2009 英語
S.-H. Hong; H. Nagamochi Upward star-shaped polyhedral graphs Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics),5878 LNCS,913-922 2009 英語
K. Okumoto; T. Fukunaga; H. Nagamochi Divide-and-conquer algorithms for partitioning hypergraphs and submodular systems Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics),5878 LNCS,55-64 2009 英語
Y. Nakao; H. Nagamochi Worst case analysis for pickup and delivery problems with consecutive pickups and deliveries Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics),5878 LNCS,554-563 2009 英語
S.-H. Hong; H. Nagamochi New approximation to the one-sided radial crossing minimization Journal of Graph Algorithms and Applications,13,2,179-196 2009 英語
T. Imamichi; H. Nagamochi Performance analysis of a collision detection algorithm of spheres based on slab partitioning IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences,E91A,9,2308-2313 2008/09 英語
Y. Nakao; H. Nagamochi Worst case analysis for pickup and delivery problems with transfer IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences,E91A,9,2328-2334 2008/09 英語
H. Fujiwara; J. Wang; L. Zhao; H. Nagamochi; T. Akutsu Enumerating treelike chemical graphs with given path frequency Journal of Chemical Information and Modeling,48,7,1345-1357 2008/07 英語
S.-H. Hong; H. Nagamochi Convex drawings of graphs with non-convex boundary constraints Discrete Applied Mathematics,156,12,2368-2380 2008/06/28 英語
H. Nagamochi; T. Ohnishi Approximating a vehicle scheduling problem with time windows and handling times Theoretical Computer Science,393,1-3,133-146 2008/03/20 英語
HAYASHIDA Morihiro;AKUTSU Tatsuya;NAGAMOCHI Hiroshi 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 An improved approximation algorithm for capacitated multicast routings in networks Theoretical Computer Science,390,1,81-91 2008/01/22 英語
S.-H. Hong; H. Nagamochi Approximating crossing minimization in radial layouts Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics),4957 LNCS,461-472 2008 英語
E. Morsy; H. Nagamochi Approximating the generalized capacitated tree-routing problem Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics),5092 LNCS,621-630 2008 英語
S.-H. Hong; H. Nagamochi Star-shaped drawings of graphs with fixed embedding and concave corner constraints Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics),5092 LNCS,405-414 2008 英語
T. Fukunaga; H. Nagamochi Approximating minimum cost multigraphs of specified edge-connectivity under degree bounds Journal of the Operations Research Society of Japan,50,4,339-349 2007/12 英語
Y. Karuno; H. Nagamochi; X. Wang Bi-criteria food packing by dynamic programming Journal of the Operations Research Society of Japan,50,4,376-389 2007/12 英語
H. Nagamochi; K. Okada Approximating the minmax rooted-tree cover in a tree Information Processing Letters,104,5,173-178 2007/11/30 英語
T. Ishii; H. Fujita; H. Nagamochi The source location problem with local 3-vertex-connectivity requirements Discrete Applied Mathematics,155,18,2523-2538 2007/11/01 英語
A. Berger; T. Fukunaga; H. Nagamochi; O. Parekh Approximability of the capacitated b-edge dominating set problem Theoretical Computer Science,385,1-3,202-213 2007/10/15 英語
K. Hirata; T. Matsuda; H. Nagamochi; T. Takine Contention-free λ-planes in optically burst-switched WDM networks IEICE Transactions on Communications,E90B,9,2524-2531 2007/09 英語
T. Fukunaga; H. Nagamochi Generalizing the induced matching by edge capacity constraints Discrete Optimization,4,2,198-205 2007/06/01 英語
T. Ishii; K. Iwata; H. Nagamochi Bisecting a 4-connected graph with three resource sets Discrete Applied Mathematics,155,11,1441-1450 2007/06 英語
H. Nagamochi; K. Kuroya Drawing c-planar biconnected clustered graphs Discrete Applied Mathematics,155,9,1155-1174 2007/05/01 英語
E. Mosry; H. Nagamochi Approximation algorithms for multicast routings in a network with multi-sources IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences,E90A,5,900-906 2007/05 英語
H. Nagamochi; Y. Kamidoi Minimum cost subpartitions in graphs Information Processing Letters,102,2-3,79-84 2007/04/30 英語
T. Ishii; H. Fujita; H. Nagamochi Minimum cost source location problem with local 3-vertex-connectivity requirements Theoretical Computer Science,372,1,81-93 2007/03/06 英語
H. Nagamochi; Y. Abe An approximation algorithm for dissecting a rectangle into rectangles with specified areas Discrete Applied Mathematics,155,4,523-537 2007/02/15 英語
H. Nagamochi Computing a minimum cut in a graph with dynamic edges incident to a designated vertex IEICE Transactions on Information and Systems,E90D,2,428-431 2007/02 英語
T. Fukunaga; H. Nagamochi Approximating a generalization of metric TSP IEICE Transactions on Information and Systems,E90D,2,432-439 2007/02 英語
Nakao, Yoshitaka; Nagamochi, Hiroshi A DP-based Heuristic Algorithm for the Discrete Split Delivery Vehicle Routing Problem JOURNAL OF ADVANCED MECHANICAL DESIGN SYSTEMS AND MANUFACTURING,1,2,217-226 2007 英語
H. Nagamochi Algorithms for the minimum partitioning problems in graphs Electronics and Communications in Japan, Part III: Fundamental Electronic Science (English translation of Denshi Tsushin Gakkai Ronbunshi),90,10,63-78 2007 英語
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 Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics),4638 LNCS,121-135 2007 英語
H. Ito; H. Nagamochi Two equivalent measures on weighted hypergraphs Discrete Applied Mathematics,154,16,2330-2334 2006/11/01 英語
H. Nagamochi Sparse connectivity certificates via MA orderings in graphs Discrete Applied Mathematics,154,16,2411-2417 2006/11/01 英語
H. Nagamochi Packing soft rectangles International Journal of Foundations of Computer Science,17,5,1165-1178 2006/10 英語
T. Ishii; S. Yamamoto; H. Nagamochi Augmenting forests to meet odd diameter requirements Discrete Optimization,3,2,154-164 2006/06/01 英語
H. Nagamochi; T. Kawada Minmax subtree cover problem on cacti Discrete Applied Mathematics,154,8,1254-1263 2006/05/15 英語
H. Nagamochi A fast edge-splitting algorithm in edge-weighted graphs IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences,E89A,5,1263-1268 2006/05 英語
T. Ishii; H. Nagamochi; T. Ibaraki Augmenting a (k - 1)-vertex-connected multigraph to an ℓ-edge-connected and k-vertex-connected multigraph Algorithmica (New York),44,3,257-280 2006/04 英語
H. Nagamochi Increasing the edge-connectivity by contracting a vertex subset in graphs IEICE Transactions on Information and Systems,E89D,2,744-750 2006/02 英語
P. Eades; Q. Feng; X. Lin; H. Nagamochi Straight-line drawing algorithms for hierarchical graphs and clustered graphs Algorithmica (New York),44,1,1-32 2006/01 英語
Y. Kamidoit; N. Yoshidat; H. Nagamochi A deterministic algorithm for finding all minimum k-way cuts SIAM Journal on Computing,36,5,1329-1341 2006 英語
T. Fukunaga; H. Nagamochi Some Theorems on Detachments Preserving Local-Edge-Connectivity Electronic Notes in Discrete Mathematics,24,173-180 2006 英語
H. Nagamochi; K. Iwata; T. Ishii A robust algorithm for bisecting a triconnected graph with two resource sets Theoretical Computer Science,341,1-3,364-378 2005/09/05 英語
H. Nagamochi A 4/3-approximation for the minimum 2-local-vertex-connectivity augmentation in a connected graph Journal of Algorithms,56,2,77-95 2005/08 英語
H. Nagamochi Packing unit squares in a rectangle Electronic Journal of Combinatorics,12,1 2005/07/29 英語
H. Nagamochi Approximating the minmax rooted-subtree cover problem IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences,E88A,5,1335-1338 2005/05 英語
H. Nagamochi An improved bound on the one-sided minimum crossing number in two-layered drawings Discrete and Computanional Geometry,33,4,565-591 2005/04 英語
H. Nagamochi On computing minimum (s,t)-cuts in digraphs Information Processing Letters,93,5,231-237 2005/03/16 英語
H. Nagamochi On the one-sided crossing minimization in a bipartite graph with large degrees Theoretical Computer Science,332,1-3,417-446 2005/02/28 英語
L. Zhao; H. Nagamochi; T. Ibaraki Greedy splitting algorithms for approximating multiway partition problems Mathematical Programming,102,1,167-183 2005/01 英語
H. Nagamochi On 2-approximation to the vertex-connectivity in graphs IEICE Transactions on Information and Systems,E88D,1,12-16 2005/01 英語
Y. Karuno, Hiroshi Nagamochi Scheduling vehicles on trees Pacific Journal of Optimization,vol. 1, no. 3, pp. 527-543. 2005 英語
H. Nagamochi Graph algorithms for network connectivity problems Journal of the Operations Research Society of Japan,47,4,199-223 2004/12 英語
L. Zhao; H. Nagamochi; T. Ibaraki On generalized greedy splitting algorithms for multiway partition problems Discrete Applied Mathematics,143,1-3,130-143 2004/09/30 英語
H. Nagamochi; N. Yamada Counting edge crossings in a 2-layered drawing Information Processing Letters,91,5,221-225 2004/09/15 英語
H. Nagamochi; K. Okada A faster 2-approximation algorithm for the minmax p -traveling salesmen problem on a tree Discrete Applied Mathematics,140,1-3,103-114 2004/05/15 英語
H. Nagamochi; T. Suzuki; T. Ishii A simple recognition of maximal planar graphs Information Processing Letters,89,5,223-226 2004/03/16 英語
Y. Karuno; H. Nagamochi An approximability result of the multi-vehicle scheduling problem on a path with release and handling times Theoretical Computer Science,312,2-3,267-280 2004/01/30 英語
H. Nagamochi; K. Kuroya Convex drawing for c-planar biconnected clustered graphs Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics),2912,369-380 2004 英語
H. Nagamochi An improved approximation to the one-sided bilayer drawing Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics),2912,406-418 2004 英語
H. Nagamochi; Y. Nishida; T. Ibaraki Approximability of the Minimum Maximal Matching Problem in Planar Graphs IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences,E86A,12,3251-3258 2003/12 英語
Karuno, Y; Nagamochi, H 2-Approximation algorithms for the multi-vehicle scheduling problem on a path with release and handling times DISCRETE APPLIED MATHEMATICS,129,2-3,433-447 2003/08/01 英語
Nagamochi, H; Ishii, T On the minimum local-vertex-connectivity augmentation in graphs DISCRETE APPLIED MATHEMATICS,129,2-3,475-486 2003/08/01 英語
H. Nagamochi; P. Eades An edge-splitting algorithm in planar graphs Journal of Combinatorial Optimization,7,2,137-159 2003/06 英語
L. Zhao; H. Nagamochi; T. Ibaraki A linear time 5/3-approximation for the minimum strongly-connected spanning subgraph problem Information Processing Letters,86,2,63-70 2003/04/30 英語
L. Zhao; H. Nagamochi; T. Ibaraki A primal-dual approximation algorithm for the survivable network design problem in hypergraphs Discrete Applied Mathematics,126,2-3,275-289 2003/03/15 英語
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 IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS,E86D,2,179-185 2003/02 英語
永持 仁 Algorithms for the minimum partitioning problems in graphs The Institute of Electronics, Information and Communication Engineers Transactions on Information and Systems,J86-D-I/2, 53-68 2003 英語
H. Nagamochi An approximation for finding a smallest 2-edge-connected subgraph containing a specified spanning tree Discrete Applied Mathematics,126,1,83-113 2003 英語
H. Nagamochi; T. Ibaraki Graph connectivity and its augmentation: Applications of MA orderings Discrete Applied Mathematics,123,1-3,447-472 2002/11/15 英語
Y. Karuno; H. Nagamochi; T. Ibaraki Better Approximation Ratios for the Single-Vehicle Scheduling Problems on Line-Shaped Networks Networks,39,4,203-209 2002/07 英語
T. Fujito; H. Nagamochi A 2-approximation algorithm for the minimum weight edge dominating set problem Discrete Applied Mathematics,118,3,199-207 2002/05/15 英語
L. Zhao; H. Nagamochi; T. Ibaraki A note on approximating the survivable network design problem in hypergraphs IEICE Transactions on Information and Systems,E85D,2,322-326 2002/02 英語
H. Nagamochi; T. Jordán; Y. Nakao; T. Ibaraki Convex embeddings and bisections of 3-connected graphs Combinatorica,22,4,537-554 2002 英語
H. Ito; H. Nagamochi Comparing hypergraphs by areas of hyperedges drawn on a convex polygon Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics),2866,176-181 2002 英語
Y. Karuno; H. Nagamochi A better approximation for the two-stage assembly scheduling problem with two machines at the first stage Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics),2518 LNCS,199-210 2002 英語
永持 仁 On the minimum edge- and vertex-connectivity augmentation in multigraphs, "jointly worked " The Second Japanese-Sino Optimization Meeting,/ , 61 2002 英語
H. Nagamochi; T. Ishii; H. Ito Minimum cost source location problem with vertex-connectivity requirements in digraphs Information Processing Letters,80,6,287-293 2001/12/31 英語
L. Zhao; H. Nagamochi; T. Ibaraki Approximating the Minimum k-way Cut in a Graph via Minimum 3-way Cuts Journal of Combinatorial Optimization,5,4,397-410 2001/12 英語
T. Hasunuma; H. Nagamochi Independent spanning trees with small depths in iterated line digraphs Discrete Applied Mathematics,110,2-3,189-211 2001/06/15 英語
H. Nagamochi; T. Shiraki; T. Ibaraki Augmenting a Submodular and Posi-modular Set Function by a Multigraph Journal of Combinatorial Optimization,5,2,175-212 2001/06 英語
T. Ishii; H. Nagamochi; T. Ibaraki Multigraph augmentation under biconnectivity and general edge-connectivity requirements Networks,37,3,144-155 2001/05 英語
H. Nagamochi; K. Mochizuki; T. Ibaraki Solving the single-vehicle scheduling problems for all home locations under depth-first routing on a tree IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences,E84A,5,1135-1143 2001/05 英語
H. Nagamochi; T. Hasunuma An Efficient script N signScript C sign Algorithm for a Sparse k-Edge-Connectivity Certificate Journal of Algorithms,38,2,354-373 2001/02 英語
H. Nagamochi; M. Miller; Slamin Bounds on the number of isolates in sum graph labeling Discrete Mathematics,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 " Lecture Notes in Computer Science,V 2161, 218-229 2001 英語
永持 仁 A primal-dual approximation algorithm for the survivable network design problem in hypergraphs, "jointly worked " Lecture Notes in Computer Science,V2010, 478-489 2001 英語
永持 仁 A unified framework for approximating some partition problems via greedy splitting, "jointly worked " Lecture Notes in Computer Science,V2223, 682-694 2001 英語
永持 仁 Bounds on sum number in graphs, "jointly worked " Discrete Mathematics,240/1-3, 175-185 2001 英語
Hiroshi Nagamochi, M. Miller, Slamin Bounds on sum number in graphs Discrete Mathematics, vol.240, no.1-3,pp.175-185 2001 英語
H. Nagamochi; T. Ibaraki Polyhedral structure of submodular and posi-modular systems Discrete Applied Mathematics,107,1-3,165-189 2000/12/21 英語
H. Nagamochi; T. Ibaraki A fast algorithm for computing minimum 3-way and 4-way cuts Mathematical Programming, Series B,88,3,507-520 2000/09 英語
H. Nagamochi; S. Katayama; T. Ibaraki A Faster Algorithm for Computing Minimum 5-Way and 6-Way Cuts in Graphs Journal of Combinatorial Optimization,4,2,151-169 2000/06 英語
H. Nagamochi; Y. Nakao; T. Ibaraki A Fast Algorithm for Cactus Representations of Minimum Cuts Japan Journal of Industrial and Applied Mathematics,17,2,245-264 2000/06 英語
X. Deng; T. Ibaraki; H. Nagamochi; W. Zang Totally balanced combinatorial optimization games Mathematical Programming, Series B,87,3,441-452 2000/05 英語
H. Nagamochi; K. Seki; T. Ibaraki A 7/3-approximation for the minimum weight 3-connected spanning subgraph problem IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences,E83A,4,687-691 2000/04 英語
T. Ishii; H. Nagamochi; T. Baraki Optimal Augmentation of a 2-Vertex-Connected Multigraph to an ℓ-Edge-Connected and 3-Vertex-Connected Multigraph Journal of Combinatorial Optimization,4,1,35-77 2000/03 英語
Nagamochi, H Recent development of graph connectivity augmentation algorithms IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS,E83D,3,372-383 2000/03 英語
Nagamochi, H; Nakamura, S; Ibaraki, T A simplified (O)over-tilde(nm) time edge-splitting algorithm in undirected graphs ALGORITHMICA,26,1,50-67 2000/01 英語
Zhao, L; Nagamochi, H; Ibaraki, T; Aggarwal, A; Rangan, CP Approximating the minimum k-way cut in a graph via minimum 3-way cuts ALGORITHMS AND COMPUTATIONS,1741,373-382 2000 英語
Nagamochi, H; Jordan, T; Nakao, Y; Ibaraki, T; Aggarwal, A; Rangan, CP Bisecting two subsets in 3-connected graphs ALGORITHMS AND COMPUTATIONS,1741,425-434 2000 英語
H. Nagamochi; S. Nakamura; T. Ibaraki A simplified Õ(nm) time edge-splitting algorithm in undirected graphs Algorithmica (New York),26,1,50-67 2000 英語
永持 仁 Simultaneous augmentation of two graphs to an l-edge-connected graph and a biconnected graph, "jointly worked " Lecture Notes in Computer Science,V1969, 326-337 2000 英語
H. Nagamochi; T. Ishii; T. Ibaraki A simple proof of a minimum cut algorithm and its applications IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences,E82A,10,2231-2236 1999/10 英語
H. Nagamochi; T. Ibaraki An Approximation of the Minimum Vertex Cover in a Graph Japan Journal of Industrial and Applied Mathematics,16,3,369-375 1999/10 英語
X. Deng; T. Ibaraki; H. Nagamochi Algorithmic aspects of the core of combinatorial optimization games Mathematics of Operations Research,24,3,751-766 1999/08 英語
H. Nagamochi; T. Ibaraki Augmenting Edge-Connectivity over the Entire Range in Õ(nm) Time Journal of Algorithms,30,2,253-301 1999/02 英語
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 ALGORITHMS - ESA'99,1643,414-425 1999 英語
NAGAMOCHI H;KATAYAMA S;IBARAKI T A Faster Algorithm for Computing Minimum 5-Way and 6-Way Cuts in Graphs. Lect Notes Comput Sci,1627,164-173 1999 英語
M. Kato; R. Kawakita; H. Nagamochi; Y. Oie A reconfigurative algorithm for torus lightwave networks Electronics and Communications in Japan, Part I: Communications (English translation of Denshi Tsushin Gakkai Ronbunshi),82,6,34-44 1999 英語
永持 仁 An approximation for finding a smallest 2-edge-connected subgraph containing a specified spanning tree, "jointly worked " Lecture Notes in Computer Science,V1627, 31-40 1999 英語
永持 仁 Drawing clustered graphs on an orthogonal grid, "jointly worked " Journal of Graph Algorithms and Application,3/4, 3-29 1999 英語
P. Eades, Q. Feng and Hiroshi Nagamochi Drawing clustered graphs on an orthogonal grid Journal of Graph Algorithms and Application,vol.3, no.4,, pp. 3-29 1999 英語
A. Frank; T. Ibaraki; H. Nagamochi Two arc-disjoint paths in Eulerian digraphs SIAM Journal on Discrete Mathematics,11,4,557-589 1998/11 英語
H. Nagamochi; T. Ibaraki A note on minimizing submodular functions Information Processing Letters,67,5,239-244 1998/09/15 英語
永持 仁 Independent spanning trees with small depths in iterated line digraphs Australian Computer Science Communications,20/3, 21-35 1998 英語
T. Ibaraki; A.V. Karzanov; H. Nagamochi A fast algorithm for finding a maximum free multiflow in an inner Eulerian network and some generalizations Combinatorica,18,1,61-83 1998 英語
Nagamochi, H; Eades, P; Bixby, RE; Boyd, EA; RiosMercado, RZ Edge-splitting and edge-connectivity augmentation in planar graphs INTEGER PROGRAMMING AND COMBINATORIAL OPTIMIZATION,1412,96-111 1998 英語
T. Ishii; H. Nagamochi; T. Ibaraki K-edge and 3-vertex connectivity augmentation in an arbitrary multigraph Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics),1533,159-168 1998 英語
H. Nagamochi; T. Ibaraki Polyhedral structure of submodular and posi-modular systems Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics),1533,169-178 1998 英語
H. Nagamochi; T. Hasunuma An efficient NC algorithm for a sparse k-edge-connectivity certificate Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics),1533,447-456 1998 英語
H. Nagamochi; K. Mochizuki; T. Ibaraki Complexity of the single vehicle scheduling problem on graphs INFOR,35,4,256-276 1997/11 英語
H. Nagamochi; K. Nishimura; T. Ibaraki Computing all small cuts in AN undirected network SIAM Journal on Discrete Mathematics,10,3,469-481 1997/08 英語
H. Nagamochi; D.-Z. Zeng; N. Kabutoya; T. Ibaraki Complexity of the minimum base game on matroids Mathematics of Operations Research,22,1,146-164 1997/02 英語
Y. Karuno; H. Nagamochi; T. Ibaraki Vehicle scheduling on a tree with release and handling times Annals of Operations Research,69,193-207 1997 英語
ISHII T;NAGAMOCHI H;IBARAKI T Augmenting Edge and Vertex Connectivities Simultaneously. Lect Notes Comput Sci,1350,102-111 1997 英語
H. Nagamochi; T. Ibaraki Deterministic Õ(nm) time edge-splitting in undirected graphs Journal of Combinatorial Optimization,1,1,5-46 1997 英語
Y. Karuno; H. Nagamochi; T. Ibaraki Vehicle scheduling on a tree to minimize maximum lateness Journal of the Operations Research Society of Japan,39,3,345-355 1996/09 英語
H. Nagamochi; T. Kameda Constructing cactus representation for all minimum cuts in an undirected network Journal of the Operations Research Society of Japan,39,2,135-158 1996/06 英語
KARUNO Y;NAGAMOCHI H;IBARAKI T Computational Complexity of the Traveling Salesman Problem on a Line with Deadlines and General Handling Times. Mem Fac Eng Des Kyoto Inst Technol Ser Sci Technol,45,19-22 1996 英語
T. Ibaraki; H. Nagamochi; T. Kameda Optimal coteries for rings and related networks Distributed Computing,8,4,191-201 1995/06 英語
NAGAMOCHI H;IBARAKI T A Faster Edge Splitting Algorithm in Multigraphs and its Application to the Edge-Connectivity Augmentation Problem. Lect Notes Comput Sci,920,403-413 1995 英語
永持 仁 Two arc-disjoint paths in Eulerian digraphs, "jointly worked " Lecture Notes in Computer Science,V1004, 92-101 1995 英語
H. Nagamochi; T. Ono; T. Ibaraki Implementing an efficient minimum capacity cut algorithm Mathematical Programming,67,3,325-341 1994/12/14 英語
HARADA, H; SUN, Z; NAGAMOCHI, H AN EXACT LOWER-BOUND ON THE NUMBER OF CUT-SETS IN MULTIGRAPHS NETWORKS,24,8,429-443 1994/12 英語
H. Nagamochi; T. Kameda Canonical cactus representation for minimum cuts Japan Journal of Industrial and Applied Mathematics,11,3,343-361 1994 英語
永持 仁 Computing all small cuts in undirected networks, "jointly worked " Lecture Notes in Computer Science,V834, 190-198 1994 英語
FRANK, A; IBARAKI, T; NAGAMOCHI, H ON SPARSE SUBGRAPHS PRESERVING CONNECTIVITY PROPERTIES JOURNAL OF GRAPH THEORY,17,3,275-281 1993/07 英語
KARUNO Y;NAGAMOCHI H;IBARAKI T Vehicle Scheduling on a Tree with Release and Handling Times. Lect Notes Comput Sci,762,486-495 1993 英語
永持 仁 Computing k-edge-connected components in multigraphs, "jointly worked " Inst. Electron. Inform. Comm. Eng. Trans,E76-A,/ 4, \t513-517 1993 英語
Hiroshi Nagamochi; Toshihide Ibaraki On Onaga\\'s upper bound on the mean values of probabilistic maximum flows IEEE Transactions on Reliability,41,2,225-229 1992/06 英語
NAGAMOCHI, H; IBARAKI, T COMPUTING EDGE-CONNECTIVITY IN MULTIGRAPHS AND CAPACITATED GRAPHS SIAM JOURNAL ON DISCRETE MATHEMATICS,5,1,54-66 1992/02 英語
Hiroshi Nagamochi; Toshihide Ibaraki Linear-time algorithm for finding a sparse k-connected spanning subgraph of a k-connected graph Algorithmica (New York),7,5-6,583-596 1992 英語
H. Nagamochi; T. Ibaraki A linear time algorithm for computing 3-edge-connected components in a multigraph Japan Journal of Industrial and Applied Mathematics,9,2,163-180 1992 英語
IBARAKI T;NAGAMOCHI H;KAMEDA T Optimal Coteries for Rings and Related Networks. Proc Int Conf Distrib Comput Syst,12th,650-656 1992 英語
Hiroshi Nagamochi; Zheng Sun; Toshihide Ibaraki Counting the number of minimum cuts in undirected multigraphs IEEE Transactions on Reliability,40,5,610-614 1991/12 英語
NAGAMOCHI, H; IBARAKI, T MAXIMUM FLOWS IN PROBABILISTIC NETWORKS NETWORKS,21,6,645-666 1991/10 英語
NAGAMOCHI, H; FUKUSHIMA, M; IBARAKI, T RELAXATION METHODS FOR THE STRICTLY CONVEX MULTICOMMODITY FLOW PROBLEM WITH CAPACITY CONSTRAINTS ON INDIVIDUAL COMMODITIES NETWORKS,20,4,409-426 1990/07 英語
H. Nagamochi; T. Ibaraki Multicommodity flows in certain planar directed networks Discrete Applied Mathematics,27,1-2,125-145 1990/05 英語
永持 仁 Computing the edge-connectivity of multigraphs and capacitated graphs, "jointly worked " Lecture Notes in Computer Science,V450, 12-20 1990 英語
永持 仁 Multiple graphs minimizing the number of minimum cut-sets, "jointly worked " Trans. Inst. Electron. Inform. Comm. Eng. Jap,E73/6, 915-921 1990 英語
H. Nagamochi; T. Ibaraki On max-flow min-cut and integral flow properties for multicommodity flows in directed networks Information Processing Letters,31,6,279-285 1989/06/19 英語
永持 仁 Augmenting edge-connectivity over the entire range in Õ(nm) time, "jointly worked " J. Algorithms,V30, 253-301 英語
永持 仁 Deterministic Õ(nm) time edge-splitting in undirected graphs, "jointly worked " J. Combinatorial Optimization,1/1, 5-46 英語

  • <<
  • >>
  • 表示
学会発表等 > 学会発表等
(文系研究者の一般的な学会報告の業績は「講演等」を参照してください)
著者名 タイトル 書誌情報等 年月 査読の有無 言語
Fei He, Akiyoshi Hanai,NAGAMOCHI Hiroshi .Tatsuya Akutsu Enumerating Naphthalene Isomers of Tree-like Chemical Graphs. BIOINFORMATICS,3,258-265 2016/02 英語
Morito Oomine, Aleksandar Shurbevski,NAGAMOCHI Hiroshi 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 The 18th Japan Conference on Discrete and Computational Geometry and Graphs,102-103 2015/09 英語
Fei He,NAGAMOCHI Hiroshi 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 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 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. WALCOM 2015:,234-245 2015 英語
Seok-Hee Hong, ,NAGAMOCHI Hiroshi 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 ISAAC 2014,429-440 2014 英語
NAGAMOCHI Hiroshi Linear Layouts in Submodular Systems ISAAC 2012:,475-484 2012 英語
Hiroshi Nagamochi; Toshihide Ibaraki Deterministic qq(nm) time edge-splitting in undirected graphs Conference Proceedings of the Annual ACM Symposium on Theory of Computing,64-73 1996 英語
永持 仁 アルゴリズム辞典(共著) 共立出版, 1995 日本語
A. Shurbevski; H. Nagamochi; Y. Karuno Approximating the bipartite TSP and its biased generalization Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics),8344 LNCS,56-67 2014 英語
M. Xiao; H. Nagamochi An exact algorithm for maximum independent set in degree-5 graphs Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics),7924 LNCS,72-83 2013 英語
M. Xiao; H. Nagamochi An improved exact algorithm for undirected feedback vertex set Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics),8287 LNCS,153-164 2013 英語
M. Xiao; H. Nagamochi Exact algorithms for maximum independent set Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics),8283 LNCS,328-338 2013 英語
M. Xiao; H. Nagamochi An exact algorithm for TSP in degree-3 graphs via circuit procedure and amortization on connectivity structure Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics),7876 LNCS,96-107 2013 英語
C. Zhang; H. Nagamochi The next-to-shortest path in undirected graphs with nonnegative weights Conferences in Research and Practice in Information Technology Series,128,13-20 2012 英語
K. Ibara; H. Nagamochi Characterizing mechanisms in obnoxious facility game Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics),7402 LNCS,301-311 2012 英語
M. Xiao; H. Nagamochi An improved exact algorithm for TSP in degree-4 graphs Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics),7434 LNCS,74-85 2012 英語
M. Xiao; H. Nagamochi A refined exact algorithm for edge dominating set Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics),7287 LNCS,360-372 2012 英語
H. Nagamochi Submodular minimization via pathwidth Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics),7287 LNCS,584-593 2012 英語
M. Shimizu, H. Nagamochi and T. Akutsu Enumerating tree-like chemical graphs with given upper and lower bounds on path frequencies. BMC bioinformatics,12,14 2011/12/14 英語
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 The 10th International Conference on Electronics, Telecommunications, Automation, and Informatics - ETAI 2011, Metropol Hotel, Ohrid, Macedonia, September 16-20, 2011, CD-ROM A1-1 (1--6). 2011/09 英語
L. Zhao, P. Eumthurapojn, H. Nagamochi A practical speed-up technique for A* algorithms the 4th Annual Meeting of the Asian Association for Algorithms and Computation (AAAC 2011), in Hsinchu, Taiwan 2011/04 英語
T. Hasunuma; H. Nagamochi Improved bounds for minimum fault-tolerant gossip graphs Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics),6986 LNCS,203-214 2011 英語
M. Xiao; H. Nagamochi Further improvement on maximum independent set in degree-4 graphs Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics),6831 LNCS,163-178 2011 英語
M. Xiao; H. Nagamochi Parameterized edge dominating set in cubic graphs (extended abstract) Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics),6681,100-112 2011 英語
Y. Karuno, H. Nagamochi Network transformation heuristics for multi-story storage rack problems Proceedings of International Symposium on Scheduling 2011 (ISS2011), JSME No. 11-205, pp. 161--164, 2011 英語
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 Proceedings of International Symposium on Scheduling 2011 (ISS2011), JSME No. 11-205, pp. 235--240 2011 英語
Y. Karuno; H. Nagamochi; A. Nakashima; K. Yamashita Heuristics for scheduling problems on identical machines like storage allocation IEEE International Conference on Industrial Informatics (INDIN),863-868 2010 英語
Mingyu Xiao, Takuro Fukunaga, Hiroshi Nagamochi FPTAS's for Some Cut Problems in Weighted Trees. The 4th International Frontiers of Algorithmics Workshop (FAW 2010) 2010 英語
Y. Karuno; H. Nagamochi; A. Shurbevski Approximation algorithms for a cyclic routing problem of grasp-and-delivery robots SCIS and ISIS 2010 - Joint 5th International Conference on Soft Computing and Intelligent Systems and 11th International Symposium on Advanced Intelligent Systems,94-99 2010 英語
K. Haraguchi, S.-H. Hong, Hiroshi Nagamochi Multiclass visual classifier based on bipartite graph representation of decision tables Learning and Intelligent OptimizatioN Conference (LION 4) 2010 英語
Yoshiyuki Karuno, Kougaku Yamashita, Eishi Chiba, Hiroshi Nagamochi 4C1 SCHEDULING MULTIPROCESSOR TASKS WITH PROMPT SERVICE CONSTRAINTS ON ALIGNED IDENTICAL PROCESSORS Proceedings of International Symposium on Scheduling,2009,203-208 2009/07/04 英語
K. Haraguchi; S.-H. Hong; H. Nagamochi Bipartite graph representation of multiple decision table classifiers Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics),5792 LNCS,46-60 2009 英語
T. Imada; S. Ota; H. Nagamochi; T. Akutsu Enumerating stereoisomers of tree structured molecules using dynamic programming Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics),5878 LNCS,14-23 2009 英語
J. Wang; J. Gim; M. Sasaki; L. Zhao; H. Nagamochi Efficient approximate algorithms for the beacon placement and its dual problem (abstract) Proceedings - 2009 International Conference on Computational Intelligence and Software Engineering, CiSE 2009 2009 英語
T. Imamichi, Y. Arahori, Hiroshi Nagamochi Efficient branch-and-bound algorithms for one-dimensional contiguous bin packing problem and two-dimensional strip packing problem, The 6th ESICUP Meeting 2009 英語
S. Umetani, K. Matsumoto, Hiroshi Nagamochi, One-dimensional cutting stock problem for a paper tube industry The 6th ESICUP Meeting 2009 英語
S.-H. Hong, Hiroshi Nagamochi Toward characterization of vertex-edge graphs of three-dimensional nonconvex polyhedra, 6th Japanese-Hungarian Symposium on Discrete Mathematics and Its Applications 2009 英語
Yoshiyuki Karuno, Kougaku Yamashita, Eishi Chiba, Hiroshi Nagamochi Combinatorial optimization problems and algorithms in double-layered food packing equipments Proc. International Symposium on Scheduling 2009 2009 英語
J. Wang, J. Gim, M. Sasaki, L. Zhao, Hiroshi Nagamochi Efficient approximate algorithms for the beacon placement and its dual problem, 2009 Korea-Japan Joint Workshop on Algorithms and Computation, , pp. 101-108. 2009 英語
K. Haraguchi, S.-H. Hong, Hiroshi Nagamochi Visualized Multiple Decision Table Classifiers without Discretization 4th Korea-Japan Workshop on Operations Research in Service Science pp. 19-28. 2009 英語
K. Haraguchi, S.-H. Hong, Hiroshi Nagamochi, Visualization can improve multiple decision table classifiers The 6th International Conference on Modeling Decisions for Artificial Intelligence (MDAI 2009) pp. 41-52. 2009 英語
K. Okumoto, T. Fukunaga, Hiroshi Nagamochi, Divide-and-conquer algorithms for partitioning hypergraphs and submodular systems, The 20th International Symposium on Algorithms and Computation (ISAAC 2009), 2009 英語
S. Karakawa, E. Morsy, Hiroshi Nagamochi Minmax tree cover in the Euclidean space Third Annual Workshop on Algorithms and Computation (WALCOM 2009) 2009 英語
T. Fukunaga, Hiroshi Nagamochi Network design with weighted degree constraints Third Annual Workshop on Algorithms and Computation (WALCOM 2009) 2009 英語
Hiroshi Nagamochi, Cop-robber guarding game with cycle robber region The Third International Frontiers of Algorithmics Workshop (FAW 2009), 2009 英語
Y. Nakao, Hiroshi Nagamochi Worst case analysis for pickup and delivery problems with consecutive pickups and deliveries The 20th International Symposium on Algorithms and Computation (ISAAC 2009) 2009 英語
S.-H. Hong, Hiroshi Nagamochi Upward star-shaped polyhedral graphs The 20th International Symposium on Algorithms and Computation (ISAAC 2009) 2009 英語
T. Fukunaga; M.M. Halldórsson; H. Nagamochi Robust cost colorings Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms,1204-1212 2008 英語
M. Sasaki; L. Zhao; H. Nagamochi Security-aware beacon based network monitoring 2008 11th IEEE Singapore International Conference on Communication Systems, ICCS 2008,527-531 2008 英語
T. Imamichi; H. Nagamochi Designing algorithms with multi-sphere scheme Proceedings - International Conference on Informatics Education and Research for Knowledge-Circulating Society, ICKS 2008,125-130 2008 英語
Jaeseong Gim, Yohei Arahori, Takashi Imamichi, Seok-Hee Hong, Hiroshi Nagamochi Overlap removal in label layouts by a multi-sphere scheme, the poster session of 2008 IEEE Pacific Visualization Symposium (PacificVis 2008) 2008 英語
K. Haraguchi, Seok-Hee Hong, Hiroshi Nagamochi, Visual analysis of hierarchical data using 2.5D drawing with minimum occlusion the poster session of 2008 IEEE Pacific Visualization Symposium (PacificVis 2008) 2008 英語
E. Morsy, Hiroshi Nagamochi Approximating the generalized capacitated tree-routing The 14th Annual International Computing and Combinatorics Conference (COCOON 2008) 2008 英語
L. Zhao, T. Ohshima, Hiroshi Nagamochi A* algorithm for the time-dependent shortest path problem The 11th Japan-Korea Joint Workshop on Algorithms and Computation (WAAC08)pp. 36-43. 2008 英語
T. Imamichi, Hiroshi Nagamochi A fast collision detection algorithm for a multi-sphere scheme The 11th Japan-Korea Joint Workshop on Algorithms and Computation (WAAC08), pp. 173-180. 2008 英語
Y. Ishida, L. Zhao, Hiroshi Nagamochi, T. Akutsu Improved algorithm for enumerating tree-likee chemical graphs, The 19th International Conference on Genome Informatics (GIW2008) 2008 英語
Shinji IMAHORI, Yoshiyuki KARUNO, Hiroshi NAGAMOCHI, Xiaoming WANG Efficient algorithms for combinatorial food packing problems Proc. of the 11th International Conference on Humans and Computers (HC'2008), pp. 317-322 2008 英語
S.-H. Hong, Hiroshi Nagamochi, Approximating crossing minimization in radial layouts The 8th Latin American Theoretical Informatics Symposium (LATIN08) 2008 英語
S.-H. Hong, Hiroshi Nagamochi Star-shaped drawings of graphs with fixed embedding and concave corner constraints The 14th Annual International Computing and Combinatorics Conference (COCOON 2008) 2008 英語
T. Imamichi, Y. Arahori, J. Gim, S.-H. Hong, Hiroshi Nagamochi Removing node overlaps using multi-sphere scheme The 16th International Symposium on Graph Drawing (GD 2008) 2008 英語
T. Fukunaga, Hiroshi Nagamochi The set connector problems in graphs The Twelfth Conference on Integer Programming and Combinatorial Optimization, IPCO 2007, 2007 英語
T. Imamichi, Hiroshi Nagamochi, Packing sets of circles with shape-memory, INFORMS International Puerto Rico 2007 2007 英語
S.-H. Hong, Hiroshi Nagamochi, Fully convex drawings of clustered planar graphs 2007 Korea-Japan Joint Workshop on Algorithms and Computation, pp. 32-39. 2007 英語
T. Imamichi, Hiroshi Nagamochi An Iterated Local Search Algorithm in a Multi-sphere Scheme for 2D and 3D Packing Problems, 2007 Korea-Japan Joint Workshop on Algorithms and Computation, pp. 72-79. 2007 英語
H. Fujiwara, L. Zhao, Hiroshi Nagamochi, T. Akutsu, W. Jiexun, Enumerating tree-like chemical structures from feature vector 2007 Korea-Japan Joint Workshop on Algorithms and Computation, pp. 48-55 2007 英語
T. Imamichi, Hiroshi Nagamochi A multi-sphere scheme for 2D and 3D packing problems Stochastic local search (SLS) algorithms 2007 英語
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 Stochastic local search (SLS) algorithms 2007 英語
S.-H. Hong, Hiroshi Nagamochi, Star-shaped drawings of planar graphs 18th International Workshop on Combinatorial Algorithms, 2007 英語
Hiroshi Nagamochi, Minimum degree orderings, The 18th International Symposium on Algorithms and Computation (ISAAC 2007) 2007 英語
T. Fukunaga, M. Halldorsson, Hiroshi Nagamochi, Rent-or-buy scheduling and cost coloring problems Foundations of Software Technology and Theoretical Computer Science,FSTTCS 2007, 2007 英語
M. Hayashida; T. Akutsu; H. Nagamochi A novel clustering method for analysis of biological networks using maximal components of graphs Series on Advances in Bioinformatics and Computational Biology,5,257-266 2007 英語
A. Kawaguchi; H. Nagamochi Orthogonal drawings for plane graphs with specified face areas Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics),4484 LNCS,584-594 2007 英語
L. Zhao; A. Shimae; H. Nagamochi Linear-tree rule structure for firewall optimization Proceedings of the Sixth IASTED International Conference on Communications, Internet, and Information Technology, CIIT 2007,67-72 2007 英語
J. Uchida; Y. Karuno; H. Nagamochi Heuristics for a scheduling problem of minimizing the number of one-way vehicles on paths with deadlines Proceedings of the SICE Annual Conference,2633-2638 2007 英語
K. Haraguchi; H. Nagamochi Extension of ICF classifiers to real world data sets Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics),4570 LNAI,776-785 2007 英語
H. Nagamochi Approximating minimum k-partitions in submodular systems Proceedings - Second International Conference on Informatics Research for Development of Knowledge Society Infrastructure, ICKS 2007,119-128 2007 英語
E. Morsy, Hiroshi Nagamochi Approximating capacitated tree-routings in networks, The 4th Annual Conference on Theory and Applications of Models of Computation (TAMC07) 2007 英語
J. Wang, L. Zhao, Hiroshi Nagamochi, T. Akutsu An efficient enumeration of colored outerplanar graphs The 4th Annual Conference on Theory and Applications of Models of Computation(TAMC07) 2007 英語
S.-H. Hong, Hiroshi Nagamochi A linear time algorithm for symmetric convex drawings of triconnected planar graphs, The Kyoto International Conference on Computational Geometry and Graph Theory (KyotoCGGT2007) 2007 英語
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) Proceedings of International Symposium on Scheduling,2006,132-137 2006/07/18 英語
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) Proceedings of International Symposium on Scheduling,2006,160-165 2006/07/18 英語
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) Proceedings of International Symposium on Scheduling,2006,42-47 2006/07/18 英語
Morsy Ehab;Nagamochi Hiroshi 1A2 AN IMPROVED APPROXIMATION ALGORITHM FOR CAPACITATED MULTICAST ROUTINGS IN NETWORKS(Technical session 1A: Combinatorial optimization) Proceedings of International Symposium on Scheduling,2006,12-17 2006/07/18 英語
T. Imamichi, M. Yagiura, Hiroshi Nagamochi An iterated local search algorithm based on nonlinear programming for the irregular strip packing problem The 19th conference of the European Chapter on Combinatorial Optimization (ECCO XIX) and the International Symposium on Combinatorial Optimisation 2006 (CO 2006) 2006 英語
M. Yagiura, Toshihide Ibaraki, T. Imamichi, Y. Koga, Hiroshi Nagamochi,K. Nonobe Efficient branch-and-bound algorithms for weighted MAX-2-SAT The 21st European Conference on Operational Research (EURO XXI) 2006 英語
T. Fukunaga, Hiroshi Nagamochi Network design with edge-connectivity and degree constraints Fourth Workshop on Approximation and Online Algorithms (WAOA06) 2006 英語
Hiroshi Nagamochi A detachment algorithm for inferring a graph from path frequency The Twelfth Annual International Computing and Combinatorics Conference (COCOON'06) 2006 英語
T. Fukunaga, Hiroshi Nagamochi Some theorems on detachments preserving local-edge-connectivity Fifth CRACOW Conference on Graph Theory (USTRON '06), CCGT 2006 英語
K. Hirata; T. Matsuda; H. Nagamochi; T. Takine Contention-free λ-planes in optically burst-switched WDM networks GLOBECOM - IEEE Global Telecommunications Conference 2006 英語
S.-H. Hong, Hiroshi Nagamochi Convex drawings with non-convex boundary, 32nd International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2006) 2006 英語
T. Fukunaga, Hiroshi Nagamoch Approximating minimum cost multigraphs of specified edge-connectivity under degree bounds, Proceedings of the 9th Japan-Korea Joint Workshop on Algorithm and Computation (WAAC06),, pp. 25-32. 2006 英語
S.-H. Hong, Hiroshi Nagamochi Convex drawings of hierarchical plane graphs 17th Australasian Workshop on Combinatorial Algorithms (AWOCA 2006) 2006 英語
M. Sakashita, K. Makino, Hiroshi Nagamochi, S. Fujishige Minimum transversals in posi-modular systems ESA 2006, 14th Annual European Symposium on Algorithms 2006 英語
Kouji Hirata, Takahiro Matsuda, Hiroshi Nagamochi, Tetsuya Takine Contention-Free lambda-Planes in Optically Burst-Switched WDM IEEE GLOBECOM 2006 Advanced Technologies and Protocols for Optical Networks 2006 英語
Y. Koga, M. Yagiura, K. Nonobe, T. Imamichi, Hiroshi Nagamochi, Toshihide Ibaraki, Efficient branch-and-bound algorithms for weighted MAX-2-SAT Third International Conference on Innovative Applications of Information Technology for the Developing World(Asian Applied Computing Conference (AACC 2005)) 2005 英語
T. Fukunaga; H. Nagamochi Approximation algorithms for the b-edge dominating set problem and its related problems Lecture Notes in Computer Science,3595,747-756 2005 英語
T. Ishii; K. Iwata; H. Nagamochi Bisecting a four-connected graph with three resource sets Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics),3827,176-185 2005 英語
T. Ishii, H. Fujita, Hiroshi Nagamochi, Minimum cost source location problem with local 3-vertex-connectivity requirements, Computing: The Australasian Theory Symposium (CATS) Australasian Computer Science Week, pp.97-105. 2005 英語
T. Ishii, K. Iwata, Hiroshi Nagamochi, Bisecting a four-connected graph with three resource sets, 4th Japanese-Hungarian Symposium on Discrete Mathematics and Its Applications,,pp. 107-113. 2005 英語
K. Haraguchi, Hiroshi Nagamochi, Toshihide Ibaraki Compactness of classifiers by iterative compositions of features 4th Japanese-Hungarian Symposium on Discrete Mathematics and Its Applications,pp. 92-98. 2005 英語
T. Fukunaga, Hiroshi Nagamochi, Edge packing problem with edge capacity constraints 4th Janese-Hungarian Symposium on Discrete Mathematics and Its Applications,pp. 69-75. , 2005 英語
Y. Kamidoi, N. Yoshida, Hiroshi Nagamochi, A deterministic algorithm for finding all minimum k-way cuts, 4th Japanese-Hungarian Symposium on Discrete Mathematics and Its Applications,pp. 224-233., 2005 英語
T. Imamichi, M. Kenmochi, K. Nonobe, M. Yagiura, Hiroshi Nagamochi Branch-and-bound algorithms for rectangular strip packing and perfect packing problems, ESICUP (EURO Special Interest Group on Cutting and Packing) 2nd Meeting, 2005 英語
M. Kenmochi, T. Imamichi, K. Nonobe, M. Yagiura, Hiroshi Nagamochi, Exact algorithms for the 2-dimensional strip packing problem with rotations, The IFORS Triennial 2005 Conference 2005 英語
M. Nishihara, M. Yagiura, Toshihide Ibaraki, Hiroshi Nagamochi The relation between option pricing and optimization problems The IFORS Triennial 2005 Conference, 2005 英語
Hiroshi Nagamochi Heuristics for the Minmax Subtree Cover in Graphs The IFORS Triennial 2005 Conference, 2005 英語
Y. Karuno, Hiroshi Nagamochi Minimizing capacitated tree covers of graphs Third International Conference on Innovative Applications of Information Technology for the Developing World(Asian Applied Computing Conference (AACC 2005) 2005 英語
K. Haraguchi, Hiroshi Nagamochi, Toshihide Ibaraki Experimental studies on representation complexity and error rates of iteratively composed features, Third International Conference on Innovative Applications of Information Technology for the Developing World (Asian Applied Computing Conference (AACC 2005)) 2005 英語
H. Nagamochi; T. Kawada Approximating the minmax subtree cover problem in a cactus Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics),3341,705-716 2004 英語
Hiroshi Nagamochi An improved approximation to the one-sided bilayer drawing The 11th International Symposium on Graph Drawing (GD2003) 2003 英語
Hiroshi Nagamochi, K. Kuroya, Convex drawing for c-planar biconnected clustered graphs The 11th International Symposium on Graph Drawing (GD2003) 2003 英語
H. Nagamochi; K. Okada Polynomial time 2-approximation algorithms for the minmax subtree cover problem Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics),2906,138-147 2003 英語
H. Nagamochi; Y. Abe An approximation algorithm for dissecting a rectangle into rectangles with specified areas Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics),2906,280-289 2003 英語
Y. Karuno; H. Nagamochi A better approximation for the two-machine flowshop scheduling problem with time lags Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics),2906,309-318 2003 英語
T. Ishii; S. Yamamoto; H. Nagamochi Augmenting forests to meet odd diameter requirements Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics),2906,434-443 2003 英語
T. Ishii; Y. Akiyama; H. Nagamochi Minimum augmentation of edge-connectivity between vertices and sets of vertices in undirected graphs Electronic Notes in Theoretical Computer Science,78,243-266 2003 英語
永持 仁 A simple and robust algorithm for bisecting a triconnected graph with two resource sets, "jointly worked " Proceedings of the 7th Japan-Korea Joint Workshop on Algorithms and Computation,/ , 210-222 2003 英語
永持 仁 A simple recognition of maximal planar graphs, "jointly worked " Proceedings of the 7th Japan-Korea Joint Workshop on Algorithms and Computation,/ , 182-188 2003 英語
永持 仁 Can a hypergraph cover every convex polygon?, "jointly worked " the 3rd Hungarian-Japanese Symposium on Discrete Mathematics and Its Applications,/ , 293-302 2003 英語
永持 仁 Computing extreme sets in graphs and its applications the 3rd Hungarian-Japanese Symposium on Discrete Mathematics and Its Applications,/ , 349-357 2003 英語
永持 仁 Source location problem with local 3-vertex-connectivity requirements, "jointly worked " the 3rd Hungarian-Japanese Symposium on Discrete Mathematics and Its Applications,/ , 368-377 2003 英語
Hiroshi Nagamochi, N. Yamada Fast algorithms for counting bilayer crossings 7th Japan-Korea Joint Workshop on Algorithms and Computation, pp.203-209. 2003 英語
H. Ito, Hiroshi Nagamochi Comparing hypergraphs by areas of hyperedges drawn on a convex polygon Discrete and Computational Geometry, JCDCG'02, Tokyo, Japan, pp. 71-72. 2002 英語
H. Ito; H. Nagamochi; Y. Sugiyama; M. Fujita File transfer tree problems Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics),2518,441-452 2002 英語
Y. Karuno; H. Nagamochi A Polynomial Time Approximation Scheme for the Multi-vehicle Scheduling Problem on a Path with Release and Handling Times Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics),2223,36-47 2001 英語
H. Nagamochi; T. Ishii On the minimum local-vertex-connectivity augmentation in graphs Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics),2223,124-135 2001 英語
L. Zhao; H. Nagamochi; T. Ibaraki A unified framework for approximating multiway partition problemsExtended Abstract Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics),2223,682-694 2001 英語
Liang Zhao,Hiroshi Nagamochi,T. Ibaraki A primal-dual approximation algorithm for the survival network design problem in hypergraphs 18th International Symposium on Theoretical Aspects of Computer Science (STACS2001),pp. 478--489 2001 英語
Y. Karuno, Hiroshi Nagamochi A 2-approximation algorithm for the multi-vehicle scheduling on a path with release and handling times 9th Annual European Symposium on Algorithms, BRICS, pp. 218-229. 2001 英語
Ishii, T; Nagamochi, H; Halldorsson, MM On the minimum augmentation of an l-connected graph to a k-connected graph ALGORITHM THEORY - SWAT 2000,1851,286-299 2000 英語
T. Ishii, Hiroshi Nagamochi, Simultaneous augmentation of two graphs to an l-edge-connected graph and a biconnected graph 11th Annual International Symposium on Algorithms and Computation, ISAAC'00, pp. 326-337. 2000 英語
Hiroshi Nagamochi,Takashi Shiraki,T. Ibaraki Augmenting a submodular and posi-modular set function by a multigraph The 1st Japanese-Hungarian Symposium on Discrete Mathematics and its Applications 1999 英語
Hiroshi Nagamochi,T. Ibaraki An Approximation for Finding a Smallest 2-Edge-Connected Subgraph Containing a Specified Spanning Tree 5th Annual International Conference on Computing and Combinatorics (COCOON'99). 1999 英語
Liang Zhao,Hiroshi Nagamochi,T. Ibaraki Approximating the minimum k-way cut in a graph via minimum 3-way cuts 10th International Symposium on Algorithms and Computation (ISAAC'99),pp. 373--382 1999 英語
Hiroshi Nagamochi,Tibor Jordan,Y. Nakao,T. Ibaraki Bisecting two subsets in 3-connected graphs 10th International Symposium on Algorithms and Computation (ISAAC'99),pp. 425--434 1999 英語
Nagamochi, H; Ibaraki, T; Cornuejols, G; Burkard, RE; Woeginger, GJ A fast algorithm for computing minimum 3-way and 4-way cuts INTEGER PROGRAMMING AND COMBINATORIAL OPTIMIZATION,1610,377-390 1999 英語
永持 仁 Augmenting a submodular and posi-modular set function by a multigraph, "jointly worked " Proceedings of the 1st Japanese-Hungarian Symposium on Discrete Mathematics and Its Applications,/ , 273-279 1999 英語
Hiroshi Nagamochi,Shigeki Katayama,T. Ibaraki Faster Algorithm for Computing Minimum 5-Way and 6-Way Cuts 5th Annual International Conference on Computing and Combinatorics (COCOON'99). 1999 英語
永持 仁 Optimal augmentation of a biconnected graph to a k-edge-connected and triconnected graph, "jointly worked " Proceedings 9th Annual ACM-SIAM Symposium on Discrete Algorithms,/ , 280-289 1998 英語
Xiaotie Deng; Toshihide Ibaraki; Hiroshi Nagamochi Combinatorial optimization games Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms,720-729 1997 英語
Hiroshi Nagamochi; Takashi Shiraki; Toshihide Ibaraki Computing edge-connectivity augmentation function in O(nm) time Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms,649-658 1997 英語
永持 仁 Complexity of the single vehicle scheduling problem on graphs, "jointly worked " Proceedings of the International Workshop Intelligent Scheduling of Robots and Flexible Manufacturing Systems,/ , 89-104 1995 英語

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