永持 仁

Last Update: 2018/07/04 11:57:59

Print

Name(Kanji/Kana/Abecedarium Latinum)
永持 仁/ナガモチ ヒロシ/Nagamochi, Hiroshi
Primary Affiliation(Org1/Job title)
Graduate Schools Informatics/Professor
Faculty
Org1 Job title
工学部
Contact Address
Type Address(Japanese) Address(English)
Office 〒606-8501 京都府京都市左京区吉田本町 Yoshida-Honmachi, Sakyo-ku, Kyoto 606-8501, Japan
Academic Organizations You are Affiliated to in Japan
Organization name(Japanese) Organization name(English)
電子情報通信学会 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
Academic Degree
Field(Japanese) Field(English) University(Japanese) University(English) Method
工学修士 京都大学
工学博士 京都大学
Graduate School
University(Japanese) University(English) Faculty(Japanese) Faculty(English) Major(Japanese) Major(English) Degree
京都大学 大学院工学研究科修士課程数理工学専攻 修了
京都大学 大学院工学研究科博士課程数理工学専攻 修了
Undergraduate School / Major(s)
University(Japanese) University(English) Faculty(Japanese) Faculty(English) Major(s)(Japanese) Major(s)(English) Degree
京都大学 農学部農業工学科 卒業
Personal Profile
(Japanese)
1988年京都大学大学院工学研究科 博士課程修了。工学博士。豊橋技術科学大学、京都大学,豊橋技術科学大学を経て,2004年より京都大学大学院情報学研究科(数理工学専攻)教授。専門は離散最適化,とりわけ、グラフアルゴリズム,図形パッキング問題,スケジューリング,列挙アルゴリズムなどに従事ししている。主著に Algorithmic Aspects of Graph Connectivities Cambridge University Press, 2008)や「グラフ理論 連結構造とその応用」(朝倉書店, 2010年)がある。日本オペレーションズ・リサーチ学会,電子情報通信学会,情報処理学会,日本応用数理学会各会員。
(English)
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).
Language of Instruction
Language(japanese) Language(english) Code
英語
researchmap URL
https://researchmap.jp/read0012908
Research Topics
(Japanese)
グラフ理論における連結性,平面性などのグラフ構造の研究.グラフ・ネットワーク構造などを対象とした,スケジューリング問題,配置問題,ルーティング問題などの離散最適化問題に対する効率の良いアルゴリズムの設計を行う.
(English)
Study on graph structure with respect to connectivity and planarity in graph theory. Design of efficient algorithms for discrete optimization such as scheduling problem, location problem and routing problem in graph, network structure.
Overview of the research
(Japanese)
グラフ理論,グラフの連結性,グラフの平面性,離散最適化,多項式時間アルゴリズム,NP-完全性,近似アルゴリズム,指数時間厳密アルゴリズム
(English)
graph theory, graph connectivity, graph planarity, discrete optimization, polynomial-time algorithm, NP-completeness, approximation algorithm, exponential-time exact algorithm
Fields of research (key words)
Key words(Japanese) Key words(English)
組み合せ最適化 Compinatorial Optimization
アルゴリズム Algorithms
離散構造 Discrete structure
離散最適化 Discrete optimization
Published Papers
Author Author(Japanese) Author(English) Title Title(Japanese) Title(English) Bibliography Bibliography(Japanese) Bibliography(English) Publication date Refereed paper Language Publishing type Disclose
Mohd Shahrizan Othman,Aleksandar Shurbevski,Hiroshi Nagamochi Mohd Shahrizan Othman,Aleksandar Shurbevski,Hiroshi Nagamochi Mohd Shahrizan Othman,Aleksandar Shurbevski,Hiroshi Nagamochi Polynomial-Space Exact Algorithms for the Bipartite Traveling Salesman Problem. Polynomial-Space Exact Algorithms for the Bipartite Traveling Salesman Problem. Polynomial-Space Exact Algorithms for the Bipartite Traveling Salesman Problem. IEICE Transactions, 101-D, 3, 611-612 IEICE Transactions, 101-D, 3, 611-612 IEICE Transactions, 101-D, 3, 611-612 2018 Refereed Disclose to all
Jinghui Li,Hiroshi Nagamochi,Array Jinghui Li,Hiroshi Nagamochi,Array Jinghui Li,Hiroshi Nagamochi,Array Enumerating Substituted Benzene Isomers of Tree-Like Chemical Graphs. Enumerating Substituted Benzene Isomers of Tree-Like Chemical Graphs. Enumerating Substituted Benzene Isomers of Tree-Like Chemical Graphs. IEEE/ACM Trans. Comput. Biology Bioinform., 15, 2, 633-646 IEEE/ACM Trans. Comput. Biology Bioinform., 15, 2, 633-646 IEEE/ACM Trans. Comput. Biology Bioinform., 15, 2, 633-646 2018 Refereed Disclose to all
Seok-Hee Hong,Hiroshi Nagamochi Seok-Hee Hong,Hiroshi Nagamochi Seok-Hee Hong,Hiroshi Nagamochi 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. Theor. Comput. Sci., 725, 79-98 Theor. Comput. Sci., 725, 79-98 Theor. Comput. Sci., 725, 79-98 2018 Refereed Disclose to all
Norhazwani Md Yunos,Aleksandar Shurbevski,Hiroshi Nagamochi Norhazwani Md Yunos,Aleksandar Shurbevski,Hiroshi Nagamochi Norhazwani Md Yunos,Aleksandar Shurbevski,Hiroshi Nagamochi An Improved-time Polynomial-space Exact Algorithm for TSP in Degree-5 Graphs. An Improved-time Polynomial-space Exact Algorithm for TSP in Degree-5 Graphs. An Improved-time Polynomial-space Exact Algorithm for TSP in Degree-5 Graphs. JIP, 25, 639-654 JIP, 25, 639-654 JIP, 25, 639-654 2017 Refereed Disclose to all
Mohd Shahrizan Othman,Aleksandar Shurbevski,Yoshiyuki Karuno,Hiroshi Nagamochi Mohd Shahrizan Othman,Aleksandar Shurbevski,Yoshiyuki Karuno,Hiroshi Nagamochi Mohd Shahrizan Othman,Aleksandar Shurbevski,Yoshiyuki Karuno,Hiroshi Nagamochi Routing of Carrier-vehicle Systems with Dedicated Last-stretch Delivery Vehicle and Fixed Carrier Route. Routing of Carrier-vehicle Systems with Dedicated Last-stretch Delivery Vehicle and Fixed Carrier Route. Routing of Carrier-vehicle Systems with Dedicated Last-stretch Delivery Vehicle and Fixed Carrier Route. JIP, 25, 655-666 JIP, 25, 655-666 JIP, 25, 655-666 2017 Refereed Disclose to all
Mingyu Xiao,Hiroshi Nagamochi Mingyu Xiao,Hiroshi Nagamochi Mingyu Xiao,Hiroshi Nagamochi Exact algorithms for maximum independent set. Exact algorithms for maximum independent set. Exact algorithms for maximum independent set. Inf. Comput., 255, 126-146 Inf. Comput., 255, 126-146 Inf. Comput., 255, 126-146 2017 Refereed Disclose to all
Ken Iwaide,Hiroshi Nagamochi Ken Iwaide,Hiroshi Nagamochi Ken Iwaide,Hiroshi Nagamochi An Exact Algorithm for Lowest Edge Dominating Set. An Exact Algorithm for Lowest Edge Dominating Set. An Exact Algorithm for Lowest Edge Dominating Set. IEICE Transactions, 100-D, 3, 414-421 IEICE Transactions, 100-D, 3, 414-421 IEICE Transactions, 100-D, 3, 414-421 2017 Refereed Disclose to all
Morito Oomine,Aleksandar Shurbevski,Hiroshi Nagamochi Morito Oomine,Aleksandar Shurbevski,Hiroshi Nagamochi Morito Oomine,Aleksandar Shurbevski,Hiroshi Nagamochi 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. J. Graph Algorithms Appl., 21, 3, 247-263 J. Graph Algorithms Appl., 21, 3, 247-263 J. Graph Algorithms Appl., 21, 3, 247-263 2017 Refereed Disclose to all
Array,Hiroshi Nagamochi Array,Hiroshi Nagamochi Array,Hiroshi Nagamochi 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. Theor. Comput. Sci., 659, 72-82 Theor. Comput. Sci., 659, 72-82 Theor. Comput. Sci., 659, 72-82 2017 Refereed Disclose to all
M. Oomine,NAGAMOCHI Hiroshi 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, 623 IEICE Transactions Inf. and Syst., E99.D, 3, 623 IEICE Transactions Inf. and Syst., E99.D, 3, 623 2016/03 Refereed English Disclose to all
Ken Iwaide,NAGAMOCHI Hiroshi 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 J. Graph Algorithms Appl., 20, 1, 23-58 J. Graph Algorithms Appl., 20, 1, 23-58 2016 Refereed English Disclose to all
Mingyu Xiao,NAGAMOCHI Hiroshi 永持 仁 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 Algorithmica, 74, 2, 713-741 Algorithmica, 74, 2, 713-741 2016 Refereed English Disclose to all
Mingyu Xiao,NAGAMOCHI Hiroshi 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 Discrete Applied Mathematics, 199, 137-155 Discrete Applied Mathematics, 199, 137-155 2016 Refereed English Disclose to all
M. Xiao,NAGAMOCHI Hiroshi 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 Theory of Computing Systems, 58, 2, 241-272 Theory of Computing Systems, 58, 2, 241-272 2016 Refereed English Disclose to all
Morito Oomine,Hiroshi Nagamochi Morito Oomine,Hiroshi Nagamochi Morito Oomine,Hiroshi Nagamochi 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, 99-D, 3, 615-623 IEICE Transactions, 99-D, 3, 615-623 IEICE Transactions, 99-D, 3, 615-623 2016 Refereed Disclose to all
Fei He,Akiyoshi Hanai,Hiroshi Nagamochi,Tatsuya Akutsu Fei He,Akiyoshi Hanai,Hiroshi Nagamochi,Tatsuya Akutsu Fei He,Akiyoshi Hanai,Hiroshi Nagamochi,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. Proceedings of the 9th International Joint Conference on Biomedical Engineering Systems and Technologies (BIOSTEC 2016) - Volume 3: BIOINFORMATICS, Rome, Italy, February 21-23, 2016., 258-265 Proceedings of the 9th International Joint Conference on Biomedical Engineering Systems and Technologies (BIOSTEC 2016) - Volume 3: BIOINFORMATICS, Rome, Italy, February 21-23, 2016., 258-265 Proceedings of the 9th International Joint Conference on Biomedical Engineering Systems and Technologies (BIOSTEC 2016) - Volume 3: BIOINFORMATICS, Rome, Italy, February 21-23, 2016., 258-265 2016 Refereed Disclose to all
Seok-Hee Hong,Hiroshi Nagamochi Seok-Hee Hong,Hiroshi Nagamochi Seok-Hee Hong,Hiroshi Nagamochi Re-embedding a 1-Plane Graph into a Straight-Line Drawing in Linear Time. Re-embedding a 1-Plane Graph into a Straight-Line Drawing in Linear Time. Re-embedding a 1-Plane Graph into a Straight-Line Drawing in Linear Time. Graph Drawing and Network Visualization - 24th International Symposium, GD 2016, Athens, Greece, September 19-21, 2016, Revised Selected Papers, 321-334 Graph Drawing and Network Visualization - 24th International Symposium, GD 2016, Athens, Greece, September 19-21, 2016, Revised Selected Papers, 321-334 Graph Drawing and Network Visualization - 24th International Symposium, GD 2016, Athens, Greece, September 19-21, 2016, Revised Selected Papers, 321-334 2016 Refereed Disclose to all
Mingyu Xiao,Hiroshi Nagamochi Mingyu Xiao,Hiroshi Nagamochi Mingyu Xiao,Hiroshi Nagamochi A Linear-Time Algorithm for Integral Multiterminal Flows in Trees. A Linear-Time Algorithm for Integral Multiterminal Flows in Trees. A Linear-Time Algorithm for Integral Multiterminal Flows in Trees. 27th International Symposium on Algorithms and Computation, ISAAC 2016, December 12-14, 2016, Sydney, Australia, 62:1-62:12 27th International Symposium on Algorithms and Computation, ISAAC 2016, December 12-14, 2016, Sydney, Australia, 62:1-62:12 27th International Symposium on Algorithms and Computation, ISAAC 2016, December 12-14, 2016, Sydney, Australia, 62:1-62:12 2016 Refereed Disclose to all
Masataka Ikeda,NAGAMOCHI Hiroshi IKEDA Masataka, 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, E98.D, 3, 503-511 IEICE Transactions, E98.D, 3, 503-511 IEICE Transactions, E98.D, 3, 503-511 2015 Refereed English Disclose to all
Array,Hiroshi Nagamochi Array,Hiroshi Nagamochi Array,Hiroshi Nagamochi Exact algorithms for dominating induced matching based on graph partition. Exact algorithms for dominating induced matching based on graph partition. Exact algorithms for dominating induced matching based on graph partition. Discrete Applied Mathematics, 190-191, 147-162 Discrete Applied Mathematics, 190-191, 147-162 Discrete Applied Mathematics, 190-191, 147-162 2015 Refereed Disclose to all
Mingyu Xiao,Hiroshi Nagamochi Mingyu Xiao,Hiroshi Nagamochi Mingyu Xiao,Hiroshi Nagamochi An improved exact algorithm for undirected feedback vertex set. An improved exact algorithm for undirected feedback vertex set. An improved exact algorithm for undirected feedback vertex set. J. Comb. Optim., 30, 2, 214-241 J. Comb. Optim., 30, 2, 214-241 J. Comb. Optim., 30, 2, 214-241 2015 Refereed Disclose to all
Norhazwani Md Yunos,Aleksandar Shurbevski,Hiroshi Nagamochi Norhazwani Md Yunos,Aleksandar Shurbevski,Hiroshi Nagamochi Norhazwani Md Yunos,Aleksandar Shurbevski,Hiroshi Nagamochi 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. Discrete and Computational Geometry and Graphs - 18th Japan Conference, JCDCGG 2015, Kyoto, Japan, September 14-16, 2015, Revised Selected Papers, 228-240 Discrete and Computational Geometry and Graphs - 18th Japan Conference, JCDCGG 2015, Kyoto, Japan, September 14-16, 2015, Revised Selected Papers, 228-240 Discrete and Computational Geometry and Graphs - 18th Japan Conference, JCDCGG 2015, Kyoto, Japan, September 14-16, 2015, Revised Selected Papers, 228-240 2015 Refereed Disclose to all
Seok-Hee Hong,Hiroshi Nagamochi Seok-Hee Hong,Hiroshi Nagamochi Seok-Hee Hong,Hiroshi Nagamochi Testing Full Outer-2-planarity in Linear Time. Testing Full Outer-2-planarity in Linear Time. Testing Full Outer-2-planarity in Linear Time. Graph-Theoretic Concepts in Computer Science - 41st International Workshop, WG 2015, Garching, Germany, June 17-19, 2015, Revised Papers, 406-421 Graph-Theoretic Concepts in Computer Science - 41st International Workshop, WG 2015, Garching, Germany, June 17-19, 2015, Revised Papers, 406-421 Graph-Theoretic Concepts in Computer Science - 41st International Workshop, WG 2015, Garching, Germany, June 17-19, 2015, Revised Papers, 406-421 2015 Refereed Disclose to all
Mingyu Xiao,NAGAMOCHI Hiroshi Xiao M., Nagamochi H. 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, P2, 207-216 Theor. Comput. Sci., 560, P2, 207-216 Theor. Comput. Sci., 560, P2, 207-216 2014 Refereed English Disclose to all
Mingyu Xiao,Hiroshi Nagamochi Mingyu Xiao,Hiroshi Nagamochi Mingyu Xiao,Hiroshi Nagamochi Exact Algorithms for Dominating Induced Matching Based on Graph Partition. Exact Algorithms for Dominating Induced Matching Based on Graph Partition. Exact Algorithms for Dominating Induced Matching Based on Graph Partition. CoRR, abs/1408.6196 CoRR, abs/1408.6196 CoRR, abs/1408.6196 2014 Refereed Disclose to all
Masaki Suzuki,NAGAMOCHI Hiroshi Suzuki M., Akutsu T., Nagamochi H. 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 J. Cheminformatics, 6, 1, 31 J. Cheminformatics, 6, 1, 31 2014 Refereed English Disclose to all
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, C, 8-20 J. Discrete Algorithms, 29, C, 8-20 J. Discrete Algorithms, 29, C, 8-20 2014 Refereed English Disclose to all
M. Xiao; H. Nagamochi Mingyu Xiao,Hiroshi 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. Exact algorithms for annotated edge dominating set in graphs with degree bounded by 3 IEICE Transactions on Information and Systems, 96-D, 3, 408-418 IEICE Transactions, 96-D, 3, 408-418 IEICE Transactions on Information and Systems, 96-D, 3, 408-418 2013 Refereed English Disclose to all
A. Shurbevski; H. Nagamochi; Y. Karuno Aleksandar Shurbevski,Hiroshi Nagamochi,Yoshiyuki 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. Better approximation algorithms for grasp-and-delivery robot routing problems IEICE Transactions on Information and Systems, 96-D, 3, 450-456 IEICE Transactions, 96-D, 3, 450-456 IEICE Transactions on Information and Systems, 96-D, 3, 450-456 2013 Refereed English Disclose to all
Y. Zhao; M. Hayashida; J. Jindalertudomdee; H. Nagamochi; T. Akutsu Yang Zhao,Morihiro Hayashida,Jira Jindalertudomdee,Hiroshi Nagamochi,Tatsuya 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. Breadth-first search approach to enumeration of tree-like chemical compounds Journal of Bioinformatics and Computational Biology, 11, 6 J. Bioinformatics and Computational Biology, 11, 6 Journal of Bioinformatics and Computational Biology, 11, 6 2013 Refereed English Disclose to all
M. Xiao; H. Nagamochi Mingyu Xiao,Hiroshi 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. Confining sets and avoiding bottleneck cases: A simple maximum independent set algorithm in degree-3 graphs Theoretical Computer Science, 469, 92-104 Theor. Comput. Sci., 469, 92-104 Theoretical Computer Science, 469, 92-104 2013 Refereed English Disclose to all
M. Xiao; T. Fukunaga; H. Nagamochi Mingyu Xiao,Array,Hiroshi Nagamochi M. Xiao; T. Fukunaga; H. Nagamochi FPTASs for trimming weighted trees FPTASs for trimming weighted trees. FPTASs for trimming weighted trees Theoretical Computer Science, 469, 105-118 Theor. Comput. Sci., 469, 105-118 Theoretical Computer Science, 469, 105-118 2013 Refereed English Disclose to all
M. Xiao; H. Nagamochi Mingyu Xiao,Hiroshi 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. Parameterized edge dominating set in graphs with degree bounded by 3 Theoretical Computer Science, 508, 2-15 Theor. Comput. Sci., 508, 2-15 Theoretical Computer Science, 508, 2-15 2013 Refereed English Disclose to all
Kazumasa Okumoto, Takuro Fukunaga, Hiroshi Nagamochi: 永持 仁 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 Algorithmica, 62, 3-4, 787-806 Algorithmica, 62, 3-4, 787-806 2012 Refereed English Disclose to all
Y. Arahori; T. Imamichi; H. Nagamochi Yohei Arahori,Takashi Imamichi,Hiroshi 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. An exact strip packing algorithm based on canonical forms Computers and Operations Research, 39, 12, 2991-3011 Computers & OR, 39, 12, 2991-3011 Computers and Operations Research, 39, 12, 2991-3011 2012 Refereed English Disclose to all
Seok-Hee Hong, Hiroshi Nagamochi: 永持 仁 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 Algorithmica, 62, 3-4, 1122-1158 Algorithmica, 62, 3-4, 1122-1158 2012 Refereed English Disclose to all
T. Imada; H. Nagamochi Tomoki Imada,Hiroshi Nagamochi T. Imada; H. Nagamochi Indexing all rooted subgraphs of a rooted graph Indexing All Rooted Subgraphs of a Rooted Graph. Indexing all rooted subgraphs of a rooted graph IEICE Transactions on Information and Systems, 95-D, 3, 712-721 IEICE Transactions, 95-D, 3, 712-721 IEICE Transactions on Information and Systems, 95-D, 3, 712-721 2012 Refereed English Disclose to all
Y. Zhao; M. Hayashida; J.C. Nacher; H. Nagamochi; T. Akutsu Yang Zhao,Morihiro Hayashida,Jose C. Nacher,Hiroshi Nagamochi,Tatsuya 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. Protein complex prediction via improved verification methods using constrained domain-domain matching International Journal of Bioinformatics Research and Applications, 8, 3/4, 210-227 IJBRA, 8, 3/4, 210-227 International Journal of Bioinformatics Research and Applications, 8, 3/4, 210-227 2012 Refereed English Disclose to all
M. Xiao; H. Nagamochi Mingyu Xiao,Hiroshi Nagamochi M. Xiao; H. Nagamochi An FPT algorithm for edge subset feedback edge set An FPT algorithm for edge subset feedback edge set. An FPT algorithm for edge subset feedback edge set Information Processing Letters, 112, 1-2, 5-9 Inf. Process. Lett., 112, 1-2, 5-9 Information Processing Letters, 112, 1-2, 5-9 2012 Refereed English Disclose to all
S.-H. Hong; H. Nagamochi Seok-Hee Hong,Hiroshi 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. Minimum cost star-shaped drawings of plane graphs with a fixed embedding and concave corner constraints Theoretical Computer Science, 445, 36-51 Theor. Comput. Sci., 445, 36-51 Theoretical Computer Science, 445, 36-51 2012 Refereed English Disclose to all
S. Imahori; Y. Karuno; H. Nagamochi; X. Wang Shinji Imahori,Yoshiyuki Karuno,Hiroshi Nagamochi,Xiaoming 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. Kansei engineering, humans and computers: Efficient dynamic programming algorithms for combinatorial food packing problems International Journal of Biometrics, 3, 3, 228-245 IJBM, 3, 3, 228-245 International Journal of Biometrics, 3, 3, 228-245 2011 Refereed English Disclose to all
S.-H. Hong; H. Nagamochi Seok-Hee Hong,Hiroshi Nagamochi S.-H. Hong; H. Nagamochi Guest editors\\' foreword Guest Editors' Foreword. Guest editors\\' foreword International Journal of Computational Geometry and Applications, 21, 3, 251-252 Int. J. Comput. Geometry Appl., 21, 3, 251-252 International Journal of Computational Geometry and Applications, 21, 3, 251-252 2011 Refereed English Disclose to all
Hirofumi Aota,Takuro Fukunaga,Hiroshi Nagamochi Hirofumi Aota,Takuro Fukunaga,Hiroshi Nagamochi Hirofumi Aota,Takuro Fukunaga,Hiroshi Nagamochi An Approximation Algorithm for Locating Maximal Disks within Convex Polygons. An Approximation Algorithm for Locating Maximal Disks within Convex Polygons. An Approximation Algorithm for Locating Maximal Disks within Convex Polygons. Int. J. Comput. Geometry Appl., 21, 6, 661-684 Int. J. Comput. Geometry Appl., 21, 6, 661-684 Int. J. Comput. Geometry Appl., 21, 6, 661-684 2011 Refereed Disclose to all
Y. Karuno; H. Nagamochi; A. Shurbevski Yoshiyuki Karuno,Hiroshi Nagamochi,Aleksandar 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. 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 JACIII, 15, 8, 1103-1108 Journal of Advanced Computational Intelligence and Intelligent Informatics, 15, 8, 1103-1108 2011 Refereed English Disclose to all
Tomoki Imada,Shunsuke Ota,Hiroshi Nagamochi,Tatsuya Akutsu Tomoki Imada,Shunsuke Ota,Hiroshi Nagamochi,Tatsuya Akutsu Tomoki Imada,Shunsuke Ota,Hiroshi Nagamochi,Tatsuya Akutsu Efficient Enumeration of Stereoisomers of Outerplanar Chemical Graphs Using Dynamic Programming. Efficient Enumeration of Stereoisomers of Outerplanar Chemical Graphs Using Dynamic Programming. Efficient Enumeration of Stereoisomers of Outerplanar Chemical Graphs Using Dynamic Programming. Journal of Chemical Information and Modeling, 51, 11, 2788-2807 Journal of Chemical Information and Modeling, 51, 11, 2788-2807 Journal of Chemical Information and Modeling, 51, 11, 2788-2807 2011 Refereed Disclose to all
Array,Hiroshi Nagamochi Array,Hiroshi Nagamochi Array,Hiroshi Nagamochi Approximating capacitated tree-routings in networks. Approximating capacitated tree-routings in networks. Approximating capacitated tree-routings in networks. J. Comb. Optim., 21, 2, 254-267 J. Comb. Optim., 21, 2, 254-267 J. Comb. Optim., 21, 2, 254-267 2011 Refereed Disclose to all
S. Karakawa; E. Morsy; H. Nagamochi Seigo Karakawa,Ehab Morsy,Hiroshi Nagamochi S. Karakawa; E. Morsy; H. Nagamochi Minmax tree cover in the euclidean space Minmax Tree Cover in the Euclidean Space. Minmax tree cover in the euclidean space Journal of Graph Algorithms and Applications, 15, 3, 345-371 J. Graph Algorithms Appl., 15, 3, 345-371 Journal of Graph Algorithms and Applications, 15, 3, 345-371 2011 Refereed English Disclose to all
T. Ibaraki; T. Imamichi; Y. Koga; H. Nagamochi; K. Nonobe; M. Yagiura Toshihide Ibaraki,Takashi Imamichi,Yuichi Koga,Hiroshi Nagamochi,Koji Nonobe,Mutsunori 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. Efficient branch-and-bound algorithms for weighted MAX-2-SAT Mathematical Programming, 127, 2, 297-343 Math. Program., 127, 2, 297-343 Mathematical Programming, 127, 2, 297-343 2011 Refereed English Disclose to all
Kazuki Matsumoto,Array,Hiroshi Nagamochi Kazuki Matsumoto,Array,Hiroshi Nagamochi Kazuki Matsumoto,Array,Hiroshi 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. On the one-dimensional stock cutting problem in the paper tube industry. J. Scheduling, 14, 3, 281-290 J. Scheduling, 14, 3, 281-290 J. Scheduling, 14, 3, 281-290 2011 Refereed Disclose to all
Hiroshi Nagamochi Hiroshi Nagamochi Hiroshi Nagamochi Cop-robber guarding game with cycle robber-region. Cop-robber guarding game with cycle robber-region. Cop-robber guarding game with cycle robber-region. Theor. Comput. Sci., 412, 4-5, 383-390 Theor. Comput. Sci., 412, 4-5, 383-390 Theor. Comput. Sci., 412, 4-5, 383-390 2011 Refereed Disclose to all
S.-H. Hong; H. Nagamochi Seok-Hee Hong,Hiroshi Nagamochi S.-H. Hong; H. Nagamochi Editorial: ISAAC 2008 special issue Editorial: ISAAC 2008 Special Issue. Editorial: ISAAC 2008 special issue Algorithmica (New York), 61, 4, 777-778 Algorithmica, 61, 4, 777-778 Algorithmica (New York), 61, 4, 777-778 2011 Refereed English Disclose to all
Seok-Hee Hong,Hiroshi Nagamochi Seok-Hee Hong,Hiroshi Nagamochi Seok-Hee Hong,Hiroshi 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. Extending Steinitz's Theorem to Upward Star-Shaped Polyhedra and Spherical Polyhedra. Algorithmica, 61, 4, 1022-1076 Algorithmica, 61, 4, 1022-1076 Algorithmica, 61, 4, 1022-1076 2011 Refereed Disclose to all
M. Shimizu; H. Nagamochi; T. Akutsu Masaaki Shimizu,Hiroshi Nagamochi,Tatsuya 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. Enumerating tree-like chemical graphs with given upper and lower bounds on path frequencies. BMC bioinformatics, 12, S-14, S3 BMC Bioinformatics, 12, S-14, S3 BMC bioinformatics, 12, S-14, S3 2011 Refereed English Disclose to all
Bingbing Zhuang,Hiroshi Nagamochi Bingbing Zhuang,Hiroshi Nagamochi Bingbing Zhuang,Hiroshi Nagamochi Generation of Symmetric and Asymmetric Biconnected Rooted Triangulated Planar Graphs. Generation of Symmetric and Asymmetric Biconnected Rooted Triangulated Planar Graphs. Generation of Symmetric and Asymmetric Biconnected Rooted Triangulated Planar Graphs. IEICE Transactions, 94-D, 2, 200-210 IEICE Transactions, 94-D, 2, 200-210 IEICE Transactions, 94-D, 2, 200-210 2011 Refereed Disclose to all
Bingbing Zhuang,Hiroshi Nagamochi Bingbing Zhuang,Hiroshi Nagamochi Bingbing Zhuang,Hiroshi Nagamochi Generation of Symmetric and Asymmetric Biconnected Rooted Outerplanar Graphs. Generation of Symmetric and Asymmetric Biconnected Rooted Outerplanar Graphs. Generation of Symmetric and Asymmetric Biconnected Rooted Outerplanar Graphs. IEICE Transactions, 94-D, 2, 211-219 IEICE Transactions, 94-D, 2, 211-219 IEICE Transactions, 94-D, 2, 211-219 2011 Refereed Disclose to all
Tatsuya Akutsu,Hiroshi Nagamochi Tatsuya Akutsu,Hiroshi Nagamochi Tatsuya Akutsu,Hiroshi Nagamochi Kernel Methods for Chemical Compounds: From Classification to Design. Kernel Methods for Chemical Compounds: From Classification to Design. Kernel Methods for Chemical Compounds: From Classification to Design. IEICE Transactions, 94-D, 10, 1846-1853 IEICE Transactions, 94-D, 10, 1846-1853 IEICE Transactions, 94-D, 10, 1846-1853 2011 Refereed Disclose to all
Hiroshi Nagamochi Hiroshi Nagamochi Hiroshi Nagamochi Minimum Degree Orderings. Minimum Degree Orderings. Minimum Degree Orderings. Algorithmica, 56, 1, 17-34 Algorithmica, 56, 1, 17-34 Algorithmica, 56, 1, 17-34 2010 Refereed Disclose to all
Toshimasa Ishii,Yoko Akiyama,Hiroshi Nagamochi Toshimasa Ishii,Yoko Akiyama,Hiroshi Nagamochi Toshimasa Ishii,Yoko Akiyama,Hiroshi 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. Minimum Augmentation of Edge-Connectivity between Vertices and Sets of Vertices in Undirected Graphs. Algorithmica, 56, 4, 413-436 Algorithmica, 56, 4, 413-436 Algorithmica, 56, 4, 413-436 2010 Refereed Disclose to all
Seok-Hee Hong,Hiroshi Nagamochi Seok-Hee Hong,Hiroshi Nagamochi Seok-Hee Hong,Hiroshi 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. A Linear-Time Algorithm for Symmetric Convex Drawings of Internally Triconnected Plane Graphs. Algorithmica, 58, 2, 433-460 Algorithmica, 58, 2, 433-460 Algorithmica, 58, 2, 433-460 2010 Refereed Disclose to all
Seok-Hee Hong,Hiroshi Nagamochi Seok-Hee Hong,Hiroshi Nagamochi Seok-Hee Hong,Hiroshi Nagamochi Approximation Algorithms for Minimizing Edge Crossings in Radial Drawings. Approximation Algorithms for Minimizing Edge Crossings in Radial Drawings. Approximation Algorithms for Minimizing Edge Crossings in Radial Drawings. Algorithmica, 58, 2, 478-497 Algorithmica, 58, 2, 478-497 Algorithmica, 58, 2, 478-497 2010 Refereed Disclose to all
Seok-Hee Hong,Hiroshi Nagamochi Seok-Hee Hong,Hiroshi Nagamochi Seok-Hee Hong,Hiroshi Nagamochi An algorithm for constructing star-shaped drawings of plane graphs. An algorithm for constructing star-shaped drawings of plane graphs. An algorithm for constructing star-shaped drawings of plane graphs. Comput. Geom., 43, 2, 191-206 Comput. Geom., 43, 2, 191-206 Comput. Geom., 43, 2, 191-206 2010 Refereed Disclose to all
Array,Hiroshi Nagamochi Array,Hiroshi Nagamochi Array,Hiroshi Nagamochi Network design with weighted degree constraints. Network design with weighted degree constraints. Network design with weighted degree constraints. Discrete Optimization, 7, 4, 246-255 Discrete Optimization, 7, 4, 246-255 Discrete Optimization, 7, 4, 246-255 2010 Refereed Disclose to all
Ehab Morsy,Hiroshi Nagamochi Ehab Morsy,Hiroshi Nagamochi Ehab Morsy,Hiroshi Nagamochi Approximation to the Minimum Cost Edge Installation Problem. Approximation to the Minimum Cost Edge Installation Problem. Approximation to the Minimum Cost Edge Installation Problem. IEICE Transactions, 93-A, 4, 778-786 IEICE Transactions, 93-A, 4, 778-786 IEICE Transactions, 93-A, 4, 778-786 2010 Refereed Disclose to all
Yusuke Ishida,Yuki Kato,Liang Zhao,Hiroshi Nagamochi,Tatsuya Akutsu Yusuke Ishida,Yuki Kato,Liang Zhao,Hiroshi Nagamochi,Tatsuya Akutsu Yusuke Ishida,Yuki Kato,Liang Zhao,Hiroshi Nagamochi,Tatsuya 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. 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 Journal of Chemical Information and Modeling, 50, 5, 934-946 Journal of Chemical Information and Modeling, 50, 5, 934-946 2010 Refereed Disclose to all
S.-H. Hong; H. Nagamochi Seok-Hee Hong,Hiroshi 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. Convex drawings of hierarchical planar graphs and clustered planar graphs Journal of Discrete Algorithms, 8, 3, 282-295 J. Discrete Algorithms, 8, 3, 282-295 Journal of Discrete Algorithms, 8, 3, 282-295 2010 Refereed English Disclose to all
E. Morsy; H. Nagamochi Ehab Morsy,Hiroshi 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. On the approximation of the generalized capacitated tree-routing problem Journal of Discrete Algorithms, 8, 3, 311-320 J. Discrete Algorithms, 8, 3, 311-320 Journal of Discrete Algorithms, 8, 3, 311-320 2010 Refereed English Disclose to all
Shunsuke Ota,Array,Hiroshi Nagamochi Shunsuke Ota,Array,Hiroshi Nagamochi Shunsuke Ota,Array,Hiroshi Nagamochi A plane graph representation of triconnected graphs. A plane graph representation of triconnected graphs. A plane graph representation of triconnected graphs. Theor. Comput. Sci., 411, 44-46, 3979-3993 Theor. Comput. Sci., 411, 44-46, 3979-3993 Theor. Comput. Sci., 411, 44-46, 3979-3993 2010 Refereed Disclose to all
Tatsuya Ohshima,Pipaporn Eumthurapojn,Liang Zhao,Hiroshi Nagamochi Tatsuya Ohshima,Pipaporn Eumthurapojn,Liang Zhao,Hiroshi Nagamochi Tatsuya Ohshima,Pipaporn Eumthurapojn,Liang Zhao,Hiroshi 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. An A* Algorithm Framework for the Point-to-Point Time-Dependent Shortest Path Problem. Computational Geometry, Graphs and Applications - 9th International Conference, CGGA 2010, Dalian, China, November 3-6, 2010, Revised Selected Papers, 154-163 Computational Geometry, Graphs and Applications - 9th International Conference, CGGA 2010, Dalian, China, November 3-6, 2010, Revised Selected Papers, 154-163 Computational Geometry, Graphs and Applications - 9th International Conference, CGGA 2010, Dalian, China, November 3-6, 2010, Revised Selected Papers, 154-163 2010 Refereed Disclose to all
B. Zhuang; H. Nagamochi Bingbing Zhuang,Hiroshi Nagamochi B. Zhuang; H. Nagamochi Enumerating rooted graphs with reflectional block structures Enumerating Rooted Graphs with Reflectional Block Structures. 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, 49-60 Algorithms and Complexity, 7th International Conference, CIAC 2010, Rome, Italy, May 26-28, 2010. Proceedings, 6078, 49-60 Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 6078, 49-60 2010 Refereed English Disclose to all
B. Zhuang; H. Nagamochi Bingbing Zhuang,Hiroshi Nagamochi B. Zhuang; H. Nagamochi Listing triconnected rooted plane graphs Listing Triconnected Rooted Plane Graphs. Listing triconnected rooted plane graphs Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 6509, 347-361 Combinatorial Optimization and Applications - 4th International Conference, COCOA 2010, Kailua-Kona, HI, USA, December 18-20, 2010, Proceedings, Part II, 6509, 347-361 Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 6509, 347-361 2010 Refereed English Disclose to all
B. Zhuang; H. Nagamochi Bingbing Zhuang,Hiroshi Nagamochi B. Zhuang; H. Nagamochi Constant time generation of biconnected rooted plane graphs Constant Time Generation of Biconnected Rooted Plane Graphs. 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, 113-123 Frontiers in Algorithmics, 4th International Workshop, FAW 2010, Wuhan, China, August 11-13, 2010. Proceedings, 6213, 113-123 Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 6213, 113-123 2010 Refereed English Disclose to all
B. Zhuang; H. Nagamochi Bingbing Zhuang,Hiroshi Nagamochi B. Zhuang; H. Nagamochi Generating trees on multisets Generating Trees on Multisets. Generating trees on multisets Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 6506, 182-193 Algorithms and Computation - 21st International Symposium, ISAAC 2010, Jeju Island, Korea, December 15-17, 2010, Proceedings, Part I, 6506, 182-193 Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 6506, 182-193 2010 Refereed English Disclose to all
B. Zhuang; H. Nagamochi Bingbing Zhuang,Hiroshi Nagamochi B. Zhuang; H. Nagamochi Generating internally triconnected rooted plane graphs Generating Internally Triconnected Rooted Plane Graphs. Generating internally triconnected rooted plane graphs Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 6108, 467-478 Theory and Applications of Models of Computation, 7th Annual Conference, TAMC 2010, Prague, Czech Republic, June 7-11, 2010. Proceedings, 6108, 467-478 Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 6108, 467-478 2010 Refereed English Disclose to all
Hiroshi Nagamochi Hiroshi Nagamochi Hiroshi Nagamochi A Detachment Algorithm for Inferring a Graph from Path Frequency. A Detachment Algorithm for Inferring a Graph from Path Frequency. A Detachment Algorithm for Inferring a Graph from Path Frequency. Algorithmica, 53, 2, 207-224 Algorithmica, 53, 2, 207-224 Algorithmica, 53, 2, 207-224 2009 Refereed Disclose to all
Array,Hiroshi Nagamochi Array,Hiroshi Nagamochi Array,Hiroshi Nagamochi Eulerian detachments with local edge-connectivity. Eulerian detachments with local edge-connectivity. Eulerian detachments with local edge-connectivity. Discrete Applied Mathematics, 157, 4, 691-698 Discrete Applied Mathematics, 157, 4, 691-698 Discrete Applied Mathematics, 157, 4, 691-698 2009 Refereed Disclose to all
Takashi Imamichi,Mutsunori Yagiura,Hiroshi Nagamochi Takashi Imamichi,Mutsunori Yagiura,Hiroshi Nagamochi Takashi Imamichi,Mutsunori 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. An iterated local search algorithm based on nonlinear programming for the irregular strip packing problem. Discrete Optimization, 6, 4, 345-361 Discrete Optimization, 6, 4, 345-361 Discrete Optimization, 6, 4, 345-361 2009 Refereed Disclose to all
Mitsutoshi Kenmochi,Takashi Imamichi,Koji Nonobe,Mutsunori Yagiura,Hiroshi Nagamochi Mitsutoshi Kenmochi,Takashi Imamichi,Koji Nonobe,Mutsunori Yagiura,Hiroshi Nagamochi Mitsutoshi Kenmochi,Takashi Imamichi,Koji Nonobe,Mutsunori Yagiura,Hiroshi 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. Exact algorithms for the two-dimensional strip packing problem with and without rotations. European Journal of Operational Research, 198, 1, 73-83 European Journal of Operational Research, 198, 1, 73-83 European Journal of Operational Research, 198, 1, 73-83 2009 Refereed Disclose to all
S.-H. Hong; H. Nagamochi Seok-Hee Hong,Hiroshi Nagamochi S.-H. Hong; H. Nagamochi New approximation to the one-sided radial crossing minimization New Approximation to the One-sided Radial Crossing Minimization. New approximation to the one-sided radial crossing minimization Journal of Graph Algorithms and Applications, 13, 2, 179-196 J. Graph Algorithms Appl., 13, 2, 179-196 Journal of Graph Algorithms and Applications, 13, 2, 179-196 2009 Refereed English Disclose to all
Array,Hiroshi Nagamochi Array,Hiroshi Nagamochi Array,Hiroshi Nagamochi Network Design with Edge-Connectivity and Degree Constraints. Network Design with Edge-Connectivity and Degree Constraints. Network Design with Edge-Connectivity and Degree Constraints. Theory Comput. Syst., 45, 3, 512-532 Theory Comput. Syst., 45, 3, 512-532 Theory Comput. Syst., 45, 3, 512-532 2009 Refereed Disclose to all
M. Sakashita; K. Makino; H. Nagamochi; S. Fujishige Mariko Sakashita,Kazuhisa Makino,Hiroshi Nagamochi,Array M. Sakashita; K. Makino; H. Nagamochi; S. Fujishige Minimum transversals in posimodular systems Minimum Transversals in Posimodular Systems. Minimum transversals in posimodular systems SIAM Journal on Discrete Mathematics, 23, 2, 858-871 SIAM J. Discrete Math., 23, 2, 858-871 SIAM Journal on Discrete Mathematics, 23, 2, 858-871 2009 Refereed English Disclose to all
Akifumi Kawaguchi,Hiroshi Nagamochi Akifumi Kawaguchi,Hiroshi Nagamochi Akifumi Kawaguchi,Hiroshi Nagamochi Drawing slicing graphs with face areas. Drawing slicing graphs with face areas. Drawing slicing graphs with face areas. Theor. Comput. Sci., 410, 11, 1061-1072 Theor. Comput. Sci., 410, 11, 1061-1072 Theor. Comput. Sci., 410, 11, 1061-1072 2009 Refereed Disclose to all
Seok-Hee Hong,Hiroshi Nagamochi Seok-Hee Hong,Hiroshi Nagamochi Seok-Hee Hong,Hiroshi Nagamochi Convex drawings of graphs with non-convex boundary constraints. Convex drawings of graphs with non-convex boundary constraints. Convex drawings of graphs with non-convex boundary constraints. Discrete Applied Mathematics, 156, 12, 2368-2380 Discrete Applied Mathematics, 156, 12, 2368-2380 Discrete Applied Mathematics, 156, 12, 2368-2380 2008 Refereed Disclose to all
Takashi Imamichi,Hiroshi Nagamochi Takashi Imamichi,Hiroshi Nagamochi Takashi Imamichi,Hiroshi 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. Performance Analysis of a Collision Detection Algorithm of Spheres Based on Slab Partitioning. IEICE Transactions, 91-A, 9, 2308-2313 IEICE Transactions, 91-A, 9, 2308-2313 IEICE Transactions, 91-A, 9, 2308-2313 2008 Refereed Disclose to all
Yoshitaka Nakao,Hiroshi Nagamochi Yoshitaka Nakao,Hiroshi Nagamochi Yoshitaka Nakao,Hiroshi Nagamochi Worst Case Analysis for Pickup and Delivery Problems with Transfer. Worst Case Analysis for Pickup and Delivery Problems with Transfer. Worst Case Analysis for Pickup and Delivery Problems with Transfer. IEICE Transactions, 91-A, 9, 2328-2334 IEICE Transactions, 91-A, 9, 2328-2334 IEICE Transactions, 91-A, 9, 2328-2334 2008 Refereed Disclose to all
Hiroki Fujiwara,Jiexun Wang,Liang Zhao,Hiroshi Nagamochi,Tatsuya Akutsu Hiroki Fujiwara,Jiexun Wang,Liang Zhao,Hiroshi Nagamochi,Tatsuya Akutsu Hiroki Fujiwara,Jiexun Wang,Liang Zhao,Hiroshi Nagamochi,Tatsuya Akutsu Enumerating Treelike Chemical Graphs with Given Path Frequency. Enumerating Treelike Chemical Graphs with Given Path Frequency. Enumerating Treelike Chemical Graphs with Given Path Frequency. Journal of Chemical Information and Modeling, 48, 7, 1345-1357 Journal of Chemical Information and Modeling, 48, 7, 1345-1357 Journal of Chemical Information and Modeling, 48, 7, 1345-1357 2008 Refereed Disclose to all
Array,Hiroshi Nagamochi Array,Hiroshi Nagamochi Array,Hiroshi Nagamochi An improved approximation algorithm for capacitated multicast routings in networks. An improved approximation algorithm for capacitated multicast routings in networks. An improved approximation algorithm for capacitated multicast routings in networks. Theor. Comput. Sci., 390, 1, 81-91 Theor. Comput. Sci., 390, 1, 81-91 Theor. Comput. Sci., 390, 1, 81-91 2008 Refereed Disclose to all
Hiroshi Nagamochi,Takaharu Ohnishi Hiroshi Nagamochi,Takaharu Ohnishi Hiroshi Nagamochi,Takaharu Ohnishi Approximating a vehicle scheduling problem with time windows and handling times. Approximating a vehicle scheduling problem with time windows and handling times. Approximating a vehicle scheduling problem with time windows and handling times. Theor. Comput. Sci., 393, 1-3, 133-146 Theor. Comput. Sci., 393, 1-3, 133-146 Theor. Comput. Sci., 393, 1-3, 133-146 2008 Refereed Disclose to all
E. Morsy; H. Nagamochi Ehab Morsy,Hiroshi Nagamochi E. Morsy; H. Nagamochi Approximating the generalized capacitated tree-routing problem Approximating the Generalized Capacitated Tree-Routing Problem. 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, 621-630 Computing and Combinatorics, 14th Annual International Conference, COCOON 2008, Dalian, China, June 27-29, 2008, Proceedings, 5092, 621-630 Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 5092, 621-630 2008 Refereed English Disclose to all
Algorithms and Computation, 19th International Symposium, ISAAC 2008, Gold Coast, Australia, December 15-17, 2008. Proceedings Algorithms and Computation, 19th International Symposium, ISAAC 2008, Gold Coast, Australia, December 15-17, 2008. Proceedings Algorithms and Computation, 19th International Symposium, ISAAC 2008, Gold Coast, Australia, December 15-17, 2008. Proceedings ISAAC 2008, 5369 ISAAC 2008, 5369 ISAAC 2008, 5369 2008 Refereed Disclose to all
Hiroshi Nagamochi,Yuusuke Abe Hiroshi Nagamochi,Yuusuke Abe Hiroshi Nagamochi,Yuusuke 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. An approximation algorithm for dissecting a rectangle into rectangles with specified areas. Discrete Applied Mathematics, 155, 4, 523-537 Discrete Applied Mathematics, 155, 4, 523-537 Discrete Applied Mathematics, 155, 4, 523-537 2007 Refereed Disclose to all
Hiroshi Nagamochi,Katsutoshi Kuroya Hiroshi Nagamochi,Katsutoshi Kuroya Hiroshi Nagamochi,Katsutoshi Kuroya Drawing c-planar biconnected clustered graphs. Drawing c-planar biconnected clustered graphs. Drawing c-planar biconnected clustered graphs. Discrete Applied Mathematics, 155, 9, 1155-1174 Discrete Applied Mathematics, 155, 9, 1155-1174 Discrete Applied Mathematics, 155, 9, 1155-1174 2007 Refereed Disclose to all
Toshimasa Ishii,Kengo Iwata,Hiroshi Nagamochi Toshimasa Ishii,Kengo Iwata,Hiroshi Nagamochi Toshimasa Ishii,Kengo Iwata,Hiroshi Nagamochi Bisecting a 4-connected graph with three resource sets. Bisecting a 4-connected graph with three resource sets. Bisecting a 4-connected graph with three resource sets. Discrete Applied Mathematics, 155, 11, 1441-1450 Discrete Applied Mathematics, 155, 11, 1441-1450 Discrete Applied Mathematics, 155, 11, 1441-1450 2007 Refereed Disclose to all
Toshimasa Ishii,Hitoshi Fujita,Hiroshi Nagamochi Toshimasa Ishii,Hitoshi Fujita,Hiroshi Nagamochi Toshimasa Ishii,Hitoshi Fujita,Hiroshi Nagamochi The source location problem with local 3-vertex-connectivity requirements. The source location problem with local 3-vertex-connectivity requirements. The source location problem with local 3-vertex-connectivity requirements. Discrete Applied Mathematics, 155, 18, 2523-2538 Discrete Applied Mathematics, 155, 18, 2523-2538 Discrete Applied Mathematics, 155, 18, 2523-2538 2007 Refereed Disclose to all
Array,Hiroshi Nagamochi Array,Hiroshi Nagamochi Array,Hiroshi Nagamochi Generalizing the induced matching by edge capacity constraints. Generalizing the induced matching by edge capacity constraints. Generalizing the induced matching by edge capacity constraints. Discrete Optimization, 4, 2, 198-205 Discrete Optimization, 4, 2, 198-205 Discrete Optimization, 4, 2, 198-205 2007 Refereed Disclose to all
Hiroshi Nagamochi Hiroshi Nagamochi Hiroshi 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. Computing a Minimum Cut in a Graph with Dynamic Edges Incident to a Designated Vertex. IEICE Transactions, 90-D, 2, 428-431 IEICE Transactions, 90-D, 2, 428-431 IEICE Transactions, 90-D, 2, 428-431 2007 Refereed Disclose to all
Array,Hiroshi Nagamochi Array,Hiroshi Nagamochi Array,Hiroshi Nagamochi Approximating a Generalization of Metric TSP. Approximating a Generalization of Metric TSP. Approximating a Generalization of Metric TSP. IEICE Transactions, 90-D, 2, 432-439 IEICE Transactions, 90-D, 2, 432-439 IEICE Transactions, 90-D, 2, 432-439 2007 Refereed Disclose to all
Ehab Morsy,Hiroshi Nagamochi Ehab Morsy,Hiroshi Nagamochi Ehab Morsy,Hiroshi Nagamochi Approximation Algorithms for Multicast Routings in a Network with Multi-Sources. Approximation Algorithms for Multicast Routings in a Network with Multi-Sources. Approximation Algorithms for Multicast Routings in a Network with Multi-Sources. IEICE Transactions, 90-A, 5, 900-906 IEICE Transactions, 90-A, 5, 900-906 IEICE Transactions, 90-A, 5, 900-906 2007 Refereed Disclose to all
Y. Karuno; H. Nagamochi; J. Uchida 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 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, 727, 911-918 Nihon Kikai Gakkai Ronbunshu, C Hen/Transactions of the Japan Society of Mechanical Engineers, Part C, 73, 727, 911-918 Nihon Kikai Gakkai Ronbunshu, C Hen/Transactions of the Japan Society of Mechanical Engineers, Part C, 73, 727, 911-918 2007 Refereed Japanese Disclose to all
Kouji Hirata,Takahiro Matsuda 0001,Hiroshi Nagamochi,Tetsuya Takine Kouji Hirata,Takahiro Matsuda 0001,Hiroshi Nagamochi,Tetsuya Takine Kouji Hirata,Takahiro Matsuda 0001,Hiroshi Nagamochi,Tetsuya Takine Contention-Free lambda-Planes in Optically Burst-Switched WDM Networks. Contention-Free lambda-Planes in Optically Burst-Switched WDM Networks. Contention-Free lambda-Planes in Optically Burst-Switched WDM Networks. IEICE Transactions, 90-B, 9, 2524-2531 IEICE Transactions, 90-B, 9, 2524-2531 IEICE Transactions, 90-B, 9, 2524-2531 2007 Refereed Disclose to all
Hiroshi Nagamochi,Yoko Kamidoi Hiroshi Nagamochi,Yoko Kamidoi Hiroshi Nagamochi,Yoko Kamidoi Minimum cost subpartitions in graphs. Minimum cost subpartitions in graphs. Minimum cost subpartitions in graphs. Inf. Process. Lett., 102, 2-3, 79-84 Inf. Process. Lett., 102, 2-3, 79-84 Inf. Process. Lett., 102, 2-3, 79-84 2007 Refereed Disclose to all
Hiroshi Nagamochi,Kohei Okada Hiroshi Nagamochi,Kohei Okada Hiroshi Nagamochi,Kohei Okada Approximating the minmax rooted-tree cover in a tree. Approximating the minmax rooted-tree cover in a tree. Approximating the minmax rooted-tree cover in a tree. Inf. Process. Lett., 104, 5, 173-178 Inf. Process. Lett., 104, 5, 173-178 Inf. Process. Lett., 104, 5, 173-178 2007 Refereed Disclose to all
Yoko Kamidoi,Noriyoshi Yoshida,Hiroshi Nagamochi Yoko Kamidoi,Noriyoshi Yoshida,Hiroshi Nagamochi Yoko Kamidoi,Noriyoshi Yoshida,Hiroshi Nagamochi A Deterministic Algorithm for Finding All Minimum k-Way Cuts. A Deterministic Algorithm for Finding All Minimum k-Way Cuts. A Deterministic Algorithm for Finding All Minimum k-Way Cuts. SIAM J. Comput., 36, 5, 1329-1341 SIAM J. Comput., 36, 5, 1329-1341 SIAM J. Comput., 36, 5, 1329-1341 2007 Refereed Disclose to all
Toshimasa Ishii,Hitoshi Fujita,Hiroshi Nagamochi Toshimasa Ishii,Hitoshi Fujita,Hiroshi Nagamochi Toshimasa Ishii,Hitoshi 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. Minimum cost source location problem with local 3-vertex-connectivity requirements. Theor. Comput. Sci., 372, 1, 81-93 Theor. Comput. Sci., 372, 1, 81-93 Theor. Comput. Sci., 372, 1, 81-93 2007 Refereed Disclose to all
André Berger,Array,Hiroshi Nagamochi,Ojas Parekh André Berger,Array,Hiroshi Nagamochi,Ojas Parekh André Berger,Array,Hiroshi Nagamochi,Ojas Parekh Approximability of the capacitated b-edge dominating set problem. Approximability of the capacitated b-edge dominating set problem. Approximability of the capacitated b-edge dominating set problem. Theor. Comput. Sci., 385, 1-3, 202-213 Theor. Comput. Sci., 385, 1-3, 202-213 Theor. Comput. Sci., 385, 1-3, 202-213 2007 Refereed Disclose to all
Takuro Fukunaga,Hiroshi Nagamochi Takuro Fukunaga,Hiroshi Nagamochi Takuro Fukunaga,Hiroshi Nagamochi The Set Connector Problem in Graphs. The Set Connector Problem in Graphs. The Set Connector Problem in Graphs. Integer Programming and Combinatorial Optimization, 12th International IPCO Conference, Ithaca, NY, USA, June 25-27, 2007, Proceedings, 484-498 Integer Programming and Combinatorial Optimization, 12th International IPCO Conference, Ithaca, NY, USA, June 25-27, 2007, Proceedings, 484-498 Integer Programming and Combinatorial Optimization, 12th International IPCO Conference, Ithaca, NY, USA, June 25-27, 2007, Proceedings, 484-498 2007 Refereed Disclose to all
Ehab Morsy,Hiroshi Nagamochi Ehab Morsy,Hiroshi Nagamochi Ehab Morsy,Hiroshi Nagamochi Approximation to the Minimum Cost Edge Installation Problem. Approximation to the Minimum Cost Edge Installation Problem. Approximation to the Minimum Cost Edge Installation Problem. Algorithms and Computation, 18th International Symposium, ISAAC 2007, Sendai, Japan, December 17-19, 2007, Proceedings, 292-303 Algorithms and Computation, 18th International Symposium, ISAAC 2007, Sendai, Japan, December 17-19, 2007, Proceedings, 292-303 Algorithms and Computation, 18th International Symposium, ISAAC 2007, Sendai, Japan, December 17-19, 2007, Proceedings, 292-303 2007 Refereed Disclose to all
M. Yagiura; A. Komiya; K. Kojima; K. Nonobe; H. Nagamochi; T. Ibaraki; F. Glover Mutsunori Yagiura,Akira Komiya,Kenya Kojima,Koji Nonobe,Hiroshi Nagamochi,Toshihide Ibaraki,Fred 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. 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 Engineering Stochastic Local Search Algorithms. Designing, Implementing and Analyzing Effective Heuristics, International Workshop, SLS 2007, Brussels, Belgium, September 6-8, 2007, Proceedings, 4638 LNCS, 121-135 Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 4638 LNCS, 121-135 2007 Refereed English Disclose to all
Jiexun Wang,Liang Zhao,Hiroshi Nagamochi,Tatsuya Akutsu Jiexun Wang,Liang Zhao,Hiroshi Nagamochi,Tatsuya Akutsu Jiexun Wang,Liang Zhao,Hiroshi Nagamochi,Tatsuya Akutsu An Efficient Algorithm for Generating Colored Outerplanar Graphs. An Efficient Algorithm for Generating Colored Outerplanar Graphs. An Efficient Algorithm for Generating Colored Outerplanar Graphs. Theory and Applications of Models of Computation, 4th International Conference, TAMC 2007, Shanghai, China, May 22-25, 2007, Proceedings, 573-583 Theory and Applications of Models of Computation, 4th International Conference, TAMC 2007, Shanghai, China, May 22-25, 2007, Proceedings, 573-583 Theory and Applications of Models of Computation, 4th International Conference, TAMC 2007, Shanghai, China, May 22-25, 2007, Proceedings, 573-583 2007 Refereed Disclose to all
Yoshiyuki Karuno,Hiroshi Nagamochi Yoshiyuki Karuno,Hiroshi Nagamochi Yoshiyuki Karuno,Hiroshi Nagamochi Vehicle Scheduling Problems in Graphs. Vehicle Scheduling Problems in Graphs. Vehicle Scheduling Problems in Graphs. Handbook of Approximation Algorithms and Metaheuristics. Handbook of Approximation Algorithms and Metaheuristics. Handbook of Approximation Algorithms and Metaheuristics. 2007 Refereed Disclose to all
Mutsunori Yagiura,Hiroshi Nagamochi,Shinji Imahori Mutsunori Yagiura,Hiroshi Nagamochi,Shinji Imahori Mutsunori Yagiura,Hiroshi Nagamochi,Shinji Imahori Practical Algorithms for Two-Dimensional Packing. Practical Algorithms for Two-Dimensional Packing. Practical Algorithms for Two-Dimensional Packing. Handbook of Approximation Algorithms and Metaheuristics. Handbook of Approximation Algorithms and Metaheuristics. Handbook of Approximation Algorithms and Metaheuristics. 2007 Refereed Disclose to all
Kouji Hirata,Takahiro Matsuda 0001,Hiroshi Nagamochi,Tetsuya Takine Kouji Hirata,Takahiro Matsuda 0001,Hiroshi Nagamochi,Tetsuya Takine Kouji Hirata,Takahiro Matsuda 0001,Hiroshi Nagamochi,Tetsuya Takine Contention-Free l-Planes in Optically Burst-Switched WDM Networks. Contention-Free l-Planes in Optically Burst-Switched WDM Networks. Contention-Free l-Planes in Optically Burst-Switched WDM Networks. Proceedings of the Global Telecommunications Conference, 2006. GLOBECOM '06, San Francisco, CA, USA, 27 November - 1 December 2006 Proceedings of the Global Telecommunications Conference, 2006. GLOBECOM '06, San Francisco, CA, USA, 27 November - 1 December 2006 Proceedings of the Global Telecommunications Conference, 2006. GLOBECOM '06, San Francisco, CA, USA, 27 November - 1 December 2006 2006 Refereed Disclose to all
Seok-Hee Hong,Hiroshi Nagamochi Seok-Hee Hong,Hiroshi Nagamochi Seok-Hee Hong,Hiroshi Nagamochi Convex Drawings of Graphs with Non-convex Boundary. Convex Drawings of Graphs with Non-convex Boundary. Convex Drawings of Graphs with Non-convex Boundary. Graph-Theoretic Concepts in Computer Science, 32nd International Workshop, WG 2006, Bergen, Norway, June 22-24, 2006, Revised Papers, 113-124 Graph-Theoretic Concepts in Computer Science, 32nd International Workshop, WG 2006, Bergen, Norway, June 22-24, 2006, Revised Papers, 113-124 Graph-Theoretic Concepts in Computer Science, 32nd International Workshop, WG 2006, Bergen, Norway, June 22-24, 2006, Revised Papers, 113-124 2006 Refereed Disclose to all
Y. Karuno; H. Nagamochi; Y. Ohshima 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 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, 716, 1390-1397 Nihon Kikai Gakkai Ronbunshu, C Hen/Transactions of the Japan Society of Mechanical Engineers, Part C, 72, 716, 1390-1397 Nihon Kikai Gakkai Ronbunshu, C Hen/Transactions of the Japan Society of Mechanical Engineers, Part C, 72, 716, 1390-1397 2006 Refereed Japanese Disclose to all
Peter Eades,Qing-Wen Feng,Xuemin Lin,Hiroshi Nagamochi Peter Eades,Qing-Wen Feng,Xuemin Lin,Hiroshi Nagamochi Peter Eades,Qing-Wen Feng,Xuemin Lin,Hiroshi Nagamochi Straight-Line Drawing Algorithms for Hierarchical Graphs and Clustered Graphs. Straight-Line Drawing Algorithms for Hierarchical Graphs and Clustered Graphs. Straight-Line Drawing Algorithms for Hierarchical Graphs and Clustered Graphs. Algorithmica, 44, 1, 1-32 Algorithmica, 44, 1, 1-32 Algorithmica, 44, 1, 1-32 2006 Refereed Disclose to all
Toshimasa Ishii,Hiroshi Nagamochi,Toshihide Ibaraki Toshimasa Ishii,Hiroshi Nagamochi,Toshihide Ibaraki Toshimasa Ishii,Hiroshi Nagamochi,Toshihide Ibaraki Augmenting a (k-1)-Vertex-Connected Multigraph l-Edge-Connected and k-Vertex-Connected Multigraph. Augmenting a (k-1)-Vertex-Connected Multigraph l-Edge-Connected and k-Vertex-Connected Multigraph. Augmenting a (k-1)-Vertex-Connected Multigraph l-Edge-Connected and k-Vertex-Connected Multigraph. Algorithmica, 44, 3, 257-280 Algorithmica, 44, 3, 257-280 Algorithmica, 44, 3, 257-280 2006 Refereed Disclose to all
Hiroshi Nagamochi,Taizo Kawada Hiroshi Nagamochi,Taizo Kawada Hiroshi Nagamochi,Taizo Kawada Minmax subtree cover problem on cacti. Minmax subtree cover problem on cacti. Minmax subtree cover problem on cacti. Discrete Applied Mathematics, 154, 8, 1254-1263 Discrete Applied Mathematics, 154, 8, 1254-1263 Discrete Applied Mathematics, 154, 8, 1254-1263 2006 Refereed Disclose to all
Hiro Ito,Hiroshi Nagamochi Hiro Ito,Hiroshi Nagamochi Hiro Ito,Hiroshi Nagamochi Two equivalent measures on weighted hypergraphs. Two equivalent measures on weighted hypergraphs. Two equivalent measures on weighted hypergraphs. Discrete Applied Mathematics, 154, 16, 2330-2334 Discrete Applied Mathematics, 154, 16, 2330-2334 Discrete Applied Mathematics, 154, 16, 2330-2334 2006 Refereed Disclose to all
Hiroshi Nagamochi Hiroshi Nagamochi Hiroshi Nagamochi Sparse connectivity certificates via MA orderings in graphs. Sparse connectivity certificates via MA orderings in graphs. Sparse connectivity certificates via MA orderings in graphs. Discrete Applied Mathematics, 154, 16, 2411-2417 Discrete Applied Mathematics, 154, 16, 2411-2417 Discrete Applied Mathematics, 154, 16, 2411-2417 2006 Refereed Disclose to all
Toshimasa Ishii,Shigeyuki Yamamoto,Hiroshi Nagamochi Toshimasa Ishii,Shigeyuki Yamamoto,Hiroshi Nagamochi Toshimasa Ishii,Shigeyuki Yamamoto,Hiroshi Nagamochi Augmenting forests to meet odd diameter requirements. Augmenting forests to meet odd diameter requirements. Augmenting forests to meet odd diameter requirements. Discrete Optimization, 3, 2, 154-164 Discrete Optimization, 3, 2, 154-164 Discrete Optimization, 3, 2, 154-164 2006 Refereed Disclose to all
Hiroshi Nagamochi Hiroshi Nagamochi Hiroshi Nagamochi Increasing the Edge-Connectivity by Contracting a Vertex Subset in Graphs. Increasing the Edge-Connectivity by Contracting a Vertex Subset in Graphs. Increasing the Edge-Connectivity by Contracting a Vertex Subset in Graphs. IEICE Transactions, 89-D, 2, 744-750 IEICE Transactions, 89-D, 2, 744-750 IEICE Transactions, 89-D, 2, 744-750 2006 Refereed Disclose to all
Hiroshi Nagamochi Hiroshi Nagamochi Hiroshi Nagamochi A Fast Edge-Splitting Algorithm in Edge-Weighted Graphs. A Fast Edge-Splitting Algorithm in Edge-Weighted Graphs. A Fast Edge-Splitting Algorithm in Edge-Weighted Graphs. IEICE Transactions, 89-A, 5, 1263-1268 IEICE Transactions, 89-A, 5, 1263-1268 IEICE Transactions, 89-A, 5, 1263-1268 2006 Refereed Disclose to all
Hiroshi Nagamochi Hiroshi Nagamochi Hiroshi Nagamochi Packing Soft Rectangles. Packing Soft Rectangles. Packing Soft Rectangles. Int. J. Found. Comput. Sci., 17, 5, 1165-1178 Int. J. Found. Comput. Sci., 17, 5, 1165-1178 Int. J. Found. Comput. Sci., 17, 5, 1165-1178 2006 Refereed Disclose to all
石井利昌;永持仁;西垣豊;高橋健吾;武田真人 石井利昌;永持仁;西垣豊;高橋健吾;武田真人 石井利昌;永持仁;西垣豊;高橋健吾;武田真人 タンク繰りにおける経路探索法 タンク繰りにおける経路探索法 タンク繰りにおける経路探索法 システム制御情報学会論文誌, 18, 6, 213-221 システム制御情報学会論文誌, 18, 6, 213-221 システム制御情報学会論文誌, 18, 6, 213-221 2005/06 Refereed Japanese Disclose to all
Hiroshi Nagamochi Hiroshi Nagamochi Hiroshi Nagamochi Packing Unit Squares in a Rectangle. Packing Unit Squares in a Rectangle. Packing Unit Squares in a Rectangle. Electr. J. Comb., 12 Electr. J. Comb., 12 Electr. J. Comb., 12 2005 Refereed Disclose to all
Hiroshi Nagamochi Hiroshi Nagamochi Hiroshi 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. An Improved Bound on the One-Sided Minimum Crossing Number in Two-Layered Drawings. Discrete & Computational Geometry, 33, 4, 569-591 Discrete & Computational Geometry, 33, 4, 569-591 Discrete & Computational Geometry, 33, 4, 569-591 2005 Refereed Disclose to all
Hiroshi Nagamochi Hiroshi Nagamochi Hiroshi Nagamochi On 2-Approximation to the Vertex-Connectivity in Graphs. On 2-Approximation to the Vertex-Connectivity in Graphs. On 2-Approximation to the Vertex-Connectivity in Graphs. IEICE Transactions, 88-D, 1, 12-16 IEICE Transactions, 88-D, 1, 12-16 IEICE Transactions, 88-D, 1, 12-16 2005 Refereed Disclose to all
Hiroshi Nagamochi Hiroshi Nagamochi Hiroshi Nagamochi Approximating the Minmax Rooted-Subtree Cover Problem. Approximating the Minmax Rooted-Subtree Cover Problem. Approximating the Minmax Rooted-Subtree Cover Problem. IEICE Transactions, 88-A, 5, 1335-1338 IEICE Transactions, 88-A, 5, 1335-1338 IEICE Transactions, 88-A, 5, 1335-1338 2005 Refereed Disclose to all
Hiroshi Nagamochi Hiroshi Nagamochi Hiroshi Nagamochi On computing minimum (s, t)-cuts in digraphs. On computing minimum (s, t)-cuts in digraphs. On computing minimum (s, t)-cuts in digraphs. Inf. Process. Lett., 93, 5, 231-237 Inf. Process. Lett., 93, 5, 231-237 Inf. Process. Lett., 93, 5, 231-237 2005 Refereed Disclose to all
Hiroshi Nagamochi Hiroshi Nagamochi Hiroshi 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. A 4/3-approximation for the minimum 2-local-vertex-connectivity augmentation in a connected graph. J. Algorithms, 56, 2, 77-95 J. Algorithms, 56, 2, 77-95 J. Algorithms, 56, 2, 77-95 2005 Refereed Disclose to all
Liang Zhao,Hiroshi Nagamochi,Toshihide Ibaraki Liang Zhao,Hiroshi Nagamochi,Toshihide Ibaraki Liang Zhao,Hiroshi Nagamochi,Toshihide Ibaraki Greedy splitting algorithms for approximating multiway partition problems. Greedy splitting algorithms for approximating multiway partition problems. Greedy splitting algorithms for approximating multiway partition problems. Math. Program., 102, 1, 167-183 Math. Program., 102, 1, 167-183 Math. Program., 102, 1, 167-183 2005 Refereed Disclose to all
Hiroshi Nagamochi Hiroshi Nagamochi Hiroshi 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. On the one-sided crossing minimization in a bipartite graph with large degrees. Theor. Comput. Sci., 332, 1-3, 417-446 Theor. Comput. Sci., 332, 1-3, 417-446 Theor. Comput. Sci., 332, 1-3, 417-446 2005 Refereed Disclose to all
Hiroshi Nagamochi,Kengo Iwata,Toshimasa Ishii Hiroshi Nagamochi,Kengo Iwata,Toshimasa Ishii Hiroshi Nagamochi,Kengo Iwata,Toshimasa 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. A robust algorithm for bisecting a triconnected graph with two resource sets. Theor. Comput. Sci., 341, 1-3, 364-378 Theor. Comput. Sci., 341, 1-3, 364-378 Theor. Comput. Sci., 341, 1-3, 364-378 2005 Refereed Disclose to all
Liang Zhao,Hiroshi Nagamochi,Toshihide Ibaraki Liang Zhao,Hiroshi Nagamochi,Toshihide Ibaraki Liang Zhao,Hiroshi Nagamochi,Toshihide Ibaraki On generalized greedy splitting algorithms for multiway partition problems. On generalized greedy splitting algorithms for multiway partition problems. On generalized greedy splitting algorithms for multiway partition problems. Discrete Applied Mathematics, 143, 1-3, 130-143 Discrete Applied Mathematics, 143, 1-3, 130-143 Discrete Applied Mathematics, 143, 1-3, 130-143 2004 Refereed Disclose to all
Hiroshi Nagamochi,Takahisa Suzuki,Toshimasa Ishii Hiroshi Nagamochi,Takahisa Suzuki,Toshimasa Ishii Hiroshi Nagamochi,Takahisa Suzuki,Toshimasa Ishii A simple recognition of maximal planar graphs. A simple recognition of maximal planar graphs. A simple recognition of maximal planar graphs. Inf. Process. Lett., 89, 5, 223-226 Inf. Process. Lett., 89, 5, 223-226 Inf. Process. Lett., 89, 5, 223-226 2004 Refereed Disclose to all
Hiroshi Nagamochi,Nobuyasu Yamada Hiroshi Nagamochi,Nobuyasu Yamada Hiroshi Nagamochi,Nobuyasu Yamada Counting edge crossings in a 2-layered drawing. Counting edge crossings in a 2-layered drawing. Counting edge crossings in a 2-layered drawing. Inf. Process. Lett., 91, 5, 221-225 Inf. Process. Lett., 91, 5, 221-225 Inf. Process. Lett., 91, 5, 221-225 2004 Refereed Disclose to all
Yoshiyuki Karuno,Hiroshi Nagamochi Yoshiyuki Karuno,Hiroshi Nagamochi Yoshiyuki Karuno,Hiroshi 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. An approximability result of the multi-vehicle scheduling problem on a path with release and handling times. Theor. Comput. Sci., 312, 2-3, 267-280 Theor. Comput. Sci., 312, 2-3, 267-280 Theor. Comput. Sci., 312, 2-3, 267-280 2004 Refereed Disclose to all
Hiroshi Nagamochi,Kohei Okada Hiroshi Nagamochi,Kohei Okada Hiroshi Nagamochi,Kohei 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. A faster 2-approximation algorithm for the minmax p-traveling salesmen problem on a tree. Discrete Applied Mathematics, 140, 1-3, 103-114 Discrete Applied Mathematics, 140, 1-3, 103-114 Discrete Applied Mathematics, 140, 1-3, 103-114 2004 Refereed Disclose to all
永持 仁 永持 仁 永持 仁 グラフの最小分割問題に対するアルゴリズム(<小特集>LAシンポジウム(計算機科学基礎理論ワークショップ)論文小特集) グラフの最小分割問題に対するアルゴリズム(<小特集>LAシンポジウム(計算機科学基礎理論ワークショップ)論文小特集) グラフの最小分割問題に対するアルゴリズム(<小特集>LAシンポジウム(計算機科学基礎理論ワークショップ)論文小特集) 電子情報通信学会論文誌. D-I, 情報・システム, I-情報処理, 86, 2, 53-68 電子情報通信学会論文誌. D-I, 情報・システム, I-情報処理, 86, 2, 53-68 電子情報通信学会論文誌. D-I, 情報・システム, I-情報処理, 86, 2, 53-68 2003/02/01 Refereed Japanese Disclose to all
H. Nagamochi Hiroshi 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. An approximation for finding a smallest 2-edge-connected subgraph containing a specified spanning tree Discrete Applied Mathematics, 126, 1, 83-113 Discrete Applied Mathematics, 126, 1, 83-113 Discrete Applied Mathematics, 126, 1, 83-113 2003 Refereed English Disclose to all
Liang Zhao,Hiroshi Nagamochi,Toshihide Ibaraki Liang Zhao,Hiroshi Nagamochi,Toshihide Ibaraki Liang Zhao,Hiroshi Nagamochi,Toshihide 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. A primal-dual approximation algorithm for the survivable network design problem in hypergraphs. Discrete Applied Mathematics, 126, 2-3, 275-289 Discrete Applied Mathematics, 126, 2-3, 275-289 Discrete Applied Mathematics, 126, 2-3, 275-289 2003 Refereed Disclose to all
Yoshiyuki Karuno,Hiroshi Nagamochi Yoshiyuki Karuno,Hiroshi Nagamochi Yoshiyuki Karuno,Hiroshi Nagamochi 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. 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 Discrete Applied Mathematics, 129, 2-3, 433-447 Discrete Applied Mathematics, 129, 2-3, 433-447 2003 Refereed Disclose to all
Hiroshi Nagamochi,Toshimasa Ishii Hiroshi Nagamochi,Toshimasa Ishii Hiroshi Nagamochi,Toshimasa Ishii On the minimum local-vertex-connectivity augmentation in graphs. On the minimum local-vertex-connectivity augmentation in graphs. On the minimum local-vertex-connectivity augmentation in graphs. Discrete Applied Mathematics, 129, 2-3, 475-486 Discrete Applied Mathematics, 129, 2-3, 475-486 Discrete Applied Mathematics, 129, 2-3, 475-486 2003 Refereed Disclose to all
Liang Zhao,Hiroshi Nagamochi,Toshihide Ibaraki Liang Zhao,Hiroshi Nagamochi,Toshihide Ibaraki Liang Zhao,Hiroshi Nagamochi,Toshihide 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. A linear time 5/3-approximation for the minimum strongly-connected spanning subgraph problem. Inf. Process. Lett., 86, 2, 63-70 Inf. Process. Lett., 86, 2, 63-70 Inf. Process. Lett., 86, 2, 63-70 2003 Refereed Disclose to all
Hiroshi Nagamochi,Peter Eades Hiroshi Nagamochi,Peter Eades Hiroshi Nagamochi,Peter Eades An Edge-Splitting Algorithm in Planar Graphs. An Edge-Splitting Algorithm in Planar Graphs. An Edge-Splitting Algorithm in Planar Graphs. J. Comb. Optim., 7, 2, 137-159 J. Comb. Optim., 7, 2, 137-159 J. Comb. Optim., 7, 2, 137-159 2003 Refereed Disclose to all
Hiroshi Nagamochi,Tibor Jordán,Yoshitaka Nakao,Toshihide Ibaraki Hiroshi Nagamochi,Tibor Jordán,Yoshitaka Nakao,Toshihide Ibaraki Hiroshi Nagamochi,Tibor Jordán,Yoshitaka Nakao,Toshihide Ibaraki Convex Embeddings and Bisections of 3-Connected Graphs 1. Convex Embeddings and Bisections of 3-Connected Graphs 1. Convex Embeddings and Bisections of 3-Connected Graphs 1. Combinatorica, 22, 4, 537-554 Combinatorica, 22, 4, 537-554 Combinatorica, 22, 4, 537-554 2002 Refereed Disclose to all
Toshihiro Fujito,Hiroshi Nagamochi Toshihiro Fujito,Hiroshi Nagamochi Toshihiro Fujito,Hiroshi 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. A 2-approximation algorithm for the minimum weight edge dominating set problem. Discrete Applied Mathematics, 118, 3, 199-207 Discrete Applied Mathematics, 118, 3, 199-207 Discrete Applied Mathematics, 118, 3, 199-207 2002 Refereed Disclose to all
Hiroshi Nagamochi,Toshihide Ibaraki Hiroshi Nagamochi,Toshihide Ibaraki Hiroshi Nagamochi,Toshihide Ibaraki Graph connectivity and its augmentation: applications of MA orderings. Graph connectivity and its augmentation: applications of MA orderings. Graph connectivity and its augmentation: applications of MA orderings. Discrete Applied Mathematics, 123, 1-3, 447-472 Discrete Applied Mathematics, 123, 1-3, 447-472 Discrete Applied Mathematics, 123, 1-3, 447-472 2002 Refereed Disclose to all
Yoshiyuki Karuno,Hiroshi Nagamochi,Toshihide Ibaraki Yoshiyuki Karuno,Hiroshi Nagamochi,Toshihide Ibaraki Yoshiyuki Karuno,Hiroshi Nagamochi,Toshihide 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. Better approximation ratios for the single-vehicle scheduling problems on line-shaped networks. Networks, 39, 4, 203-209 Networks, 39, 4, 203-209 Networks, 39, 4, 203-209 2002 Refereed Disclose to all
Y. Karuno; H. Nagamochi Yoshiyuki Karuno,Hiroshi 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. 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, 199-210 Algorithms and Computation, 13th International Symposium, ISAAC 2002 Vancouver, BC, Canada, November 21-23, 2002, Proceedings, 2518, 199-210 Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2518, 199-210 2002 Refereed English Disclose to all
Toru Hasunuma,Hiroshi Nagamochi Toru Hasunuma,Hiroshi Nagamochi Toru Hasunuma,Hiroshi Nagamochi Independent spanning trees with small depths in iterated line digraphs. Independent spanning trees with small depths in iterated line digraphs. Independent spanning trees with small depths in iterated line digraphs. Discrete Applied Mathematics, 110, 2-3, 189-211 Discrete Applied Mathematics, 110, 2-3, 189-211 Discrete Applied Mathematics, 110, 2-3, 189-211 2001 Refereed Disclose to all
H. Nagamochi; M. Miller; Slamin Hiroshi Nagamochi,Mirka Miller,Array 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. Bounds on the number of isolates in sum graph labeling Discrete Mathematics, 240, 1-3, 175-185 Discrete Mathematics, 240, 1-3, 175-185 Discrete Mathematics, 240, 1-3, 175-185 2001 Refereed English Disclose to all
Hiroshi Nagamochi,Toshimasa Ishii,Hiro Ito Hiroshi Nagamochi,Toshimasa Ishii,Hiro Ito Hiroshi Nagamochi,Toshimasa Ishii,Hiro Ito Minimum cost source location problem with vertex-connectivity requirements in digraphs. Minimum cost source location problem with vertex-connectivity requirements in digraphs. Minimum cost source location problem with vertex-connectivity requirements in digraphs. Inf. Process. Lett., 80, 6, 287-293 Inf. Process. Lett., 80, 6, 287-293 Inf. Process. Lett., 80, 6, 287-293 2001 Refereed Disclose to all
Hiroshi Nagamochi,Toru Hasunuma Hiroshi Nagamochi,Toru Hasunuma Hiroshi Nagamochi,Toru Hasunuma An Efficient NC Algorithm for a Sparse k-Edge-Connectivity Certificate. An Efficient NC Algorithm for a Sparse k-Edge-Connectivity Certificate. An Efficient NC Algorithm for a Sparse k-Edge-Connectivity Certificate. J. Algorithms, 38, 2, 354-373 J. Algorithms, 38, 2, 354-373 J. Algorithms, 38, 2, 354-373 2001 Refereed Disclose to all
Hiroshi Nagamochi,Takashi Shiraki,Toshihide Ibaraki Hiroshi Nagamochi,Takashi Shiraki,Toshihide Ibaraki Hiroshi Nagamochi,Takashi Shiraki,Toshihide Ibaraki Augmenting a Submodular and Posi-modular Set Function by a Multigraph. Augmenting a Submodular and Posi-modular Set Function by a Multigraph. Augmenting a Submodular and Posi-modular Set Function by a Multigraph. J. Comb. Optim., 5, 2, 175-212 J. Comb. Optim., 5, 2, 175-212 J. Comb. Optim., 5, 2, 175-212 2001 Refereed Disclose to all
Liang Zhao,Hiroshi Nagamochi,Toshihide Ibaraki Liang Zhao,Hiroshi Nagamochi,Toshihide Ibaraki Liang Zhao,Hiroshi Nagamochi,Toshihide 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. Approximating the Minimum k-way Cut in a Graph via Minimum 3-way Cuts. J. Comb. Optim., 5, 4, 397-410 J. Comb. Optim., 5, 4, 397-410 J. Comb. Optim., 5, 4, 397-410 2001 Refereed Disclose to all
Toshimasa Ishii,Hiroshi Nagamochi,Toshihide Ibaraki Toshimasa Ishii,Hiroshi Nagamochi,Toshihide Ibaraki Toshimasa Ishii,Hiroshi Nagamochi,Toshihide Ibaraki Multigraph augmentation under biconnectivity and general edge-connectivity requirements. Multigraph augmentation under biconnectivity and general edge-connectivity requirements. Multigraph augmentation under biconnectivity and general edge-connectivity requirements. Networks, 37, 3, 144-155 Networks, 37, 3, 144-155 Networks, 37, 3, 144-155 2001 Refereed Disclose to all
Yoshiyuki Karuno,Hiroshi Nagamochi Yoshiyuki Karuno,Hiroshi Nagamochi Yoshiyuki Karuno,Hiroshi Nagamochi A 2-Approximation Algorithm for the Multi-vehicle Scheduling Problem on a Path with Release and Handling Times. A 2-Approximation Algorithm for the Multi-vehicle Scheduling Problem on a Path with Release and Handling Times. A 2-Approximation Algorithm for the Multi-vehicle Scheduling Problem on a Path with Release and Handling Times. Algorithms - ESA 2001, 9th Annual European Symposium, Aarhus, Denmark, August 28-31, 2001, Proceedings, 218-229 Algorithms - ESA 2001, 9th Annual European Symposium, Aarhus, Denmark, August 28-31, 2001, Proceedings, 218-229 Algorithms - ESA 2001, 9th Annual European Symposium, Aarhus, Denmark, August 28-31, 2001, Proceedings, 218-229 2001 Refereed Disclose to all
Liang Zhao,Hiroshi Nagamochi,Toshihide Ibaraki Liang Zhao,Hiroshi Nagamochi,Toshihide Ibaraki Liang Zhao,Hiroshi Nagamochi,Toshihide Ibaraki A Unified Framework for Approximating Multiway Partition Problems. A Unified Framework for Approximating Multiway Partition Problems. A Unified Framework for Approximating Multiway Partition Problems. Algorithms and Computation, 12th International Symposium, ISAAC 2001, Christchurch, New Zealand, December 19-21, 2001, Proceedings, 682-694 Algorithms and Computation, 12th International Symposium, ISAAC 2001, Christchurch, New Zealand, December 19-21, 2001, Proceedings, 682-694 Algorithms and Computation, 12th International Symposium, ISAAC 2001, Christchurch, New Zealand, December 19-21, 2001, Proceedings, 682-694 2001 Refereed Disclose to all
Liang Zhao,Hiroshi Nagamochi,Toshihide Ibaraki Liang Zhao,Hiroshi Nagamochi,Toshihide Ibaraki Liang Zhao,Hiroshi Nagamochi,Toshihide Ibaraki A Primal-Dual Approximation Algorithm for the Survivable Network Design Problem in Hypergraph. A Primal-Dual Approximation Algorithm for the Survivable Network Design Problem in Hypergraph. A Primal-Dual Approximation Algorithm for the Survivable Network Design Problem in Hypergraph. STACS 2001, 18th Annual Symposium on Theoretical Aspects of Computer Science, Dresden, Germany, February 15-17, 2001, Proceedings, 478-489 STACS 2001, 18th Annual Symposium on Theoretical Aspects of Computer Science, Dresden, Germany, February 15-17, 2001, Proceedings, 478-489 STACS 2001, 18th Annual Symposium on Theoretical Aspects of Computer Science, Dresden, Germany, February 15-17, 2001, Proceedings, 478-489 2001 Refereed Disclose to all
H. Nagamochi; S. Nakamura; T. Ibaraki Hiroshi Nagamochi,S. Nakamura,Toshihide 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. A simplified Õ(nm) time edge-splitting algorithm in undirected graphs Algorithmica (New York), 26, 1, 50-67 Algorithmica, 26, 1, 50-67 Algorithmica (New York), 26, 1, 50-67 2000 Refereed English Disclose to all
Hiroshi Nagamochi,Toshihide Ibaraki Hiroshi Nagamochi,Toshihide Ibaraki Hiroshi Nagamochi,Toshihide Ibaraki Polyhedral structure of submodular and posi-modular systems. Polyhedral structure of submodular and posi-modular systems. Polyhedral structure of submodular and posi-modular systems. Discrete Applied Mathematics, 107, 1-3, 165-189 Discrete Applied Mathematics, 107, 1-3, 165-189 Discrete Applied Mathematics, 107, 1-3, 165-189 2000 Refereed Disclose to all
Toshimasa Ishii,Hiroshi Nagamochi,Toshihide Ibaraki Toshimasa Ishii,Hiroshi Nagamochi,Toshihide Ibaraki Toshimasa Ishii,Hiroshi Nagamochi,Toshihide Ibaraki Optimal Augmentation of a 2-Vertex-Connected Multigraph to a k-Edge-Connected and 3-Vertex-Connected Multigraph. Optimal Augmentation of a 2-Vertex-Connected Multigraph to a k-Edge-Connected and 3-Vertex-Connected Multigraph. Optimal Augmentation of a 2-Vertex-Connected Multigraph to a k-Edge-Connected and 3-Vertex-Connected Multigraph. J. Comb. Optim., 4, 1, 35-77 J. Comb. Optim., 4, 1, 35-77 J. Comb. Optim., 4, 1, 35-77 2000 Refereed Disclose to all
Hiroshi Nagamochi,Shigeki Katayama,Toshihide Ibaraki Hiroshi Nagamochi,Shigeki Katayama,Toshihide Ibaraki Hiroshi Nagamochi,Shigeki Katayama,Toshihide 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. A Faster Algorithm for Computing Minimum 5-Way and 6-Way Cuts in Graphs. J. Comb. Optim., 4, 2, 151-169 J. Comb. Optim., 4, 2, 151-169 J. Comb. Optim., 4, 2, 151-169 2000 Refereed Disclose to all
Xiaotie Deng,Toshihide Ibaraki,Hiroshi Nagamochi,Wenan Zang Xiaotie Deng,Toshihide Ibaraki,Hiroshi Nagamochi,Wenan Zang Xiaotie Deng,Toshihide Ibaraki,Hiroshi Nagamochi,Wenan Zang Totally balanced combinatorial optimization games. Totally balanced combinatorial optimization games. Totally balanced combinatorial optimization games. Math. Program., 87, 3, 441-452 Math. Program., 87, 3, 441-452 Math. Program., 87, 3, 441-452 2000 Refereed Disclose to all
Hiroshi Nagamochi,Toshihide Ibaraki Hiroshi Nagamochi,Toshihide Ibaraki Hiroshi Nagamochi,Toshihide 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. A fast algorithm for computing minimum 3-way and 4-way cuts. Math. Program., 88, 3, 507-520 Math. Program., 88, 3, 507-520 Math. Program., 88, 3, 507-520 2000 Refereed Disclose to all
Hiroshi Nagamochi,Toshihide Ibaraki Hiroshi Nagamochi,Toshihide Ibaraki Hiroshi Nagamochi,Toshihide Ibaraki Augmenting Edge-Connectivity over the Entire Range in Õ(nm) Time. Augmenting Edge-Connectivity over the Entire Range in Õ(nm) Time. Augmenting Edge-Connectivity over the Entire Range in Õ(nm) Time. J. Algorithms, 30, 2, 253-301 J. Algorithms, 30, 2, 253-301 J. Algorithms, 30, 2, 253-301 1999 Refereed Disclose to all
P. Eades, Q. Feng and Hiroshi Nagamochi Peter Eades,Qing-Wen Feng,Hiroshi Nagamochi P. Eades, Q. Feng and Hiroshi Nagamochi Drawing clustered graphs on an orthogonal grid Drawing Clustered Graphs on an Orthogonal Grid. Drawing clustered graphs on an orthogonal grid Journal of Graph Algorithms and Application,vol.3, no.4,, pp. 3-29, 3, 4, 3-29 J. Graph Algorithms Appl., 3, 4, 3-29 Journal of Graph Algorithms and Application,vol.3, no.4,, pp. 3-29, 3, 4, 3-29 1999 Refereed English Disclose to all
Xiaotie Deng,Toshihide Ibaraki,Hiroshi Nagamochi Xiaotie Deng,Toshihide Ibaraki,Hiroshi Nagamochi Xiaotie Deng,Toshihide Ibaraki,Hiroshi Nagamochi Algorithmic Aspects of the Core of Combinatorial Optimization Games. Algorithmic Aspects of the Core of Combinatorial Optimization Games. Algorithmic Aspects of the Core of Combinatorial Optimization Games. Math. Oper. Res., 24, 3, 751-766 Math. Oper. Res., 24, 3, 751-766 Math. Oper. Res., 24, 3, 751-766 1999 Refereed Disclose to all
NAGAMOCHI H;KATAYAMA S;IBARAKI T Hiroshi Nagamochi,Shigeki Katayama,Toshihide Ibaraki 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. A Faster Algorithm for Computing Minimum 5-Way and 6-Way Cuts in Graphs. Lect Notes Comput Sci, 1627, 164-173 Computing and Combinatorics, 5th Annual International Conference, COCOON '99, Tokyo, Japan, July 26-28, 1999, Proceedings, 1627, 164-173 Lect Notes Comput Sci, 1627, 164-173 1999 Refereed English Disclose to all
Toshimasa Ishii,Hiroshi Nagamochi,Toshihide Ibaraki Toshimasa Ishii,Hiroshi Nagamochi,Toshihide Ibaraki Toshimasa Ishii,Hiroshi Nagamochi,Toshihide Ibaraki Augmenting a (kappa-1)-Vertex-Connected Multigraph to an iota-Edge-Connected and kappa-Vertex-Connected Multigraph. Augmenting a (kappa-1)-Vertex-Connected Multigraph to an iota-Edge-Connected and kappa-Vertex-Connected Multigraph. Augmenting a (kappa-1)-Vertex-Connected Multigraph to an iota-Edge-Connected and kappa-Vertex-Connected Multigraph. Algorithms - ESA '99, 7th Annual European Symposium, Prague, Czech Republic, July 16-18, 1999, Proceedings, 414-425 Algorithms - ESA '99, 7th Annual European Symposium, Prague, Czech Republic, July 16-18, 1999, Proceedings, 414-425 Algorithms - ESA '99, 7th Annual European Symposium, Prague, Czech Republic, July 16-18, 1999, Proceedings, 414-425 1999 Refereed Disclose to all
永持 仁 永持 仁 永持 仁 数理工学のすすめ--木を見て森を見る 数理工学のすすめ--木を見て森を見る 数理工学のすすめ--木を見て森を見る 理系への数学, 31, 8, 62-66 理系への数学, 31, 8, 62-66 理系への数学, 31, 8, 62-66 1998/08 Refereed Japanese Disclose to all
永持仁;牧野和久;ZENG D‐Z;村田真紀;茨木俊秀 永持仁;牧野和久;ZENG D‐Z;村田真紀;茨木俊秀 永持仁;牧野和久;ZENG D‐Z;村田真紀;茨木俊秀 Convexity of Elementary Flow Games. Convexity of Elementary Flow Games. Convexity of Elementary Flow Games. 電子情報通信学会論文誌 D-1, J81-D-1, 6, 666-676 電子情報通信学会論文誌 D-1, J81-D-1, 6, 666-676 電子情報通信学会論文誌 D-1, J81-D-1, 6, 666-676 1998/06 Refereed Japanese Disclose to all
永持仁 永持仁 永持仁 グラフの連結度増大問題 グラフの連結度増大問題 グラフの連結度増大問題 応用数理, 8, 1, 20-29 応用数理, 8, 1, 20-29 応用数理, 8, 1, 20-29 1998/03 Refereed Japanese Disclose to all
T. Ibaraki; A.V. Karzanov; H. Nagamochi Toshihide Ibaraki,Alexander V. Karzanov,Hiroshi 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. A fast algorithm for finding a maximum free multiflow in an inner Eulerian network and some generalizations Combinatorica, 18, 1, 61-83 Combinatorica, 18, 1, 61-83 Combinatorica, 18, 1, 61-83 1998 Refereed English Disclose to all
Hiroshi Nagamochi,Toshihide Ibaraki Hiroshi Nagamochi,Toshihide Ibaraki Hiroshi Nagamochi,Toshihide Ibaraki A Note on Minimizing Submodular Functions. A Note on Minimizing Submodular Functions. A Note on Minimizing Submodular Functions. Inf. Process. Lett., 67, 5, 239-244 Inf. Process. Lett., 67, 5, 239-244 Inf. Process. Lett., 67, 5, 239-244 1998 Refereed Disclose to all
András Frank,Toshihide Ibaraki,Hiroshi Nagamochi András Frank,Toshihide Ibaraki,Hiroshi Nagamochi András Frank,Toshihide Ibaraki,Hiroshi Nagamochi Two Arc-Disjoint Paths in Eulerian Digraphs. Two Arc-Disjoint Paths in Eulerian Digraphs. Two Arc-Disjoint Paths in Eulerian Digraphs. SIAM J. Discrete Math., 11, 4, 557-589 SIAM J. Discrete Math., 11, 4, 557-589 SIAM J. Discrete Math., 11, 4, 557-589 1998 Refereed Disclose to all
永持 仁 Toru Hasunuma,Hiroshi Nagamochi 永持 仁 Independent spanning trees with small depths in iterated line digraphs Independent Spanning Trees with Small Depths in Iterated Line Digraphs. Independent spanning trees with small depths in iterated line digraphs Australian Computer Science Communications,20/3, 21-35, 21-36 Proceedings of Computing: The Fourth Australasian Theory Symposium (CATS'98), Perth, WA, Australia, February 2-3, 1998, 21-36 Australian Computer Science Communications,20/3, 21-35, 21-36 1998 Refereed English Disclose to all
Nagamochi, H; Eades, P; Bixby, RE; Boyd, EA; RiosMercado, RZ Hiroshi Nagamochi,Peter Eades 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. Edge-splitting and edge-connectivity augmentation in planar graphs INTEGER PROGRAMMING AND COMBINATORIAL OPTIMIZATION, 1412, 96-111 Integer Programming and Combinatorial Optimization, 6th International IPCO Conference, Houston, Texas, USA, June 22-24, 1998, Proceedings, 1412, 96-111 INTEGER PROGRAMMING AND COMBINATORIAL OPTIMIZATION, 1412, 96-111 1998 Refereed English Disclose to all
T. Ishii; H. Nagamochi; T. Ibaraki Toshimasa Ishii,Hiroshi Nagamochi,Toshihide 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. 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 Algorithms and Computation, 9th International Symposium, ISAAC '98, Taejon, Korea, December 14-16, 1998, Proceedings, 1533, 159-168 Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 1533, 159-168 1998 Refereed English Disclose to all
H. Nagamochi; T. Ibaraki Hiroshi Nagamochi,Toshihide Ibaraki H. Nagamochi; T. Ibaraki Polyhedral structure of submodular and posi-modular systems Polyhedral Structure of Submodular and Posi-modular Systems. 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 Algorithms and Computation, 9th International Symposium, ISAAC '98, Taejon, Korea, December 14-16, 1998, Proceedings, 1533, 169-178 Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 1533, 169-178 1998 Refereed English Disclose to all
H. Nagamochi; T. Hasunuma Hiroshi Nagamochi,Toru 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. 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 Algorithms and Computation, 9th International Symposium, ISAAC '98, Taejon, Korea, December 14-16, 1998, Proceedings, 1533, 447-456 Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 1533, 447-456 1998 Refereed English Disclose to all
Toshimasa Ishii,Hiroshi Nagamochi,Toshihide Ibaraki Toshimasa Ishii,Hiroshi Nagamochi,Toshihide Ibaraki Toshimasa Ishii,Hiroshi Nagamochi,Toshihide Ibaraki Optimal Augmentation to Make a Graph k-Edge-Connected and Triconnected. Optimal Augmentation to Make a Graph k-Edge-Connected and Triconnected. Optimal Augmentation to Make a Graph k-Edge-Connected and Triconnected. Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 25-27 January 1998, San Francisco, California., 280-289 Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 25-27 January 1998, San Francisco, California., 280-289 Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 25-27 January 1998, San Francisco, California., 280-289 1998 Refereed Disclose to all
嘉藤学;河北隆二;永持仁;尾家祐二 嘉藤学;河北隆二;永持仁;尾家祐二 嘉藤学;河北隆二;永持仁;尾家祐二 格子型光波ネットワークの再構成アルゴリズムについて 格子型光波ネットワークの再構成アルゴリズムについて 格子型光波ネットワークの再構成アルゴリズムについて 電子情報通信学会論文誌 B-1, J80-B-1, 10, 709-718 電子情報通信学会論文誌 B-1, J80-B-1, 10, 709-718 電子情報通信学会論文誌 B-1, J80-B-1, 10, 709-718 1997/10 Refereed Japanese Disclose to all
Y. Karuno; H. Nagamochi; T. Ibaraki Yoshiyuki Karuno,Hiroshi Nagamochi,Toshihide 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. Vehicle scheduling on a tree with release and handling times Annals of Operations Research, 69, 193-207 Annals OR, 69, 193-207 Annals of Operations Research, 69, 193-207 1997 Refereed English Disclose to all
H. Nagamochi; T. Ibaraki Hiroshi Nagamochi,Toshihide Ibaraki H. Nagamochi; T. Ibaraki Deterministic Õ(nm) time edge-splitting in undirected graphs Deterministic Õ(nm) Time Edge-Splitting in Undirected Graphs. Deterministic Õ(nm) time edge-splitting in undirected graphs Journal of Combinatorial Optimization, 1, 1, 5-46 J. Comb. Optim., 1, 1, 5-46 Journal of Combinatorial Optimization, 1, 1, 5-46 1997 Refereed English Disclose to all
Hiroshi Nagamochi,Dao-Zhi Zeng,Naohisa Kabutoya,Toshihide Ibaraki Hiroshi Nagamochi,Dao-Zhi Zeng,Naohisa Kabutoya,Toshihide Ibaraki Hiroshi Nagamochi,Dao-Zhi Zeng,Naohisa Kabutoya,Toshihide Ibaraki Complexity of the Minimum Base Game on Matroids. Complexity of the Minimum Base Game on Matroids. Complexity of the Minimum Base Game on Matroids. Math. Oper. Res., 22, 1, 146-164 Math. Oper. Res., 22, 1, 146-164 Math. Oper. Res., 22, 1, 146-164 1997 Refereed Disclose to all
Hiroshi Nagamochi,Kazuhiro Nishimura,Toshihide Ibaraki Hiroshi Nagamochi,Kazuhiro Nishimura,Toshihide Ibaraki Hiroshi Nagamochi,Kazuhiro Nishimura,Toshihide Ibaraki Computing All Small Cuts in an Undirected Network. Computing All Small Cuts in an Undirected Network. Computing All Small Cuts in an Undirected Network. SIAM J. Discrete Math., 10, 3, 469-481 SIAM J. Discrete Math., 10, 3, 469-481 SIAM J. Discrete Math., 10, 3, 469-481 1997 Refereed Disclose to all
ISHII T;NAGAMOCHI H;IBARAKI T Toshimasa Ishii,Hiroshi Nagamochi,Toshihide Ibaraki ISHII T;NAGAMOCHI H;IBARAKI T Augmenting Edge and Vertex Connectivities Simultaneously. Augmenting Edge and Vertex Connectivities Simultaneously. Augmenting Edge and Vertex Connectivities Simultaneously. Lect Notes Comput Sci, 1350, 102-111 Algorithms and Computation, 8th International Symposium, ISAAC '97, Singapore, December 17-19, 1997, Proceedings, 1350, 102-111 Lect Notes Comput Sci, 1350, 102-111 1997 Refereed English Disclose to all
Hiroshi Nagamochi,Takashi Shiraki,Toshihide Ibaraki Hiroshi Nagamochi,Takashi Shiraki,Toshihide Ibaraki Hiroshi Nagamochi,Takashi Shiraki,Toshihide Ibaraki Computing Edge-Connectivity Augmentation Function in Õ(nm) Time. Computing Edge-Connectivity Augmentation Function in Õ(nm) Time. Computing Edge-Connectivity Augmentation Function in Õ(nm) Time. Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 5-7 January 1997, New Orleans, Louisiana., 649-658 Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 5-7 January 1997, New Orleans, Louisiana., 649-658 Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 5-7 January 1997, New Orleans, Louisiana., 649-658 1997 Refereed Disclose to all
Hiroshi Nagamochi,Toshihide Ibaraki Hiroshi Nagamochi,Toshihide Ibaraki Hiroshi Nagamochi,Toshihide Ibaraki Deterministic Õ(nm) Time Edge-Splitting in Undirected Graphs. Deterministic Õ(nm) Time Edge-Splitting in Undirected Graphs. Deterministic Õ(nm) Time Edge-Splitting in Undirected Graphs. Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing, Philadelphia, Pennsylvania, USA, May 22-24, 1996, 64-73 Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing, Philadelphia, Pennsylvania, USA, May 22-24, 1996, 64-73 Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing, Philadelphia, Pennsylvania, USA, May 22-24, 1996, 64-73 1996 Refereed Disclose to all
Algorithms and Computation, 7th International Symposium, ISAAC '96, Osaka, Japan, December 16-18, 1996, Proceedings Algorithms and Computation, 7th International Symposium, ISAAC '96, Osaka, Japan, December 16-18, 1996, Proceedings Algorithms and Computation, 7th International Symposium, ISAAC '96, Osaka, Japan, December 16-18, 1996, Proceedings ISAAC 1996, 1178 ISAAC 1996, 1178 ISAAC 1996, 1178 1996 Refereed Disclose to all
永持 仁 永持 仁 永持 仁 サブツアー交換交叉に対する2つのコメント(共著) サブツアー交換交叉に対する2つのコメント(共著) サブツアー交換交叉に対する2つのコメント(共著) 人工知能学会論文誌,10/3, 464-467 人工知能学会論文誌,10/3, 464-467 人工知能学会論文誌,10/3, 464-467 1995 Refereed Japanese Disclose to all
Toshihide Ibaraki,Hiroshi Nagamochi,Tsunehiko Kameda Toshihide Ibaraki,Hiroshi Nagamochi,Tsunehiko Kameda Toshihide Ibaraki,Hiroshi Nagamochi,Tsunehiko Kameda Optimal Coteries for Rings and Related Networks. Optimal Coteries for Rings and Related Networks. Optimal Coteries for Rings and Related Networks. Distributed Computing, 8, 4, 191-201 Distributed Computing, 8, 4, 191-201 Distributed Computing, 8, 4, 191-201 1995 Refereed Disclose to all
NAGAMOCHI H;IBARAKI T Hiroshi Nagamochi,Toshihide Ibaraki 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. A Faster Edge Splitting Algorithm in Multigraphs and its Application to the Edge-Connectivity Augmentation Problem. Lect Notes Comput Sci, 920, 403-413 Integer Programming and Combinatorial Optimization, 4th International IPCO Conference, Copenhagen, Denmark, May 29-31, 1995, Proceedings, 920, 403-413 Lect Notes Comput Sci, 920, 403-413 1995 Refereed English Disclose to all
András Frank,Toshihide Ibaraki,Hiroshi Nagamochi András Frank,Toshihide Ibaraki,Hiroshi Nagamochi András Frank,Toshihide Ibaraki,Hiroshi Nagamochi Two Arc Disjoint Paths in Eulerian Diagraphs. Two Arc Disjoint Paths in Eulerian Diagraphs. Two Arc Disjoint Paths in Eulerian Diagraphs. Algorithms and Computation, 6th International Symposium, ISAAC '95, Cairns, Australia, December 4-6, 1995, Proceedings, 92-101 Algorithms and Computation, 6th International Symposium, ISAAC '95, Cairns, Australia, December 4-6, 1995, Proceedings, 92-101 Algorithms and Computation, 6th International Symposium, ISAAC '95, Cairns, Australia, December 4-6, 1995, Proceedings, 92-101 1995 Refereed Disclose to all
Hiroshi Nagamochi,Tadashi Ono,Toshihide Ibaraki Hiroshi Nagamochi,Tadashi Ono,Toshihide Ibaraki Hiroshi Nagamochi,Tadashi Ono,Toshihide Ibaraki Implementing an efficient minimum capacity cut algorithm. Implementing an efficient minimum capacity cut algorithm. Implementing an efficient minimum capacity cut algorithm. Math. Program., 67, 325-341 Math. Program., 67, 325-341 Math. Program., 67, 325-341 1994 Refereed Disclose to all
Hideaki Harada,Zheng Sun,Hiroshi Nagamochi Hideaki Harada,Zheng Sun,Hiroshi Nagamochi Hideaki Harada,Zheng Sun,Hiroshi Nagamochi An exact lower bound on the number of cut-sets in multigraphs. An exact lower bound on the number of cut-sets in multigraphs. An exact lower bound on the number of cut-sets in multigraphs. Networks, 24, 8, 429-443 Networks, 24, 8, 429-443 Networks, 24, 8, 429-443 1994 Refereed Disclose to all
Hiroshi Nagamochi,Kazuhiro Nishimura,Toshihide Ibaraki Hiroshi Nagamochi,Kazuhiro Nishimura,Toshihide Ibaraki Hiroshi Nagamochi,Kazuhiro Nishimura,Toshihide Ibaraki Computing All Small Cuts in Undirected Networks. Computing All Small Cuts in Undirected Networks. Computing All Small Cuts in Undirected Networks. Algorithms and Computation, 5th International Symposium, ISAAC '94, Beijing, P. R. China, August 25-27, 1994, Proceedings, 190-198 Algorithms and Computation, 5th International Symposium, ISAAC '94, Beijing, P. R. China, August 25-27, 1994, Proceedings, 190-198 Algorithms and Computation, 5th International Symposium, ISAAC '94, Beijing, P. R. China, August 25-27, 1994, Proceedings, 190-198 1994 Refereed Disclose to all
Array,Toshihide Ibaraki,Hiroshi Nagamochi Array,Toshihide Ibaraki,Hiroshi Nagamochi Array,Toshihide Ibaraki,Hiroshi Nagamochi On sparse subgraphs preserving connectivity properties. On sparse subgraphs preserving connectivity properties. On sparse subgraphs preserving connectivity properties. Journal of Graph Theory, 17, 3, 275-281 Journal of Graph Theory, 17, 3, 275-281 Journal of Graph Theory, 17, 3, 275-281 1993 Refereed Disclose to all
KARUNO Y;NAGAMOCHI H;IBARAKI T Yoshiyuki Karuno,Hiroshi Nagamochi,Toshihide Ibaraki 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. Vehicle Scheduling on a Tree with Release and Handling Times. Lect Notes Comput Sci, 762, 486-495 Algorithms and Computation, 4th International Symposium, ISAAC '93, Hong Kong, December 15-17, 1993, Proceedings, 762, 486-495 Lect Notes Comput Sci, 762, 486-495 1993 Refereed English Disclose to all
Hiroshi Nagamochi,Toshihide Ibaraki Hiroshi Nagamochi,Toshihide Ibaraki Hiroshi Nagamochi,Toshihide Ibaraki A Linear-Time Algorithm for Finding a Sparse k-Connected Spanning Subgraph of a k-Connected Graph. A Linear-Time Algorithm for Finding a Sparse k-Connected Spanning Subgraph of a k-Connected Graph. A Linear-Time Algorithm for Finding a Sparse k-Connected Spanning Subgraph of a k-Connected Graph. Algorithmica, 7, 5&6, 583-596 Algorithmica, 7, 5&6, 583-596 Algorithmica, 7, 5&6, 583-596 1992 Refereed Disclose to all
Hiroshi Nagamochi,Toshihide Ibaraki Hiroshi Nagamochi,Toshihide Ibaraki Hiroshi Nagamochi,Toshihide Ibaraki Computing Edge-Connectivity in Multigraphs and Capacitated Graphs. Computing Edge-Connectivity in Multigraphs and Capacitated Graphs. Computing Edge-Connectivity in Multigraphs and Capacitated Graphs. SIAM J. Discrete Math., 5, 1, 54-66 SIAM J. Discrete Math., 5, 1, 54-66 SIAM J. Discrete Math., 5, 1, 54-66 1992 Refereed Disclose to all
IBARAKI T;NAGAMOCHI H;KAMEDA T Toshihide Ibaraki,Hiroshi Nagamochi,Tiko Kameda IBARAKI T;NAGAMOCHI H;KAMEDA T Optimal Coteries for Rings and Related Networks. Optimal Coteries for Rings and Related Networks. Optimal Coteries for Rings and Related Networks. Proc Int Conf Distrib Comput Syst, 12th, 650-656 Proceedings of the 12th International Conference on Distributed Computing Systems, Yokohama, Japan, June 9-12, 1992, 12th, 650-656 Proc Int Conf Distrib Comput Syst, 12th, 650-656 1992 Refereed English Disclose to all
Hiroshi Nagamochi,Toshihide Ibaraki Hiroshi Nagamochi,Toshihide Ibaraki Hiroshi Nagamochi,Toshihide Ibaraki Maximum flows in probabilistic networks. Maximum flows in probabilistic networks. Maximum flows in probabilistic networks. Networks, 21, 6, 645-666 Networks, 21, 6, 645-666 Networks, 21, 6, 645-666 1991 Refereed Disclose to all
永持 仁 永持 仁 永持 仁 基数3のカットセット数を最小にする2-辺連結グラフ 基数3のカットセット数を最小にする2-辺連結グラフ 基数3のカットセット数を最小にする2-辺連結グラフ 電子情報通信学会論文誌 A 基礎・境界, 73, 7, 1281-1285 電子情報通信学会論文誌 A 基礎・境界, 73, 7, 1281-1285 電子情報通信学会論文誌 A 基礎・境界, 73, 7, 1281-1285 1990/07 Refereed Japanese Disclose to all
永持 仁 永持 仁 永持 仁 組合せ最適化におけるTardosの新解法 (最近の数理計画特集) 組合せ最適化におけるTardosの新解法 (最近の数理計画特集) 組合せ最適化におけるTardosの新解法 (最近の数理計画特集) システム・制御・情報, 34, 4, 232-240 システム・制御・情報, 34, 4, 232-240 システム・制御・情報, 34, 4, 232-240 1990/04 Refereed Japanese Disclose to all
Hiroshi Nagamochi,Toshihide Ibaraki Hiroshi Nagamochi,Toshihide Ibaraki Hiroshi Nagamochi,Toshihide Ibaraki Multicommodity flows in certain planar directed networks. Multicommodity flows in certain planar directed networks. Multicommodity flows in certain planar directed networks. Discrete Applied Mathematics, 27, 1-2, 125-145 Discrete Applied Mathematics, 27, 1-2, 125-145 Discrete Applied Mathematics, 27, 1-2, 125-145 1990 Refereed Disclose to all
Hiroshi Nagamochi,Masao Fukushima,Toshihide Ibaraki Hiroshi Nagamochi,Masao Fukushima,Toshihide Ibaraki Hiroshi Nagamochi,Masao Fukushima,Toshihide Ibaraki 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. Relaxation methods for the strictly convex multicommodity flow problem with capacity constraints on individual commodities. Networks, 20, 4, 409-426 Networks, 20, 4, 409-426 Networks, 20, 4, 409-426 1990 Refereed Disclose to all
Hiroshi Nagamochi,Toshihide Ibaraki Hiroshi Nagamochi,Toshihide Ibaraki Hiroshi Nagamochi,Toshihide Ibaraki Computing Edge-Connectivity in Multiple and Capacitated Graphs. Computing Edge-Connectivity in Multiple and Capacitated Graphs. Computing Edge-Connectivity in Multiple and Capacitated Graphs. Algorithms, International Symposium SIGAL '90, Tokyo, Japan, August 16-18, 1990, Proceedings, 12-20 Algorithms, International Symposium SIGAL '90, Tokyo, Japan, August 16-18, 1990, Proceedings, 12-20 Algorithms, International Symposium SIGAL '90, Tokyo, Japan, August 16-18, 1990, Proceedings, 12-20 1990 Refereed Disclose to all
永持 仁 永持 仁 永持 仁 与えられた基数のカットセット数を最小にするグラフ 与えられた基数のカットセット数を最小にするグラフ 与えられた基数のカットセット数を最小にするグラフ 電子情報通信学会論文誌 A 基礎・境界, 72, 10, 1601-1610 電子情報通信学会論文誌 A 基礎・境界, 72, 10, 1601-1610 電子情報通信学会論文誌 A 基礎・境界, 72, 10, 1601-1610 1989/10 Refereed Japanese Disclose to all
Hiroshi Nagamochi,Toshihide Ibaraki Hiroshi Nagamochi,Toshihide Ibaraki Hiroshi Nagamochi,Toshihide 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. On Max-Flow Min-Cut and Integral Flow Properties for Multicommodity Flows in Directed Networks. Inf. Process. Lett., 31, 6, 279-285 Inf. Process. Lett., 31, 6, 279-285 Inf. Process. Lett., 31, 6, 279-285 1989 Refereed Disclose to all
永持 仁 永持 仁 永持 仁 ある種の平面有向ネットワーク上の多品種流問題の実行可能性判定法(共著) ある種の平面有向ネットワーク上の多品種流問題の実行可能性判定法(共著) ある種の平面有向ネットワーク上の多品種流問題の実行可能性判定法(共著) 電子情報通信学会誌,J71-A/3, 804-810 電子情報通信学会誌,J71-A/3, 804-810 電子情報通信学会誌,J71-A/3, 804-810 1988 Refereed Japanese Disclose to all
永持 仁 永持 仁 永持 仁 ある種の平面有向ネットワーク上の多品種流問題に対する最大流ー最小カットの定理(共著) ある種の平面有向ネットワーク上の多品種流問題に対する最大流ー最小カットの定理(共著) ある種の平面有向ネットワーク上の多品種流問題に対する最大流ー最小カットの定理(共著) 電子情報通信学会誌,J71-A/1, 71-82 電子情報通信学会誌,J71-A/1, 71-82 電子情報通信学会誌,J71-A/1, 71-82 1988 Refereed Japanese Disclose to all
永持仁;茨木俊秀;長谷川利治 永持仁;茨木俊秀;長谷川利治 永持仁;茨木俊秀;長谷川利治 ある種の平面有向ネットワーク上の多品種流問題について ある種の平面有向ネットワーク上の多品種流問題について ある種の平面有向ネットワーク上の多品種流問題について 電子情報通信学会論文誌 A, 70, 2, 228-238 電子情報通信学会論文誌 A, 70, 2, 228-238 電子情報通信学会論文誌 A, 70, 2, 228-238 1987/02 Refereed Japanese Disclose to all
永持 仁 永持 仁 永持 仁 平面有向ネットワークのクラスCUに対する多品種流問題(共著) 平面有向ネットワークのクラスCUに対する多品種流問題(共著) 平面有向ネットワークのクラスCUに対する多品種流問題(共著) 電子情報通信学会誌,J71-A/9, 1328-1339 電子情報通信学会誌,J71-A/9, 1328-1339 電子情報通信学会誌,J71-A/9, 1328-1339 1987 Refereed Japanese Disclose to all
永持 仁 永持 仁 永持 仁 確率付きネットワーク上の期待最大流について(共著) 確率付きネットワーク上の期待最大流について(共著) 確率付きネットワーク上の期待最大流について(共著) 電子情報通信学会誌,J72-A/10, 1611-1620 電子情報通信学会誌,J72-A/10, 1611-1620 電子情報通信学会誌,J72-A/10, 1611-1620 Refereed Japanese Disclose to all

  • <<
  • >>
Title language:
Misc
Author Author(Japanese) Author(English) Title Title(Japanese) Title(English) Bibliography Bibliography(Japanese) Bibliography(English) Publication date Refereed paper Language Publishing type Disclose
Fei He, Akiyoshi Hanai,NAGAMOCHI Hiroshi .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 BIOINFORMATICS, 3, 258-265 BIOINFORMATICS, 3, 258-265 2016/02 Refereed English Disclose to all
Morito Oomine, Aleksandar Shurbevski,NAGAMOCHI Hiroshi 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 Lecture Notes in Computer Science, 9627, 286-297 Lecture Notes in Computer Science, 9627, 286-297 2016 Refereed English Disclose to all
N. Md Yunos, A. Shurbevski,NAGAMOCHI Hiroshi 永持 仁 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 The 18th Japan Conference on Discrete and Computational Geometry and Graphs, 102-103 The 18th Japan Conference on Discrete and Computational Geometry and Graphs, 102-103 2015/09 Refereed English Disclose to all
Fei He,NAGAMOCHI Hiroshi 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 he 12th International Symposium on Operations Research and its Applications in Engineering, Technology and Management, 70-81 he 12th International Symposium on Operations Research and its Applications in Engineering, Technology and Management, 70-81 2015/08 Refereed English Disclose to all
N. Md Yunos, A. Shurbevski,NAGAMOCHI Hiroshi 永持 仁 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 The 12th International Symposium on Operations Research and its Applications in Engineering, Technology and Management, 45-58 The 12th International Symposium on Operations Research and its Applications in Engineering, Technology and Management, 45-58 2015/08 Refereed English Disclose to all
Seok-Hee Hong,NAGAMOCHI Hiroshi 永持 仁 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 41st International Workshop on Graph-Theoretic Concepts in Computer Science 41st International Workshop on Graph-Theoretic Concepts in Computer Science 2015/06 Refereed English Disclose to all
Ken Iwaide, Hiroshi Nagamochi: 永持 仁 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 WALCOM 2015:, 234-245 WALCOM 2015:, 234-245 2015 Refereed English Disclose to all
Seok-Hee Hong, ,NAGAMOCHI Hiroshi 永持 仁 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 COCOON 2014:, 477-488 COCOON 2014:, 477-488 2014 Refereed English Disclose to all
Mingyu Xiao,NAGAMOCHI Hiroshi 永持 仁 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 ISAAC 2014, 429-440 ISAAC 2014, 429-440 2014 Refereed English Disclose to all
NAGAMOCHI Hiroshi 永持 仁 NAGAMOCHI Hiroshi Linear Layouts in Submodular Systems Linear Layouts in Submodular Systems Linear Layouts in Submodular Systems ISAAC 2012:, 475-484 ISAAC 2012:, 475-484 ISAAC 2012:, 475-484 2012 Refereed English Disclose to all
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 Conference Proceedings of the Annual ACM Symposium on Theory of Computing, 64-73 , 64-73 Conference Proceedings of the Annual ACM Symposium on Theory of Computing, 64-73 1996 Refereed English Disclose to all
永持 仁 永持 仁 永持 仁 アルゴリズム辞典(共著) アルゴリズム辞典(共著) アルゴリズム辞典(共著) 共立出版, 共立出版, 共立出版, 1995 Refereed Japanese Disclose to all

  • <<
  • >>
Title language:
Books etc
Author Author(Japanese) Author(English) Title Title(Japanese) Title(English) Publisher Publisher(Japanese) Publisher(English) Publication date Language Type Disclose
茨木 俊秀, 永持 仁 茨木 俊秀, 永持 仁 茨木 俊秀, 永持 仁 グラフ理論 連結構造とその応用 グラフ理論 連結構造とその応用 グラフ理論 連結構造とその応用 基礎数理講座, 朝倉書店 基礎数理講座, 朝倉書店 基礎数理講座, 朝倉書店 2010 Japanese Disclose to all
永持 仁 永持 仁 永持 仁 アルゴリズム工学―計算困難問題への挑戦―、第4.1章 グラフの連結度(共著) アルゴリズム工学―計算困難問題への挑戦―、第4.1章 グラフの連結度(共著) アルゴリズム工学―計算困難問題への挑戦―、第4.1章 グラフの連結度(共著) 共立出版,/ , 104-109 共立出版,/ , 104-109 共立出版,/ , 104-109 2001 Japanese Disclose to all
永持 仁 (分担執筆/62著者) 永持 仁 (分担執筆/62著者) 永持 仁 (分担執筆/62著者) アルゴリズム工学 - 計算困難問題への挑戦 - アルゴリズム工学 - 計算困難問題への挑戦 - アルゴリズム工学 - 計算困難問題への挑戦 - 共立出版 共立出版 共立出版 2001 Japanese Disclose to all
茨木俊秀, 永持仁 茨木俊秀, 永持仁 茨木俊秀, 永持仁 「数理工学のすすめ」 「数理工学のすすめ」 「数理工学のすすめ」 現代数学社 現代数学社 現代数学社 2000 Japanese Disclose to all
永持仁(4著者) 永持仁(4著者) 永持仁(4著者) 離散構造とアルゴリズム VI 離散構造とアルゴリズム VI 離散構造とアルゴリズム VI 近代科学社 近代科学社 近代科学社 1999 Japanese Disclose to all
永持 仁 永持 仁 永持 仁 離散構造とアルゴリズムⅥ、第3章「グラフの連結度増大問題とその周辺」 離散構造とアルゴリズムⅥ、第3章「グラフの連結度増大問題とその周辺」 離散構造とアルゴリズムⅥ、第3章「グラフの連結度増大問題とその周辺」 近代科学社(インプレス) 近代科学社(インプレス) 近代科学社(インプレス) 1999 Japanese Disclose to all
永持 仁 (3共訳者) 永持 仁 (3共訳者) 永持 仁 (3共訳者) アルゴリズム入門 - 設計と解析 - アルゴリズム入門 - 設計と解析 - アルゴリズム入門 - 設計と解析 - 星雲社 星雲社 星雲社 1998 Japanese Disclose to all
永持 仁 永持 仁 永持 仁 アルゴリズム入門 ―設計と解析―(共著) アルゴリズム入門 ―設計と解析―(共著) アルゴリズム入門 ―設計と解析―(共著) アジソン・ウエスレイ社, アジソン・ウエスレイ社, アジソン・ウエスレイ社, 1998 Japanese Disclose to all
永持 仁 永持 仁 永持 仁 数理工学のすすめ/木を見て森を見る 数理工学のすすめ/木を見て森を見る 数理工学のすすめ/木を見て森を見る 現代数学社 現代数学社 現代数学社 1998 Japanese Disclose to all
永持 仁 永持 仁 永持 仁 新版情報処理ハンドブック(共著) 新版情報処理ハンドブック(共著) 新版情報処理ハンドブック(共著) オーム社 オーム社 オーム社 1995 Joint Work Disclose to all
永持 仁 永持 仁 永持 仁 アルゴリズム辞典(共著) アルゴリズム辞典(共著) アルゴリズム辞典(共著) 共立出版 共立出版 共立出版 1995 Joint Work Disclose to all
永持 仁 永持 仁 永持 仁 離散構造とアルゴリズムⅡ、第4章「グラフの最小カット」 離散構造とアルゴリズムⅡ、第4章「グラフの最小カット」 離散構造とアルゴリズムⅡ、第4章「グラフの最小カット」 近代科学社,155-208 近代科学社,155-208 近代科学社,155-208 1992 Japanese Disclose to all

  • <<
  • >>
Title language:
Awards
Title(Japanese) Title(English) Organization name(Japanese) Organization name(English) Date
研究賞 情報処理学会 1990
研究賞(アルゴリズム研究会) 情報処理学会 1990
論文賞 電子情報通信学会 1998
論文賞 電子情報通信学会 1998
論文賞 電子情報通信学会 1999
第14回 日本IBM科学賞(コンピューターサインス分野) 2000
文献賞 文献賞日本オペレーションズ・リサーチ学会 2006
学会賞 (学術賞) スケジューリング学会 2006
業績賞 電子情報通信学会 2010
External funds: competitive funds and Grants-in-Aid for Scientific Research (Kakenhi)
Type Position Title(Japanese) Title(English) Period
奨励研究(A) 組み合せ構造をもつ問題を解くアルゴリズムの研究 1998-1998
特定領域研究 グラフ・ネットワーク問題を解くアルゴリズムの開発 1999-1999
基盤研究(C) グラフ理論に基づく近似アルゴリズムの構築とネットワーク問題への応用 2004-2004
特定領域研究 グラフ構造を有する問題に対する近似アルゴリズムの設計 2004-2004
特定領域研究 グラフ構造を有する問題に対する近似アルゴリズムの設計 2005-2005
基盤研究(C) グラフ・ネットワークの連結特性の解析とアルゴリズム設計への 応用 2005-2005
特定領域研究 グラフ構造を有する問題に対する近似アルゴリズムの設計 2006-2006
基盤研究(C) グラフ・ネットワークの連結特性の解析とアルゴリズム設計への 応用 2006-2006
基盤研究(C) 図形充填問題に対するプラットフォームモデルの構築 2008-2010
基盤研究(C) Representative ネットワーク構造への変換に基づくアルゴリズム設計技術 2011-2013
基盤研究(C) Representative グラフ最適化問題に対する高速アルゴリズムの理論設計と実装開発 (平成26年度分) 2014/04/01-2015/03/31
基盤研究(C) Representative グラフ最適化問題に対する高速アルゴリズムの理論設計と実装開発 (平成27年度分) 2015/04/01-2016/03/31
基盤研究(C) Representative グラフ最適化問題に対する高速アルゴリズムの理論設計と実装開発 (平成28年度分) 2016/04/01-2017/03/31
基盤研究(C) Representative グラフ理論的手法に基づく離散最適化アルゴリズムの設計 (平成29年度分) 2017/04/01-2018/03/31

  • <<
  • >>
External funds: other than those above
System Main person Title(Japanese) Title(English) Period
離散最適化アルゴリズム Algorithms for Discrete optimization -
ネットワーク問題に対する効率の良いアルゴリズムの開発 Development of Efficient Algorithms for Network Problems 1988-
Teaching subject(s)
Name(Japanese) Name(English) Term Department Period
グラフ理論(数理) 前期 工学部 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
応用数学特別セミナー Seminar on Applied Mathematics, Advanced 後期 情報学研究科 2017/04-2018/03
数理工学特別セミナー Seminar on Applied Mathematics and Physics, Advanced 通年 情報学研究科 2017/04-2018/03
数理工学特別研究2 Advanced Study in Applied Mathematics and Physics II 通年 情報学研究科 2017/04-2018/03
数理工学特別研究1 Advanced Study in Applied Mathematics and Physics I 通年 情報学研究科 2017/04-2018/03
最適化 Optimization 後期 工学部 2017/04-2018/03
最適化 Optimization 後期 経営管理教育部 2017/04-2018/03
グラフ理論 Graph Theory 前期 工学部 2017/04-2018/03
計画数学通論 Operations Research, Advanced 後期 情報学研究科 2017/04-2018/03
離散数理特論 Discrete Mathematics, Advanced 後期 情報学研究科 2017/04-2018/03
最適化 Optimization 後期 工学部 2018/04-2019/03
最適化 Optimization 後期 経営管理教育部 2018/04-2019/03
グラフ理論 Graph Theory 前期 工学部 2018/04-2019/03
計画数学通論 Operations Research, Advanced 後期 情報学研究科 2018/04-2019/03
離散数理特論 Discrete Mathematics, Advanced 後期 情報学研究科 2018/04-2019/03

  • <<
  • >>
School management (title, position)
Title Period
発明評価委員会(ソフトウェア・コンテンツ分野拠点) 委員 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
Faculty management (title, position)
Title Period
専攻長会議 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
専攻長会議 2017/04/01-2018/03/31
制規委員会委員 2017/04/01-2018/03/31
情報セキュリティ委員会委員 2017/04/01-2018/03/31
評価・広報委員会委員 2018/04/01-2019/03/31
工学研究科・工学部広報委員会委員 2018/04/01-2020/03/31