永持 仁

Last Update: 2021/06/11 13:35:23

Print

Name(Kanji/Kana/Abecedarium Latinum)
永持 仁/ナガモチ ヒロシ/Nagamochi, Hiroshi
Primary Affiliation(Org1/Job title)
Graduate School of Informatics/Professor
Faculty
Org1 Job title
工学部
Contact Address
Type Address(Japanese) Address(English)
Office 〒606-8501 京都府京都市左京区吉田本町 Yoshida-Honmachi, Sakyo-ku, Kyoto 606-8501, Japan
E-mail Address
nagamochi.hiroshi.7c @ kyoto-u.ac.jp
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
Academic Degree
Field(Japanese) Field(English) University(Japanese) University(English) Method
工学修士 京都大学
工学博士 京都大学
Academic Resume (Graduate Schools)
University(Japanese) University(English) Faculty(Japanese) Faculty(English) Major(Japanese) Major(English) Completion Status
京都大学 大学院工学研究科修士課程数理工学専攻 修了
京都大学 大学院工学研究科博士課程数理工学専攻 修了
Academic Resume (Undergraduate School/Majors)
University(Japanese) University(English) Faculty(Japanese) Faculty(English) Major(s)(Japanese) Major(s)(English) Completion Status
京都大学 農学部農業工学科 卒業
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 and Information Processing Society of Japan. 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
英語 English eng
researchmap URL
https://researchmap.jp/risan_suuri_2021
Research Topics
(Japanese)
グラフ理論における連結性,平面性などのグラフ構造の研究.グラフ・ネットワーク構造などを対象とした,スケジューリング問題,配置問題,ルーティング問題などの離散最適化問題に対する効率の良いアルゴリズムの設計を行う.最近では,機械学習による構造物性相関(QSPR)の逆問題を整数計画を用いて解くことで,所望の物性値を有すると予測される化合物を設計するシステムの開発に取り組んでいる.
(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. Development of a system of designing a chemical graph that has a desired chemical property by solving the inverse problem of QSPR with a machine learning.
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
Rachaya Chiewvanichakorn, Chenxi Wang, Zhe Zhang, Aleksandar Shurbevski, Hiroshi Nagamochi, Tatsuya Akutsu Rachaya Chiewvanichakorn, Chenxi Wang, Zhe Zhang, Aleksandar Shurbevski, Hiroshi Nagamochi, Tatsuya Akutsu Rachaya Chiewvanichakorn, Chenxi Wang, Zhe Zhang, Aleksandar Shurbevski, Hiroshi Nagamochi, Tatsuya Akutsu A Method for the Inverse QSAR/QSPR Based on Artificial Neural Networks and Mixed Integer Linear Programming A Method for the Inverse QSAR/QSPR Based on Artificial Neural Networks and Mixed Integer Linear Programming A Method for the Inverse QSAR/QSPR Based on Artificial Neural Networks and Mixed Integer Linear Programming Proceedings of the 2020 10th International Conference on Bioscience, Biochemistry and Bioinformatics Proceedings of the 2020 10th International Conference on Bioscience, Biochemistry and Bioinformatics Proceedings of the 2020 10th International Conference on Bioscience, Biochemistry and Bioinformatics 2020/01/19 Refereed Research paper(international conference proceedings) Disclose to all
Naveed Azam, Rachaya Chiewvanichakorn, Fan Zhang, Aleksandar Shurbevski, Hiroshi Nagamochi, Tatsuya Akutsu Naveed Azam, Rachaya Chiewvanichakorn, Fan Zhang, Aleksandar Shurbevski, Hiroshi Nagamochi, Tatsuya Akutsu A Novel Method for the Inverse QSAR/QSPR based on Artificial Neural Networks and Mixed Integer Linear Programming with Guaranteed Admissibility A Novel Method for the Inverse QSAR/QSPR based on Artificial Neural Networks and Mixed Integer Linear Programming with Guaranteed Admissibility A Novel Method for the Inverse QSAR/QSPR based on Artificial Neural Networks and Mixed Integer Linear Programming with Guaranteed Admissibility Proceedings of the 13th International Joint Conference on Biomedical Engineering Systems and Technologies Proceedings of the 13th International Joint Conference on Biomedical Engineering Systems and Technologies 2020 Refereed Research paper(international conference proceedings) Disclose to all
Kyousuke Yamashita, Ryuji Masui, Xiang Zhou, Chenxi Wang, Aleksandar Shurbevski, Hiroshi Nagamochi, Tatsuya Akutsu Kyousuke Yamashita, Ryuji Masui, Xiang Zhou, Chenxi Wang, Aleksandar Shurbevski, Hiroshi Nagamochi, Tatsuya Akutsu Kyousuke Yamashita, Ryuji Masui, Xiang Zhou, Chenxi Wang, Aleksandar Shurbevski, Hiroshi Nagamochi, Tatsuya Akutsu Enumerating Chemical Graphs with Two Disjoint Cycles Satisfying Given Path Frequency Specifications. Enumerating Chemical Graphs with Two Disjoint Cycles Satisfying Given Path Frequency Specifications. Enumerating Chemical Graphs with Two Disjoint Cycles Satisfying Given Path Frequency Specifications. CoRR, abs/2004.08381 CoRR, abs/2004.08381 CoRR, abs/2004.08381 2020 Refereed Research paper(scientific journal) Disclose to all
Yuui Tamura, Yuhei Nishiyama, Chenxi Wang, Yanming Sun, Aleksandar Shurbevski, Hiroshi Nagamochi, Tatsuya Akutsu Yuui Tamura, Yuhei Nishiyama, Chenxi Wang, Yanming Sun, Aleksandar Shurbevski, Hiroshi Nagamochi, Tatsuya Akutsu Yuui Tamura, Yuhei Nishiyama, Chenxi Wang, Yanming Sun, Aleksandar Shurbevski, Hiroshi Nagamochi, Tatsuya Akutsu Enumerating Chemical Graphs with Mono-block 2-Augmented Tree Structure from Given Upper and Lower Bounds on Path Frequencies. Enumerating Chemical Graphs with Mono-block 2-Augmented Tree Structure from Given Upper and Lower Bounds on Path Frequencies. Enumerating Chemical Graphs with Mono-block 2-Augmented Tree Structure from Given Upper and Lower Bounds on Path Frequencies. CoRR, abs/2004.06367 CoRR, abs/2004.06367 CoRR, abs/2004.06367 2020 Refereed Research paper(scientific journal) Disclose to all
Naveed Ahmed Azam, Rachaya Chiewvanichakorn, Fan Zhang, Aleksandar Shurbevski, Hiroshi Nagamochi, Tatsuya Akutsu Naveed Ahmed Azam, Rachaya Chiewvanichakorn, Fan Zhang, Aleksandar Shurbevski, Hiroshi Nagamochi, Tatsuya Akutsu Naveed Ahmed Azam, Rachaya Chiewvanichakorn, Fan Zhang, Aleksandar Shurbevski, Hiroshi Nagamochi, Tatsuya Akutsu A Novel Method for the Inverse QSAR/QSPR based on Artificial Neural Networks and Mixed Integer Linear Programming with Guaranteed Admissibility. A Novel Method for the Inverse QSAR/QSPR based on Artificial Neural Networks and Mixed Integer Linear Programming with Guaranteed Admissibility. A Novel Method for the Inverse QSAR/QSPR based on Artificial Neural Networks and Mixed Integer Linear Programming with Guaranteed Admissibility. , 101-108 , 101-108 , 101-108 2020 Refereed Research paper(international conference proceedings) Disclose to all
Jianshen Zhu, Chenxi Wang, Aleksandar Shurbevski, Hiroshi Nagamochi, Tatsuya Akutsu Jianshen Zhu, Chenxi Wang, Aleksandar Shurbevski, Hiroshi Nagamochi, Tatsuya Akutsu Jianshen Zhu, Chenxi Wang, Aleksandar Shurbevski, Hiroshi Nagamochi, Tatsuya Akutsu A Novel Method for Inference of Chemical Compounds of Cycle Index Two with Desired Properties Based on Artificial Neural Networks and Integer Programming. A Novel Method for Inference of Chemical Compounds of Cycle Index Two with Desired Properties Based on Artificial Neural Networks and Integer Programming. A Novel Method for Inference of Chemical Compounds of Cycle Index Two with Desired Properties Based on Artificial Neural Networks and Integer Programming. Algorithms, 13, 5, 124-124 Algorithms, 13, 5, 124-124 Algorithms, 13, 5, 124-124 2020 Refereed Research paper(scientific journal) Disclose to all
Kazuya Haraguchi, Hiroshi Nagamochi Kazuya Haraguchi, Hiroshi Nagamochi Kazuya Haraguchi, Hiroshi Nagamochi A Polynomial-delay Algorithm for Enumerating Connectors under Various Connectivity Conditions A Polynomial-delay Algorithm for Enumerating Connectors under Various Connectivity Conditions A Polynomial-delay Algorithm for Enumerating Connectors under Various Connectivity Conditions Proceedings of The 30th International Symposium on Algorithms and Computation (ISAAC 2019) Proceedings of The 30th International Symposium on Algorithms and Computation (ISAAC 2019) Proceedings of The 30th International Symposium on Algorithms and Computation (ISAAC 2019) 2019 Refereed English Research paper(international conference proceedings) Disclose to all
Seok-Hee Hong, Hiroshi Nagamochi Seok-Hee Hong, Hiroshi Nagamochi Seok-Hee Hong, Hiroshi Nagamochi A linear-time algorithm for testing full outer-2-planarity A linear-time algorithm for testing full outer-2-planarity A linear-time algorithm for testing full outer-2-planarity Discrete Applied Mathematics, 255, 234-257 Discrete Applied Mathematics, 255, 234-257 Discrete Applied Mathematics, 255, 234-257 2019 Refereed Disclose to all
Yuhei Nishiyama, Aleksandar Shurbevski, Hiroshi Nagamochi, Tatsuya Akutsu Yuhei Nishiyama, Aleksandar Shurbevski, Hiroshi Nagamochi, Tatsuya Akutsu Yuhei Nishiyama, Aleksandar Shurbevski, Hiroshi Nagamochi, Tatsuya Akutsu Resource Cut, a New Bounding Procedure to Algorithms for Enumerating Tree-Like Chemical Graphs Resource Cut, a New Bounding Procedure to Algorithms for Enumerating Tree-Like Chemical Graphs Resource Cut, a New Bounding Procedure to Algorithms for Enumerating Tree-Like Chemical Graphs IEEE/ACM Trans. Comput. Biology Bioinform, 16, 1, 77-90 IEEE/ACM Trans. Comput. Biology Bioinform, 16, 1, 77-90 IEEE/ACM Trans. Comput. Biology Bioinform, 16, 1, 77-90 2019 Refereed English Research paper(scientific journal) Disclose to all
Jinghui Li, Hiroshi Nagamochi, Tatsuya Akutsu Jinghui Li, Hiroshi Nagamochi, Tatsuya Akutsu Jinghui Li, Hiroshi Nagamochi, Tatsuya Akutsu 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 Transactions on Computational Biology and Bioinformatics, 15, 2, 633-646 IEEE/ACM Transactions on Computational Biology and Bioinformatics, 15, 2, 633-646 IEEE/ACM Transactions on Computational Biology and Bioinformatics, 15, 2, 633-646 2018/03/01 Refereed English Research paper(scientific journal) Disclose to all
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 on Information and Systems, E101D, 3, 611-612 IEICE Transactions on Information and Systems, E101D, 3, 611-612 IEICE Transactions on Information and Systems, E101D, 3, 611-612 2018/03/01 Refereed English Research paper(scientific journal) Disclose to all
Yuui Tamura, Hiroshi Nagamochi, Aleksandar Shurbevski, Tatsuya Akutsu Yuui Tamura, Hiroshi Nagamochi, Aleksandar Shurbevski, Tatsuya Akutsu Yuui Tamura, Hiroshi Nagamochi, Aleksandar Shurbevski, Tatsuya Akutsu Enumerating chemical mono-block 3-augmented trees with two junctions Enumerating chemical mono-block 3-augmented trees with two junctions Enumerating chemical mono-block 3-augmented trees with two junctions ACM International Conference Proceeding Series, 48-55 ACM International Conference Proceeding Series, 48-55 ACM International Conference Proceeding Series, 48-55 2018/01/18 Refereed English Research paper(international conference proceedings) 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
Mingyu Xiao, Hiroshi Nagamochi Mingyu Xiao, Hiroshi Nagamochi Mingyu Xiao, Hiroshi Nagamochi A refined algorithm for maximum independent set in degree-4 graphs A refined algorithm for maximum independent set in degree-4 graphs A refined algorithm for maximum independent set in degree-4 graphs JOURNAL OF COMBINATORIAL OPTIMIZATION, 34, 3, 830-873 JOURNAL OF COMBINATORIAL OPTIMIZATION, 34, 3, 830-873 JOURNAL OF COMBINATORIAL OPTIMIZATION, 34, 3, 830-873 2017/10 Refereed English Research paper(scientific journal) Disclose to all
Mohd Shahrizan Bin Othman, Aleksandar Shurbevski, Yoshiyuki Karuno, Hiroshi Nagamochi Mohd Shahrizan Bin Othman, Aleksandar Shurbevski, Yoshiyuki Karuno, Hiroshi Nagamochi Mohd Shahrizan Bin 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 Journal of Information Processing, 25, 655-666 Journal of Information Processing, 25, 655-666 Journal of Information Processing, 25, 655-666 2017/08/01 Refereed English Research paper(scientific journal) 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 Journal of Information Processing, 25, 639-654 Journal of Information Processing, 25, 639-654 Journal of Information Processing, 25, 639-654 2017/08/01 Refereed English Research paper(scientific journal) 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 INFORMATION AND COMPUTATION, 255, 126-146 INFORMATION AND COMPUTATION, 255, 126-146 INFORMATION AND COMPUTATION, 255, 126-146 2017/08 Refereed English Research paper(scientific journal) 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 ON INFORMATION AND SYSTEMS, E100D, 3, 414-421 IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, E100D, 3, 414-421 IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, E100D, 3, 414-421 2017/03 Refereed English Research paper(scientific journal) Disclose to all
Mingyu Xiao, Hiroshi Nagamochi Mingyu Xiao, Hiroshi Nagamochi Mingyu Xiao, 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 THEORETICAL COMPUTER SCIENCE, 659, 72-82 THEORETICAL COMPUTER SCIENCE, 659, 72-82 THEORETICAL COMPUTER SCIENCE, 659, 72-82 2017/01 Refereed English Research paper(scientific journal) 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 Journal of Graph Algorithms and Applications, 21, 3, 247-263 Journal of Graph Algorithms and Applications, 21, 3, 247-263 Journal of Graph Algorithms and Applications, 21, 3, 247-263 2017 Refereed English Research paper(scientific journal) 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 Leibniz International Proceedings in Informatics, LIPIcs, 64, 62.1-62.12 Leibniz International Proceedings in Informatics, LIPIcs, 64, 62.1-62.12 Leibniz International Proceedings in Informatics, LIPIcs, 64, 62.1-62.12 2016/12/01 Refereed English Research paper(international conference proceedings) 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 ON INFORMATION AND SYSTEMS, E99D, 3, 615-623 IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, E99D, 3, 615-623 IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, E99D, 3, 615-623 2016/03 Refereed English Research paper(scientific journal) 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 ON INFORMATION AND SYSTEMS, E99D, 3, 615-623 IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, E99D, 3, 615-623 IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, E99D, 3, 615-623 2016/03 Refereed English Research paper(scientific journal) Disclose to all
Mingyu Xiao, Hiroshi Nagamochi Mingyu Xiao, Hiroshi Nagamochi Mingyu Xiao, Hiroshi Nagamochi 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/02 Refereed English Research paper(scientific journal) Disclose to all
Mingyu Xiao, Hiroshi Nagamochi Mingyu Xiao, Hiroshi Nagamochi Mingyu Xiao, Hiroshi Nagamochi An Exact Algorithm for TSP in Degree-3 Graphs Via Circuit Procedure and Amortization on Connectivity Structure An Exact Algorithm for TSP in Degree-3 Graphs Via Circuit Procedure and Amortization on Connectivity Structure 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/02 Refereed English Research paper(scientific journal) Disclose to all
Aleksandar Shurbevski, Hiroshi Nagamochi, Yoshiyuki Karuno Aleksandar Shurbevski, Hiroshi Nagamochi, Yoshiyuki Karuno Aleksandar Shurbevski, Hiroshi Nagamochi, Yoshiyuki Karuno Approximation algorithms for a sequencing problem with a biased bipartite structure Approximation algorithms for a sequencing problem with a biased bipartite structure Approximation algorithms for a sequencing problem with a biased bipartite structure JOURNAL OF ADVANCED MECHANICAL DESIGN SYSTEMS AND MANUFACTURING, 10, 3 JOURNAL OF ADVANCED MECHANICAL DESIGN SYSTEMS AND MANUFACTURING, 10, 3 JOURNAL OF ADVANCED MECHANICAL DESIGN SYSTEMS AND MANUFACTURING, 10, 3 2016 Refereed English Research paper(scientific journal) 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, 9224, 406-421 GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE, 9224, 406-421 GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE, 9224, 406-421 2016 Refereed English Research paper(international conference proceedings) 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, JCDCGG 2015, 9943, 228-240 DISCRETE AND COMPUTATIONAL GEOMETRY AND GRAPHS, JCDCGG 2015, 9943, 228-240 DISCRETE AND COMPUTATIONAL GEOMETRY AND GRAPHS, JCDCGG 2015, 9943, 228-240 2016 Refereed English Research paper(international conference proceedings) 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 (GD 2016), 9801, 321-334 GRAPH DRAWING AND NETWORK VISUALIZATION (GD 2016), 9801, 321-334 GRAPH DRAWING AND NETWORK VISUALIZATION (GD 2016), 9801, 321-334 2016 Refereed English Research paper(international conference proceedings) 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
Mingyu Xiao, Hiroshi Nagamochi Mingyu Xiao, Hiroshi Nagamochi Mingyu Xiao, Hiroshi Nagamochi 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/01 Refereed English Research paper(scientific journal) Disclose to all
Ken Iwaide, Hiroshi Nagamochi 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 Journal of Graph Algorithms and Applications, 20, 1, 23-58 Journal of Graph Algorithms and Applications, 20, 1, 23-58 Journal of Graph Algorithms and Applications, 20, 1, 23-58 2016 Refereed English Research paper(scientific journal) 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 JOURNAL OF COMBINATORIAL OPTIMIZATION, 30, 2, 214-241 JOURNAL OF COMBINATORIAL OPTIMIZATION, 30, 2, 214-241 JOURNAL OF COMBINATORIAL OPTIMIZATION, 30, 2, 214-241 2015/08 Refereed English Research paper(scientific journal) 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 DISCRETE APPLIED MATHEMATICS, 190, 147-162 DISCRETE APPLIED MATHEMATICS, 190, 147-162 DISCRETE APPLIED MATHEMATICS, 190, 147-162 2015/08 Refereed English Research paper(scientific journal) Disclose to all
Masataka Ikeda, Hiroshi Nagamochi Masataka Ikeda, Hiroshi Nagamochi Masataka Ikeda, Hiroshi Nagamochi 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 ON INFORMATION AND SYSTEMS, E98D, 3, 503-511 IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, E98D, 3, 503-511 IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, E98D, 3, 503-511 2015/03 Refereed English Research paper(scientific journal) Disclose to all
Mingyu Xiao, Hiroshi Nagamochi Mingyu Xiao, Hiroshi Nagamochi Mingyu Xiao, Hiroshi Nagamochi A refined exact algorithm for Edge Dominating Set A refined exact algorithm for Edge Dominating Set A refined exact algorithm for Edge Dominating Set THEORETICAL COMPUTER SCIENCE, 560, P2, 207-216 THEORETICAL COMPUTER SCIENCE, 560, P2, 207-216 THEORETICAL COMPUTER SCIENCE, 560, P2, 207-216 2014/12 Refereed English Research paper(scientific journal) Disclose to all
Masaki Suzuki, Hiroshi Nagamochi, Tatsuya Akutsu Masaki Suzuki, Hiroshi Nagamochi, Tatsuya Akutsu Masaki Suzuki, Hiroshi Nagamochi, Tatsuya Akutsu 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 JOURNAL OF CHEMINFORMATICS, 6, 1, 31 JOURNAL OF CHEMINFORMATICS, 6, 1, 31 JOURNAL OF CHEMINFORMATICS, 6, 1, 31 2014/05 Refereed English Research paper(scientific journal) Disclose to all
Aleksandar Shurbevski, Noriaki Hirosue, Hiroshi Nagamochi Aleksandar Shurbevski, Noriaki Hirosue, Hiroshi Nagamochi Aleksandar Shurbevski, Noriaki Hirosue, Hiroshi Nagamochi Optimization Techniques for Robot Path Planning Optimization Techniques for Robot Path Planning Optimization Techniques for Robot Path Planning ICT INNOVATIONS 2013: ICT INNOVATIONS AND EDUCATION, 231, 111-120 ICT INNOVATIONS 2013: ICT INNOVATIONS AND EDUCATION, 231, 111-120 ICT INNOVATIONS 2013: ICT INNOVATIONS AND EDUCATION, 231, 111-120 2014 Refereed English Research paper(international conference proceedings) 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
Toshihiro Shimizu, Takuro Fukunagaa, Hiroshi Nagamochi Toshihiro Shimizu, Takuro Fukunagaa, Hiroshi Nagamochi Toshihiro Shimizu, Takuro Fukunagaa, Hiroshi Nagamochi Unranking of small combinations from large sets Unranking of small combinations from large sets Unranking of small combinations from large sets Journal of Discrete Algorithms, 29, C, 8-20 Journal of Discrete Algorithms, 29, C, 8-20 Journal of Discrete Algorithms, 29, C, 8-20 2014 Refereed English Research paper(scientific journal) Disclose to all
Yang Zhao, Morihiro Hayashida, Jira Jindalertudomdee, Hiroshi Nagamochi, Tatsuya Akutsu Yang Zhao, Morihiro Hayashida, Jira Jindalertudomdee, Hiroshi Nagamochi, Tatsuya Akutsu Yang Zhao, Morihiro Hayashida, Jira Jindalertudomdee, Hiroshi Nagamochi, Tatsuya 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 Journal of Bioinformatics and Computational Biology, 11, 6 Journal of Bioinformatics and Computational Biology, 11, 6 2013/12 Refereed English Research paper(scientific journal) Disclose to all
Mingyu Xiao, Hiroshi Nagamochi Mingyu Xiao, Hiroshi Nagamochi Mingyu Xiao, Hiroshi 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 THEORETICAL COMPUTER SCIENCE, 508, 2-15 THEORETICAL COMPUTER SCIENCE, 508, 2-15 2013/10 Refereed English Research paper(scientific journal) Disclose to all
Mingyu Xiao, Hiroshi Nagamochi Mingyu Xiao, Hiroshi Nagamochi Mingyu Xiao, Hiroshi 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, E96D, 3, 408-418 IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, E96D, 3, 408-418 IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, E96D, 3, 408-418 2013/03 Refereed English Research paper(scientific journal) Disclose to all
Aleksandar Shurbevski, Hiroshi Nagamochi, Yoshiyuki Karuno Aleksandar Shurbevski, Hiroshi Nagamochi, Yoshiyuki Karuno Aleksandar Shurbevski, Hiroshi Nagamochi, Yoshiyuki 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, E96-D, 3, 450-456 IEICE Transactions on Information and Systems, E96-D, 3, 450-456 IEICE Transactions on Information and Systems, E96-D, 3, 450-456 2013 Refereed English Research paper(scientific journal) Disclose to all
Mingyu Xiao, Takuro Fukunaga, Hiroshi Nagamochi Mingyu Xiao, Takuro Fukunaga, Hiroshi Nagamochi Mingyu Xiao, Takuro Fukunaga, Hiroshi Nagamochi FPTASs for trimming weighted trees FPTASs for trimming weighted trees FPTASs for trimming weighted trees THEORETICAL COMPUTER SCIENCE, 469, 105-118 THEORETICAL COMPUTER SCIENCE, 469, 105-118 THEORETICAL COMPUTER SCIENCE, 469, 105-118 2013/01 Refereed English Research paper(scientific journal) Disclose to all
Mingyu Xiao, Hiroshi Nagamochi Mingyu Xiao, Hiroshi Nagamochi Mingyu Xiao, Hiroshi 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 THEORETICAL COMPUTER SCIENCE, 469, 92-104 THEORETICAL COMPUTER SCIENCE, 469, 92-104 2013/01 Refereed English Research paper(scientific journal) Disclose to all
Yohei Arahori, Takashi Imamichi, Hiroshi Nagamochi Yohei Arahori, Takashi Imamichi, Hiroshi Nagamochi Yohei Arahori, Takashi Imamichi, Hiroshi 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 & OPERATIONS RESEARCH, 39, 12, 2991-3011 COMPUTERS & OPERATIONS RESEARCH, 39, 12, 2991-3011 COMPUTERS & OPERATIONS RESEARCH, 39, 12, 2991-3011 2012/12 Refereed English Research paper(scientific journal) Disclose to all
Yang Zhao, Morihiro Hayashida, Jose C. Nacher, Hiroshi Nagamochi, Tatsuya Akutsu Yang Zhao, Morihiro Hayashida, Jose C. Nacher, Hiroshi Nagamochi, Tatsuya Akutsu Yang Zhao, Morihiro Hayashida, Jose C. Nacher, Hiroshi Nagamochi, Tatsuya 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 International Journal of Bioinformatics Research and Applications, 8, 3-4, 210-227 International Journal of Bioinformatics Research and Applications, 8, 3-4, 210-227 2012/09 Refereed English Research paper(scientific journal) Disclose to all
Seok-Hee Hong, Hiroshi Nagamochi Seok-Hee Hong, Hiroshi Nagamochi Seok-Hee Hong, Hiroshi 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 THEORETICAL COMPUTER SCIENCE, 445, 36-51 THEORETICAL COMPUTER SCIENCE, 445, 36-51 2012/08 Refereed English Research paper(scientific journal) Disclose to all
Seok-Hee Hong, Hiroshi Nagamochi 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/04 Refereed English Research paper(scientific journal) Disclose to all
Kazumasa Okumoto, Takuro Fukunaga, Hiroshi Nagamochi 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/04 Refereed English Research paper(scientific journal) Disclose to all
Seok-Hee Hong, Hiroshi Nagamochi 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/04 Refereed English Research paper(scientific journal) Disclose to all
Kazumasa Okumoto, Takuro Fukunaga, Hiroshi Nagamochi 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/04 Refereed English Research paper(scientific journal) Disclose to all
Tomoki Imada, Hiroshi Nagamochi Tomoki Imada, Hiroshi Nagamochi Tomoki Imada, Hiroshi 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, E95D, 3, 712-721 IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, E95D, 3, 712-721 IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, E95D, 3, 712-721 2012/03 Refereed English Research paper(scientific journal) Disclose to all
Aleksandar Shurbevski, Yoshiyuki Karuno, Hiroshi Nagamochi Aleksandar Shurbevski, Yoshiyuki Karuno, Hiroshi Nagamochi Aleksandar Shurbevski, Yoshiyuki Karuno, Hiroshi Nagamochi A Dynamic Programming Based Improvement Heuristic for a Repetitive Routing Problem of Grasp-and-Delivery Robots A Dynamic Programming Based Improvement Heuristic for a Repetitive Routing Problem of Grasp-and-Delivery Robots A Dynamic Programming Based Improvement Heuristic for a Repetitive Routing Problem of Grasp-and-Delivery Robots JOURNAL OF ADVANCED MECHANICAL DESIGN SYSTEMS AND MANUFACTURING, 6, 5, 611-621 JOURNAL OF ADVANCED MECHANICAL DESIGN SYSTEMS AND MANUFACTURING, 6, 5, 611-621 JOURNAL OF ADVANCED MECHANICAL DESIGN SYSTEMS AND MANUFACTURING, 6, 5, 611-621 2012 Refereed English Research paper(scientific journal) Disclose to all
Mingyu Xiao, Hiroshi Nagamochi Mingyu Xiao, Hiroshi Nagamochi Mingyu Xiao, Hiroshi 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 INFORMATION PROCESSING LETTERS, 112, 1-2, 5-9 INFORMATION PROCESSING LETTERS, 112, 1-2, 5-9 2012/01 Refereed English Research paper(scientific journal) 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 INTERNATIONAL JOURNAL OF COMPUTATIONAL GEOMETRY & APPLICATIONS, 21, 6, 661-684 INTERNATIONAL JOURNAL OF COMPUTATIONAL GEOMETRY & APPLICATIONS, 21, 6, 661-684 INTERNATIONAL JOURNAL OF COMPUTATIONAL GEOMETRY & APPLICATIONS, 21, 6, 661-684 2011/12 Refereed English Research paper(scientific journal) 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/12 Refereed English Research paper(scientific journal) Disclose to all
Masaaki Shimizu, Hiroshi Nagamochi, Tatsuya Akutsu Masaaki Shimizu, Hiroshi Nagamochi, Tatsuya Akutsu Masaaki Shimizu, Hiroshi Nagamochi, Tatsuya 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/12 Refereed English Research paper(scientific journal) Disclose to all
Seok-Hee Hong, Hiroshi Nagamochi Seok-Hee Hong, Hiroshi Nagamochi Seok-Hee Hong, Hiroshi Nagamochi Editorial: ISAAC 2008 Special Issue Editorial: ISAAC 2008 Special Issue Editorial: ISAAC 2008 Special Issue ALGORITHMICA, 61, 4, 777-778 ALGORITHMICA, 61, 4, 777-778 ALGORITHMICA, 61, 4, 777-778 2011/12 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 INTERNATIONAL JOURNAL OF COMPUTATIONAL GEOMETRY & APPLICATIONS, 21, 6, 661-684 INTERNATIONAL JOURNAL OF COMPUTATIONAL GEOMETRY & APPLICATIONS, 21, 6, 661-684 INTERNATIONAL JOURNAL OF COMPUTATIONAL GEOMETRY & APPLICATIONS, 21, 6, 661-684 2011/12 Refereed English Research paper(scientific journal) 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/12 Refereed English Research paper(scientific journal) 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/11 Refereed English Research paper(scientific journal) 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/11 Refereed English Research paper(scientific journal) 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 ON INFORMATION AND SYSTEMS, E94D, 10, 1846-1853 IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, E94D, 10, 1846-1853 IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, E94D, 10, 1846-1853 2011/10 Refereed English Research paper(scientific journal) Disclose to all
Kazuki Matsumoto, Shunji Umetani, Hiroshi Nagamochi Kazuki Matsumoto, Shunji Umetani, Hiroshi Nagamochi Kazuki Matsumoto, Shunji Umetani, 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 JOURNAL OF SCHEDULING, 14, 3, 281-290 JOURNAL OF SCHEDULING, 14, 3, 281-290 JOURNAL OF SCHEDULING, 14, 3, 281-290 2011/06 Refereed English Research paper(scientific journal) Disclose to all
Seok-Hee Hong, Hiroshi Nagamochi Seok-Hee Hong, Hiroshi Nagamochi Seok-Hee Hong, Hiroshi Nagamochi Selected Papers from the 19th Annual International Symposium on Algorithms and Computation FOREWORD Selected Papers from the 19th Annual International Symposium on Algorithms and Computation FOREWORD Selected Papers from the 19th Annual International Symposium on Algorithms and Computation FOREWORD INTERNATIONAL JOURNAL OF COMPUTATIONAL GEOMETRY & APPLICATIONS, 21, 3, 251-252 INTERNATIONAL JOURNAL OF COMPUTATIONAL GEOMETRY & APPLICATIONS, 21, 3, 251-252 INTERNATIONAL JOURNAL OF COMPUTATIONAL GEOMETRY & APPLICATIONS, 21, 3, 251-252 2011/06 Refereed English Disclose to all
Shinji Imahori, Yoshiyuki Karuno, Hiroshi Nagamochi, Xiaoming Wang Shinji Imahori, Yoshiyuki Karuno, Hiroshi Nagamochi, Xiaoming Wang Shinji Imahori, Yoshiyuki Karuno, Hiroshi Nagamochi, Xiaoming 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 International Journal of Biometrics, 3, 3, 228-245 International Journal of Biometrics, 3, 3, 228-245 2011/06 Refereed English Research paper(scientific journal) Disclose to all
Seok-Hee Hong, Hiroshi Nagamochi Seok-Hee Hong, Hiroshi Nagamochi Seok-Hee Hong, Hiroshi Nagamochi Guest editors' foreword Guest editors' foreword Guest editors' foreword International Journal of Computational Geometry and Applications, 21, 3, 251-252 International Journal of Computational Geometry and Applications, 21, 3, 251-252 International Journal of Computational Geometry and Applications, 21, 3, 251-252 2011/06 Refereed English Research paper(scientific journal) Disclose to all
Kazuki Matsumoto, Shunji Umetani, Hiroshi Nagamochi Kazuki Matsumoto, Shunji Umetani, Hiroshi Nagamochi Kazuki Matsumoto, Shunji Umetani, 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 JOURNAL OF SCHEDULING, 14, 3, 281-290 JOURNAL OF SCHEDULING, 14, 3, 281-290 JOURNAL OF SCHEDULING, 14, 3, 281-290 2011/06 Refereed English Research paper(scientific journal) Disclose to all
Toshihide Ibaraki, Takashi Imamichi, Yuichi Koga, Hiroshi Nagamochi, Koji Nonobe, Mutsunori Yagiura Toshihide Ibaraki, Takashi Imamichi, Yuichi Koga, Hiroshi Nagamochi, Koji Nonobe, Mutsunori Yagiura Toshihide Ibaraki, Takashi Imamichi, Yuichi Koga, Hiroshi Nagamochi, Koji Nonobe, Mutsunori 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 MATHEMATICAL PROGRAMMING, 127, 2, 297-343 MATHEMATICAL PROGRAMMING, 127, 2, 297-343 2011/04 Refereed English Research paper(scientific journal) 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 tree structured molecules using dynamic programming Efficient enumeration of stereoisomers of tree structured molecules using dynamic programming Efficient enumeration of stereoisomers of tree structured molecules using dynamic programming JOURNAL OF MATHEMATICAL CHEMISTRY, 49, 4, 910-970 JOURNAL OF MATHEMATICAL CHEMISTRY, 49, 4, 910-970 JOURNAL OF MATHEMATICAL CHEMISTRY, 49, 4, 910-970 2011/04 Refereed English Research paper(scientific journal) Disclose to all
Hiroshi Nagamochi Hiroshi Nagamochi Hiroshi Nagamochi Coprobber guarding game with cycle robber-region Coprobber guarding game with cycle robber-region Coprobber guarding game with cycle robber-region Theoretical Computer Science, 412, 4-5, 383-390 Theoretical Computer Science, 412, 4-5, 383-390 Theoretical Computer Science, 412, 4-5, 383-390 2011/02/04 Refereed English Research paper(scientific journal) 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 THEORETICAL COMPUTER SCIENCE, 412, 4-5, 383-390 THEORETICAL COMPUTER SCIENCE, 412, 4-5, 383-390 THEORETICAL COMPUTER SCIENCE, 412, 4-5, 383-390 2011/02 Refereed English Research paper(scientific journal) 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 ON INFORMATION AND SYSTEMS, E94D, 2, 211-219 IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, E94D, 2, 211-219 IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, E94D, 2, 211-219 2011/02 Refereed English Research paper(scientific journal) 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 ON INFORMATION AND SYSTEMS, E94D, 2, 200-210 IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, E94D, 2, 200-210 IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, E94D, 2, 200-210 2011/02 Refereed English Research paper(scientific journal) Disclose to all
Ehab Morsy, Hiroshi Nagamochi Ehab Morsy, Hiroshi Nagamochi Ehab Morsy, Hiroshi Nagamochi Approximating capacitated tree-routings in networks Approximating capacitated tree-routings in networks Approximating capacitated tree-routings in networks JOURNAL OF COMBINATORIAL OPTIMIZATION, 21, 2, 254-267 JOURNAL OF COMBINATORIAL OPTIMIZATION, 21, 2, 254-267 JOURNAL OF COMBINATORIAL OPTIMIZATION, 21, 2, 254-267 2011/02 Refereed English Research paper(scientific journal) Disclose to all
Ehab Morsy, Hiroshi Nagamochi Ehab Morsy, Hiroshi Nagamochi Ehab Morsy, Hiroshi Nagamochi Approximating capacitated tree-routings in networks Approximating capacitated tree-routings in networks Approximating capacitated tree-routings in networks JOURNAL OF COMBINATORIAL OPTIMIZATION, 21, 2, 254-267 JOURNAL OF COMBINATORIAL OPTIMIZATION, 21, 2, 254-267 JOURNAL OF COMBINATORIAL OPTIMIZATION, 21, 2, 254-267 2011/02 Refereed English Research paper(scientific journal) 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 ON INFORMATION AND SYSTEMS, E94D, 2, 211-219 IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, E94D, 2, 211-219 IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, E94D, 2, 211-219 2011/02 Refereed English Research paper(scientific journal) 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 ON INFORMATION AND SYSTEMS, E94D, 2, 200-210 IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, E94D, 2, 200-210 IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, E94D, 2, 200-210 2011/02 Refereed English Research paper(scientific journal) 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 on Information and Systems, E94-D, 10, 1846-1853 IEICE Transactions on Information and Systems, E94-D, 10, 1846-1853 IEICE Transactions on Information and Systems, E94-D, 10, 1846-1853 2011 Refereed English Research paper(scientific journal) 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, 7033, 154-+ COMPUTATIONAL GEOMETRY, GRAPHS AND APPLICATIONS, 7033, 154-+ COMPUTATIONAL GEOMETRY, GRAPHS AND APPLICATIONS, 7033, 154-+ 2011 Refereed English Research paper(international conference proceedings) Disclose to all
Seigo Karakawa, Ehab Morsy, Hiroshi Nagamochi Seigo Karakawa, Ehab Morsy, Hiroshi Nagamochi Seigo Karakawa, Ehab Morsy, Hiroshi 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 Journal of Graph Algorithms and Applications, 15, 3, 345-371 Journal of Graph Algorithms and Applications, 15, 3, 345-371 2011 Refereed English Research paper(scientific journal) Disclose to all
Yoshiyuki Karuno, Hiroshi Nagamochi, Aleksandar Shurbevski Yoshiyuki Karuno, Hiroshi Nagamochi, Aleksandar Shurbevski Yoshiyuki Karuno, Hiroshi Nagamochi, Aleksandar 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 Journal of Advanced Computational Intelligence and Intelligent Informatics, 15, 8, 1103-1108 Journal of Advanced Computational Intelligence and Intelligent Informatics, 15, 8, 1103-1108 2011 Refereed English Research paper(scientific journal) 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, 7033, 154-+ COMPUTATIONAL GEOMETRY, GRAPHS AND APPLICATIONS, 7033, 154-+ COMPUTATIONAL GEOMETRY, GRAPHS AND APPLICATIONS, 7033, 154-+ 2011 Refereed English Research paper(international conference proceedings) Disclose to all
Takuro Fukunaga, Hiroshi Nagamochi Takuro Fukunaga, Hiroshi Nagamochi Takuro Fukunaga, 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/11 Refereed English Research paper(scientific journal) Disclose to all
Takuro Fukunaga, Hiroshi Nagamochi Takuro Fukunaga, Hiroshi Nagamochi Takuro Fukunaga, 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/11 Refereed English Research paper(scientific journal) Disclose to all
Shunsuke Ota, Ehab Morsy, Hiroshi Nagamochi Shunsuke Ota, Ehab Morsy, Hiroshi Nagamochi Shunsuke Ota, Ehab Morsy, Hiroshi Nagamochi A plane graph representation of triconnected graphs A plane graph representation of triconnected graphs A plane graph representation of triconnected graphs THEORETICAL COMPUTER SCIENCE, 411, 44-46, 3979-3993 THEORETICAL COMPUTER SCIENCE, 411, 44-46, 3979-3993 THEORETICAL COMPUTER SCIENCE, 411, 44-46, 3979-3993 2010/10 Refereed English Research paper(scientific journal) 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/10 Refereed English Research paper(scientific journal) 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/10 Refereed English Research paper(scientific journal) Disclose to all
Shunsuke Ota, Ehab Morsy, Hiroshi Nagamochi Shunsuke Ota, Ehab Morsy, Hiroshi Nagamochi Shunsuke Ota, Ehab Morsy, Hiroshi Nagamochi A plane graph representation of triconnected graphs A plane graph representation of triconnected graphs A plane graph representation of triconnected graphs THEORETICAL COMPUTER SCIENCE, 411, 44-46, 3979-3993 THEORETICAL COMPUTER SCIENCE, 411, 44-46, 3979-3993 THEORETICAL COMPUTER SCIENCE, 411, 44-46, 3979-3993 2010/10 Refereed English Research paper(scientific journal) 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/10 Refereed English Research paper(scientific journal) 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/10 Refereed English Research paper(scientific journal) Disclose to all
Seok-Hee Hong, Hiroshi Nagamochi Seok-Hee Hong, Hiroshi Nagamochi Seok-Hee Hong, Hiroshi 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 Journal of Discrete Algorithms, 8, 3, 282-295 Journal of Discrete Algorithms, 8, 3, 282-295 2010/09 Refereed English Research paper(scientific journal) Disclose to all
Ehab Morsy, Hiroshi Nagamochi Ehab Morsy, Hiroshi Nagamochi Ehab Morsy, Hiroshi 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 Journal of Discrete Algorithms, 8, 3, 311-320 Journal of Discrete Algorithms, 8, 3, 311-320 2010/09 Refereed English Research paper(scientific journal) 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/05 Refereed English Research paper(scientific journal) 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/05 Refereed English Research paper(scientific journal) 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 ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, E93A, 4, 778-786 IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, E93A, 4, 778-786 IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, E93A, 4, 778-786 2010/04 Refereed English Research paper(scientific journal) 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/04 Refereed English Research paper(scientific journal) 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 ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, E93A, 4, 778-786 IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, E93A, 4, 778-786 IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, E93A, 4, 778-786 2010/04 Refereed English Research paper(scientific journal) 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/04 Refereed English Research paper(scientific journal) 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 COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 43, 2, 191-206 COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 43, 2, 191-206 COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 43, 2, 191-206 2010/02 Refereed English Research paper(scientific journal) 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 COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 43, 2, 191-206 COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 43, 2, 191-206 COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 43, 2, 191-206 2010/02 Refereed English Research paper(scientific journal) Disclose to all
Hiroshi Nagamochi Hiroshi Nagamochi Hiroshi Nagamochi Minimum degree orderings Minimum degree orderings Minimum degree orderings Algorithmica (New York), 56, 1, 17-34 Algorithmica (New York), 56, 1, 17-34 Algorithmica (New York), 56, 1, 17-34 2010/01 Refereed English Research paper(international conference proceedings) Disclose to all
Bingbing Zhuang, Hiroshi Nagamochi Bingbing Zhuang, Hiroshi Nagamochi Bingbing Zhuang, Hiroshi Nagamochi Generating Trees on Multisets Generating Trees on Multisets Generating Trees on Multisets ALGORITHMS AND COMPUTATION, PT I, 6506, 182-193 ALGORITHMS AND COMPUTATION, PT I, 6506, 182-193 ALGORITHMS AND COMPUTATION, PT I, 6506, 182-193 2010 Refereed English Research paper(international conference proceedings) Disclose to all
Bingbing Zhuang, Hiroshi Nagamochi Bingbing Zhuang, Hiroshi Nagamochi Bingbing Zhuang, Hiroshi Nagamochi Listing Triconnected Rooted Plane Graphs Listing Triconnected Rooted Plane Graphs Listing Triconnected Rooted Plane Graphs COMBINATORIAL OPTIMIZATION AND APPLICATIONS, PT II, 6509, 347-361 COMBINATORIAL OPTIMIZATION AND APPLICATIONS, PT II, 6509, 347-361 COMBINATORIAL OPTIMIZATION AND APPLICATIONS, PT II, 6509, 347-361 2010 Refereed English Research paper(international conference proceedings) Disclose to all
Mingyu Xiao, Takuro Fukunaga, Hiroshi Nagamochi Mingyu Xiao, Takuro Fukunaga, Hiroshi Nagamochi Mingyu Xiao, Takuro Fukunaga, Hiroshi Nagamochi FPTAS's for Some Cut Problems in Weighted Trees FPTAS's for Some Cut Problems in Weighted Trees FPTAS's for Some Cut Problems in Weighted Trees FRONTIERS IN ALGORITHMICS, 6213, 210-+ FRONTIERS IN ALGORITHMICS, 6213, 210-+ FRONTIERS IN ALGORITHMICS, 6213, 210-+ 2010 Refereed English Research paper(international conference proceedings) Disclose to all
Bingbing Zhuang, Hiroshi Nagamochi Bingbing Zhuang, Hiroshi Nagamochi Bingbing Zhuang, Hiroshi 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 FRONTIERS IN ALGORITHMICS, 6213, 113-123 FRONTIERS IN ALGORITHMICS, 6213, 113-123 FRONTIERS IN ALGORITHMICS, 6213, 113-123 2010 Refereed English Research paper(international conference proceedings) Disclose to all
Kazuya Haraguchi, Seok-Hee Hong, Hiroshi Nagamochi Kazuya Haraguchi, Seok-Hee Hong, Hiroshi Nagamochi Kazuya Haraguchi, Seok-Hee Hong, Hiroshi Nagamochi Multiclass Visual Classifier Based on Bipartite Graph Representation of Decision Tables Multiclass Visual Classifier Based on Bipartite Graph Representation of Decision Tables Multiclass Visual Classifier Based on Bipartite Graph Representation of Decision Tables LEARNING AND INTELLIGENT OPTIMIZATION, 6073, 169-+ LEARNING AND INTELLIGENT OPTIMIZATION, 6073, 169-+ LEARNING AND INTELLIGENT OPTIMIZATION, 6073, 169-+ 2010 Refereed English Research paper(international conference proceedings) Disclose to all
Bingbing Zhuang, Hiroshi Nagamochi Bingbing Zhuang, Hiroshi Nagamochi Bingbing Zhuang, Hiroshi Nagamochi Generating Internally Triconnected Rooted Plane Graphs Generating Internally Triconnected Rooted Plane Graphs Generating Internally Triconnected Rooted Plane Graphs THEORY AND APPLICATIONS OF MODELS OF COMPUTATION, PROCEEDINGS, 6108, 467-478 THEORY AND APPLICATIONS OF MODELS OF COMPUTATION, PROCEEDINGS, 6108, 467-478 THEORY AND APPLICATIONS OF MODELS OF COMPUTATION, PROCEEDINGS, 6108, 467-478 2010 Refereed English Research paper(international conference proceedings) Disclose to all
Bingbing Zhuang, Hiroshi Nagamochi Bingbing Zhuang, Hiroshi Nagamochi Bingbing Zhuang, Hiroshi Nagamochi Enumerating Rooted Graphs with Reflectional Block Structures Enumerating Rooted Graphs with Reflectional Block Structures Enumerating Rooted Graphs with Reflectional Block Structures ALGORITHMS AND COMPLEXITY, PROCEEDINGS, 6078, 49-60 ALGORITHMS AND COMPLEXITY, PROCEEDINGS, 6078, 49-60 ALGORITHMS AND COMPLEXITY, PROCEEDINGS, 6078, 49-60 2010 Refereed English Research paper(international conference proceedings) Disclose to all
Yoshiyuki Karuno, Hiroshi Nagamochi, Xiaoming Wang Yoshiyuki Karuno, Hiroshi Nagamochi, Xiaoming Wang Yoshiyuki Karuno, Hiroshi Nagamochi, Xiaoming Wang Optimization Problems and Algorithms in Double-layered Food Packing Systems Optimization Problems and Algorithms in Double-layered Food Packing Systems Optimization Problems and Algorithms in Double-layered Food Packing Systems JOURNAL OF ADVANCED MECHANICAL DESIGN SYSTEMS AND MANUFACTURING, 4, 3, 605-615 JOURNAL OF ADVANCED MECHANICAL DESIGN SYSTEMS AND MANUFACTURING, 4, 3, 605-615 JOURNAL OF ADVANCED MECHANICAL DESIGN SYSTEMS AND MANUFACTURING, 4, 3, 605-615 2010 Refereed English Research paper(scientific journal) Disclose to all
Bingbing Zhuang, Hiroshi Nagamochi Bingbing Zhuang, Hiroshi Nagamochi Bingbing Zhuang, Hiroshi Nagamochi Constant Time Generation of Trees with Degree Bounds Constant Time Generation of Trees with Degree Bounds Constant Time Generation of Trees with Degree Bounds OPERATIONS RESEARCH AND ITS APPLICATIONS, 12, 183-194 OPERATIONS RESEARCH AND ITS APPLICATIONS, 12, 183-194 OPERATIONS RESEARCH AND ITS APPLICATIONS, 12, 183-194 2010 Refereed English Research paper(international conference proceedings) 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/01 Refereed English Research paper(scientific journal) 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/11 Refereed English Research paper(scientific journal) 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/11 Refereed English Research paper(scientific journal) 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/10 Refereed English Research paper(scientific journal) Disclose to all
Takuro Fukunaga, Hiroshi Nagamochi Takuro Fukunaga, Hiroshi Nagamochi Takuro Fukunaga, 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 OF COMPUTING SYSTEMS, 45, 3, 512-532 THEORY OF COMPUTING SYSTEMS, 45, 3, 512-532 THEORY OF COMPUTING SYSTEMS, 45, 3, 512-532 2009/10 Refereed English Research paper(scientific journal) 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/10 Refereed English Research paper(scientific journal) Disclose to all
Takuro Fukunaga, Hiroshi Nagamochi Takuro Fukunaga, Hiroshi Nagamochi Takuro Fukunaga, 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 of Computing Systems, 45, 3, 512-532 Theory of Computing Systems, 45, 3, 512-532 Theory of Computing Systems, 45, 3, 512-532 2009/07 Refereed English Research paper(scientific journal) 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 THEORETICAL COMPUTER SCIENCE, 410, 11, 1061-1072 THEORETICAL COMPUTER SCIENCE, 410, 11, 1061-1072 THEORETICAL COMPUTER SCIENCE, 410, 11, 1061-1072 2009/03 Refereed English Research paper(scientific journal) 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 THEORETICAL COMPUTER SCIENCE, 410, 11, 1061-1072 THEORETICAL COMPUTER SCIENCE, 410, 11, 1061-1072 THEORETICAL COMPUTER SCIENCE, 410, 11, 1061-1072 2009/03 Refereed English Research paper(scientific journal) Disclose to all
Takuro Fukunaga, Hiroshi Nagamochi Takuro Fukunaga, Hiroshi Nagamochi Takuro Fukunaga, 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/02/28 Refereed English Research paper(scientific journal) 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 (New York), 53, 2, 207-224 Algorithmica (New York), 53, 2, 207-224 Algorithmica (New York), 53, 2, 207-224 2009/02 Refereed English Research paper(scientific journal) Disclose to all
Takuro Fukunaga, Hiroshi Nagamochi Takuro Fukunaga, Hiroshi Nagamochi Takuro Fukunaga, 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/02 Refereed English Research paper(scientific journal) 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/02 Refereed English Research paper(scientific journal) Disclose to all
UCHIDA Jun, KARUNO Yoshiyuki, NAGAMOCHI Hiroshi UCHIDA Jun, KARUNO Yoshiyuki, NAGAMOCHI Hiroshi UCHIDA Jun, KARUNO Yoshiyuki, NAGAMOCHI Hiroshi Scheduling Capacitated One-Way Vehicles on Paths with Deadlines Scheduling Capacitated One-Way Vehicles on Paths with Deadlines Scheduling Capacitated One-Way Vehicles on Paths with Deadlines SICE J Control Meas Syst Integr, 2, 1, 20-26 SICE J Control Meas Syst Integr, 2, 1, 20-26 SICE J Control Meas Syst Integr, 2, 1, 20-26 2009/01/31 Refereed English Disclose to all
Seok-Hee Hong, Hiroshi Nagamochi Seok-Hee Hong, Hiroshi Nagamochi Seok-Hee Hong, Hiroshi 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 Journal of Graph Algorithms and Applications, 13, 2, 179-196 Journal of Graph Algorithms and Applications, 13, 2, 179-196 2009 Refereed English Research paper(scientific journal) Disclose to all
Yoshitaka Nakao, Hiroshi Nagamochi Yoshitaka Nakao, Hiroshi Nagamochi Yoshitaka Nakao, Hiroshi Nagamochi Worst Case Analysis for Pickup and Delivery Problems with Consecutive Pickups and Deliveries Worst Case Analysis for Pickup and Delivery Problems with Consecutive Pickups and Deliveries Worst Case Analysis for Pickup and Delivery Problems with Consecutive Pickups and Deliveries ALGORITHMS AND COMPUTATION, PROCEEDINGS, 5878, 554-563 ALGORITHMS AND COMPUTATION, PROCEEDINGS, 5878, 554-563 ALGORITHMS AND COMPUTATION, PROCEEDINGS, 5878, 554-563 2009 Refereed English Research paper(international conference proceedings) Disclose to all
Kazumasa Okumoto, Takuro Fukunaga, Hiroshi Nagamochi 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 ALGORITHMS AND COMPUTATION, PROCEEDINGS, 5878, 55-+ ALGORITHMS AND COMPUTATION, PROCEEDINGS, 5878, 55-+ ALGORITHMS AND COMPUTATION, PROCEEDINGS, 5878, 55-+ 2009 Refereed English Research paper(international conference proceedings) Disclose to all
Seok-Hee Hong, Hiroshi Nagamochi Seok-Hee Hong, Hiroshi Nagamochi Seok-Hee Hong, Hiroshi Nagamochi Upward Star-Shaped Polyhedral Graphs Upward Star-Shaped Polyhedral Graphs Upward Star-Shaped Polyhedral Graphs ALGORITHMS AND COMPUTATION, PROCEEDINGS, 5878, 913-+ ALGORITHMS AND COMPUTATION, PROCEEDINGS, 5878, 913-+ ALGORITHMS AND COMPUTATION, PROCEEDINGS, 5878, 913-+ 2009 Refereed English Research paper(international conference proceedings) 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 Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 5598, 74-84 Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 5598, 74-84 Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 5598, 74-84 2009 Refereed English Research paper(international conference proceedings) Disclose to all
Takashi Imamichi, Yohei Arahori, Jaeseong Gim, Seok-Hee Hong, Hiroshi Nagamochi Takashi Imamichi, Yohei Arahori, Jaeseong Gim, Seok-Hee Hong, Hiroshi Nagamochi Takashi Imamichi, Yohei Arahori, Jaeseong Gim, Seok-Hee Hong, Hiroshi Nagamochi Removing Node Overlaps Using Multi-sphere Scheme Removing Node Overlaps Using Multi-sphere Scheme Removing Node Overlaps Using Multi-sphere Scheme GRAPH DRAWING, 5417, 296-+ GRAPH DRAWING, 5417, 296-+ GRAPH DRAWING, 5417, 296-+ 2009 Refereed English Research paper(international conference proceedings) Disclose to all
Seigo Karakawa, Ehab Morsy, Hiroshi Nagamochi Seigo Karakawa, Ehab Morsy, Hiroshi Nagamochi Seigo Karakawa, Ehab Morsy, Hiroshi Nagamochi Minmax Tree Cover in the Euclidean Space Minmax Tree Cover in the Euclidean Space Minmax Tree Cover in the Euclidean Space WALCOM: ALGORITHMS AND COMPUTATION, PROCEEDINGS, 5431, 202-213 WALCOM: ALGORITHMS AND COMPUTATION, PROCEEDINGS, 5431, 202-213 WALCOM: ALGORITHMS AND COMPUTATION, PROCEEDINGS, 5431, 202-213 2009 Refereed English Research paper(international conference proceedings) Disclose to all
Takuro Fukunaga, Hiroshi Nagamochi Takuro Fukunaga, Hiroshi Nagamochi Takuro Fukunaga, Hiroshi Nagamochi Network design with weighted degree constraints Network design with weighted degree constraints Network design with weighted degree constraints Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 5431, 214-225 Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 5431, 214-225 Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 5431, 214-225 2009 Refereed English Research paper(international conference proceedings) Disclose to all
Mariko Sakashita, Kazuhisa Makino, Hiroshi Nagamochi, Satoru Fujishige Mariko Sakashita, Kazuhisa Makino, Hiroshi Nagamochi, Satoru Fujishige Mariko Sakashita, Kazuhisa Makino, Hiroshi Nagamochi, Satoru 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 JOURNAL ON DISCRETE MATHEMATICS, 23, 2, 858-871 SIAM JOURNAL ON DISCRETE MATHEMATICS, 23, 2, 858-871 2009 Refereed English Research paper(scientific journal) 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 ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, E91A, 9, 2328-2334 IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, E91A, 9, 2328-2334 IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, E91A, 9, 2328-2334 2008/09 Refereed English Research paper(scientific journal) 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 ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, E91A, 9, 2308-2313 IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, E91A, 9, 2308-2313 IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, E91A, 9, 2308-2313 2008/09 Refereed English Research paper(scientific journal) 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 ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, E91A, 9, 2328-2334 IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, E91A, 9, 2328-2334 IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, E91A, 9, 2328-2334 2008/09 Refereed English Research paper(scientific journal) 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 ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, E91A, 9, 2308-2313 IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, E91A, 9, 2308-2313 IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, E91A, 9, 2308-2313 2008/09 Refereed English Research paper(scientific journal) 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/07 Refereed English Research paper(scientific journal) 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/07 Refereed English Research paper(scientific journal) 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/06 Refereed English Research paper(scientific journal) 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/06 Refereed English Research paper(scientific journal) Disclose to all
HAYASHIDA Morihiro, AKUTSU Tatsuya, NAGAMOCHI Hiroshi HAYASHIDA Morihiro, AKUTSU Tatsuya, NAGAMOCHI Hiroshi HAYASHIDA Morihiro, AKUTSU Tatsuya, NAGAMOCHI Hiroshi A Clustering Method for Analysis of Sequence Similarity Networks of Proteins Using Maximal Components of Graphs A Clustering Method for Analysis of Sequence Similarity Networks of Proteins Using Maximal Components of Graphs A Clustering Method for Analysis of Sequence Similarity Networks of Proteins Using Maximal Components of Graphs 情報処理学会論文誌, 49, SIG5(TBIO4), 15-24 情報処理学会論文誌, 49, SIG5(TBIO4), 15-24 情報処理学会論文誌, 49, SIG5(TBIO4), 15-24 2008/03/15 Refereed English 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 THEORETICAL COMPUTER SCIENCE, 393, 1-3, 133-146 THEORETICAL COMPUTER SCIENCE, 393, 1-3, 133-146 THEORETICAL COMPUTER SCIENCE, 393, 1-3, 133-146 2008/03 Refereed English Research paper(scientific journal) 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 THEORETICAL COMPUTER SCIENCE, 393, 1-3, 133-146 THEORETICAL COMPUTER SCIENCE, 393, 1-3, 133-146 THEORETICAL COMPUTER SCIENCE, 393, 1-3, 133-146 2008/03 Refereed English Research paper(scientific journal) Disclose to all
Ehab Morsy, Hiroshi Nagamochi Ehab Morsy, Hiroshi Nagamochi Ehab Morsy, 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 THEORETICAL COMPUTER SCIENCE, 390, 1, 81-91 THEORETICAL COMPUTER SCIENCE, 390, 1, 81-91 THEORETICAL COMPUTER SCIENCE, 390, 1, 81-91 2008/01 Refereed English Research paper(scientific journal) Disclose to all
Seok-Hee Hong, Hiroshi Nagamochi Seok-Hee Hong, Hiroshi Nagamochi Seok-Hee Hong, Hiroshi Nagamochi Star-shaped drawings of graphs with fixed embedding and concave corner constraints Star-shaped drawings of graphs with fixed embedding and concave corner constraints Star-shaped drawings of graphs with fixed embedding and concave corner constraints COMPUTING AND COMBINATORICS, PROCEEDINGS, 5092, 405-+ COMPUTING AND COMBINATORICS, PROCEEDINGS, 5092, 405-+ COMPUTING AND COMBINATORICS, PROCEEDINGS, 5092, 405-+ 2008 Refereed English Research paper(international conference proceedings) Disclose to all
Ehab Morsy, Hiroshi Nagamochi Ehab Morsy, Hiroshi Nagamochi Ehab Morsy, Hiroshi Nagamochi Approximating the generalized capacitated tree-routing problem Approximating the generalized capacitated tree-routing problem Approximating the generalized capacitated tree-routing problem COMPUTING AND COMBINATORICS, PROCEEDINGS, 5092, 621-630 COMPUTING AND COMBINATORICS, PROCEEDINGS, 5092, 621-630 COMPUTING AND COMBINATORICS, PROCEEDINGS, 5092, 621-630 2008 Refereed English Research paper(international conference proceedings) Disclose to all
Seok-Hee Hong, Hiroshi Nagamochi Seok-Hee Hong, Hiroshi Nagamochi Seok-Hee Hong, Hiroshi Nagamochi Approximating crossing minimization in radial layouts Approximating crossing minimization in radial layouts Approximating crossing minimization in radial layouts LATIN 2008: THEORETICAL INFORMATICS, 4957, 461-+ LATIN 2008: THEORETICAL INFORMATICS, 4957, 461-+ LATIN 2008: THEORETICAL INFORMATICS, 4957, 461-+ 2008 Refereed English Research paper(international conference proceedings) Disclose to all
Ehab Morsy, Hiroshi Nagamochi Ehab Morsy, Hiroshi Nagamochi Ehab Morsy, 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 THEORETICAL COMPUTER SCIENCE, 390, 1, 81-91 THEORETICAL COMPUTER SCIENCE, 390, 1, 81-91 THEORETICAL COMPUTER SCIENCE, 390, 1, 81-91 2008/01 Refereed English Research paper(scientific journal) Disclose to all
Yoshiyuki Karuno, Hiroshi Nagamochi, Xiaoming Wang Yoshiyuki Karuno, Hiroshi Nagamochi, Xiaoming Wang Yoshiyuki Karuno, Hiroshi Nagamochi, Xiaoming Wang Bi-criteria food packing by dynamic programming Bi-criteria food packing by dynamic programming Bi-criteria food packing by dynamic programming JOURNAL OF THE OPERATIONS RESEARCH SOCIETY OF JAPAN, 50, 4, 376-389 JOURNAL OF THE OPERATIONS RESEARCH SOCIETY OF JAPAN, 50, 4, 376-389 JOURNAL OF THE OPERATIONS RESEARCH SOCIETY OF JAPAN, 50, 4, 376-389 2007/12 Refereed English Research paper(scientific journal) Disclose to all
Takuro Fukunaga, Hiroshi Nagamochi Takuro Fukunaga, Hiroshi Nagamochi Takuro Fukunaga, Hiroshi Nagamochi Approximating minimum cost multigraphs of specified edge-connectivity under degree bounds Approximating minimum cost multigraphs of specified edge-connectivity under degree bounds Approximating minimum cost multigraphs of specified edge-connectivity under degree bounds JOURNAL OF THE OPERATIONS RESEARCH SOCIETY OF JAPAN, 50, 4, 339-349 JOURNAL OF THE OPERATIONS RESEARCH SOCIETY OF JAPAN, 50, 4, 339-349 JOURNAL OF THE OPERATIONS RESEARCH SOCIETY OF JAPAN, 50, 4, 339-349 2007/12 Refereed English Research paper(scientific journal) 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 INFORMATION PROCESSING LETTERS, 104, 5, 173-178 INFORMATION PROCESSING LETTERS, 104, 5, 173-178 INFORMATION PROCESSING LETTERS, 104, 5, 173-178 2007/11 Refereed English Research paper(scientific journal) 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/11 Refereed English Research paper(scientific journal) 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 INFORMATION PROCESSING LETTERS, 104, 5, 173-178 INFORMATION PROCESSING LETTERS, 104, 5, 173-178 INFORMATION PROCESSING LETTERS, 104, 5, 173-178 2007/11 Refereed English Research paper(scientific journal) 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/11 Refereed English Research paper(scientific journal) Disclose to all
Andre Berger, Takuro Fukunaga, Hiroshi Nagamochi, Ojas Parekh Andre Berger, Takuro Fukunaga, Hiroshi Nagamochi, Ojas Parekh Andre Berger, Takuro Fukunaga, 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 THEORETICAL COMPUTER SCIENCE, 385, 1-3, 202-213 THEORETICAL COMPUTER SCIENCE, 385, 1-3, 202-213 THEORETICAL COMPUTER SCIENCE, 385, 1-3, 202-213 2007/10 Refereed English Research paper(scientific journal) Disclose to all
Andre Berger, Takuro Fukunaga, Hiroshi Nagamochi, Ojas Parekh Andre Berger, Takuro Fukunaga, Hiroshi Nagamochi, Ojas Parekh Andre Berger, Takuro Fukunaga, 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 THEORETICAL COMPUTER SCIENCE, 385, 1-3, 202-213 THEORETICAL COMPUTER SCIENCE, 385, 1-3, 202-213 THEORETICAL COMPUTER SCIENCE, 385, 1-3, 202-213 2007/10 Refereed English Research paper(scientific journal) Disclose to all
Kouji Hiratata, Takahiro Matsuda, Hiroshi Nagamochi, Tetsuya Takine Kouji Hiratata, Takahiro Matsuda, Hiroshi Nagamochi, Tetsuya Takine Kouji Hiratata, Takahiro Matsuda, 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 ON COMMUNICATIONS, E90B, 9, 2524-2531 IEICE TRANSACTIONS ON COMMUNICATIONS, E90B, 9, 2524-2531 IEICE TRANSACTIONS ON COMMUNICATIONS, E90B, 9, 2524-2531 2007/09 Refereed English Research paper(scientific journal) Disclose to all
Kouji Hiratata, Takahiro Matsuda, Hiroshi Nagamochi, Tetsuya Takine Kouji Hiratata, Takahiro Matsuda, Hiroshi Nagamochi, Tetsuya Takine Kouji Hiratata, Takahiro Matsuda, 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 ON COMMUNICATIONS, E90B, 9, 2524-2531 IEICE TRANSACTIONS ON COMMUNICATIONS, E90B, 9, 2524-2531 IEICE TRANSACTIONS ON COMMUNICATIONS, E90B, 9, 2524-2531 2007/09 Refereed English Research paper(scientific journal) Disclose to all
Takuro Fukunaga, Hiroshi Nagamochi Takuro Fukunaga, Hiroshi Nagamochi Takuro Fukunaga, 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/06/01 Refereed English Research paper(scientific journal) 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/06 Refereed English Research paper(scientific journal) Disclose to all
Takuro Fukunaga, Hiroshi Nagamochi Takuro Fukunaga, Hiroshi Nagamochi Takuro Fukunaga, 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/06 Refereed English Research paper(scientific journal) 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/06 Refereed English Research paper(scientific journal) 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/05 Refereed English Research paper(scientific journal) Disclose to all
Ehab Mosry, Hiroshi Nagamochi Ehab Mosry, Hiroshi Nagamochi Ehab Mosry, 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 ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, E90A, 5, 900-906 IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, E90A, 5, 900-906 IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, E90A, 5, 900-906 2007/05 Refereed English Research paper(scientific journal) Disclose to all
Ehab Mosry, Hiroshi Nagamochi Ehab Mosry, Hiroshi Nagamochi Ehab Mosry, 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 ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, E90A, 5, 900-906 IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, E90A, 5, 900-906 IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, E90A, 5, 900-906 2007/05 Refereed English Research paper(scientific journal) 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/05 Refereed English Research paper(scientific journal) 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 INFORMATION PROCESSING LETTERS, 102, 2-3, 79-84 INFORMATION PROCESSING LETTERS, 102, 2-3, 79-84 INFORMATION PROCESSING LETTERS, 102, 2-3, 79-84 2007/04 Refereed English Research paper(scientific journal) 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 INFORMATION PROCESSING LETTERS, 102, 2-3, 79-84 INFORMATION PROCESSING LETTERS, 102, 2-3, 79-84 INFORMATION PROCESSING LETTERS, 102, 2-3, 79-84 2007/04 Refereed English Research paper(scientific journal) 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 THEORETICAL COMPUTER SCIENCE, 372, 1, 81-93 THEORETICAL COMPUTER SCIENCE, 372, 1, 81-93 THEORETICAL COMPUTER SCIENCE, 372, 1, 81-93 2007/03 Refereed English Research paper(scientific journal) 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 THEORETICAL COMPUTER SCIENCE, 372, 1, 81-93 THEORETICAL COMPUTER SCIENCE, 372, 1, 81-93 THEORETICAL COMPUTER SCIENCE, 372, 1, 81-93 2007/03 Refereed English Research paper(scientific journal) 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/02 Refereed English Research paper(scientific journal) 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 ON INFORMATION AND SYSTEMS, E90D, 2, 428-431 IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, E90D, 2, 428-431 IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, E90D, 2, 428-431 2007/02 Refereed English Research paper(scientific journal) Disclose to all
Takuro Fukunaga, Hiroshi Nagamochi Takuro Fukunaga, Hiroshi Nagamochi Takuro Fukunaga, Hiroshi Nagamochi Approximating a generalization of metric TSP Approximating a generalization of metric TSP Approximating a generalization of metric TSP IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, E90D, 2, 432-439 IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, E90D, 2, 432-439 IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, E90D, 2, 432-439 2007/02 Refereed English Research paper(scientific journal) 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/02 Refereed English Research paper(scientific journal) Disclose to all
Takuro Fukunaga, Hiroshi Nagamochi Takuro Fukunaga, Hiroshi Nagamochi Takuro Fukunaga, Hiroshi Nagamochi Approximating a generalization of metric TSP Approximating a generalization of metric TSP Approximating a generalization of metric TSP IEICE Transactions on Information and Systems, E90-D, 2, 432-439 IEICE Transactions on Information and Systems, E90-D, 2, 432-439 IEICE Transactions on Information and Systems, E90-D, 2, 432-439 2007 Refereed English Research paper(scientific journal) Disclose to all
Mutsunori Yagiura, Akira Komiya, Kenya Kojima, Koji Nonobe, Hiroshi Nagamochi, Toshihide Ibaraki, Fred Glover Mutsunori Yagiura, Akira Komiya, Kenya Kojima, Koji Nonobe, Hiroshi Nagamochi, Toshihide Ibaraki, Fred Glover Mutsunori Yagiura, Akira Komiya, Kenya Kojima, Koji Nonobe, Hiroshi Nagamochi, Toshihide Ibaraki, Fred 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 ENGINEERING STOCHASTIC LOCAL SEARCH ALGORITHMS: DESIGNING, IMPLEMENTING AND ANALYZING EFFECTIVE HEURISTICS, 4638, 121-+ ENGINEERING STOCHASTIC LOCAL SEARCH ALGORITHMS: DESIGNING, IMPLEMENTING AND ANALYZING EFFECTIVE HEURISTICS, 4638, 121-+ ENGINEERING STOCHASTIC LOCAL SEARCH ALGORITHMS: DESIGNING, IMPLEMENTING AND ANALYZING EFFECTIVE HEURISTICS, 4638, 121-+ 2007 Refereed English Research paper(international conference proceedings) Disclose to all
Hiroshi Nagamochi Hiroshi Nagamochi Hiroshi Nagamochi Algorithms for the minimum partitioning problems in graphs Algorithms for the minimum partitioning problems in graphs Algorithms for the minimum partitioning problems in graphs ELECTRONICS AND COMMUNICATIONS IN JAPAN PART III-FUNDAMENTAL ELECTRONIC SCIENCE, 90, 10, 63-78 ELECTRONICS AND COMMUNICATIONS IN JAPAN PART III-FUNDAMENTAL ELECTRONIC SCIENCE, 90, 10, 63-78 ELECTRONICS AND COMMUNICATIONS IN JAPAN PART III-FUNDAMENTAL ELECTRONIC SCIENCE, 90, 10, 63-78 2007 Refereed English Research paper(scientific journal) Disclose to all
Y. Karuno, H. Nagamochi, J. Uchida Y. Karuno, H. Nagamochi, J. Uchida Selective vehicle scheduling on paths with a due date involving criterion Selective vehicle scheduling on paths with a due date involving criterion Nihon Kikai Gakkai Ronbunshu, C Hen/Transactions of the Japan Society of Mechanical Engineers, Part C, 73, 3, 911-918 Nihon Kikai Gakkai Ronbunshu, C Hen/Transactions of the Japan Society of Mechanical Engineers, Part C, 73, 3, 911-918 , 73, 3, 911-918 2007 Refereed Japanese Disclose to all
Yoshitaka Nakao, Hiroshi Nagamochi Yoshitaka Nakao, Hiroshi Nagamochi Yoshitaka Nakao, Hiroshi Nagamochi A DP-based Heuristic Algorithm for the Discrete Split Delivery Vehicle Routing Problem A DP-based Heuristic Algorithm for the Discrete Split Delivery Vehicle Routing Problem A DP-based Heuristic Algorithm for the Discrete Split Delivery Vehicle Routing Problem JOURNAL OF ADVANCED MECHANICAL DESIGN SYSTEMS AND MANUFACTURING, 1, 2, 217-226 JOURNAL OF ADVANCED MECHANICAL DESIGN SYSTEMS AND MANUFACTURING, 1, 2, 217-226 JOURNAL OF ADVANCED MECHANICAL DESIGN SYSTEMS AND MANUFACTURING, 1, 2, 217-226 2007 Refereed English Research paper(scientific journal) 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
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
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, PROCEEDINGS, 4484, 573-+ THEORY AND APPLICATIONS OF MODELS OF COMPUTATION, PROCEEDINGS, 4484, 573-+ THEORY AND APPLICATIONS OF MODELS OF COMPUTATION, PROCEEDINGS, 4484, 573-+ 2007 Refereed English Research paper(international conference proceedings) 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, 4835, 292-303 ALGORITHMS AND COMPUTATION, 4835, 292-303 ALGORITHMS AND COMPUTATION, 4835, 292-303 2007 Refereed English Research paper(international conference proceedings) 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, PROCEEDINGS, 4513, 484-+ INTEGER PROGRAMMING AND COMBINATORIAL OPTIMIZATION, PROCEEDINGS, 4513, 484-+ INTEGER PROGRAMMING AND COMBINATORIAL OPTIMIZATION, PROCEEDINGS, 4513, 484-+ 2007 Refereed English Research paper(international conference proceedings) 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 on Information and Systems, E90-D, 2, 428-431 IEICE Transactions on Information and Systems, E90-D, 2, 428-431 IEICE Transactions on Information and Systems, E90-D, 2, 428-431 2007 Refereed English Research paper(scientific journal) 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/11/01 Refereed English Research paper(scientific journal) 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/11 Refereed English Research paper(scientific journal) 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/11 Refereed English Research paper(scientific journal) 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/11 Refereed English Research paper(scientific journal) Disclose to all
Hiroshi Nagamochi Hiroshi Nagamochi Hiroshi Nagamochi Packing soft rectangles Packing soft rectangles Packing soft rectangles International Journal of Foundations of Computer Science, 17, 5, 1165-1178 International Journal of Foundations of Computer Science, 17, 5, 1165-1178 International Journal of Foundations of Computer Science, 17, 5, 1165-1178 2006/10 Refereed English Research paper(scientific journal) Disclose to all
Hiroshi Nagamochi Hiroshi Nagamochi Hiroshi Nagamochi Packing soft rectangles Packing soft rectangles Packing soft rectangles INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 17, 5, 1165-1178 INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 17, 5, 1165-1178 INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 17, 5, 1165-1178 2006/10 Refereed English Research paper(scientific journal) Disclose to all
Takuro Fukunaga, Hiroshi Nagamochi Takuro Fukunaga, Hiroshi Nagamochi Takuro Fukunaga, Hiroshi Nagamochi Some Theorems on Detachments Preserving Local-Edge-Connectivity Some Theorems on Detachments Preserving Local-Edge-Connectivity Some Theorems on Detachments Preserving Local-Edge-Connectivity Electronic Notes in Discrete Mathematics, 24, 173-180 Electronic Notes in Discrete Mathematics, 24, 173-180 Electronic Notes in Discrete Mathematics, 24, 173-180 2006/07/15 Refereed English Research paper(scientific journal) 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/06 Refereed English Research paper(scientific journal) 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/06 Refereed English Research paper(scientific journal) Disclose to all
H Nagamochi, T Kawada H Nagamochi, T Kawada H Nagamochi, T 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/05 Refereed English Research paper(scientific journal) 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 ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, E89A, 5, 1263-1268 IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, E89A, 5, 1263-1268 IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, E89A, 5, 1263-1268 2006/05 Refereed English Research paper(scientific journal) Disclose to all
H Nagamochi, T Kawada H Nagamochi, T Kawada H Nagamochi, T 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/05 Refereed English Research paper(scientific journal) Disclose to all
T Ishii, H Nagamochi, T Ibaraki T Ishii, H Nagamochi, T Ibaraki T Ishii, H Nagamochi, T Ibaraki Augmenting a (k-1)-vertex-connected multigraph to an l-edge-connected and k-vertex-connected multigraph Augmenting a (k-1)-vertex-connected multigraph to an l-edge-connected and k-vertex-connected multigraph Augmenting a (k-1)-vertex-connected multigraph to an l-edge-connected and k-vertex-connected multigraph ALGORITHMICA, 44, 3, 257-280 ALGORITHMICA, 44, 3, 257-280 ALGORITHMICA, 44, 3, 257-280 2006/04 Refereed English Research paper(scientific journal) Disclose to all
T Ishii, H Nagamochi, T Ibaraki T Ishii, H Nagamochi, T Ibaraki T Ishii, H Nagamochi, T Ibaraki Augmenting a (k-1)-vertex-connected multigraph to an l-edge-connected and k-vertex-connected multigraph Augmenting a (k-1)-vertex-connected multigraph to an l-edge-connected and k-vertex-connected multigraph Augmenting a (k-1)-vertex-connected multigraph to an l-edge-connected and k-vertex-connected multigraph ALGORITHMICA, 44, 3, 257-280 ALGORITHMICA, 44, 3, 257-280 ALGORITHMICA, 44, 3, 257-280 2006/04 Refereed English Research paper(scientific journal) Disclose to all
Koji Hirata, Takahiro Matsuda, Hiroshi Nagamochi, Tetsuya Takine 平田孝志, 松田崇弘, 永持 仁, 滝根哲哉 Koji Hirata, Takahiro Matsuda, Hiroshi Nagamochi, Tetsuya Takine Contention Avoidance based on Spanning Trees with Dedicated Wavelengths in Optically Burst-Switched WDM Networks 光バースト交換網における専用波長を用いた全域木形成による衝突回避法 Contention Avoidance based on Spanning Trees with Dedicated Wavelengths in Optically Burst-Switched WDM Networks 電子情報通信学会技術報告, 105, 628, 413-418 電子情報通信学会技術報告, 105, 628, 413-418 , 105, 628, 413-418 2006/03 Japanese Research paper(other academic) Disclose to all
H Nagamochi H Nagamochi H Nagamochi Increasing the edge-connectivity by contracting a vertex subset in graphs Increasing the edge-connectivity by contracting a vertex subset in graphs Increasing the edge-connectivity by contracting a vertex subset in graphs IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, E89D, 2, 744-750 IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, E89D, 2, 744-750 IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, E89D, 2, 744-750 2006/02 Refereed English Research paper(scientific journal) Disclose to all
P Eades, QW Feng, XM Lin, H Nagamochi P Eades, QW Feng, XM Lin, H Nagamochi P Eades, QW Feng, XM Lin, H 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/01 Refereed English Research paper(scientific journal) Disclose to all
Y. Karuno, H. Nagamochi, Y. Ohshima Y. Karuno, H. Nagamochi, Y. Ohshima A dynamic programming approach for a food packing problem A dynamic programming approach for a food packing problem Nihon Kikai Gakkai Ronbunshu, C Hen/Transactions of the Japan Society of Mechanical Engineers, Part C, 72, 4, 1390-1397 Nihon Kikai Gakkai Ronbunshu, C Hen/Transactions of the Japan Society of Mechanical Engineers, Part C, 72, 4, 1390-1397 , 72, 4, 1390-1397 2006 Refereed Japanese 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 JOURNAL ON COMPUTING, 36, 5, 1329-1341 SIAM JOURNAL ON COMPUTING, 36, 5, 1329-1341 SIAM JOURNAL ON COMPUTING, 36, 5, 1329-1341 2006 Refereed English Research paper(scientific journal) 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, 4271, 113-+ GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE, 4271, 113-+ GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE, 4271, 113-+ 2006 Refereed English Research paper(international conference proceedings) Disclose to all
Kouji Hirata, Takahiro Matsuda, Hiroshi Nagamochi, Tetsuya Takine Kouji Hirata, Takahiro Matsuda, Hiroshi Nagamochi, Tetsuya Takine Kouji Hirata, Takahiro Matsuda, Hiroshi Nagamochi, Tetsuya Takine Contention-Free lambda-Planes in Optically Burst-Switched WDM Networks Contention-Free lambda-Planes in Optically Burst-Switched WDM Networks Contention-Free lambda-Planes in Optically Burst-Switched WDM Networks GLOBECOM 2006 - 2006 IEEE GLOBAL TELECOMMUNICATIONS CONFERENCE GLOBECOM 2006 - 2006 IEEE GLOBAL TELECOMMUNICATIONS CONFERENCE GLOBECOM 2006 - 2006 IEEE GLOBAL TELECOMMUNICATIONS CONFERENCE 2006 Refereed English Research paper(international conference proceedings) 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 on Fundamentals of Electronics, Communications and Computer Sciences, E89-A, 5, 1263-1268 IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, E89-A, 5, 1263-1268 IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, E89-A, 5, 1263-1268 2006 Refereed English Research paper(scientific journal) 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 on Information and Systems, E89-D, 2, 744-750 IEICE Transactions on Information and Systems, E89-D, 2, 744-750 IEICE Transactions on Information and Systems, E89-D, 2, 744-750 2006 Refereed English Research paper(international conference proceedings) Disclose to all
P Eades, QW Feng, XM Lin, H Nagamochi P Eades, QW Feng, XM Lin, H Nagamochi P Eades, QW Feng, XM Lin, H 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/01 Refereed English Research paper(scientific journal) 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 JOURNAL ON COMPUTING, 36, 5, 1329-1341 SIAM JOURNAL ON COMPUTING, 36, 5, 1329-1341 SIAM JOURNAL ON COMPUTING, 36, 5, 1329-1341 2006 Refereed English Research paper(scientific journal) Disclose to all
H Nagamochi, K Iwata, T Ishii H Nagamochi, K Iwata, T Ishii H Nagamochi, K Iwata, T Ishii A robust algorithm for bisecting a triconnected graph with two resource sets A robust algorithm for bisecting a triconnected graph with two resource sets A robust algorithm for bisecting a triconnected graph with two resource sets THEORETICAL COMPUTER SCIENCE, 341, 1-3, 364-378 THEORETICAL COMPUTER SCIENCE, 341, 1-3, 364-378 THEORETICAL COMPUTER SCIENCE, 341, 1-3, 364-378 2005/09 Refereed English Research paper(scientific journal) Disclose to all
H Nagamochi, K Iwata, T Ishii H Nagamochi, K Iwata, T Ishii H Nagamochi, K Iwata, T Ishii A robust algorithm for bisecting a triconnected graph with two resource sets A robust algorithm for bisecting a triconnected graph with two resource sets A robust algorithm for bisecting a triconnected graph with two resource sets THEORETICAL COMPUTER SCIENCE, 341, 1-3, 364-378 THEORETICAL COMPUTER SCIENCE, 341, 1-3, 364-378 THEORETICAL COMPUTER SCIENCE, 341, 1-3, 364-378 2005/09 Refereed English Research paper(scientific journal) Disclose to all
H Nagamochi H Nagamochi H Nagamochi A 4/3-approximation for the minimum 2-local-vertex-connectivity augmentation in a connected graph A 4/3-approximation for the minimum 2-local-vertex-connectivity augmentation in a connected graph A 4/3-approximation for the minimum 2-local-vertex-connectivity augmentation in a connected graph JOURNAL OF ALGORITHMS, 56, 2, 77-95 JOURNAL OF ALGORITHMS, 56, 2, 77-95 JOURNAL OF ALGORITHMS, 56, 2, 77-95 2005/08 Refereed English Research paper(scientific journal) 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 Journal of Algorithms, 56, 2, 77-95 Journal of Algorithms, 56, 2, 77-95 Journal of Algorithms, 56, 2, 77-95 2005/08 Refereed English Research paper(scientific journal) Disclose to all
H. Nagamochi H. Nagamochi H. Nagamochi Packing unit squares in a rectangle Packing unit squares in a rectangle Packing unit squares in a rectangle Electronic Journal of Combinatorics, 12, 1 Electronic Journal of Combinatorics, 12, 1 Electronic Journal of Combinatorics, 12, 1 2005/07/29 Refereed English Disclose to all
H Nagamochi H Nagamochi H Nagamochi Packing unit squares in a rectangle Packing unit squares in a rectangle Packing unit squares in a rectangle ELECTRONIC JOURNAL OF COMBINATORICS, 12, 1 ELECTRONIC JOURNAL OF COMBINATORICS, 12, 1 ELECTRONIC JOURNAL OF COMBINATORICS, 12, 1 2005/07 Refereed English Research paper(scientific journal) Disclose to all
石井利昌, 永持仁, 西垣豊, 高橋健吾, 武田真人 石井利昌, 永持仁, 西垣豊, 高橋健吾, 武田真人 タンク繰りにおける経路探索法 タンク繰りにおける経路探索法 システム制御情報学会論文誌, 18, 6, 213-221 システム制御情報学会論文誌, 18, 6, 213-221 , 18, 6, 213-221 2005/06 Refereed Japanese Disclose to all
H Nagamochi H Nagamochi H Nagamochi Approximating the minmax rooted-subtree cover problem Approximating the minmax rooted-subtree cover problem Approximating the minmax rooted-subtree cover problem IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, E88A, 5, 1335-1338 IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, E88A, 5, 1335-1338 IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, E88A, 5, 1335-1338 2005/05 Refereed English Research paper(scientific journal) Disclose to all
H Nagamochi H Nagamochi H Nagamochi An improved bound on the one-sided minimum crossing number in two-layered drawings An improved bound on the one-sided minimum crossing number in two-layered drawings An improved bound on the one-sided minimum crossing number in two-layered drawings DISCRETE & COMPUTATIONAL GEOMETRY, 33, 4, 565-591 DISCRETE & COMPUTATIONAL GEOMETRY, 33, 4, 565-591 DISCRETE & COMPUTATIONAL GEOMETRY, 33, 4, 565-591 2005/04 Refereed English Research paper(scientific journal) 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 Information Processing Letters, 93, 5, 231-237 Information Processing Letters, 93, 5, 231-237 Information Processing Letters, 93, 5, 231-237 2005/03/16 Refereed English Research paper(scientific journal) Disclose to all
H Nagamochi H Nagamochi H 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 INFORMATION PROCESSING LETTERS, 93, 5, 231-237 INFORMATION PROCESSING LETTERS, 93, 5, 231-237 INFORMATION PROCESSING LETTERS, 93, 5, 231-237 2005/03 Refereed English Research paper(scientific journal) 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 Theoretical Computer Science, 332, 1-3, 417-446 Theoretical Computer Science, 332, 1-3, 417-446 Theoretical Computer Science, 332, 1-3, 417-446 2005/02/28 Refereed English Research paper(scientific journal) Disclose to all
H Nagamochi H Nagamochi H Nagamochi On the one-sided crossing minimization in a bipartite graph with large degrees On the one-sided crossing minimization in a bipartite graph with large degrees On the one-sided crossing minimization in a bipartite graph with large degrees THEORETICAL COMPUTER SCIENCE, 332, 1-3, 417-446 THEORETICAL COMPUTER SCIENCE, 332, 1-3, 417-446 THEORETICAL COMPUTER SCIENCE, 332, 1-3, 417-446 2005/02 Refereed English Research paper(scientific journal) 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 and Computational Geometry, 33, 4, 565-591 Discrete and Computational Geometry, 33, 4, 565-591 Discrete and Computational Geometry, 33, 4, 565-591 2005 Refereed English Research paper(scientific journal) 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 on Information and Systems, E88-D, 1, 12-16 IEICE Transactions on Information and Systems, E88-D, 1, 12-16 IEICE Transactions on Information and Systems, E88-D, 1, 12-16 2005 Refereed English Research paper(international conference proceedings) Disclose to all
L Zhao, H Nagamochi, T Ibaraki L Zhao, H Nagamochi, T Ibaraki L Zhao, H Nagamochi, T Ibaraki Greedy splitting algorithms for approximating multiway partition problems Greedy splitting algorithms for approximating multiway partition problems Greedy splitting algorithms for approximating multiway partition problems MATHEMATICAL PROGRAMMING, 102, 1, 167-183 MATHEMATICAL PROGRAMMING, 102, 1, 167-183 MATHEMATICAL PROGRAMMING, 102, 1, 167-183 2005/01 Refereed English Research paper(scientific journal) Disclose to all
Y. Karuno, Hiroshi Nagamochi Y. Karuno, Hiroshi Nagamochi Y. Karuno, Hiroshi Nagamochi Scheduling vehicles on trees Scheduling vehicles on trees Scheduling vehicles on trees Pacific Journal of Optimization,vol. 1, no. 3, pp. 527-543. Pacific Journal of Optimization,vol. 1, no. 3, pp. 527-543. Pacific Journal of Optimization,vol. 1, no. 3, pp. 527-543. 2005 Refereed English Disclose to all
L Zhao, H Nagamochi, T Ibaraki L Zhao, H Nagamochi, T Ibaraki L Zhao, H Nagamochi, T Ibaraki Greedy splitting algorithms for approximating multiway partition problems Greedy splitting algorithms for approximating multiway partition problems Greedy splitting algorithms for approximating multiway partition problems MATHEMATICAL PROGRAMMING, 102, 1, 167-183 MATHEMATICAL PROGRAMMING, 102, 1, 167-183 MATHEMATICAL PROGRAMMING, 102, 1, 167-183 2005/01 Refereed English Research paper(scientific journal) 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 on Fundamentals of Electronics, Communications and Computer Sciences, E88-A, 5, 1335-1338 IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, E88-A, 5, 1335-1338 IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, E88-A, 5, 1335-1338 2005 Refereed English Research paper(scientific journal) Disclose to all
H Nagamochi H Nagamochi H 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 ON INFORMATION AND SYSTEMS, E88D, 1, 12-16 IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, E88D, 1, 12-16 IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, E88D, 1, 12-16 2005/01 Refereed English Research paper(scientific journal) Disclose to all
H Nagamochi H Nagamochi H Nagamochi Graph algorithms for network connectivity problems Graph algorithms for network connectivity problems Graph algorithms for network connectivity problems JOURNAL OF THE OPERATIONS RESEARCH SOCIETY OF JAPAN, 47, 4, 199-223 JOURNAL OF THE OPERATIONS RESEARCH SOCIETY OF JAPAN, 47, 4, 199-223 JOURNAL OF THE OPERATIONS RESEARCH SOCIETY OF JAPAN, 47, 4, 199-223 2004/12 Refereed English Research paper(scientific journal) Disclose to all
L Zhao, H Nagamochi, T Ibarakic L Zhao, H Nagamochi, T Ibarakic L Zhao, H Nagamochi, T Ibarakic 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/09 Refereed English Research paper(scientific journal) Disclose to all
H Nagamochi, N Yamada H Nagamochi, N Yamada H Nagamochi, N 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 INFORMATION PROCESSING LETTERS, 91, 5, 221-225 INFORMATION PROCESSING LETTERS, 91, 5, 221-225 INFORMATION PROCESSING LETTERS, 91, 5, 221-225 2004/09 Refereed English Research paper(scientific journal) Disclose to all
H Nagamochi, N Yamada H Nagamochi, N Yamada H Nagamochi, N 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 INFORMATION PROCESSING LETTERS, 91, 5, 221-225 INFORMATION PROCESSING LETTERS, 91, 5, 221-225 INFORMATION PROCESSING LETTERS, 91, 5, 221-225 2004/09 Refereed English Research paper(scientific journal) Disclose to all
L Zhao, H Nagamochi, T Ibarakic L Zhao, H Nagamochi, T Ibarakic L Zhao, H Nagamochi, T Ibarakic 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/09 Refereed English Research paper(scientific journal) Disclose to all
H Nagamochi, K Okada H Nagamochi, K Okada H Nagamochi, K Okada A faster 2-approximation algorithm for the minmax p-traveling salesmen problem on a tree A faster 2-approximation algorithm for the minmax p-traveling salesmen problem on a tree 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/05 Refereed English Research paper(scientific journal) Disclose to all
H Nagamochi, K Okada H Nagamochi, K Okada H Nagamochi, K Okada A faster 2-approximation algorithm for the minmax p-traveling salesmen problem on a tree A faster 2-approximation algorithm for the minmax p-traveling salesmen problem on a tree 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/05 Refereed English Research paper(scientific journal) Disclose to all
H Nagamochi, T Suzuki, T Ishii H Nagamochi, T Suzuki, T Ishii H Nagamochi, T Suzuki, T Ishii A simple recognition of maximal planar graphs A simple recognition of maximal planar graphs A simple recognition of maximal planar graphs INFORMATION PROCESSING LETTERS, 89, 5, 223-226 INFORMATION PROCESSING LETTERS, 89, 5, 223-226 INFORMATION PROCESSING LETTERS, 89, 5, 223-226 2004/03 Refereed English Research paper(scientific journal) Disclose to all
H Nagamochi, T Suzuki, T Ishii H Nagamochi, T Suzuki, T Ishii H Nagamochi, T Suzuki, T Ishii A simple recognition of maximal planar graphs A simple recognition of maximal planar graphs A simple recognition of maximal planar graphs INFORMATION PROCESSING LETTERS, 89, 5, 223-226 INFORMATION PROCESSING LETTERS, 89, 5, 223-226 INFORMATION PROCESSING LETTERS, 89, 5, 223-226 2004/03 Refereed English Research paper(scientific journal) Disclose to all
Y Karuno, H Nagamochi Y Karuno, H Nagamochi Y Karuno, H Nagamochi An approximability result of the multi-vehicle scheduling problem on a path with release and handling times An approximability result of the multi-vehicle scheduling problem on a path with release and handling times An approximability result of the multi-vehicle scheduling problem on a path with release and handling times THEORETICAL COMPUTER SCIENCE, 312, 2-3, 267-280 THEORETICAL COMPUTER SCIENCE, 312, 2-3, 267-280 THEORETICAL COMPUTER SCIENCE, 312, 2-3, 267-280 2004/01 Refereed English Research paper(scientific journal) Disclose to all
H Nagamochi H Nagamochi H Nagamochi An improved approximation to the one-sided bilayer drawing An improved approximation to the one-sided bilayer drawing An improved approximation to the one-sided bilayer drawing GRAPH DRAWING, 2912, 406-418 GRAPH DRAWING, 2912, 406-418 GRAPH DRAWING, 2912, 406-418 2004 Refereed English Research paper(scientific journal) Disclose to all
H Nagamochi, K Kuroya H Nagamochi, K Kuroya H Nagamochi, K Kuroya Convex drawing for c-planar biconnected clustered graphs Convex drawing for c-planar biconnected clustered graphs Convex drawing for c-planar biconnected clustered graphs GRAPH DRAWING, 2912, 369-380 GRAPH DRAWING, 2912, 369-380 GRAPH DRAWING, 2912, 369-380 2004 Refereed English Research paper(scientific journal) Disclose to all
Y Karuno, H Nagamochi Y Karuno, H Nagamochi Y Karuno, H Nagamochi An approximability result of the multi-vehicle scheduling problem on a path with release and handling times An approximability result of the multi-vehicle scheduling problem on a path with release and handling times An approximability result of the multi-vehicle scheduling problem on a path with release and handling times THEORETICAL COMPUTER SCIENCE, 312, 2-3, 267-280 THEORETICAL COMPUTER SCIENCE, 312, 2-3, 267-280 THEORETICAL COMPUTER SCIENCE, 312, 2-3, 267-280 2004/01 Refereed English Research paper(scientific journal) Disclose to all
H Nagamochi, Y Nishida, T Ibaraki H Nagamochi, Y Nishida, T Ibaraki H Nagamochi, Y Nishida, T Ibaraki Approximability of the minimum maximal matching problem in planar graphs Approximability of the minimum maximal matching problem in planar graphs Approximability of the minimum maximal matching problem in planar graphs IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, E86A, 12, 3251-3258 IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, E86A, 12, 3251-3258 IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, E86A, 12, 3251-3258 2003/12 Refereed English Research paper(scientific journal) Disclose to all
Nagamochi, H, Ishii, T Nagamochi, H, Ishii, T Nagamochi, H, Ishii, T On the minimum local-vertex-connectivity augmentation in graphs On the minimum local-vertex-connectivity augmentation in graphs 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/08/01 Refereed English Disclose to all
Y Karuno, H Nagamochi Y Karuno, H Nagamochi Y Karuno, H 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/08 Refereed English Research paper(scientific journal) Disclose to all
H Nagamochi, T Ishii H Nagamochi, T Ishii H Nagamochi, T Ishii On the minimum local-vertex-connectivity augmentation in graphs On the minimum local-vertex-connectivity augmentation in graphs 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/08 Refereed English Research paper(scientific journal) Disclose to all
Y Karuno, H Nagamochi Y Karuno, H Nagamochi Y Karuno, H 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/08 Refereed English Research paper(scientific journal) Disclose to all
H Nagamochi, P Eades H Nagamochi, P Eades H Nagamochi, P Eades An edge-splitting algorithm in planar graphs An edge-splitting algorithm in planar graphs An edge-splitting algorithm in planar graphs JOURNAL OF COMBINATORIAL OPTIMIZATION, 7, 2, 137-159 JOURNAL OF COMBINATORIAL OPTIMIZATION, 7, 2, 137-159 JOURNAL OF COMBINATORIAL OPTIMIZATION, 7, 2, 137-159 2003/06 Refereed English Research paper(scientific journal) Disclose to all
H Nagamochi, P Eades H Nagamochi, P Eades H Nagamochi, P Eades An edge-splitting algorithm in planar graphs An edge-splitting algorithm in planar graphs An edge-splitting algorithm in planar graphs JOURNAL OF COMBINATORIAL OPTIMIZATION, 7, 2, 137-159 JOURNAL OF COMBINATORIAL OPTIMIZATION, 7, 2, 137-159 JOURNAL OF COMBINATORIAL OPTIMIZATION, 7, 2, 137-159 2003/06 Refereed English Research paper(scientific journal) Disclose to all
L Zhao, H Nagamochi, T Ibaraki L Zhao, H Nagamochi, T Ibaraki L Zhao, H Nagamochi, T Ibaraki A linear time 5/3-approximation for the minimum 3 strongly-connected spanning subgraph problem A linear time 5/3-approximation for the minimum 3 strongly-connected spanning subgraph problem A linear time 5/3-approximation for the minimum 3 strongly-connected spanning subgraph problem INFORMATION PROCESSING LETTERS, 86, 2, 63-70 INFORMATION PROCESSING LETTERS, 86, 2, 63-70 INFORMATION PROCESSING LETTERS, 86, 2, 63-70 2003/04 Refereed English Research paper(scientific journal) Disclose to all
L Zhao, H Nagamochi, T Ibaraki L Zhao, H Nagamochi, T Ibaraki L Zhao, H Nagamochi, T Ibaraki A linear time 5/3-approximation for the minimum 3 strongly-connected spanning subgraph problem A linear time 5/3-approximation for the minimum 3 strongly-connected spanning subgraph problem A linear time 5/3-approximation for the minimum 3 strongly-connected spanning subgraph problem INFORMATION PROCESSING LETTERS, 86, 2, 63-70 INFORMATION PROCESSING LETTERS, 86, 2, 63-70 INFORMATION PROCESSING LETTERS, 86, 2, 63-70 2003/04 Refereed English Research paper(scientific journal) Disclose to all
L Zhao, H Nagamochi, T Ibaraki L Zhao, H Nagamochi, T Ibaraki L Zhao, H Nagamochi, T Ibaraki A primal-dual approximation algorithm for the survivable network design problem in hypergraphs A primal-dual approximation algorithm for the survivable network design problem in hypergraphs 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/03 Refereed English Research paper(scientific journal) Disclose to all
H Nagamochi H Nagamochi H Nagamochi An approximation for finding a smallest 2-edge-connected subgraph containing a specified spanning tree An approximation for finding a smallest 2-edge-connected subgraph containing a specified spanning tree 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/03 Refereed English Research paper(scientific journal) Disclose to all
L Zhao, H Nagamochi, T Ibaraki L Zhao, H Nagamochi, T Ibaraki L Zhao, H Nagamochi, T Ibaraki A primal-dual approximation algorithm for the survivable network design problem in hypergraphs A primal-dual approximation algorithm for the survivable network design problem in hypergraphs 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/03 Refereed English Research paper(scientific journal) Disclose to all
永持 仁 永持 仁 グラフの最小分割問題に対するアルゴリズム(<小特集>LAシンポジウム(計算機科学基礎理論ワークショップ)論文小特集) グラフの最小分割問題に対するアルゴリズム(<小特集>LAシンポジウム(計算機科学基礎理論ワークショップ)論文小特集) 電子情報通信学会論文誌. D-I, 情報・システム, I-情報処理, 86, 2, 53-68 電子情報通信学会論文誌. D-I, 情報・システム, I-情報処理, 86, 2, 53-68 , 86, 2, 53-68 2003/02/01 Refereed Japanese Disclose to all
H Nagamochi, S Nakamura, T Ishii H Nagamochi, S Nakamura, T Ishii H Nagamochi, S Nakamura, T Ishii Constructing a cactus for minimum cuts of a graph in O (mn+n(2) log n) time and O(m) Space Constructing a cactus for minimum cuts of a graph in O (mn+n(2) log n) time and O(m) Space Constructing a cactus for minimum cuts of a graph in O (mn+n(2) log n) time and O(m) Space IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, E86D, 2, 179-185 IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, E86D, 2, 179-185 IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, E86D, 2, 179-185 2003/02 Refereed English Research paper(scientific journal) Disclose to all
永持 仁 永持 仁 永持 仁 Algorithms for the minimum partitioning problems in graphs Algorithms for the minimum partitioning problems in graphs Algorithms for the minimum partitioning problems in graphs The Institute of Electronics, Information and Communication Engineers Transactions on Information and Systems,J86-D-I/2, 53-68 The Institute of Electronics, Information and Communication Engineers Transactions on Information and Systems,J86-D-I/2, 53-68 The Institute of Electronics, Information and Communication Engineers Transactions on Information and Systems,J86-D-I/2, 53-68 2003 Refereed English Disclose to all
H Nagamochi, T Ibaraki H Nagamochi, T Ibaraki H Nagamochi, T Ibaraki Graph connectivity and its augmentation: applications of MA orderings Graph connectivity and its augmentation: applications of MA orderings 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/11 Refereed English Research paper(scientific journal) Disclose to all
H Nagamochi, T Ibaraki H Nagamochi, T Ibaraki H Nagamochi, T Ibaraki Graph connectivity and its augmentation: applications of MA orderings Graph connectivity and its augmentation: applications of MA orderings 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/11 Refereed English Research paper(scientific journal) Disclose to all
Y Karuno, H Nagamochi, T Ibaraki Y Karuno, H Nagamochi, T Ibaraki Y Karuno, H Nagamochi, T Ibaraki Better approximation ratios for the single-vehicle scheduling problems on line-shaped networks Better approximation ratios for the single-vehicle scheduling problems on line-shaped networks 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/07 Refereed English Research paper(scientific journal) Disclose to all
Y Karuno, H Nagamochi, T Ibaraki Y Karuno, H Nagamochi, T Ibaraki Y Karuno, H Nagamochi, T Ibaraki Better approximation ratios for the single-vehicle scheduling problems on line-shaped networks Better approximation ratios for the single-vehicle scheduling problems on line-shaped networks 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/07 Refereed English Research paper(scientific journal) 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/05/15 Refereed English Research paper(scientific journal) Disclose to all
T Fujito, H Nagamochi T Fujito, H Nagamochi T Fujito, H Nagamochi A 2-approximation algorithm for the minimum weight edge dominating set problem A 2-approximation algorithm for the minimum weight edge dominating set problem 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/05 Refereed English Research paper(scientific journal) Disclose to all
L Zhao, H Nagamochi, T Ibaraki L Zhao, H Nagamochi, T Ibaraki L Zhao, H Nagamochi, T Ibaraki A note on approximating the survivable network design problem in hypergraphs A note on approximating the survivable network design problem in hypergraphs A note on approximating the survivable network design problem in hypergraphs IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, E85D, 2, 322-326 IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, E85D, 2, 322-326 IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, E85D, 2, 322-326 2002/02 Refereed English Research paper(scientific journal) Disclose to all
永持 仁 永持 仁 永持 仁 On the minimum edge- and vertex-connectivity augmentation in multigraphs, "jointly worked " On the minimum edge- and vertex-connectivity augmentation in multigraphs, "jointly worked " On the minimum edge- and vertex-connectivity augmentation in multigraphs, "jointly worked " The Second Japanese-Sino Optimization Meeting,/ , 61 The Second Japanese-Sino Optimization Meeting,/ , 61 The Second Japanese-Sino Optimization Meeting,/ , 61 2002 Refereed English Disclose to all
Y Karuno, H Nagamochi Y Karuno, H Nagamochi Y Karuno, H Nagamochi A better approximation for the two-stage assembly scheduling problem with two machines at the first stage A better approximation for the two-stage assembly scheduling problem with two machines at the first stage A better approximation for the two-stage assembly scheduling problem with two machines at the first stage ALGORITHMS AND COMPUTATION, PROCEEDINGS, 2518, 199-210 ALGORITHMS AND COMPUTATION, PROCEEDINGS, 2518, 199-210 ALGORITHMS AND COMPUTATION, PROCEEDINGS, 2518, 199-210 2002 Refereed English Research paper(scientific journal) Disclose to all
H. Ito, H. Nagamochi H. Ito, H. Nagamochi H. Ito, H. Nagamochi Comparing hypergraphs by areas of hyperedges drawn on a convex polygon Comparing hypergraphs by areas of hyperedges drawn on a convex polygon Comparing hypergraphs by areas of hyperedges drawn on a convex polygon Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2866, 176-181 Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2866, 176-181 Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2866, 176-181 2002 Refereed English Disclose to all
H Nagamochi, T Jordan, Y Nakao, T Ibaraki H Nagamochi, T Jordan, Y Nakao, T Ibaraki H Nagamochi, T Jordan, Y Nakao, T Ibaraki Convex embeddings and bisections of 3-connected graphs Convex embeddings and bisections of 3-connected graphs Convex embeddings and bisections of 3-connected graphs COMBINATORICA, 22, 4, 537-554 COMBINATORICA, 22, 4, 537-554 COMBINATORICA, 22, 4, 537-554 2002 Refereed English Research paper(scientific journal) Disclose to all
H Nagamochi, T Jordan, Y Nakao, T Ibaraki H Nagamochi, T Jordan, Y Nakao, T Ibaraki H Nagamochi, T Jordan, Y Nakao, T Ibaraki Convex embeddings and bisections of 3-connected graphs Convex embeddings and bisections of 3-connected graphs Convex embeddings and bisections of 3-connected graphs COMBINATORICA, 22, 4, 537-554 COMBINATORICA, 22, 4, 537-554 COMBINATORICA, 22, 4, 537-554 2002 Refereed English Research paper(scientific journal) Disclose to all
H. Nagamochi, T. Ishii, H. Ito H. Nagamochi, T. Ishii, H. Ito H. Nagamochi, T. Ishii, H. Ito Minimum cost source location problem with vertex-connectivity requirements in digraphs Minimum cost source location problem with vertex-connectivity requirements in digraphs Minimum cost source location problem with vertex-connectivity requirements in digraphs Information Processing Letters, 80, 6, 287-293 Information Processing Letters, 80, 6, 287-293 Information Processing Letters, 80, 6, 287-293 2001/12/31 Refereed English Research paper(scientific journal) Disclose to all
L Zhao, H Nagamochi, T Ibaraki L Zhao, H Nagamochi, T Ibaraki L Zhao, H Nagamochi, T Ibaraki Approximating the minimum k-way cut in a graph via minimum 3-way cuts Approximating the minimum k-way cut in a graph via minimum 3-way cuts Approximating the minimum k-way cut in a graph via minimum 3-way cuts JOURNAL OF COMBINATORIAL OPTIMIZATION, 5, 4, 397-410 JOURNAL OF COMBINATORIAL OPTIMIZATION, 5, 4, 397-410 JOURNAL OF COMBINATORIAL OPTIMIZATION, 5, 4, 397-410 2001/12 Refereed English Research paper(scientific journal) Disclose to all
L Zhao, H Nagamochi, T Ibaraki L Zhao, H Nagamochi, T Ibaraki L Zhao, H Nagamochi, T Ibaraki Approximating the minimum k-way cut in a graph via minimum 3-way cuts Approximating the minimum k-way cut in a graph via minimum 3-way cuts Approximating the minimum k-way cut in a graph via minimum 3-way cuts JOURNAL OF COMBINATORIAL OPTIMIZATION, 5, 4, 397-410 JOURNAL OF COMBINATORIAL OPTIMIZATION, 5, 4, 397-410 JOURNAL OF COMBINATORIAL OPTIMIZATION, 5, 4, 397-410 2001/12 Refereed English Research paper(scientific journal) Disclose to all
H Nagamochi, T Ishii, H Ito H Nagamochi, T Ishii, H Ito H Nagamochi, T Ishii, H Ito Minimum cost source location problem with vertex-connectivity requirements in digraphs Minimum cost source location problem with vertex-connectivity requirements in digraphs Minimum cost source location problem with vertex-connectivity requirements in digraphs INFORMATION PROCESSING LETTERS, 80, 6, 287-293 INFORMATION PROCESSING LETTERS, 80, 6, 287-293 INFORMATION PROCESSING LETTERS, 80, 6, 287-293 2001/12 Refereed English Research paper(scientific journal) Disclose to all
H Nagamochi, M Miller, Slamin H Nagamochi, M Miller, Slamin H Nagamochi, M Miller, Slamin Bounds on the number of isolates in sum graph labeling Bounds on the number of isolates in sum graph labeling 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/09 Refereed English Research paper(scientific journal) 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/06/15 Refereed English Research paper(scientific journal) Disclose to all
H Nagamochi, T Shiraki, T Ibaraki H Nagamochi, T Shiraki, T Ibaraki H Nagamochi, T Shiraki, T Ibaraki Augmenting a submodular and posi-modular set function by a multigraph Augmenting a submodular and posi-modular set function by a multigraph Augmenting a submodular and posi-modular set function by a multigraph JOURNAL OF COMBINATORIAL OPTIMIZATION, 5, 2, 175-212 JOURNAL OF COMBINATORIAL OPTIMIZATION, 5, 2, 175-212 JOURNAL OF COMBINATORIAL OPTIMIZATION, 5, 2, 175-212 2001/06 Refereed English Research paper(scientific journal) Disclose to all
H Nagamochi, T Shiraki, T Ibaraki H Nagamochi, T Shiraki, T Ibaraki H Nagamochi, T Shiraki, T Ibaraki Augmenting a submodular and posi-modular set function by a multigraph Augmenting a submodular and posi-modular set function by a multigraph Augmenting a submodular and posi-modular set function by a multigraph JOURNAL OF COMBINATORIAL OPTIMIZATION, 5, 2, 175-212 JOURNAL OF COMBINATORIAL OPTIMIZATION, 5, 2, 175-212 JOURNAL OF COMBINATORIAL OPTIMIZATION, 5, 2, 175-212 2001/06 Refereed English Research paper(scientific journal) Disclose to all
T Hasunuma, H Nagamochi T Hasunuma, H Nagamochi T Hasunuma, H Nagamochi Independent spanning trees with small depths in iterated line digraphs Independent spanning trees with small depths in iterated line digraphs 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/06 Refereed English Research paper(scientific journal) Disclose to all
H Nagamochi, K Mochizuki, T Ibaraki H Nagamochi, K Mochizuki, T Ibaraki H Nagamochi, K Mochizuki, T Ibaraki Solving the single-vehicle scheduling problems for all home locations under depth-first routing on a tree Solving the single-vehicle scheduling problems for all home locations under depth-first routing on a tree Solving the single-vehicle scheduling problems for all home locations under depth-first routing on a tree IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, E84A, 5, 1135-1143 IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, E84A, 5, 1135-1143 IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, E84A, 5, 1135-1143 2001/05 Refereed English Research paper(scientific journal) Disclose to all
T Ishii, H Nagamochi, T Ibaraki T Ishii, H Nagamochi, T Ibaraki T Ishii, H Nagamochi, T Ibaraki Multigraph augmentation under biconnectivity and general edge-connectivity requirements Multigraph augmentation under biconnectivity and general edge-connectivity requirements 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/05 Refereed English Research paper(scientific journal) Disclose to all
T Ishii, H Nagamochi, T Ibaraki T Ishii, H Nagamochi, T Ibaraki T Ishii, H Nagamochi, T Ibaraki Multigraph augmentation under biconnectivity and general edge-connectivity requirements Multigraph augmentation under biconnectivity and general edge-connectivity requirements 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/05 Refereed English Research paper(scientific journal) Disclose to all
H Nagamochi, T Hasunuma H Nagamochi, T Hasunuma H Nagamochi, T Hasunuma An efficient NC algorithm for a sparse k-edge-connectivity certificate An efficient NC algorithm for a sparse k-edge-connectivity certificate An efficient NC algorithm for a sparse k-edge-connectivity certificate JOURNAL OF ALGORITHMS, 38, 2, 354-373 JOURNAL OF ALGORITHMS, 38, 2, 354-373 JOURNAL OF ALGORITHMS, 38, 2, 354-373 2001/02 Refereed English Research paper(scientific journal) Disclose to all
Hiroshi Nagamochi, Toru Hasunuma Hiroshi Nagamochi, Toru Hasunuma Hiroshi Nagamochi, Toru Hasunuma An Efficient script N signScript C sign Algorithm for a Sparse k-Edge-Connectivity Certificate An Efficient script N signScript C sign Algorithm for a Sparse k-Edge-Connectivity Certificate An Efficient script N signScript C sign Algorithm for a Sparse k-Edge-Connectivity Certificate Journal of Algorithms, 38, 2, 354-373 Journal of Algorithms, 38, 2, 354-373 Journal of Algorithms, 38, 2, 354-373 2001 Refereed English Research paper(scientific journal) Disclose to all
Hiroshi Nagamochi, M. Miller, Slamin Hiroshi Nagamochi, M. Miller, Slamin Hiroshi Nagamochi, M. Miller, Slamin Bounds on sum number in graphs Bounds on sum number in graphs Bounds on sum number in graphs Discrete Mathematics, vol.240, no.1-3,pp.175-185 Discrete Mathematics, vol.240, no.1-3,pp.175-185 Discrete Mathematics, vol.240, no.1-3,pp.175-185 2001 Refereed English Disclose to all
永持 仁 永持 仁 永持 仁 Bounds on sum number in graphs, "jointly worked " Bounds on sum number in graphs, "jointly worked " Bounds on sum number in graphs, "jointly worked " 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
永持 仁 永持 仁 永持 仁 A unified framework for approximating some partition problems via greedy splitting, "jointly worked " A unified framework for approximating some partition problems via greedy splitting, "jointly worked " A unified framework for approximating some partition problems via greedy splitting, "jointly worked " Lecture Notes in Computer Science,V2223, 682-694 Lecture Notes in Computer Science,V2223, 682-694 Lecture Notes in Computer Science,V2223, 682-694 2001 Refereed English Disclose to all
永持 仁 永持 仁 永持 仁 A primal-dual approximation algorithm for the survivable network design problem in hypergraphs, "jointly worked " A primal-dual approximation algorithm for the survivable network design problem in hypergraphs, "jointly worked " A primal-dual approximation algorithm for the survivable network design problem in hypergraphs, "jointly worked " Lecture Notes in Computer Science,V2010, 478-489 Lecture Notes in Computer Science,V2010, 478-489 Lecture Notes in Computer Science,V2010, 478-489 2001 Refereed English Disclose to all
永持 仁 永持 仁 永持 仁 A 2-approximation algorithm for the multi-vehicle scheduling on a path with release and handling times, "jointly worked " A 2-approximation algorithm for the multi-vehicle scheduling on a path with release and handling times, "jointly worked " A 2-approximation algorithm for the multi-vehicle scheduling on a path with release and handling times, "jointly worked " Lecture Notes in Computer Science,V 2161, 218-229 Lecture Notes in Computer Science,V 2161, 218-229 Lecture Notes in Computer Science,V 2161, 218-229 2001 Refereed English Disclose to all
ASANO Tetsuo, FUJIKAWA Naoki, KATOH Naoki, Matsui Tomomi, NAGAMOCHI Hiroshi, OBOKATA Koji, TOKUYAMA Takeshi ASANO Tetsuo, FUJIKAWA Naoki, KATOH Naoki, Matsui Tomomi, NAGAMOCHI Hiroshi, OBOKATA Koji, TOKUYAMA Takeshi ASANO Tetsuo, FUJIKAWA Naoki, KATOH Naoki, Matsui Tomomi, NAGAMOCHI Hiroshi, OBOKATA Koji, TOKUYAMA Takeshi Digital Halftoning: Its Computational Complexity and Approximation Algorithms Based on Network Flow Digital Halftoning: Its Computational Complexity and Approximation Algorithms Based on Network Flow Digital Halftoning: Its Computational Complexity and Approximation Algorithms Based on Network Flow Proceedings of the 6th KOREA-JAPAN Joint Workshop on Algorithms and Computation, 21 Proceedings of the 6th KOREA-JAPAN Joint Workshop on Algorithms and Computation, 21 Proceedings of the 6th KOREA-JAPAN Joint Workshop on Algorithms and Computation, 21 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
L Zhao, H Nagamochi, T Ibaraki L Zhao, H Nagamochi, T Ibaraki L Zhao, H Nagamochi, T Ibaraki A unified framework for approximating multiway partition problems - (Extended abstract) A unified framework for approximating multiway partition problems - (Extended abstract) A unified framework for approximating multiway partition problems - (Extended abstract) ALGORITHMS AND COMPUTATION, PROCEEDINGS, 2223, 682-694 ALGORITHMS AND COMPUTATION, PROCEEDINGS, 2223, 682-694 ALGORITHMS AND COMPUTATION, PROCEEDINGS, 2223, 682-694 2001 Refereed English Research paper(scientific journal) 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
H Nagamochi, T Ibaraki H Nagamochi, T 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 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/12 Refereed English Research paper(scientific journal) Disclose to all
H Nagamochi, T Ibaraki H Nagamochi, T 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 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/12 Refereed English Research paper(scientific journal) Disclose to all
H Nagamochi, T Ibaraki H Nagamochi, T Ibaraki H Nagamochi, T Ibaraki A fast algorithm for computing minimum 3-way and 4-way cuts A fast algorithm for computing minimum 3-way and 4-way cuts A fast algorithm for computing minimum 3-way and 4-way cuts MATHEMATICAL PROGRAMMING, 88, 3, 507-520 MATHEMATICAL PROGRAMMING, 88, 3, 507-520 MATHEMATICAL PROGRAMMING, 88, 3, 507-520 2000/09 Refereed English Research paper(scientific journal) Disclose to all
H Nagamochi, Y Nakao, T Ibaraki H Nagamochi, Y Nakao, T Ibaraki H Nagamochi, Y Nakao, T Ibaraki A fast algorithm for cactus representations of minimum cuts A fast algorithm for cactus representations of minimum cuts A fast algorithm for cactus representations of minimum cuts JAPAN JOURNAL OF INDUSTRIAL AND APPLIED MATHEMATICS, 17, 2, 245-264 JAPAN JOURNAL OF INDUSTRIAL AND APPLIED MATHEMATICS, 17, 2, 245-264 JAPAN JOURNAL OF INDUSTRIAL AND APPLIED MATHEMATICS, 17, 2, 245-264 2000/06 Refereed English Research paper(scientific journal) Disclose to all
H Nagamochi, S Katayama, T Ibaraki H Nagamochi, S Katayama, T Ibaraki H Nagamochi, S Katayama, T Ibaraki A faster algorithm for computing minimum 5-way and 6-way cuts in graphs A faster algorithm for computing minimum 5-way and 6-way cuts in graphs A faster algorithm for computing minimum 5-way and 6-way cuts in graphs JOURNAL OF COMBINATORIAL OPTIMIZATION, 4, 2, 151-169 JOURNAL OF COMBINATORIAL OPTIMIZATION, 4, 2, 151-169 JOURNAL OF COMBINATORIAL OPTIMIZATION, 4, 2, 151-169 2000/06 Refereed English Research paper(scientific journal) Disclose to all
H Nagamochi, S Katayama, T Ibaraki H Nagamochi, S Katayama, T Ibaraki H Nagamochi, S Katayama, T Ibaraki A faster algorithm for computing minimum 5-way and 6-way cuts in graphs A faster algorithm for computing minimum 5-way and 6-way cuts in graphs A faster algorithm for computing minimum 5-way and 6-way cuts in graphs JOURNAL OF COMBINATORIAL OPTIMIZATION, 4, 2, 151-169 JOURNAL OF COMBINATORIAL OPTIMIZATION, 4, 2, 151-169 JOURNAL OF COMBINATORIAL OPTIMIZATION, 4, 2, 151-169 2000/06 Refereed English Research paper(scientific journal) Disclose to all
XT Deng, T Ibaraki, H Nagamochi, WN Zang XT Deng, T Ibaraki, H Nagamochi, WN Zang XT Deng, T Ibaraki, H Nagamochi, WN Zang Totally balanced combinatorial optimization games Totally balanced combinatorial optimization games Totally balanced combinatorial optimization games MATHEMATICAL PROGRAMMING, 87, 3, 441-452 MATHEMATICAL PROGRAMMING, 87, 3, 441-452 MATHEMATICAL PROGRAMMING, 87, 3, 441-452 2000/05 Refereed English Research paper(scientific journal) Disclose to all
XT Deng, T Ibaraki, H Nagamochi, WN Zang XT Deng, T Ibaraki, H Nagamochi, WN Zang XT Deng, T Ibaraki, H Nagamochi, WN Zang Totally balanced combinatorial optimization games Totally balanced combinatorial optimization games Totally balanced combinatorial optimization games MATHEMATICAL PROGRAMMING, 87, 3, 441-452 MATHEMATICAL PROGRAMMING, 87, 3, 441-452 MATHEMATICAL PROGRAMMING, 87, 3, 441-452 2000/05 Refereed English Research paper(scientific journal) Disclose to all
H Nagamochi, K Seki, T Ibaraki H Nagamochi, K Seki, T Ibaraki H Nagamochi, K Seki, T Ibaraki A 7/3-approximation for the minimum weight 3-connected spanning subgraph problem A 7/3-approximation for the minimum weight 3-connected spanning subgraph problem A 7/3-approximation for the minimum weight 3-connected spanning subgraph problem IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, E83A, 4, 687-691 IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, E83A, 4, 687-691 IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, E83A, 4, 687-691 2000/04 Refereed English Research paper(scientific journal) Disclose to all
H Nagamochi H Nagamochi H Nagamochi Recent development of graph connectivity augmentation algorithms Recent development of graph connectivity augmentation algorithms Recent development of graph connectivity augmentation algorithms IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, E83D, 3, 372-383 IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, E83D, 3, 372-383 IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, E83D, 3, 372-383 2000/03 Refereed English Research paper(scientific journal) Disclose to all
T. Ishii, H. Nagamochi, T. Baraki T. Ishii, H. Nagamochi, T. Baraki T. Ishii, H. Nagamochi, T. Baraki Optimal Augmentation of a 2-Vertex-Connected Multigraph to an ℓ-Edge-Connected and 3-Vertex-Connected Multigraph Optimal Augmentation of a 2-Vertex-Connected Multigraph to an ℓ-Edge-Connected and 3-Vertex-Connected Multigraph Optimal Augmentation of a 2-Vertex-Connected Multigraph to an ℓ-Edge-Connected and 3-Vertex-Connected Multigraph Journal of Combinatorial Optimization, 4, 1, 35-77 Journal of Combinatorial Optimization, 4, 1, 35-77 Journal of Combinatorial Optimization, 4, 1, 35-77 2000/03 Refereed English Disclose to all
T Ishii, H Nagamochi, T Ibaraki T Ishii, H Nagamochi, T Ibaraki T Ishii, H Nagamochi, T Ibaraki Optimal augmentation of a 2-vertex-connected multigraph to an l-edge-connected and 3-vertex-connected multigraph Optimal augmentation of a 2-vertex-connected multigraph to an l-edge-connected and 3-vertex-connected multigraph Optimal augmentation of a 2-vertex-connected multigraph to an l-edge-connected and 3-vertex-connected multigraph JOURNAL OF COMBINATORIAL OPTIMIZATION, 4, 1, 35-77 JOURNAL OF COMBINATORIAL OPTIMIZATION, 4, 1, 35-77 JOURNAL OF COMBINATORIAL OPTIMIZATION, 4, 1, 35-77 2000/03 Refereed English Research paper(scientific journal) 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 Mathematical Programming, Series B, 88, 3, 507-520 Mathematical Programming, Series B, 88, 3, 507-520 Mathematical Programming, Series B, 88, 3, 507-520 2000 Refereed English Research paper(scientific journal) Disclose to all
H Nagamochi, S Nakamura, T Ibaraki H Nagamochi, S Nakamura, T Ibaraki H Nagamochi, S Nakamura, T Ibaraki A simplified (O)over-tilde(nm) time edge-splitting algorithm in undirected graphs A simplified (O)over-tilde(nm) time edge-splitting algorithm in undirected graphs A simplified (O)over-tilde(nm) time edge-splitting algorithm in undirected graphs ALGORITHMICA, 26, 1, 50-67 ALGORITHMICA, 26, 1, 50-67 ALGORITHMICA, 26, 1, 50-67 2000/01 Refereed English Research paper(scientific journal) Disclose to all
永持 仁 永持 仁 永持 仁 Simultaneous augmentation of two graphs to an l-edge-connected graph and a biconnected graph, "jointly worked " Simultaneous augmentation of two graphs to an l-edge-connected graph and a biconnected graph, "jointly worked " Simultaneous augmentation of two graphs to an l-edge-connected graph and a biconnected graph, "jointly worked " Lecture Notes in Computer Science,V1969, 326-337 Lecture Notes in Computer Science,V1969, 326-337 Lecture Notes in Computer Science,V1969, 326-337 2000 Refereed English Disclose to all
H Nagamochi, S Nakamura, T Ibaraki Hiroshi Nagamochi, S. Nakamura, Toshihide Ibaraki H Nagamochi, S Nakamura, T Ibaraki A simplified (O)over-tilde(nm) time edge-splitting algorithm in undirected graphs A Simplified Õ(nm) Time Edge-Splitting Algorithm in Undirected Graphs. A simplified (O)over-tilde(nm) time edge-splitting algorithm in undirected graphs ALGORITHMICA, 26, 1, 50-67 Algorithmica, 26, 1, 50-67 ALGORITHMICA, 26, 1, 50-67 2000/01 Refereed English Research paper(scientific journal) Disclose to all
H Nagamochi, T Jordan, Y Nakao, T Ibaraki H Nagamochi, T Jordan, Y Nakao, T Ibaraki H Nagamochi, T Jordan, Y Nakao, T Ibaraki Bisecting two subsets in 3-connected graphs Bisecting two subsets in 3-connected graphs Bisecting two subsets in 3-connected graphs ALGORITHMS AND COMPUTATIONS, 1741, 425-434 ALGORITHMS AND COMPUTATIONS, 1741, 425-434 ALGORITHMS AND COMPUTATIONS, 1741, 425-434 2000 Refereed English Research paper(scientific journal) Disclose to all
H Nagamochi, T Ibaraki H Nagamochi, T Ibaraki H Nagamochi, T Ibaraki An approximation of the minimum vertex cover in a graph An approximation of the minimum vertex cover in a graph An approximation of the minimum vertex cover in a graph JAPAN JOURNAL OF INDUSTRIAL AND APPLIED MATHEMATICS, 16, 3, 369-375 JAPAN JOURNAL OF INDUSTRIAL AND APPLIED MATHEMATICS, 16, 3, 369-375 JAPAN JOURNAL OF INDUSTRIAL AND APPLIED MATHEMATICS, 16, 3, 369-375 1999/10 Refereed English Research paper(scientific journal) Disclose to all
H Nagamochi, T Ishii, T Ibaraki H Nagamochi, T Ishii, T Ibaraki H Nagamochi, T Ishii, T Ibaraki A simple proof of a minimum cut algorithm and its applications A simple proof of a minimum cut algorithm and its applications A simple proof of a minimum cut algorithm and its applications IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, E82A, 10, 2231-2236 IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, E82A, 10, 2231-2236 IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, E82A, 10, 2231-2236 1999/10 Refereed English Research paper(scientific journal) Disclose to all
XT Deng, T Ibaraki, H Nagamochi XT Deng, T Ibaraki, H Nagamochi XT Deng, T Ibaraki, H 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 MATHEMATICS OF OPERATIONS RESEARCH, 24, 3, 751-766 MATHEMATICS OF OPERATIONS RESEARCH, 24, 3, 751-766 MATHEMATICS OF OPERATIONS RESEARCH, 24, 3, 751-766 1999/08 Refereed English Research paper(scientific journal) Disclose to all
XT Deng, T Ibaraki, H Nagamochi XT Deng, T Ibaraki, H Nagamochi XT Deng, T Ibaraki, H 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 MATHEMATICS OF OPERATIONS RESEARCH, 24, 3, 751-766 MATHEMATICS OF OPERATIONS RESEARCH, 24, 3, 751-766 MATHEMATICS OF OPERATIONS RESEARCH, 24, 3, 751-766 1999/08 Refereed English Research paper(scientific journal) Disclose to all
M Kato, R Kawakita, H Nagamochi, Y Oie M Kato, R Kawakita, H Nagamochi, Y Oie M Kato, R Kawakita, H Nagamochi, Y Oie A reconfigurative algorithm for torus lightwave networks A reconfigurative algorithm for torus lightwave networks A reconfigurative algorithm for torus lightwave networks ELECTRONICS AND COMMUNICATIONS IN JAPAN PART I-COMMUNICATIONS, 82, 6, 34-44 ELECTRONICS AND COMMUNICATIONS IN JAPAN PART I-COMMUNICATIONS, 82, 6, 34-44 ELECTRONICS AND COMMUNICATIONS IN JAPAN PART I-COMMUNICATIONS, 82, 6, 34-44 1999/06 Refereed English Research paper(scientific journal) Disclose to all
H Nagamochi, T Ibaraki H Nagamochi, T Ibaraki H Nagamochi, T Ibaraki Augmenting edge-connectivity over the entire range in (O)over-tilde(nm) time Augmenting edge-connectivity over the entire range in (O)over-tilde(nm) time Augmenting edge-connectivity over the entire range in (O)over-tilde(nm) time JOURNAL OF ALGORITHMS, 30, 2, 253-301 JOURNAL OF ALGORITHMS, 30, 2, 253-301 JOURNAL OF ALGORITHMS, 30, 2, 253-301 1999/02 Refereed English Research paper(scientific journal) Disclose to all
H Nagamochi, T Ibaraki Hiroshi Nagamochi, Toshihide Ibaraki H Nagamochi, T Ibaraki Augmenting edge-connectivity over the entire range in (O)over-tilde(nm) time Augmenting Edge-Connectivity over the Entire Range in Õ(nm) Time. Augmenting edge-connectivity over the entire range in (O)over-tilde(nm) time JOURNAL OF ALGORITHMS, 30, 2, 253-301 J. Algorithms, 30, 2, 253-301 JOURNAL OF ALGORITHMS, 30, 2, 253-301 1999/02 Refereed English Research paper(scientific journal) 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 Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 1741, 373-382 Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 1741, 373-382 Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 1741, 373-382 1999 Refereed English Research paper(international conference proceedings) Disclose to all
P. Eades, Q. Feng, Hiroshi Nagamochi Peter Eades, Qing-Wen Feng, Hiroshi Nagamochi P. Eades, Q. Feng, 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
永持 仁 永持 仁 永持 仁 Drawing clustered graphs on an orthogonal grid, "jointly worked " Drawing clustered graphs on an orthogonal grid, "jointly worked " Drawing clustered graphs on an orthogonal grid, "jointly worked " Journal of Graph Algorithms and Application,3/4, 3-29 Journal of Graph Algorithms and Application,3/4, 3-29 Journal of Graph Algorithms and Application,3/4, 3-29 1999 Refereed English Disclose to all
Hiroshi Nagamochi, Toshihide Ibaraki Hiroshi Nagamochi, Toshihide Ibaraki Hiroshi Nagamochi, Toshihide Ibaraki An approximation for finding a smallest 2-edge-connected subgraph containing a specified spanning tree An approximation for finding a smallest 2-edge-connected subgraph containing a specified spanning tree An approximation for finding a smallest 2-edge-connected subgraph containing a specified spanning tree Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 1627, 31-40 Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 1627, 31-40 Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 1627, 31-40 1999 Refereed English Research paper(international conference proceedings) 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 Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 1627, 164-173 Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 1627, 164-173 Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 1627, 164-173 1999 Refereed English Research paper(international conference proceedings) Disclose to all
T Ishii, H Nagamochi, T Ibaraki T Ishii, H Nagamochi, T Ibaraki T Ishii, H Nagamochi, T Ibaraki Augmentin a (k-1)-vertex-connected multigraph to an l-edge-connected and k-vertex-connected multigraph Augmentin a (k-1)-vertex-connected multigraph to an l-edge-connected and k-vertex-connected multigraph Augmentin a (k-1)-vertex-connected multigraph to an l-edge-connected and k-vertex-connected multigraph ALGORITHMS - ESA'99, 1643, 414-425 ALGORITHMS - ESA'99, 1643, 414-425 ALGORITHMS - ESA'99, 1643, 414-425 1999 Refereed English Research paper(scientific journal) Disclose to all
T Ishii, H Nagamochi, T Ibaraki T Ishii, H Nagamochi, T Ibaraki T Ishii, H Nagamochi, T Ibaraki Augmentin a (k-1)-vertex-connected multigraph to an l-edge-connected and k-vertex-connected multigraph Augmentin a (k-1)-vertex-connected multigraph to an l-edge-connected and k-vertex-connected multigraph Augmentin a (k-1)-vertex-connected multigraph to an l-edge-connected and k-vertex-connected multigraph ALGORITHMS - ESA'99, 1643, 414-425 ALGORITHMS - ESA'99, 1643, 414-425 ALGORITHMS - ESA'99, 1643, 414-425 1999 Refereed English Research paper(scientific journal) Disclose to all
A Frank, T Ibaraki, H Nagamochi A Frank, T Ibaraki, H Nagamochi A Frank, T Ibaraki, H Nagamochi Two arc-disjoint paths in Eulerian digraphs Two arc-disjoint paths in Eulerian digraphs Two arc-disjoint paths in Eulerian digraphs SIAM JOURNAL ON DISCRETE MATHEMATICS, 11, 4, 557-589 SIAM JOURNAL ON DISCRETE MATHEMATICS, 11, 4, 557-589 SIAM JOURNAL ON DISCRETE MATHEMATICS, 11, 4, 557-589 1998/11 Refereed English Research paper(scientific journal) Disclose to all
A Frank, T Ibaraki, H Nagamochi A Frank, T Ibaraki, H Nagamochi A Frank, T Ibaraki, H Nagamochi Two arc-disjoint paths in Eulerian digraphs Two arc-disjoint paths in Eulerian digraphs Two arc-disjoint paths in Eulerian digraphs SIAM JOURNAL ON DISCRETE MATHEMATICS, 11, 4, 557-589 SIAM JOURNAL ON DISCRETE MATHEMATICS, 11, 4, 557-589 SIAM JOURNAL ON DISCRETE MATHEMATICS, 11, 4, 557-589 1998/11 Refereed English Research paper(scientific journal) Disclose to all
H Nagamochi, T Ibaraki H Nagamochi, T Ibaraki H Nagamochi, T Ibaraki A note on minimizing submodular functions A note on minimizing submodular functions A note on minimizing submodular functions INFORMATION PROCESSING LETTERS, 67, 5, 239-244 INFORMATION PROCESSING LETTERS, 67, 5, 239-244 INFORMATION PROCESSING LETTERS, 67, 5, 239-244 1998/09 Refereed English Research paper(scientific journal) Disclose to all
H Nagamochi, T Ibaraki H Nagamochi, T Ibaraki H Nagamochi, T Ibaraki A note on minimizing submodular functions A note on minimizing submodular functions A note on minimizing submodular functions INFORMATION PROCESSING LETTERS, 67, 5, 239-244 INFORMATION PROCESSING LETTERS, 67, 5, 239-244 INFORMATION PROCESSING LETTERS, 67, 5, 239-244 1998/09 Refereed English Research paper(scientific journal) 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, 村田真紀, 茨木俊秀 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 , 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 Hasunuma, H Nagamochi T Hasunuma, H Nagamochi T Hasunuma, H Nagamochi Independent spanning trees with small depths in iterated line digraphs Independent spanning trees with small depths in iterated line digraphs Independent spanning trees with small depths in iterated line digraphs PROCEEDINGS OF THE 4TH AUSTRALASIAN THEORY SYMPOSIUM, CATS'98, 20, 3, 21-35 PROCEEDINGS OF THE 4TH AUSTRALASIAN THEORY SYMPOSIUM, CATS'98, 20, 3, 21-35 PROCEEDINGS OF THE 4TH AUSTRALASIAN THEORY SYMPOSIUM, CATS'98, 20, 3, 21-35 1998 Refereed English Research paper(international conference proceedings) Disclose to all
H Nagamochi, T Hasunuma H Nagamochi, T Hasunuma H Nagamochi, T Hasunuma An efficient NC algorithm for a sparse k-edge-connectivity certificate An efficient NC algorithm for a sparse k-edge-connectivity certificate An efficient NC algorithm for a sparse k-edge-connectivity certificate ALGORITHMS AND COMPUTATIONS, 1533, 447-456 ALGORITHMS AND COMPUTATIONS, 1533, 447-456 ALGORITHMS AND COMPUTATIONS, 1533, 447-456 1998 Refereed English Research paper(scientific journal) Disclose to all
H Nagamochi, T Ibaraki H Nagamochi, T 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 ALGORITHMS AND COMPUTATIONS, 1533, 169-178 ALGORITHMS AND COMPUTATIONS, 1533, 169-178 ALGORITHMS AND COMPUTATIONS, 1533, 169-178 1998 Refereed English Research paper(scientific journal) Disclose to all
T Ishii, H Nagamochi, T Ibaraki T Ishii, H Nagamochi, T Ibaraki T Ishii, H Nagamochi, T Ibaraki k-edge and 3-vertex connectivity augmentation in an arbitrary multigraph k-edge and 3-vertex connectivity augmentation in an arbitrary multigraph k-edge and 3-vertex connectivity augmentation in an arbitrary multigraph ALGORITHMS AND COMPUTATIONS, 1533, 159-168 ALGORITHMS AND COMPUTATIONS, 1533, 159-168 ALGORITHMS AND COMPUTATIONS, 1533, 159-168 1998 Refereed English Research paper(scientific journal) Disclose to all
H Nagamochi, P Eades H Nagamochi, P Eades H Nagamochi, P Eades 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, 1412, 96-111 INTEGER PROGRAMMING AND COMBINATORIAL OPTIMIZATION, 1412, 96-111 1998 Refereed English Research paper(scientific journal) Disclose to all
T Ibaraki, AV Karzanov, H Nagamochi T Ibaraki, AV Karzanov, H Nagamochi T Ibaraki, AV 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 Research paper(scientific journal) 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
H Nagamochi, K Mochizuki, T Ibaraki H Nagamochi, K Mochizuki, T Ibaraki H Nagamochi, K Mochizuki, T Ibaraki Complexity of the single vehicle scheduling problem on graphs Complexity of the single vehicle scheduling problem on graphs Complexity of the single vehicle scheduling problem on graphs INFOR, 35, 4, 256-276 INFOR, 35, 4, 256-276 INFOR, 35, 4, 256-276 1997/11 Refereed English Research paper(scientific journal) Disclose to all
嘉藤学, 河北隆二, 永持仁, 尾家祐二 嘉藤学, 河北隆二, 永持仁, 尾家祐二 格子型光波ネットワークの再構成アルゴリズムについて 格子型光波ネットワークの再構成アルゴリズムについて 電子情報通信学会論文誌 B-1, J80-B-1, 10, 709-718 電子情報通信学会論文誌 B-1, J80-B-1, 10, 709-718 , J80-B-1, 10, 709-718 1997/10 Refereed Japanese Disclose to all
H Nagamochi, K Nishimura, T Ibaraki H Nagamochi, K Nishimura, T Ibaraki H Nagamochi, K Nishimura, T Ibaraki Computing all small cuts in an undirected network Computing all small cuts in an undirected network Computing all small cuts in an undirected network SIAM JOURNAL ON DISCRETE MATHEMATICS, 10, 3, 469-481 SIAM JOURNAL ON DISCRETE MATHEMATICS, 10, 3, 469-481 SIAM JOURNAL ON DISCRETE MATHEMATICS, 10, 3, 469-481 1997/08 Refereed English Research paper(scientific journal) Disclose to all
H Nagamochi, K Nishimura, T Ibaraki H Nagamochi, K Nishimura, T Ibaraki H Nagamochi, K Nishimura, T Ibaraki Computing all small cuts in an undirected network Computing all small cuts in an undirected network Computing all small cuts in an undirected network SIAM JOURNAL ON DISCRETE MATHEMATICS, 10, 3, 469-481 SIAM JOURNAL ON DISCRETE MATHEMATICS, 10, 3, 469-481 SIAM JOURNAL ON DISCRETE MATHEMATICS, 10, 3, 469-481 1997/08 Refereed English Research paper(scientific journal) Disclose to all
H Nagamochi, DZ Zeng, N Kabutoya, T Ibaraki H Nagamochi, DZ Zeng, N Kabutoya, T Ibaraki H Nagamochi, DZ Zeng, N Kabutoya, T 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 MATHEMATICS OF OPERATIONS RESEARCH, 22, 1, 146-164 MATHEMATICS OF OPERATIONS RESEARCH, 22, 1, 146-164 MATHEMATICS OF OPERATIONS RESEARCH, 22, 1, 146-164 1997/02 Refereed English Research paper(scientific journal) Disclose to all
H Nagamochi, DZ Zeng, N Kabutoya, T Ibaraki H Nagamochi, DZ Zeng, N Kabutoya, T Ibaraki H Nagamochi, DZ Zeng, N Kabutoya, T 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 MATHEMATICS OF OPERATIONS RESEARCH, 22, 1, 146-164 MATHEMATICS OF OPERATIONS RESEARCH, 22, 1, 146-164 MATHEMATICS OF OPERATIONS RESEARCH, 22, 1, 146-164 1997/02 Refereed English Research paper(scientific journal) Disclose to all
H Nagamochi, T Ibaraki Hiroshi Nagamochi, Toshihide Ibaraki H Nagamochi, T Ibaraki Deterministic (O)over-tilde(nm) time edge-splitting in undirected graphs Deterministic Õ(nm) Time Edge-Splitting in Undirected Graphs. Deterministic (O)over-tilde(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 Research paper(scientific journal) Disclose to all
Toshimasa, I, H Nagamochi, Toshihide, I Toshimasa, I, H Nagamochi, Toshihide, I Toshimasa, I, H Nagamochi, Toshihide, I Augmenting edge and vertex connectivities simultaneously Augmenting edge and vertex connectivities simultaneously Augmenting edge and vertex connectivities simultaneously ALGORITHMS AND COMPUTATION, PROCEEDINGS, 1350, 102-111 ALGORITHMS AND COMPUTATION, PROCEEDINGS, 1350, 102-111 ALGORITHMS AND COMPUTATION, PROCEEDINGS, 1350, 102-111 1997 Refereed English Research paper(scientific journal) Disclose to all
Y Karuno, H Nagamochi, T Ibaraki Y Karuno, H Nagamochi, T Ibaraki Y Karuno, H Nagamochi, T Ibaraki Vehicle scheduling on a tree with release and handling times Vehicle scheduling on a tree with release and handling times Vehicle scheduling on a tree with release and handling times ANNALS OF OPERATIONS RESEARCH, 69, 193-207 ANNALS OF OPERATIONS RESEARCH, 69, 193-207 ANNALS OF OPERATIONS RESEARCH, 69, 193-207 1997 Refereed English Research paper(scientific journal) Disclose to all
H Nagamochi, T Shiraki, T Ibaraki Hiroshi Nagamochi, Takashi Shiraki, Toshihide Ibaraki H Nagamochi, T Shiraki, T Ibaraki Computing edge-connectivity augmentation function in (O)over-tilde-(nm) time Computing Edge-Connectivity Augmentation Function in Õ(nm) Time. Computing edge-connectivity augmentation function in (O)over-tilde-(nm) time PROCEEDINGS OF THE EIGHTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 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, 649-658 1997 Refereed English Research paper(international conference proceedings) Disclose to all
Y Karuno, H Nagamochi, T Ibaraki Y Karuno, H Nagamochi, T Ibaraki Y Karuno, H Nagamochi, T Ibaraki Vehicle scheduling on a tree to minimize maximum lateness Vehicle scheduling on a tree to minimize maximum lateness Vehicle scheduling on a tree to minimize maximum lateness JOURNAL OF THE OPERATIONS RESEARCH SOCIETY OF JAPAN, 39, 3, 345-355 JOURNAL OF THE OPERATIONS RESEARCH SOCIETY OF JAPAN, 39, 3, 345-355 JOURNAL OF THE OPERATIONS RESEARCH SOCIETY OF JAPAN, 39, 3, 345-355 1996/09 Refereed English Research paper(scientific journal) Disclose to all
H Nagamochi, T Kameda H Nagamochi, T Kameda H Nagamochi, T Kameda Constructing cactus representation for all minimum cuts in an undirected network Constructing cactus representation for all minimum cuts in an undirected network Constructing cactus representation for all minimum cuts in an undirected network JOURNAL OF THE OPERATIONS RESEARCH SOCIETY OF JAPAN, 39, 2, 135-158 JOURNAL OF THE OPERATIONS RESEARCH SOCIETY OF JAPAN, 39, 2, 135-158 JOURNAL OF THE OPERATIONS RESEARCH SOCIETY OF JAPAN, 39, 2, 135-158 1996/06 Refereed English Research paper(scientific journal) Disclose to all
KARUNO Y, NAGAMOCHI H, IBARAKI T KARUNO Y, NAGAMOCHI H, IBARAKI T KARUNO Y, NAGAMOCHI H, IBARAKI T Computational Complexity of the Traveling Salesman Problem on a Line with Deadlines and General Handling Times. Computational Complexity of the Traveling Salesman Problem on a Line with Deadlines and General Handling Times. Computational Complexity of the Traveling Salesman Problem on a Line with Deadlines and General Handling Times. Mem Fac Eng Des Kyoto Inst Technol Ser Sci Technol, 45, 19-22 Mem Fac Eng Des Kyoto Inst Technol Ser Sci Technol, 45, 19-22 Mem Fac Eng Des Kyoto Inst Technol Ser Sci Technol, 45, 19-22 1996 Refereed English 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
T IBARAKI, H NAGAMOCHI, T KAMEDA T IBARAKI, H NAGAMOCHI, T KAMEDA T IBARAKI, H NAGAMOCHI, T KAMEDA OPTIMAL COTERIES FOR RINGS AND RELATED NETWORKS OPTIMAL COTERIES FOR RINGS AND RELATED NETWORKS 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/06 Refereed English Research paper(scientific journal) Disclose to all
T IBARAKI, H NAGAMOCHI, T KAMEDA T IBARAKI, H NAGAMOCHI, T KAMEDA T IBARAKI, H NAGAMOCHI, T KAMEDA OPTIMAL COTERIES FOR RINGS AND RELATED NETWORKS OPTIMAL COTERIES FOR RINGS AND RELATED NETWORKS 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/06 Refereed English Research paper(scientific journal) Disclose to all
永持 仁 永持 仁 サブツアー交換交叉に対する2つのコメント(共著) サブツアー交換交叉に対する2つのコメント(共著) 人工知能学会論文誌,10/3, 464-467 人工知能学会論文誌,10/3, 464-467 1995 Refereed Japanese Disclose to all
永持 仁 永持 仁 永持 仁 Two arc-disjoint paths in Eulerian digraphs, "jointly worked " Two arc-disjoint paths in Eulerian digraphs, "jointly worked " Two arc-disjoint paths in Eulerian digraphs, "jointly worked " Lecture Notes in Computer Science,V1004, 92-101 Lecture Notes in Computer Science,V1004, 92-101 Lecture Notes in Computer Science,V1004, 92-101 1995 Refereed English 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
H NAGAMOCHI, T ONO, T IBARAKI H NAGAMOCHI, T ONO, T IBARAKI H NAGAMOCHI, T ONO, T IBARAKI IMPLEMENTING AN EFFICIENT MINIMUM CAPACITY CUT ALGORITHM IMPLEMENTING AN EFFICIENT MINIMUM CAPACITY CUT ALGORITHM IMPLEMENTING AN EFFICIENT MINIMUM CAPACITY CUT ALGORITHM MATHEMATICAL PROGRAMMING, 67, 3, 325-341 MATHEMATICAL PROGRAMMING, 67, 3, 325-341 MATHEMATICAL PROGRAMMING, 67, 3, 325-341 1994/12 Refereed English Research paper(scientific journal) Disclose to all
H HARADA, Z SUN, H NAGAMOCHI H HARADA, Z SUN, H NAGAMOCHI H HARADA, Z SUN, H 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/12 Refereed English Research paper(scientific journal) Disclose to all
H HARADA, Z SUN, H NAGAMOCHI H HARADA, Z SUN, H NAGAMOCHI H HARADA, Z SUN, H 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/12 Refereed English Research paper(scientific journal) Disclose to all
H NAGAMOCHI, T ONO, T IBARAKI H NAGAMOCHI, T ONO, T IBARAKI H NAGAMOCHI, T ONO, T IBARAKI IMPLEMENTING AN EFFICIENT MINIMUM CAPACITY CUT ALGORITHM IMPLEMENTING AN EFFICIENT MINIMUM CAPACITY CUT ALGORITHM IMPLEMENTING AN EFFICIENT MINIMUM CAPACITY CUT ALGORITHM MATHEMATICAL PROGRAMMING, 67, 3, 325-341 MATHEMATICAL PROGRAMMING, 67, 3, 325-341 MATHEMATICAL PROGRAMMING, 67, 3, 325-341 1994/12 Refereed English Research paper(scientific journal) Disclose to all
Hiroshi Nagamochi, Tiko Kameda Hiroshi Nagamochi, Tiko Kameda Hiroshi Nagamochi, Tiko Kameda Canonical cactus representation for minimum cuts Canonical cactus representation for minimum cuts Canonical cactus representation for minimum cuts Japan Journal of Industrial and Applied Mathematics, 11, 3, 343-361 Japan Journal of Industrial and Applied Mathematics, 11, 3, 343-361 Japan Journal of Industrial and Applied Mathematics, 11, 3, 343-361 1994/10 Refereed English Research paper(scientific journal) Disclose to all
永持 仁 永持 仁 永持 仁 Computing all small cuts in undirected networks, "jointly worked " Computing all small cuts in undirected networks, "jointly worked " Computing all small cuts in undirected networks, "jointly worked " Lecture Notes in Computer Science,V834, 190-198 Lecture Notes in Computer Science,V834, 190-198 Lecture Notes in Computer Science,V834, 190-198 1994 Refereed English 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
A FRANK, T IBARAKI, H NAGAMOCHI A FRANK, T IBARAKI, H NAGAMOCHI A FRANK, T IBARAKI, H 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/07 Refereed English Research paper(scientific journal) Disclose to all
A FRANK, T IBARAKI, H NAGAMOCHI A FRANK, T IBARAKI, H NAGAMOCHI A FRANK, T IBARAKI, H 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/07 Refereed English Research paper(scientific journal) Disclose to all
H NAGAMOCHI, T WATANABE H NAGAMOCHI, T WATANABE H NAGAMOCHI, T WATANABE COMPUTING K-EDGE-CONNECTED COMPONENTS OF A MULTIGRAPH COMPUTING K-EDGE-CONNECTED COMPONENTS OF A MULTIGRAPH COMPUTING K-EDGE-CONNECTED COMPONENTS OF A MULTIGRAPH IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, E76A, 4, 513-517 IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, E76A, 4, 513-517 IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, E76A, 4, 513-517 1993/04 Refereed English Research paper(scientific journal) Disclose to all
永持 仁 永持 仁 永持 仁 Computing k-edge-connected components in multigraphs, "jointly worked " Computing k-edge-connected components in multigraphs, "jointly worked " Computing k-edge-connected components in multigraphs, "jointly worked " Inst. Electron. Inform. Comm. Eng. Trans,E76-A,/ 4, \t513-517 Inst. Electron. Inform. Comm. Eng. Trans,E76-A,/ 4, \t513-517 Inst. Electron. Inform. Comm. Eng. Trans,E76-A,/ 4, \t513-517 1993 Refereed English 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
H NAGAMOCHI, T IBARAKI H NAGAMOCHI, T IBARAKI H NAGAMOCHI, T IBARAKI ON ONAGAS UPPER BOUND ON THE MEAN-VALUES OF PROBABILISTIC MAXIMUM FLOWS ON ONAGAS UPPER BOUND ON THE MEAN-VALUES OF PROBABILISTIC MAXIMUM FLOWS ON ONAGAS UPPER BOUND ON THE MEAN-VALUES OF PROBABILISTIC MAXIMUM FLOWS IEEE TRANSACTIONS ON RELIABILITY, 41, 2, 225-229 IEEE TRANSACTIONS ON RELIABILITY, 41, 2, 225-229 IEEE TRANSACTIONS ON RELIABILITY, 41, 2, 225-229 1992/06 Refereed English Research paper(scientific journal) Disclose to all
Hiroshi Nagamochi, Toshihide Ibaraki Hiroshi Nagamochi, Toshihide Ibaraki Hiroshi Nagamochi, Toshihide Ibaraki A linear time algorithm for computing 3-edge-connected components in a multigraph A linear time algorithm for computing 3-edge-connected components in a multigraph A linear time algorithm for computing 3-edge-connected components in a multigraph Japan Journal of Industrial and Applied Mathematics, 9, 2, 163-180 Japan Journal of Industrial and Applied Mathematics, 9, 2, 163-180 Japan Journal of Industrial and Applied Mathematics, 9, 2, 163-180 1992/06 Refereed English Research paper(scientific journal) Disclose to all
H NAGAMOCHI, T IBARAKI H NAGAMOCHI, T IBARAKI H NAGAMOCHI, T 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 JOURNAL ON DISCRETE MATHEMATICS, 5, 1, 54-66 SIAM JOURNAL ON DISCRETE MATHEMATICS, 5, 1, 54-66 SIAM JOURNAL ON DISCRETE MATHEMATICS, 5, 1, 54-66 1992/02 Refereed English Research paper(scientific journal) Disclose to all
H NAGAMOCHI, T IBARAKI H NAGAMOCHI, T IBARAKI H NAGAMOCHI, T 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 JOURNAL ON DISCRETE MATHEMATICS, 5, 1, 54-66 SIAM JOURNAL ON DISCRETE MATHEMATICS, 5, 1, 54-66 SIAM JOURNAL ON DISCRETE MATHEMATICS, 5, 1, 54-66 1992/02 Refereed English Research paper(scientific journal) Disclose to all
T IBARAKI, H NAGAMOCHI, T KAMEDA T IBARAKI, H NAGAMOCHI, T KAMEDA T IBARAKI, H NAGAMOCHI, T KAMEDA OPTIMAL COTERIES FOR RINGS AND RELATED NETWORKS OPTIMAL COTERIES FOR RINGS AND RELATED NETWORKS OPTIMAL COTERIES FOR RINGS AND RELATED NETWORKS PROCEEDINGS OF THE 12TH INTERNATIONAL CONFERENCE ON DISTRIBUTED COMPUTING SYSTEMS, 12th, 650-656 PROCEEDINGS OF THE 12TH INTERNATIONAL CONFERENCE ON DISTRIBUTED COMPUTING SYSTEMS, 12th, 650-656 PROCEEDINGS OF THE 12TH INTERNATIONAL CONFERENCE ON DISTRIBUTED COMPUTING SYSTEMS, 12th, 650-656 1992 Refereed English Research paper(international conference proceedings) Disclose to all
H NAGAMOCHI, T IBARAKI H NAGAMOCHI, T IBARAKI H NAGAMOCHI, T 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 English Research paper(scientific journal) Disclose to all
H NAGAMOCHI, T IBARAKI H NAGAMOCHI, T IBARAKI H NAGAMOCHI, T 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 English Research paper(scientific journal) Disclose to all
H NAGAMOCHI, Z SUN, T IBARAKI H NAGAMOCHI, Z SUN, T IBARAKI H NAGAMOCHI, Z SUN, T IBARAKI COUNTING THE NUMBER OF MINIMUM CUTS IN UNDIRECTED MULTIGRAPHS COUNTING THE NUMBER OF MINIMUM CUTS IN UNDIRECTED MULTIGRAPHS COUNTING THE NUMBER OF MINIMUM CUTS IN UNDIRECTED MULTIGRAPHS IEEE TRANSACTIONS ON RELIABILITY, 40, 5, 610-614 IEEE TRANSACTIONS ON RELIABILITY, 40, 5, 610-614 IEEE TRANSACTIONS ON RELIABILITY, 40, 5, 610-614 1991/12 Refereed English Research paper(scientific journal) Disclose to all
H NAGAMOCHI, T IBARAKI H NAGAMOCHI, T IBARAKI H NAGAMOCHI, T 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/10 Refereed English Research paper(scientific journal) Disclose to all
H NAGAMOCHI, T IBARAKI H NAGAMOCHI, T IBARAKI H NAGAMOCHI, T 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/10 Refereed English Research paper(scientific journal) Disclose to all
永持 仁 永持 仁 基数3のカットセット数を最小にする2-辺連結グラフ 基数3のカットセット数を最小にする2-辺連結グラフ 電子情報通信学会論文誌 A 基礎・境界, 73, 7, 1281-1285 電子情報通信学会論文誌 A 基礎・境界, 73, 7, 1281-1285 , 73, 7, 1281-1285 1990/07 Refereed Japanese Disclose to all
H NAGAMOCHI, M FUKUSHIMA, T IBARAKI H NAGAMOCHI, M FUKUSHIMA, T IBARAKI H NAGAMOCHI, M FUKUSHIMA, T 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/07 Refereed English Research paper(scientific journal) Disclose to all
H NAGAMOCHI, M FUKUSHIMA, T IBARAKI H NAGAMOCHI, M FUKUSHIMA, T IBARAKI H NAGAMOCHI, M FUKUSHIMA, T 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/07 Refereed English Research paper(scientific journal) Disclose to all
H NAGAMOCHI, T IBARAKI H NAGAMOCHI, T IBARAKI H NAGAMOCHI, T 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/05 Refereed English Research paper(scientific journal) Disclose to all
H NAGAMOCHI, T IBARAKI H NAGAMOCHI, T IBARAKI H NAGAMOCHI, T 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/05 Refereed English Research paper(scientific journal) Disclose to all
永持 仁 永持 仁 組合せ最適化におけるTardosの新解法 (最近の数理計画特集) 組合せ最適化におけるTardosの新解法 (最近の数理計画特集) システム・制御・情報, 34, 4, 232-240 システム・制御・情報, 34, 4, 232-240 , 34, 4, 232-240 1990/04 Refereed Japanese Disclose to all
永持 仁 永持 仁 永持 仁 Multiple graphs minimizing the number of minimum cut-sets, "jointly worked " Multiple graphs minimizing the number of minimum cut-sets, "jointly worked " Multiple graphs minimizing the number of minimum cut-sets, "jointly worked " Trans. Inst. Electron. Inform. Comm. Eng. Jap,E73/6, 915-921 Trans. Inst. Electron. Inform. Comm. Eng. Jap,E73/6, 915-921 Trans. Inst. Electron. Inform. Comm. Eng. Jap,E73/6, 915-921 1990 Refereed English Disclose to all
永持 仁 永持 仁 永持 仁 Computing the edge-connectivity of multigraphs and capacitated graphs, "jointly worked " Computing the edge-connectivity of multigraphs and capacitated graphs, "jointly worked " Computing the edge-connectivity of multigraphs and capacitated graphs, "jointly worked " Lecture Notes in Computer Science,V450, 12-20 Lecture Notes in Computer Science,V450, 12-20 Lecture Notes in Computer Science,V450, 12-20 1990 Refereed English Disclose to all
H NAGAMOCHI, T IBARAKI H NAGAMOCHI, T IBARAKI H NAGAMOCHI, T 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, 450, 12-20 ALGORITHMS, 450, 12-20 ALGORITHMS, 450, 12-20 1990 Refereed English Research paper(international conference proceedings) Disclose to all
H NAGAMOCHI, T IBARAKI H NAGAMOCHI, T IBARAKI H NAGAMOCHI, T 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 LECTURE NOTES IN COMPUTER SCIENCE, 450, 12-20 LECTURE NOTES IN COMPUTER SCIENCE, 450, 12-20 LECTURE NOTES IN COMPUTER SCIENCE, 450, 12-20 1990 Refereed English Research paper(scientific journal) Disclose to all
永持 仁 永持 仁 与えられた基数のカットセット数を最小にするグラフ 与えられた基数のカットセット数を最小にするグラフ 電子情報通信学会論文誌 A 基礎・境界, 72, 10, 1601-1610 電子情報通信学会論文誌 A 基礎・境界, 72, 10, 1601-1610 , 72, 10, 1601-1610 1989/10 Refereed Japanese Disclose to all
H NAGAMOCHI, T IBARAKI H NAGAMOCHI, T IBARAKI H NAGAMOCHI, T IBARAKI ON MAX-FLOW MIN-CUT AND INTEGRAL FLOW PROPERTIES FOR MULTICOMMODITY FLOWS IN DIRECTED NETWORKS ON MAX-FLOW MIN-CUT AND INTEGRAL FLOW PROPERTIES FOR MULTICOMMODITY FLOWS IN DIRECTED NETWORKS ON MAX-FLOW MIN-CUT AND INTEGRAL FLOW PROPERTIES FOR MULTICOMMODITY FLOWS IN DIRECTED NETWORKS INFORMATION PROCESSING LETTERS, 31, 6, 279-285 INFORMATION PROCESSING LETTERS, 31, 6, 279-285 INFORMATION PROCESSING LETTERS, 31, 6, 279-285 1989/06 Refereed English Research paper(scientific journal) Disclose to all
H NAGAMOCHI, T IBARAKI H NAGAMOCHI, T IBARAKI H NAGAMOCHI, T IBARAKI ON MAX-FLOW MIN-CUT AND INTEGRAL FLOW PROPERTIES FOR MULTICOMMODITY FLOWS IN DIRECTED NETWORKS ON MAX-FLOW MIN-CUT AND INTEGRAL FLOW PROPERTIES FOR MULTICOMMODITY FLOWS IN DIRECTED NETWORKS ON MAX-FLOW MIN-CUT AND INTEGRAL FLOW PROPERTIES FOR MULTICOMMODITY FLOWS IN DIRECTED NETWORKS INFORMATION PROCESSING LETTERS, 31, 6, 279-285 INFORMATION PROCESSING LETTERS, 31, 6, 279-285 INFORMATION PROCESSING LETTERS, 31, 6, 279-285 1989/06 Refereed English Research paper(scientific journal) Disclose to all
Hiroshi Nagamochi, Toshihide Ibaraki Hiroshi Nagamochi, Toshihide Ibaraki Hiroshi Nagamochi, Toshihide Ibaraki Max‐flow min‐cut theorem for the multicommodity flows in certain planar directed networks Max‐flow min‐cut theorem for the multicommodity flows in certain planar directed networks Max‐flow min‐cut theorem for the multicommodity flows in certain planar directed networks Electronics and Communications in Japan (Part III: Fundamental Electronic Science), 72, 3, 58-72 Electronics and Communications in Japan (Part III: Fundamental Electronic Science), 72, 3, 58-72 Electronics and Communications in Japan (Part III: Fundamental Electronic Science), 72, 3, 58-72 1989 Refereed English Research paper(scientific journal) Disclose to all
永持 仁 永持 仁 ある種の平面有向ネットワーク上の多品種流問題に対する最大流ー最小カットの定理(共著) ある種の平面有向ネットワーク上の多品種流問題に対する最大流ー最小カットの定理(共著) 電子情報通信学会誌,J71-A/1, 71-82 電子情報通信学会誌,J71-A/1, 71-82 1988 Refereed Japanese Disclose to all
永持 仁 永持 仁 ある種の平面有向ネットワーク上の多品種流問題の実行可能性判定法(共著) ある種の平面有向ネットワーク上の多品種流問題の実行可能性判定法(共著) 電子情報通信学会誌,J71-A/3, 804-810 電子情報通信学会誌,J71-A/3, 804-810 1988 Refereed Japanese Disclose to all
Hiroshi Nagamochi, Toshihide Ibaraki, Toshiharu Hasegawa Hiroshi Nagamochi, Toshihide Ibaraki, Toshiharu Hasegawa Hiroshi Nagamochi, Toshihide Ibaraki, Toshiharu Hasegawa On the multi‐commodity flow problem in certain planar directed networks On the multi‐commodity flow problem in certain planar directed networks On the multi‐commodity flow problem in certain planar directed networks Electronics and Communications in Japan (Part I: Communications), 71, 8, 11-24 Electronics and Communications in Japan (Part I: Communications), 71, 8, 11-24 Electronics and Communications in Japan (Part I: Communications), 71, 8, 11-24 1988 Refereed English Research paper(scientific journal) Disclose to all
永持仁, 茨木俊秀, 長谷川利治 永持仁, 茨木俊秀, 長谷川利治 ある種の平面有向ネットワーク上の多品種流問題について ある種の平面有向ネットワーク上の多品種流問題について 電子情報通信学会論文誌 A, 70, 2, 228-238 電子情報通信学会論文誌 A, 70, 2, 228-238 , 70, 2, 228-238 1987/02 Refereed Japanese Disclose to all
永持 仁 永持 仁 平面有向ネットワークのクラスCUに対する多品種流問題(共著) 平面有向ネットワークのクラスCUに対する多品種流問題(共著) 電子情報通信学会誌,J71-A/9, 1328-1339 電子情報通信学会誌,J71-A/9, 1328-1339 1987 Refereed Japanese Disclose to all
永持 仁 永持 仁 永持 仁 Deterministic Õ(nm) time edge-splitting in undirected graphs, "jointly worked " Deterministic Õ(nm) time edge-splitting in undirected graphs, "jointly worked " Deterministic Õ(nm) time edge-splitting in undirected graphs, "jointly worked " J. Combinatorial Optimization,1/1, 5-46 J. Combinatorial Optimization,1/1, 5-46 J. Combinatorial Optimization,1/1, 5-46 Refereed English Disclose to all
永持 仁 永持 仁 永持 仁 Augmenting edge-connectivity over the entire range in Õ(nm) time, "jointly worked " Augmenting edge-connectivity over the entire range in Õ(nm) time, "jointly worked " Augmenting edge-connectivity over the entire range in Õ(nm) time, "jointly worked " J. Algorithms,V30, 253-301 J. Algorithms,V30, 253-301 J. Algorithms,V30, 253-301 Refereed English Disclose to all
永持 仁 永持 仁 確率付きネットワーク上の期待最大流について(共著) 確率付きネットワーク上の期待最大流について(共著) 電子情報通信学会誌,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
Kazuya Haraguchi, Yusuke Momoi, Aleksandar Shurbevski, Hiroshi Nagamochi Kazuya Haraguchi, Yusuke Momoi, Aleksandar Shurbevski, Hiroshi Nagamochi Kazuya Haraguchi, Yusuke Momoi, Aleksandar Shurbevski, Hiroshi Nagamochi COOMA: A Components Overlaid Mining Algorithm for Enumerating Connected Subgraphs with Common Itemsets COOMA: A Components Overlaid Mining Algorithm for Enumerating Connected Subgraphs with Common Itemsets COOMA: A Components Overlaid Mining Algorithm for Enumerating Connected Subgraphs with Common Itemsets Technical Reports, Department of Applied Mathematics and Physics, Kyoto University, 2018, 002 Technical Reports, Department of Applied Mathematics and Physics, Kyoto University, 2018, 002 Technical Reports, Department of Applied Mathematics and Physics, Kyoto University, 2018, 002 2018/12 English Internal/External technical report, pre-print, etc. Disclose to all
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, 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 Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 9627, 286-297 Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 9627, 286-297 Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 9627, 286-297 2016 Refereed English 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, 9224, 406-421 GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE, 9224, 406-421 GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE, 9224, 406-421 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
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
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
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
Aleksandar Shurbevski, Hiroshi Nagamochi, Yoshiyuki Karuno Aleksandar Shurbevski, Hiroshi Nagamochi, Yoshiyuki Karuno Aleksandar Shurbevski, Hiroshi Nagamochi, Yoshiyuki Karuno Approximating the Bipartite TSP and Its Biased Generalization Approximating the Bipartite TSP and Its Biased Generalization Approximating the Bipartite TSP and Its Biased Generalization ALGORITHMS AND COMPUTATION, WALCOM 2014, 8344, 56-67 ALGORITHMS AND COMPUTATION, WALCOM 2014, 8344, 56-67 ALGORITHMS AND COMPUTATION, WALCOM 2014, 8344, 56-67 2014 Refereed English Disclose to all
Mingyu Xiao, Hiroshi Nagamochi Mingyu Xiao, Hiroshi Nagamochi Mingyu Xiao, 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 ALGORITHMS AND COMPUTATION, ISAAC 2014, 8889, 429-440 ALGORITHMS AND COMPUTATION, ISAAC 2014, 8889, 429-440 ALGORITHMS AND COMPUTATION, ISAAC 2014, 8889, 429-440 2014 Refereed English 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 COMPUTING AND COMBINATORICS, COCOON 2014, 8591, 477-488 COMPUTING AND COMBINATORICS, COCOON 2014, 8591, 477-488 COMPUTING AND COMBINATORICS, COCOON 2014, 8591, 477-488 2014 Refereed English Disclose to all
Tatsuya Akutsu, Hiroshi Nagamochi Tatsuya Akutsu, Hiroshi Nagamochi Tatsuya Akutsu, Hiroshi Nagamochi Comparison and enumeration of chemical graphs Comparison and enumeration of chemical graphs Comparison and enumeration of chemical graphs Computational and Structural Biotechnology Journal, 5, 6, e201302004 Computational and Structural Biotechnology Journal, 5, 6, e201302004 Computational and Structural Biotechnology Journal, 5, 6, e201302004 2013 English Book review, literature introduction, etc. Disclose to all
Mingyu Xiao, Hiroshi Nagamochi Mingyu Xiao, Hiroshi Nagamochi Mingyu Xiao, Hiroshi Nagamochi An exact algorithm for TSP in degree-3 graphs via circuit procedure and amortization on connectivity structure An exact algorithm for TSP in degree-3 graphs via circuit procedure and amortization on connectivity structure An exact algorithm for TSP in degree-3 graphs via circuit procedure and amortization on connectivity structure Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 7876, 96-107 Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 7876, 96-107 Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 7876, 96-107 2013 Refereed English 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 ALGORITHMS AND COMPUTATION, 8283, 328-338 ALGORITHMS AND COMPUTATION, 8283, 328-338 ALGORITHMS AND COMPUTATION, 8283, 328-338 2013 Refereed English 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 Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 8287, 153-164 Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 8287, 153-164 Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 8287, 153-164 2013 Refereed English Disclose to all
Mingyu Xiao, Hiroshi Nagamochi Mingyu Xiao, Hiroshi Nagamochi Mingyu Xiao, Hiroshi Nagamochi 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 Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 7924, 72-83 Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 7924, 72-83 Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 7924, 72-83 2013 Refereed English Disclose to all
H. Nagamochi H. Nagamochi H. Nagamochi Submodular minimization via pathwidth Submodular minimization via pathwidth Submodular minimization via pathwidth Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 7287 LNCS, 584-593 Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 7287 LNCS, 584-593 Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 7287 LNCS, 584-593 2012 Refereed English Disclose to all
Hiroshi Nagamochi Hiroshi Nagamochi Hiroshi Nagamochi Linear Layouts in Submodular Systems Linear Layouts in Submodular Systems Linear Layouts in Submodular Systems ALGORITHMS AND COMPUTATION, ISAAC 2012, 7676, 475-484 ALGORITHMS AND COMPUTATION, ISAAC 2012, 7676, 475-484 ALGORITHMS AND COMPUTATION, ISAAC 2012, 7676, 475-484 2012 Refereed English Disclose to all
Mingyu Xiao, Hiroshi Nagamochi Mingyu Xiao, Hiroshi Nagamochi Mingyu Xiao, Hiroshi Nagamochi A refined exact algorithm for edge dominating set A refined exact algorithm for edge dominating set A refined exact algorithm for edge dominating set Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 7287, 360-372 Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 7287, 360-372 Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 7287, 360-372 2012 Refereed English Disclose to all
Mingyu Xiao, Hiroshi Nagamochi Mingyu Xiao, Hiroshi Nagamochi Mingyu Xiao, Hiroshi Nagamochi An improved exact algorithm for TSP in degree-4 graphs An improved exact algorithm for TSP in degree-4 graphs An improved exact algorithm for TSP in degree-4 graphs Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 7434, 74-85 Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 7434, 74-85 Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 7434, 74-85 2012 Refereed English Disclose to all
Ken Ibara, Hiroshi Nagamochi Ken Ibara, Hiroshi Nagamochi Ken Ibara, Hiroshi Nagamochi Characterizing mechanisms in obnoxious facility game Characterizing mechanisms in obnoxious facility game Characterizing mechanisms in obnoxious facility game Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 7402, 301-311 Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 7402, 301-311 Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 7402, 301-311 2012 Refereed English Disclose to all
C. Zhang, H. Nagamochi C. Zhang, H. Nagamochi C. Zhang, H. Nagamochi The next-to-shortest path in undirected graphs with nonnegative weights The next-to-shortest path in undirected graphs with nonnegative weights The next-to-shortest path in undirected graphs with nonnegative weights Conferences in Research and Practice in Information Technology Series, 128, 13-20 Conferences in Research and Practice in Information Technology Series, 128, 13-20 Conferences in Research and Practice in Information Technology Series, 128, 13-20 2012 Refereed English Disclose to all
Masaaki Shimizu, Hiroshi Nagamochi, Tatsuya Akutsu Masaaki Shimizu, Hiroshi Nagamochi, Tatsuya Akutsu Masaaki Shimizu, Hiroshi Nagamochi, Tatsuya 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, 14 BMC BIOINFORMATICS, 12, 14 BMC BIOINFORMATICS, 12, 14 2011/12 Refereed English Disclose to all
A.r Shurbevski, H. Nagamochi, Y. Karuno A.r Shurbevski, H. Nagamochi, Y. Karuno A.r Shurbevski, H. Nagamochi, Y. Karuno Heuristics for a repetitive routing problem of a single grasp-and-delivery robot with an asymmetric edge cost function Heuristics for a repetitive routing problem of a single grasp-and-delivery robot with an asymmetric edge cost function Heuristics for a repetitive routing problem of a single grasp-and-delivery robot with an asymmetric edge cost function The 10th International Conference on Electronics, Telecommunications, Automation, and Informatics - ETAI 2011, Metropol Hotel, Ohrid, Macedonia, September 16-20, 2011, CD-ROM A1-1 (1--6). The 10th International Conference on Electronics, Telecommunications, Automation, and Informatics - ETAI 2011, Metropol Hotel, Ohrid, Macedonia, September 16-20, 2011, CD-ROM A1-1 (1--6). The 10th International Conference on Electronics, Telecommunications, Automation, and Informatics - ETAI 2011, Metropol Hotel, Ohrid, Macedonia, September 16-20, 2011, CD-ROM A1-1 (1--6). 2011/09 Refereed English Disclose to all
L. Zhao, P. Eumthurapojn, H. Nagamochi L. Zhao, P. Eumthurapojn, H. Nagamochi L. Zhao, P. Eumthurapojn, H. Nagamochi A practical speed-up technique for A* algorithms A practical speed-up technique for A* algorithms A practical speed-up technique for A* algorithms the 4th Annual Meeting of the Asian Association for Algorithms and Computation (AAAC 2011), in Hsinchu, Taiwan the 4th Annual Meeting of the Asian Association for Algorithms and Computation (AAAC 2011), in Hsinchu, Taiwan the 4th Annual Meeting of the Asian Association for Algorithms and Computation (AAAC 2011), in Hsinchu, Taiwan 2011/04 Refereed English Disclose to all
Haraguchi Kazuya, Hong Seok-Hee, Nagamochi Hiroshi 原口 和也, Hong Seok-Hee, 永持 仁 Haraguchi Kazuya, Hong Seok-Hee, Nagamochi Hiroshi Construction of Visual Classifier by Edge Crossing Minimization (The evolution of optimization models and algorithms) Construction of visual classifier by edge crossing minimization (最適化モデルとアルゴリズムの新展開--RIMS研究集会報告集) Construction of Visual Classifier by Edge Crossing Minimization (The evolution of optimization models and algorithms) RIMS Kokyuroku, 1726, 73-83 数理解析研究所講究録, 1726, 73-83 RIMS Kokyuroku, 1726, 73-83 2011/02 English Disclose to all
Liang Zhao, Pipaporn Eumthurapojn, Hiroshi Nagamochi Liang Zhao, Pipaporn Eumthurapojn, Hiroshi Nagamochi Liang Zhao, Pipaporn Eumthurapojn, Hiroshi Nagamochi Accelerating A<sup>*</sup> algorithms by sweeping out small-degree nodes Accelerating A<sup>*</sup> algorithms by sweeping out small-degree nodes Accelerating A<sup>*</sup> algorithms by sweeping out small-degree nodes 研究報告アルゴリズム(AL), 2011, 5, 1-4 研究報告アルゴリズム(AL), 2011, 5, 1-4 研究報告アルゴリズム(AL), 2011, 5, 1-4 2011/02 English Disclose to all
A. Shurbevski, Y. Karuno, H. Nagamochi A. Shurbevski, Y. Karuno, H. Nagamochi A. Shurbevski, Y. Karuno, H. Nagamochi Improved implementation of an approximation algorithm with factor two for a cyclic routing problem of grasp-and-delivery robots Improved implementation of an approximation algorithm with factor two for a cyclic routing problem of grasp-and-delivery robots Improved implementation of an approximation algorithm with factor two for a cyclic routing problem of grasp-and-delivery robots Proceedings of International Symposium on Scheduling 2011 (ISS2011), JSME No. 11-205, pp. 235--240 Proceedings of International Symposium on Scheduling 2011 (ISS2011), JSME No. 11-205, pp. 235--240 Proceedings of International Symposium on Scheduling 2011 (ISS2011), JSME No. 11-205, pp. 235--240 2011 Refereed English Disclose to all
Y. Karuno, H. Nagamochi Y. Karuno, H. Nagamochi Y. Karuno, H. Nagamochi Network transformation heuristics for multi-story storage rack problems Network transformation heuristics for multi-story storage rack problems Network transformation heuristics for multi-story storage rack problems Proceedings of International Symposium on Scheduling 2011 (ISS2011), JSME No. 11-205, pp. 161--164, Proceedings of International Symposium on Scheduling 2011 (ISS2011), JSME No. 11-205, pp. 161--164, Proceedings of International Symposium on Scheduling 2011 (ISS2011), JSME No. 11-205, pp. 161--164, 2011 Refereed English Disclose to all
Mingyu Xiao, Hiroshi Nagamochi Mingyu Xiao, Hiroshi Nagamochi Mingyu Xiao, Hiroshi Nagamochi Parameterized Edge Dominating Set in Cubic Graphs Parameterized Edge Dominating Set in Cubic Graphs Parameterized Edge Dominating Set in Cubic Graphs FRONTIERS IN ALGORITHMICS AND ALGORITHMIC ASPECTS IN INFORMATION AND MANAGEMENT, (FAW-AAIM 2011), 6681, 100-112 FRONTIERS IN ALGORITHMICS AND ALGORITHMIC ASPECTS IN INFORMATION AND MANAGEMENT, (FAW-AAIM 2011), 6681, 100-112 FRONTIERS IN ALGORITHMICS AND ALGORITHMIC ASPECTS IN INFORMATION AND MANAGEMENT, (FAW-AAIM 2011), 6681, 100-112 2011 Refereed English Disclose to all
Mingyu Xiao, Hiroshi Nagamochi Mingyu Xiao, Hiroshi Nagamochi Mingyu Xiao, Hiroshi Nagamochi Further Improvement on Maximum Independent Set in Degree-4 Graphs Further Improvement on Maximum Independent Set in Degree-4 Graphs Further Improvement on Maximum Independent Set in Degree-4 Graphs COMBINATORIAL OPTIMIZATION AND APPLICATIONS, 6831, 163-+ COMBINATORIAL OPTIMIZATION AND APPLICATIONS, 6831, 163-+ COMBINATORIAL OPTIMIZATION AND APPLICATIONS, 6831, 163-+ 2011 Refereed English Disclose to all
Toru Hasunuma, Hiroshi Nagamochi Toru Hasunuma, Hiroshi Nagamochi Toru Hasunuma, Hiroshi Nagamochi Improved Bounds for Minimum Fault-Tolerant Gossip Graphs Improved Bounds for Minimum Fault-Tolerant Gossip Graphs Improved Bounds for Minimum Fault-Tolerant Gossip Graphs GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE, 6986, 203-+ GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE, 6986, 203-+ GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE, 6986, 203-+ 2011 Refereed English Disclose to all
Kazuya Haraguchi, Seok-Hee Hong, Hiroshi Nagamochi Kazuya Haraguchi, Seok-Hee Hong, Hiroshi Nagamochi Kazuya Haraguchi, Seok-Hee Hong, Hiroshi Nagamochi Multiclass Visual Classifier Based on Bipartite Graph Representation of Decision Tables Multiclass Visual Classifier Based on Bipartite Graph Representation of Decision Tables Multiclass Visual Classifier Based on Bipartite Graph Representation of Decision Tables LEARNING AND INTELLIGENT OPTIMIZATION, 6073, 169-+ LEARNING AND INTELLIGENT OPTIMIZATION, 6073, 169-+ LEARNING AND INTELLIGENT OPTIMIZATION, 6073, 169-+ 2010 Refereed English Disclose to all
Y. Karuno, H. Nagamochi, A. Shurbevski Y. Karuno, H. Nagamochi, A. Shurbevski Y. Karuno, H. Nagamochi, A. Shurbevski Approximation algorithms for a cyclic routing problem of grasp-and-delivery robots Approximation algorithms for a cyclic routing problem of grasp-and-delivery robots Approximation algorithms for a cyclic routing problem of grasp-and-delivery robots SCIS and ISIS 2010 - Joint 5th International Conference on Soft Computing and Intelligent Systems and 11th International Symposium on Advanced Intelligent Systems, 94-99 SCIS and ISIS 2010 - Joint 5th International Conference on Soft Computing and Intelligent Systems and 11th International Symposium on Advanced Intelligent Systems, 94-99 SCIS and ISIS 2010 - Joint 5th International Conference on Soft Computing and Intelligent Systems and 11th International Symposium on Advanced Intelligent Systems, 94-99 2010 Refereed English Disclose to all
Mingyu Xiao, Takuro Fukunaga, Hiroshi Nagamochi Mingyu Xiao, Takuro Fukunaga, Hiroshi Nagamochi Mingyu Xiao, Takuro Fukunaga, Hiroshi Nagamochi FPTAS's for Some Cut Problems in Weighted Trees FPTAS's for Some Cut Problems in Weighted Trees FPTAS's for Some Cut Problems in Weighted Trees FRONTIERS IN ALGORITHMICS, 6213, 210-+ FRONTIERS IN ALGORITHMICS, 6213, 210-+ FRONTIERS IN ALGORITHMICS, 6213, 210-+ 2010 Refereed English Disclose to all
Yoshiyuki Karuno, Hiroshi Nagamochi, Akira Nakashima, Kougaku Yamashita Yoshiyuki Karuno, Hiroshi Nagamochi, Akira Nakashima, Kougaku Yamashita Yoshiyuki Karuno, Hiroshi Nagamochi, Akira Nakashima, Kougaku Yamashita Heuristics for scheduling problems on identical machines like storage allocation Heuristics for scheduling problems on identical machines like storage allocation Heuristics for scheduling problems on identical machines like storage allocation IEEE International Conference on Industrial Informatics (INDIN), 863-868 IEEE International Conference on Industrial Informatics (INDIN), 863-868 IEEE International Conference on Industrial Informatics (INDIN), 863-868 2010 Refereed English Disclose to all
Yoshiyuki Karuno, Hiroshi Nagamochi, Xiaoming Wang Yoshiyuki Karuno, Hiroshi Nagamochi, Xiaoming Wang Yoshiyuki Karuno, Hiroshi Nagamochi, Xiaoming Wang Optimization Problems and Algorithms in Double-layered Food Packing Systems Optimization Problems and Algorithms in Double-layered Food Packing Systems Optimization Problems and Algorithms in Double-layered Food Packing Systems JOURNAL OF ADVANCED MECHANICAL DESIGN SYSTEMS AND MANUFACTURING, 4, 3, 605-615 JOURNAL OF ADVANCED MECHANICAL DESIGN SYSTEMS AND MANUFACTURING, 4, 3, 605-615 JOURNAL OF ADVANCED MECHANICAL DESIGN SYSTEMS AND MANUFACTURING, 4, 3, 605-615 2010 Refereed English Disclose to all
Yoshiyuki Karuno, Kougaku Yamashita, Eishi Chiba, Hiroshi Nagamochi Yoshiyuki Karuno, Kougaku Yamashita, Eishi Chiba, Hiroshi Nagamochi Yoshiyuki Karuno, Kougaku Yamashita, Eishi Chiba, Hiroshi Nagamochi 4C1 SCHEDULING MULTIPROCESSOR TASKS WITH PROMPT SERVICE CONSTRAINTS ON ALIGNED IDENTICAL PROCESSORS 4C1 SCHEDULING MULTIPROCESSOR TASKS WITH PROMPT SERVICE CONSTRAINTS ON ALIGNED IDENTICAL PROCESSORS 4C1 SCHEDULING MULTIPROCESSOR TASKS WITH PROMPT SERVICE CONSTRAINTS ON ALIGNED IDENTICAL PROCESSORS Proceedings of International Symposium on Scheduling, 2009, 203-208 Proceedings of International Symposium on Scheduling, 2009, 203-208 Proceedings of International Symposium on Scheduling, 2009, 203-208 2009/07/04 Refereed English Disclose to all
Haraguchi Kazuya, Hong Seok-Hee, Nagamochi Hiroshi 原口 和也, Hong Seok-Hee, 永持 仁 Haraguchi Kazuya, Hong Seok-Hee, Nagamochi Hiroshi Classification by Ordering Data Samples (Acceleration and Visualization of Computation for Enumeration Problems) Classification by Ordering Data Samples (Acceleration and Visualization of Computation for Enumeration Problems) Classification by Ordering Data Samples (Acceleration and Visualization of Computation for Enumeration Problems) RIMS Kokyuroku, 1644, 20-34 数理解析研究所講究録, 1644, 20-34 RIMS Kokyuroku, 1644, 20-34 2009/04 English Disclose to all
Gim Jaeseong, Sasaki Masahiro, Zhao Liang, Nagamochi Hiroshi 金 在成, 佐々木 方太, 趙 亮, 永持 仁 Gim Jaeseong, Sasaki Masahiro, Zhao Liang, Nagamochi Hiroshi DS-1-5 An Efficient Algorithm for Large-scale Beacon Placement Problem DS-1-5 An Efficient Algorithm for Large-scale Beacon Placement Problem DS-1-5 An Efficient Algorithm for Large-scale Beacon Placement Problem Proceedings of the IEICE General Conference, 2009, 1, "S-29"-"S-30" 電子情報通信学会総合大会講演論文集, 2009, 1, "S-29"-"S-30" Proceedings of the IEICE General Conference, 2009, 1, "S-29"-"S-30" 2009/03 English Disclose to all
Seok-Hee Hong, Hiroshi Nagamochi Seok-Hee Hong, Hiroshi Nagamochi Seok-Hee Hong, Hiroshi Nagamochi Upward Star-Shaped Polyhedral Graphs Upward Star-Shaped Polyhedral Graphs Upward Star-Shaped Polyhedral Graphs ALGORITHMS AND COMPUTATION, PROCEEDINGS, 5878, 913-+ ALGORITHMS AND COMPUTATION, PROCEEDINGS, 5878, 913-+ ALGORITHMS AND COMPUTATION, PROCEEDINGS, 5878, 913-+ 2009 Refereed English Disclose to all
Yoshitaka Nakao, Hiroshi Nagamochi Yoshitaka Nakao, Hiroshi Nagamochi Yoshitaka Nakao, Hiroshi Nagamochi Worst Case Analysis for Pickup and Delivery Problems with Consecutive Pickups and Deliveries Worst Case Analysis for Pickup and Delivery Problems with Consecutive Pickups and Deliveries Worst Case Analysis for Pickup and Delivery Problems with Consecutive Pickups and Deliveries ALGORITHMS AND COMPUTATION, PROCEEDINGS, 5878, 554-563 ALGORITHMS AND COMPUTATION, PROCEEDINGS, 5878, 554-563 ALGORITHMS AND COMPUTATION, PROCEEDINGS, 5878, 554-563 2009 Refereed English 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 FRONTIERS IN ALGORITHMICS, PROCEEDINGS, 5598, 74-84 FRONTIERS IN ALGORITHMICS, PROCEEDINGS, 5598, 74-84 FRONTIERS IN ALGORITHMICS, PROCEEDINGS, 5598, 74-84 2009 Refereed English Disclose to all
Seigo Karakawa, Ehab Morsy, Hiroshi Nagamochi Seigo Karakawa, Ehab Morsy, Hiroshi Nagamochi Seigo Karakawa, Ehab Morsy, Hiroshi Nagamochi Minmax Tree Cover in the Euclidean Space Minmax Tree Cover in the Euclidean Space Minmax Tree Cover in the Euclidean Space WALCOM: ALGORITHMS AND COMPUTATION, PROCEEDINGS, 5431, 202-213 WALCOM: ALGORITHMS AND COMPUTATION, PROCEEDINGS, 5431, 202-213 WALCOM: ALGORITHMS AND COMPUTATION, PROCEEDINGS, 5431, 202-213 2009 Refereed English Disclose to all
Takashi Imamichi, Yohei Arahori, Jaeseong Gim, Seok-Hee Hong, Hiroshi Nagamochi Takashi Imamichi, Yohei Arahori, Jaeseong Gim, Seok-Hee Hong, Hiroshi Nagamochi Takashi Imamichi, Yohei Arahori, Jaeseong Gim, Seok-Hee Hong, Hiroshi Nagamochi Removing Node Overlaps Using Multi-sphere Scheme Removing Node Overlaps Using Multi-sphere Scheme Removing Node Overlaps Using Multi-sphere Scheme GRAPH DRAWING, 5417, 296-+ GRAPH DRAWING, 5417, 296-+ GRAPH DRAWING, 5417, 296-+ 2009 Refereed English Disclose to all
Kazumasa Okumoto, Takuro Fukunaga, Hiroshi Nagamochi 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 ALGORITHMS AND COMPUTATION, PROCEEDINGS, 5878, 55-+ ALGORITHMS AND COMPUTATION, PROCEEDINGS, 5878, 55-+ ALGORITHMS AND COMPUTATION, PROCEEDINGS, 5878, 55-+ 2009 Refereed English Disclose to all
K. Haraguchi, S.-H. Hong, Hiroshi Nagamochi K. Haraguchi, S.-H. Hong, Hiroshi Nagamochi K. Haraguchi, S.-H. Hong, Hiroshi Nagamochi Visualization can improve multiple decision table classifiers Visualization can improve multiple decision table classifiers Visualization can improve multiple decision table classifiers The 6th International Conference on Modeling Decisions for Artificial Intelligence (MDAI 2009) pp. 41-52. The 6th International Conference on Modeling Decisions for Artificial Intelligence (MDAI 2009) pp. 41-52. The 6th International Conference on Modeling Decisions for Artificial Intelligence (MDAI 2009) pp. 41-52. 2009 Refereed English Disclose to all
K. Haraguchi, S.-H. Hong, Hiroshi Nagamochi K. Haraguchi, S.-H. Hong, Hiroshi Nagamochi K. Haraguchi, S.-H. Hong, Hiroshi Nagamochi Visualized Multiple Decision Table Classifiers without Discretization Visualized Multiple Decision Table Classifiers without Discretization Visualized Multiple Decision Table Classifiers without Discretization 4th Korea-Japan Workshop on Operations Research in Service Science pp. 19-28. 4th Korea-Japan Workshop on Operations Research in Service Science pp. 19-28. 4th Korea-Japan Workshop on Operations Research in Service Science pp. 19-28. 2009 Refereed English Disclose to all
J. Wang, J. Gim, M. Sasaki, L. Zhao, Hiroshi Nagamochi J. Wang, J. Gim, M. Sasaki, L. Zhao, Hiroshi Nagamochi J. Wang, J. Gim, M. Sasaki, L. Zhao, Hiroshi Nagamochi Efficient approximate algorithms for the beacon placement and its dual problem, Efficient approximate algorithms for the beacon placement and its dual problem, Efficient approximate algorithms for the beacon placement and its dual problem, 2009 Korea-Japan Joint Workshop on Algorithms and Computation, , pp. 101-108. 2009 Korea-Japan Joint Workshop on Algorithms and Computation, , pp. 101-108. 2009 Korea-Japan Joint Workshop on Algorithms and Computation, , pp. 101-108. 2009 Refereed English Disclose to all
S.-H. Hong, Hiroshi Nagamochi S.-H. Hong, Hiroshi Nagamochi S.-H. Hong, Hiroshi Nagamochi Toward characterization of vertex-edge graphs of three-dimensional nonconvex polyhedra, Toward characterization of vertex-edge graphs of three-dimensional nonconvex polyhedra, Toward characterization of vertex-edge graphs of three-dimensional nonconvex polyhedra, 6th Japanese-Hungarian Symposium on Discrete Mathematics and Its Applications 6th Japanese-Hungarian Symposium on Discrete Mathematics and Its Applications 6th Japanese-Hungarian Symposium on Discrete Mathematics and Its Applications 2009 Refereed English Disclose to all
S. Umetani, K. Matsumoto, Hiroshi Nagamochi S. Umetani, K. Matsumoto, Hiroshi Nagamochi S. Umetani, K. Matsumoto, Hiroshi Nagamochi One-dimensional cutting stock problem for a paper tube industry One-dimensional cutting stock problem for a paper tube industry One-dimensional cutting stock problem for a paper tube industry The 6th ESICUP Meeting The 6th ESICUP Meeting The 6th ESICUP Meeting 2009 Refereed English Disclose to all
T. Imamichi, Y. Arahori, Hiroshi Nagamochi T. Imamichi, Y. Arahori, Hiroshi Nagamochi T. Imamichi, Y. Arahori, Hiroshi Nagamochi Efficient branch-and-bound algorithms for one-dimensional contiguous bin packing problem and two-dimensional strip packing problem, Efficient branch-and-bound algorithms for one-dimensional contiguous bin packing problem and two-dimensional strip packing problem, Efficient branch-and-bound algorithms for one-dimensional contiguous bin packing problem and two-dimensional strip packing problem, The 6th ESICUP Meeting The 6th ESICUP Meeting The 6th ESICUP Meeting 2009 Refereed English Disclose to all
Jiexun Wang, Jaeseong Gim, Masahiro Sasaki, Liang Zhao, Hiroshi Nagamochi Jiexun Wang, Jaeseong Gim, Masahiro Sasaki, Liang Zhao, Hiroshi Nagamochi Jiexun Wang, Jaeseong Gim, Masahiro Sasaki, Liang Zhao, Hiroshi Nagamochi Efficient approximate algorithms for the beacon placement and its dual problem (abstract) Efficient approximate algorithms for the beacon placement and its dual problem (abstract) Efficient approximate algorithms for the beacon placement and its dual problem (abstract) Proceedings - 2009 International Conference on Computational Intelligence and Software Engineering, CiSE 2009 Proceedings - 2009 International Conference on Computational Intelligence and Software Engineering, CiSE 2009 Proceedings - 2009 International Conference on Computational Intelligence and Software Engineering, CiSE 2009 2009 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 Enumerating Stereoisomers of Tree Structured Molecules Using Dynamic Programming Enumerating Stereoisomers of Tree Structured Molecules Using Dynamic Programming Enumerating Stereoisomers of Tree Structured Molecules Using Dynamic Programming ALGORITHMS AND COMPUTATION, PROCEEDINGS, 5878, 14-+ ALGORITHMS AND COMPUTATION, PROCEEDINGS, 5878, 14-+ ALGORITHMS AND COMPUTATION, PROCEEDINGS, 5878, 14-+ 2009 Refereed English Disclose to all
Kazuya Haraguchi, Seok-Hee Hong, Hiroshi Nagamochi Kazuya Haraguchi, Seok-Hee Hong, Hiroshi Nagamochi Kazuya Haraguchi, Seok-Hee Hong, Hiroshi Nagamochi Bipartite Graph Representation of Multiple Decision Table Classifiers Bipartite Graph Representation of Multiple Decision Table Classifiers Bipartite Graph Representation of Multiple Decision Table Classifiers STOCHASTIC ALGORITHMS: FOUNDATIONS AND APPLICATIONS, PROCEEDINGS, 5792, 46-+ STOCHASTIC ALGORITHMS: FOUNDATIONS AND APPLICATIONS, PROCEEDINGS, 5792, 46-+ STOCHASTIC ALGORITHMS: FOUNDATIONS AND APPLICATIONS, PROCEEDINGS, 5792, 46-+ 2009 Refereed English Disclose to all
Seok-Hee Hong, Hiroshi Nagamochi Seok-Hee Hong, Hiroshi Nagamochi Seok-Hee Hong, Hiroshi Nagamochi Star-shaped drawings of graphs with fixed embedding and concave corner constraints Star-shaped drawings of graphs with fixed embedding and concave corner constraints Star-shaped drawings of graphs with fixed embedding and concave corner constraints COMPUTING AND COMBINATORICS, PROCEEDINGS, 5092, 405-+ COMPUTING AND COMBINATORICS, PROCEEDINGS, 5092, 405-+ COMPUTING AND COMBINATORICS, PROCEEDINGS, 5092, 405-+ 2008 Refereed English Disclose to all
Seok-Hee Hong, Hiroshi Nagamochi Seok-Hee Hong, Hiroshi Nagamochi Seok-Hee Hong, Hiroshi Nagamochi Approximating crossing minimization in radial layouts Approximating crossing minimization in radial layouts Approximating crossing minimization in radial layouts LATIN 2008: THEORETICAL INFORMATICS, 4957, 461-+ LATIN 2008: THEORETICAL INFORMATICS, 4957, 461-+ LATIN 2008: THEORETICAL INFORMATICS, 4957, 461-+ 2008 Refereed English Disclose to all
Shinji IMAHORI, Yoshiyuki KARUNO, Hiroshi NAGAMOCHI, Xiaoming WANG Shinji IMAHORI, Yoshiyuki KARUNO, Hiroshi NAGAMOCHI, Xiaoming WANG Shinji IMAHORI, Yoshiyuki KARUNO, Hiroshi NAGAMOCHI, Xiaoming WANG Efficient algorithms for combinatorial food packing problems Efficient algorithms for combinatorial food packing problems Efficient algorithms for combinatorial food packing problems Proc. of the 11th International Conference on Humans and Computers (HC'2008), pp. 317-322 Proc. of the 11th International Conference on Humans and Computers (HC'2008), pp. 317-322 Proc. of the 11th International Conference on Humans and Computers (HC'2008), pp. 317-322 2008 Refereed English Disclose to all
Y. Ishida, L. Zhao, Hiroshi Nagamochi, T. Akutsu Y. Ishida, L. Zhao, Hiroshi Nagamochi, T. Akutsu Y. Ishida, L. Zhao, Hiroshi Nagamochi, T. Akutsu Improved algorithm for enumerating tree-likee chemical graphs, Improved algorithm for enumerating tree-likee chemical graphs, Improved algorithm for enumerating tree-likee chemical graphs, The 19th International Conference on Genome Informatics (GIW2008) The 19th International Conference on Genome Informatics (GIW2008) The 19th International Conference on Genome Informatics (GIW2008) 2008 Refereed English Disclose to all
T. Imamichi, Hiroshi Nagamochi T. Imamichi, Hiroshi Nagamochi T. Imamichi, Hiroshi Nagamochi A fast collision detection algorithm for a multi-sphere scheme A fast collision detection algorithm for a multi-sphere scheme A fast collision detection algorithm for a multi-sphere scheme The 11th Japan-Korea Joint Workshop on Algorithms and Computation (WAAC08), pp. 173-180. The 11th Japan-Korea Joint Workshop on Algorithms and Computation (WAAC08), pp. 173-180. The 11th Japan-Korea Joint Workshop on Algorithms and Computation (WAAC08), pp. 173-180. 2008 Refereed English Disclose to all
L. Zhao, T. Ohshima, Hiroshi Nagamochi L. Zhao, T. Ohshima, Hiroshi Nagamochi L. Zhao, T. Ohshima, Hiroshi Nagamochi A* algorithm for the time-dependent shortest path problem A* algorithm for the time-dependent shortest path problem A* algorithm for the time-dependent shortest path problem The 11th Japan-Korea Joint Workshop on Algorithms and Computation (WAAC08)pp. 36-43. The 11th Japan-Korea Joint Workshop on Algorithms and Computation (WAAC08)pp. 36-43. The 11th Japan-Korea Joint Workshop on Algorithms and Computation (WAAC08)pp. 36-43. 2008 Refereed English Disclose to all
Ehab Morsy, Hiroshi Nagamochi Ehab Morsy, Hiroshi Nagamochi Ehab Morsy, Hiroshi Nagamochi Approximating the generalized capacitated tree-routing problem Approximating the generalized capacitated tree-routing problem Approximating the generalized capacitated tree-routing problem COMPUTING AND COMBINATORICS, PROCEEDINGS, 5092, 621-630 COMPUTING AND COMBINATORICS, PROCEEDINGS, 5092, 621-630 COMPUTING AND COMBINATORICS, PROCEEDINGS, 5092, 621-630 2008 Refereed English Disclose to all
K. Haraguchi, Seok-Hee Hong, Hiroshi Nagamochi K. Haraguchi, Seok-Hee Hong, Hiroshi Nagamochi K. Haraguchi, Seok-Hee Hong, Hiroshi Nagamochi Visual analysis of hierarchical data using 2.5D drawing with minimum occlusion Visual analysis of hierarchical data using 2.5D drawing with minimum occlusion Visual analysis of hierarchical data using 2.5D drawing with minimum occlusion the poster session of 2008 IEEE Pacific Visualization Symposium (PacificVis 2008) the poster session of 2008 IEEE Pacific Visualization Symposium (PacificVis 2008) the poster session of 2008 IEEE Pacific Visualization Symposium (PacificVis 2008) 2008 Refereed English Disclose to all
Jaeseong Gim, Yohei Arahori, Takashi Imamichi, Seok-Hee Hong, Hiroshi Nagamochi Jaeseong Gim, Yohei Arahori, Takashi Imamichi, Seok-Hee Hong, Hiroshi Nagamochi Jaeseong Gim, Yohei Arahori, Takashi Imamichi, Seok-Hee Hong, Hiroshi Nagamochi Overlap removal in label layouts by a multi-sphere scheme, Overlap removal in label layouts by a multi-sphere scheme, Overlap removal in label layouts by a multi-sphere scheme, the poster session of 2008 IEEE Pacific Visualization Symposium (PacificVis 2008) the poster session of 2008 IEEE Pacific Visualization Symposium (PacificVis 2008) the poster session of 2008 IEEE Pacific Visualization Symposium (PacificVis 2008) 2008 Refereed English Disclose to all
Takashi Imamichi, Hiroshi Nagamochi Takashi Imamichi, Hiroshi Nagamochi Takashi Imamichi, Hiroshi Nagamochi Designing algorithms with multi-sphere scheme Designing algorithms with multi-sphere scheme Designing algorithms with multi-sphere scheme INTERNATIONAL CONFERENCE ON INFORMATICS EDUCATION AND RESEARCH FOR KNOWLEDGE-CIRCULATING SOCIETY, PROCEEDINGS, 125-130 INTERNATIONAL CONFERENCE ON INFORMATICS EDUCATION AND RESEARCH FOR KNOWLEDGE-CIRCULATING SOCIETY, PROCEEDINGS, 125-130 INTERNATIONAL CONFERENCE ON INFORMATICS EDUCATION AND RESEARCH FOR KNOWLEDGE-CIRCULATING SOCIETY, PROCEEDINGS, 125-130 2008 Refereed English Disclose to all
Masahiro Sasaki, Liang Zhao, Hiroshi Nagamochi Masahiro Sasaki, Liang Zhao, Hiroshi Nagamochi Masahiro Sasaki, Liang Zhao, Hiroshi Nagamochi Security-Aware Beacon Based Network Monitoring Security-Aware Beacon Based Network Monitoring Security-Aware Beacon Based Network Monitoring 2008 11TH IEEE SINGAPORE INTERNATIONAL CONFERENCE ON COMMUNICATION SYSTEMS (ICCS), VOLS 1-3, 527-531 2008 11TH IEEE SINGAPORE INTERNATIONAL CONFERENCE ON COMMUNICATION SYSTEMS (ICCS), VOLS 1-3, 527-531 2008 11TH IEEE SINGAPORE INTERNATIONAL CONFERENCE ON COMMUNICATION SYSTEMS (ICCS), VOLS 1-3, 527-531 2008 Refereed English Disclose to all
Takuro Fukunaga, Magnus M. Halldorsson, Hiroshi Nagamochi Takuro Fukunaga, Magnus M. Halldorsson, Hiroshi Nagamochi Takuro Fukunaga, Magnus M. Halldorsson, Hiroshi Nagamochi Robust Cost Colorings Robust Cost Colorings Robust Cost Colorings PROCEEDINGS OF THE NINETEENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 1204-+ PROCEEDINGS OF THE NINETEENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 1204-+ PROCEEDINGS OF THE NINETEENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 1204-+ 2008 Refereed English Disclose to all
三輪 直樹, 趙 亮, 永持 仁 三輪 直樹, 趙 亮, 永持 仁 三輪 直樹, 趙 亮, 永持 仁 On the construction of the minimum depth tree for P2P system P2Pシステムのための深さ最小木の構築について (メディア工学) On the construction of the minimum depth tree for P2P system ITE technical report, 31, 42, 101-106 映像情報メディア学会技術報告, 31, 42, 101-106 ITE technical report, 31, 42, 101-106 2007/09 Japanese Disclose to all
Takuro Fukunaga, Magnus M. Halldorsson, Hiroshi Nagamochi Takuro Fukunaga, Magnus M. Halldorsson, Hiroshi Nagamochi Takuro Fukunaga, Magnus M. Halldorsson, Hiroshi Nagamochi "Rent-or-Buy" scheduling and cost coloring problems "Rent-or-Buy" scheduling and cost coloring problems "Rent-or-Buy" scheduling and cost coloring problems FSTTCS 2007: FOUNDATIONS OF SOFTWARE TECHNOLOGY AND THEORETICAL COMPUTER SCIENCE, PROCEEDINGS, 4855, 84-+ FSTTCS 2007: FOUNDATIONS OF SOFTWARE TECHNOLOGY AND THEORETICAL COMPUTER SCIENCE, PROCEEDINGS, 4855, 84-+ FSTTCS 2007: FOUNDATIONS OF SOFTWARE TECHNOLOGY AND THEORETICAL COMPUTER SCIENCE, PROCEEDINGS, 4855, 84-+ 2007 Refereed English Disclose to all
Hiroshi Nagamochi Hiroshi Nagamochi Hiroshi Nagamochi Minimum degree orderings Minimum degree orderings Minimum degree orderings ALGORITHMS AND COMPUTATION, 4835, 17-28 ALGORITHMS AND COMPUTATION, 4835, 17-28 ALGORITHMS AND COMPUTATION, 4835, 17-28 2007 Refereed English Disclose to all
S.-H. Hong, Hiroshi Nagamochi S.-H. Hong, Hiroshi Nagamochi S.-H. Hong, Hiroshi Nagamochi Star-shaped drawings of planar graphs Star-shaped drawings of planar graphs Star-shaped drawings of planar graphs 18th International Workshop on Combinatorial Algorithms, 18th International Workshop on Combinatorial Algorithms, 18th International Workshop on Combinatorial Algorithms, 2007 Refereed English Disclose to all
Mutsunori Yagiura, Akira Komiya, Kenya Kojima, Koji Nonobe, Hiroshi Nagamochi, Toshihide Ibaraki, Fred Glover Mutsunori Yagiura, Akira Komiya, Kenya Kojima, Koji Nonobe, Hiroshi Nagamochi, Toshihide Ibaraki, Fred Glover Mutsunori Yagiura, Akira Komiya, Kenya Kojima, Koji Nonobe, Hiroshi Nagamochi, Toshihide Ibaraki, Fred 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 ENGINEERING STOCHASTIC LOCAL SEARCH ALGORITHMS: DESIGNING, IMPLEMENTING AND ANALYZING EFFECTIVE HEURISTICS, 4638, 121-+ ENGINEERING STOCHASTIC LOCAL SEARCH ALGORITHMS: DESIGNING, IMPLEMENTING AND ANALYZING EFFECTIVE HEURISTICS, 4638, 121-+ ENGINEERING STOCHASTIC LOCAL SEARCH ALGORITHMS: DESIGNING, IMPLEMENTING AND ANALYZING EFFECTIVE HEURISTICS, 4638, 121-+ 2007 Refereed English Disclose to all
Takashi Imamichi, Hiroshi Nagamochi Takashi Imamichi, Hiroshi Nagamochi Takashi Imamichi, Hiroshi Nagamochi A multi-sphere scheme for 2D and 3D packing problems A multi-sphere scheme for 2D and 3D packing problems A multi-sphere scheme for 2D and 3D packing problems ENGINEERING STOCHASTIC LOCAL SEARCH ALGORITHMS: DESIGNING, IMPLEMENTING AND ANALYZING EFFECTIVE HEURISTICS, 4638, 207-+ ENGINEERING STOCHASTIC LOCAL SEARCH ALGORITHMS: DESIGNING, IMPLEMENTING AND ANALYZING EFFECTIVE HEURISTICS, 4638, 207-+ ENGINEERING STOCHASTIC LOCAL SEARCH ALGORITHMS: DESIGNING, IMPLEMENTING AND ANALYZING EFFECTIVE HEURISTICS, 4638, 207-+ 2007 Refereed English Disclose to all
H. Fujiwara, L. Zhao, Hiroshi Nagamochi, T. Akutsu, W. Jiexun H. Fujiwara, L. Zhao, Hiroshi Nagamochi, T. Akutsu, W. Jiexun H. Fujiwara, L. Zhao, Hiroshi Nagamochi, T. Akutsu, W. Jiexun Enumerating tree-like chemical structures from feature vector Enumerating tree-like chemical structures from feature vector Enumerating tree-like chemical structures from feature vector 2007 Korea-Japan Joint Workshop on Algorithms and Computation, pp. 48-55 2007 Korea-Japan Joint Workshop on Algorithms and Computation, pp. 48-55 2007 Korea-Japan Joint Workshop on Algorithms and Computation, pp. 48-55 2007 Refereed English Disclose to all
T. Imamichi, Hiroshi Nagamochi T. Imamichi, Hiroshi Nagamochi T. Imamichi, Hiroshi Nagamochi An Iterated Local Search Algorithm in a Multi-sphere Scheme for 2D and 3D Packing Problems, An Iterated Local Search Algorithm in a Multi-sphere Scheme for 2D and 3D Packing Problems, An Iterated Local Search Algorithm in a Multi-sphere Scheme for 2D and 3D Packing Problems, 2007 Korea-Japan Joint Workshop on Algorithms and Computation, pp. 72-79. 2007 Korea-Japan Joint Workshop on Algorithms and Computation, pp. 72-79. 2007 Korea-Japan Joint Workshop on Algorithms and Computation, pp. 72-79. 2007 Refereed English Disclose to all
S.-H. Hong, Hiroshi Nagamochi S.-H. Hong, Hiroshi Nagamochi S.-H. Hong, Hiroshi Nagamochi Fully convex drawings of clustered planar graphs Fully convex drawings of clustered planar graphs Fully convex drawings of clustered planar graphs 2007 Korea-Japan Joint Workshop on Algorithms and Computation, pp. 32-39. 2007 Korea-Japan Joint Workshop on Algorithms and Computation, pp. 32-39. 2007 Korea-Japan Joint Workshop on Algorithms and Computation, pp. 32-39. 2007 Refereed English Disclose to all
T. Imamichi, Hiroshi Nagamochi T. Imamichi, Hiroshi Nagamochi T. Imamichi, Hiroshi Nagamochi Packing sets of circles with shape-memory, Packing sets of circles with shape-memory, Packing sets of circles with shape-memory, INFORMS International Puerto Rico 2007 INFORMS International Puerto Rico 2007 INFORMS International Puerto Rico 2007 2007 Refereed English Disclose to all
T. Fukunaga, Hiroshi Nagamochi T. Fukunaga, Hiroshi Nagamochi T. Fukunaga, Hiroshi Nagamochi The set connector problems in graphs The set connector problems in graphs The set connector problems in graphs The Twelfth Conference on Integer Programming and Combinatorial Optimization, IPCO 2007, The Twelfth Conference on Integer Programming and Combinatorial Optimization, IPCO 2007, The Twelfth Conference on Integer Programming and Combinatorial Optimization, IPCO 2007, 2007 Refereed English Disclose to all
S.-H. Hong, Hiroshi Nagamochi S.-H. Hong, Hiroshi Nagamochi S.-H. Hong, Hiroshi Nagamochi A linear time algorithm for symmetric convex drawings of triconnected planar graphs, A linear time algorithm for symmetric convex drawings of triconnected planar graphs, A linear time algorithm for symmetric convex drawings of triconnected planar graphs, The Kyoto International Conference on Computational Geometry and Graph Theory (KyotoCGGT2007) The Kyoto International Conference on Computational Geometry and Graph Theory (KyotoCGGT2007) The Kyoto International Conference on Computational Geometry and Graph Theory (KyotoCGGT2007) 2007 Refereed English Disclose to all
J. Wang, L. Zhao, Hiroshi Nagamochi, T. Akutsu J. Wang, L. Zhao, Hiroshi Nagamochi, T. Akutsu J. Wang, L. Zhao, Hiroshi Nagamochi, T. Akutsu An efficient enumeration of colored outerplanar graphs An efficient enumeration of colored outerplanar graphs An efficient enumeration of colored outerplanar graphs The 4th Annual Conference on Theory and Applications of Models of Computation(TAMC07) The 4th Annual Conference on Theory and Applications of Models of Computation(TAMC07) The 4th Annual Conference on Theory and Applications of Models of Computation(TAMC07) 2007 Refereed English Disclose to all
Ehab Morsy, Hiroshi Nagamochi Ehab Morsy, Hiroshi Nagamochi Ehab Morsy, Hiroshi Nagamochi Approximating capacitated tree-routings in networks Approximating capacitated tree-routings in networks Approximating capacitated tree-routings in networks THEORY AND APPLICATIONS OF MODELS OF COMPUTATION, PROCEEDINGS, 4484, 342-+ THEORY AND APPLICATIONS OF MODELS OF COMPUTATION, PROCEEDINGS, 4484, 342-+ THEORY AND APPLICATIONS OF MODELS OF COMPUTATION, PROCEEDINGS, 4484, 342-+ 2007 Refereed English Disclose to all
Hiroshi Nagamochi Hiroshi Nagamochi Hiroshi Nagamochi Approximating minimum k-partitions in submodular systems Approximating minimum k-partitions in submodular systems Approximating minimum k-partitions in submodular systems ICKS 2007: Second International Conference on Informatics Research for Development of Knowledge Society Infrastructure, Proceedings, 119-126 ICKS 2007: Second International Conference on Informatics Research for Development of Knowledge Society Infrastructure, Proceedings, 119-126 ICKS 2007: Second International Conference on Informatics Research for Development of Knowledge Society Infrastructure, Proceedings, 119-126 2007 Refereed English Disclose to all
Kazuya Haraguchi, Hiroshi Nagamochi Kazuya Haraguchi, Hiroshi Nagamochi Kazuya Haraguchi, Hiroshi Nagamochi Extension of ICF classifiers to real world data sets Extension of ICF classifiers to real world data sets Extension of ICF classifiers to real world data sets NEW TRENDS IN APPLIED ARTIFICIAL INTELLIGENCE, PROCEEDINGS, 4570, 776-+ NEW TRENDS IN APPLIED ARTIFICIAL INTELLIGENCE, PROCEEDINGS, 4570, 776-+ NEW TRENDS IN APPLIED ARTIFICIAL INTELLIGENCE, PROCEEDINGS, 4570, 776-+ 2007 Refereed English Disclose to all
Jun Uchida, Yoshiyuki Karuno, Hiroshi Nagamochi Jun Uchida, Yoshiyuki Karuno, Hiroshi Nagamochi Jun Uchida, Yoshiyuki Karuno, Hiroshi Nagamochi Heuristics for a scheduling problem of minimizing the number of one-way vehicles on paths with deadlines Heuristics for a scheduling problem of minimizing the number of one-way vehicles on paths with deadlines Heuristics for a scheduling problem of minimizing the number of one-way vehicles on paths with deadlines PROCEEDINGS OF SICE ANNUAL CONFERENCE, VOLS 1-8, 2624-+ PROCEEDINGS OF SICE ANNUAL CONFERENCE, VOLS 1-8, 2624-+ PROCEEDINGS OF SICE ANNUAL CONFERENCE, VOLS 1-8, 2624-+ 2007 Refereed English Disclose to all
Liang Zhao, Akira Shimae, Hiroshi Nagamochi Liang Zhao, Akira Shimae, Hiroshi Nagamochi Liang Zhao, Akira Shimae, Hiroshi Nagamochi Linear-tree rule structure for firewall optimization Linear-tree rule structure for firewall optimization Linear-tree rule structure for firewall optimization PROCEEDINGS OF THE SIXTH IASTED INTERNATIONAL CONFERENCE ON COMMUNICATIONS, INTERNET, AND INFORMATION TECHNOLOGY, 67-72 PROCEEDINGS OF THE SIXTH IASTED INTERNATIONAL CONFERENCE ON COMMUNICATIONS, INTERNET, AND INFORMATION TECHNOLOGY, 67-72 PROCEEDINGS OF THE SIXTH IASTED INTERNATIONAL CONFERENCE ON COMMUNICATIONS, INTERNET, AND INFORMATION TECHNOLOGY, 67-72 2007 Refereed English Disclose to all
Akifumi Kawaguchi, Hiroshi Nagamochi Akifumi Kawaguchi, Hiroshi Nagamochi Akifumi Kawaguchi, Hiroshi Nagamochi Orthogonal drawings for plane graphs with specified face areas Orthogonal drawings for plane graphs with specified face areas Orthogonal drawings for plane graphs with specified face areas THEORY AND APPLICATIONS OF MODELS OF COMPUTATION, PROCEEDINGS, 4484, 584-+ THEORY AND APPLICATIONS OF MODELS OF COMPUTATION, PROCEEDINGS, 4484, 584-+ THEORY AND APPLICATIONS OF MODELS OF COMPUTATION, PROCEEDINGS, 4484, 584-+ 2007 Refereed English Disclose to all
Morihiro Hayashida, Tatsuya Akutsu, Hiroshi Nagamochi Morihiro Hayashida, Tatsuya Akutsu, Hiroshi Nagamochi Morihiro Hayashida, Tatsuya Akutsu, Hiroshi Nagamochi A novel clustering method for analysis of biological networks using maximal components of graphs A novel clustering method for analysis of biological networks using maximal components of graphs A novel clustering method for analysis of biological networks using maximal components of graphs PROCEEDINGS OF THE 5TH ASIA- PACIFIC BIOINFOMATICS CONFERENCE 2007, 5, 257-+ PROCEEDINGS OF THE 5TH ASIA- PACIFIC BIOINFOMATICS CONFERENCE 2007, 5, 257-+ PROCEEDINGS OF THE 5TH ASIA- PACIFIC BIOINFOMATICS CONFERENCE 2007, 5, 257-+ 2007 Refereed English Disclose to all
HAYASHIDA Morihiro, AKUTSU Tatsuya, NAGAMOCHI Hiroshi 林田 守広, 阿久津 達也, 永持仁 HAYASHIDA Morihiro, AKUTSU Tatsuya, NAGAMOCHI Hiroshi A novel clustering method for analysis of biological networks using maximal components of graphs グラフの極大成分を用いた生物ネットワークの解析 A novel clustering method for analysis of biological networks using maximal components of graphs IPSJ SIG technical reports, 2006, 99, 1-8 情報処理学会研究報告バイオ情報学(BIO), 2006, 99, 1-8 IPSJ SIG technical reports, 2006, 99, 1-8 2006/09/15 English Disclose to all
Morsy Ehab, Nagamochi Hiroshi Morsy Ehab, Nagamochi Hiroshi Morsy Ehab, Nagamochi Hiroshi 1A2 AN IMPROVED APPROXIMATION ALGORITHM FOR CAPACITATED MULTICAST ROUTINGS IN NETWORKS(Technical session 1A: Combinatorial optimization) 1A2 AN IMPROVED APPROXIMATION ALGORITHM FOR CAPACITATED MULTICAST ROUTINGS IN NETWORKS(Technical session 1A: Combinatorial optimization) 1A2 AN IMPROVED APPROXIMATION ALGORITHM FOR CAPACITATED MULTICAST ROUTINGS IN NETWORKS(Technical session 1A: Combinatorial optimization) Proceedings of International Symposium on Scheduling, 2006, 12-17 Proceedings of International Symposium on Scheduling, 2006, 12-17 Proceedings of International Symposium on Scheduling, 2006, 12-17 2006/07/18 Refereed English Disclose to all
Nakao Yoshitaka, Nagamochi Hiroshi Nakao Yoshitaka, Nagamochi Hiroshi Nakao Yoshitaka, Nagamochi Hiroshi 2B1 A DP-BASED HEURISTIC ALGORITHM FOR THE DISCRETE SPLIT DELIVERY VEHICLE ROUTING PROBLEM(Technical session 2B: Vehicle scheduling and communication) 2B1 A DP-BASED HEURISTIC ALGORITHM FOR THE DISCRETE SPLIT DELIVERY VEHICLE ROUTING PROBLEM(Technical session 2B: Vehicle scheduling and communication) 2B1 A DP-BASED HEURISTIC ALGORITHM FOR THE DISCRETE SPLIT DELIVERY VEHICLE ROUTING PROBLEM(Technical session 2B: Vehicle scheduling and communication) Proceedings of International Symposium on Scheduling, 2006, 42-47 Proceedings of International Symposium on Scheduling, 2006, 42-47 Proceedings of International Symposium on Scheduling, 2006, 42-47 2006/07/18 Refereed English Disclose to all
Ibaraki Toshihide, Ishikawa Akihiro, Nagamochi Hiroshi, Nonobe Koji, Yagiura Mutsunori Ibaraki Toshihide, Ishikawa Akihiro, Nagamochi Hiroshi, Nonobe Koji, Yagiura Mutsunori Ibaraki Toshihide, Ishikawa Akihiro, Nagamochi Hiroshi, Nonobe Koji, Yagiura Mutsunori 6B2 AN ITERATED LOCAL SEARCH ALGORITHM FOR THE MULTI-RESOURCE GENERALIZED ASSIGNMENT PROBLEM WITH FLEXIBLE ASSIGNMENT COST(Technical session 6B: General model for scheduling and assignment problem) 6B2 AN ITERATED LOCAL SEARCH ALGORITHM FOR THE MULTI-RESOURCE GENERALIZED ASSIGNMENT PROBLEM WITH FLEXIBLE ASSIGNMENT COST(Technical session 6B: General model for scheduling and assignment problem) 6B2 AN ITERATED LOCAL SEARCH ALGORITHM FOR THE MULTI-RESOURCE GENERALIZED ASSIGNMENT PROBLEM WITH FLEXIBLE ASSIGNMENT COST(Technical session 6B: General model for scheduling and assignment problem) Proceedings of International Symposium on Scheduling, 2006, 160-165 Proceedings of International Symposium on Scheduling, 2006, 160-165 Proceedings of International Symposium on Scheduling, 2006, 160-165 2006/07/18 Refereed English Disclose to all
Imamichi Takashi, Nagamochi Hiroshi, Yagiura Mutsunori Imamichi Takashi, Nagamochi Hiroshi, Yagiura Mutsunori Imamichi Takashi, Nagamochi Hiroshi, Yagiura Mutsunori 5B2 AN ITERATED LOCAL SEARCH ALGORITHM BASED ON NONLINEAR PROGRAMMING FOR THE IRREGULAR STRIP PACKING PROBLEM(Technical session 5B: Packing problem) 5B2 AN ITERATED LOCAL SEARCH ALGORITHM BASED ON NONLINEAR PROGRAMMING FOR THE IRREGULAR STRIP PACKING PROBLEM(Technical session 5B: Packing problem) 5B2 AN ITERATED LOCAL SEARCH ALGORITHM BASED ON NONLINEAR PROGRAMMING FOR THE IRREGULAR STRIP PACKING PROBLEM(Technical session 5B: Packing problem) Proceedings of International Symposium on Scheduling, 2006, 132-137 Proceedings of International Symposium on Scheduling, 2006, 132-137 Proceedings of International Symposium on Scheduling, 2006, 132-137 2006/07/18 Refereed English Disclose to all
T. Fukunaga, Hiroshi Nagamochi T. Fukunaga, Hiroshi Nagamochi T. Fukunaga, Hiroshi Nagamochi Some theorems on detachments preserving local-edge-connectivity Some theorems on detachments preserving local-edge-connectivity Some theorems on detachments preserving local-edge-connectivity Fifth CRACOW Conference on Graph Theory (USTRON '06), CCGT Fifth CRACOW Conference on Graph Theory (USTRON '06), CCGT Fifth CRACOW Conference on Graph Theory (USTRON '06), CCGT 2006 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 COMPUTING AND COMBINATORICS, PROCEEDINGS, 4112, 274-283 COMPUTING AND COMBINATORICS, PROCEEDINGS, 4112, 274-283 COMPUTING AND COMBINATORICS, PROCEEDINGS, 4112, 274-283 2006 Refereed English Disclose to all
Takuro Fukunaga, Hiroshi Nagamochi Takuro Fukunaga, Hiroshi Nagamochi Takuro Fukunaga, 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 APPROXIMATION AND ONLINE ALGORITHMS, 4368, 188-201 APPROXIMATION AND ONLINE ALGORITHMS, 4368, 188-201 APPROXIMATION AND ONLINE ALGORITHMS, 4368, 188-201 2006 Refereed English Disclose to all
M. Yagiura, Toshihide Ibaraki, T. Imamichi, Y. Koga, Hiroshi Nagamochi, K. Nonobe M. Yagiura, Toshihide Ibaraki, T. Imamichi, Y. Koga, Hiroshi Nagamochi, K. Nonobe M. Yagiura, Toshihide Ibaraki, T. Imamichi, Y. Koga, Hiroshi Nagamochi, K. Nonobe Efficient branch-and-bound algorithms for weighted MAX-2-SAT Efficient branch-and-bound algorithms for weighted MAX-2-SAT Efficient branch-and-bound algorithms for weighted MAX-2-SAT The 21st European Conference on Operational Research (EURO XXI) The 21st European Conference on Operational Research (EURO XXI) The 21st European Conference on Operational Research (EURO XXI) 2006 Refereed English Disclose to all
T. Imamichi, M. Yagiura, Hiroshi Nagamochi T. Imamichi, M. Yagiura, Hiroshi Nagamochi T. Imamichi, M. Yagiura, Hiroshi Nagamochi An iterated local search algorithm based on nonlinear programming for the irregular strip packing problem An iterated local search algorithm based on nonlinear programming for the irregular strip packing problem An iterated local search algorithm based on nonlinear programming for the irregular strip packing problem The 19th conference of the European Chapter on Combinatorial Optimization (ECCO XIX) and the International Symposium on Combinatorial Optimisation 2006 (CO 2006) The 19th conference of the European Chapter on Combinatorial Optimization (ECCO XIX) and the International Symposium on Combinatorial Optimisation 2006 (CO 2006) The 19th conference of the European Chapter on Combinatorial Optimization (ECCO XIX) and the International Symposium on Combinatorial Optimisation 2006 (CO 2006) 2006 Refereed English Disclose to all
Kouji Hirata, Takahiro Matsuda, Hiroshi Nagamochi, Tetsuya Takine Kouji Hirata, Takahiro Matsuda, Hiroshi Nagamochi, Tetsuya Takine Kouji Hirata, Takahiro Matsuda, Hiroshi Nagamochi, Tetsuya Takine Contention-free λ-planes in optically burst-switched WDM networks Contention-free λ-planes in optically burst-switched WDM networks Contention-free λ-planes in optically burst-switched WDM networks GLOBECOM - IEEE Global Telecommunications Conference GLOBECOM - IEEE Global Telecommunications Conference GLOBECOM - IEEE Global Telecommunications Conference 2006 Refereed English Disclose to all
M. Sakashita, K. Makino, Hiroshi Nagamochi, S. Fujishige M. Sakashita, K. Makino, Hiroshi Nagamochi, S. Fujishige M. Sakashita, K. Makino, Hiroshi Nagamochi, S. Fujishige Minimum transversals in posi-modular systems Minimum transversals in posi-modular systems Minimum transversals in posi-modular systems ESA 2006, 14th Annual European Symposium on Algorithms ESA 2006, 14th Annual European Symposium on Algorithms ESA 2006, 14th Annual European Symposium on Algorithms 2006 Refereed English Disclose to all
S.-H. Hong, Hiroshi Nagamochi S.-H. Hong, Hiroshi Nagamochi S.-H. Hong, Hiroshi Nagamochi Convex drawings of hierarchical plane graphs Convex drawings of hierarchical plane graphs Convex drawings of hierarchical plane graphs 17th Australasian Workshop on Combinatorial Algorithms (AWOCA 2006) 17th Australasian Workshop on Combinatorial Algorithms (AWOCA 2006) 17th Australasian Workshop on Combinatorial Algorithms (AWOCA 2006) 2006 Refereed English Disclose to all
T. Fukunaga, H. Nagamochi T. Fukunaga, H. Nagamochi T. Fukunaga, H. Nagamochi Approximating minimum cost multigraphs of specified edge-connectivity under degree bounds, Approximating minimum cost multigraphs of specified edge-connectivity under degree bounds, Approximating minimum cost multigraphs of specified edge-connectivity under degree bounds, Proceedings of the 9th Japan-Korea Joint Workshop on Algorithm and Computation (WAAC06),, pp. 25-32. Proceedings of the 9th Japan-Korea Joint Workshop on Algorithm and Computation (WAAC06),, pp. 25-32. Proceedings of the 9th Japan-Korea Joint Workshop on Algorithm and Computation (WAAC06),, pp. 25-32. 2006 Refereed English Disclose to all
S.-H. Hong, Hiroshi Nagamochi S.-H. Hong, Hiroshi Nagamochi S.-H. Hong, Hiroshi Nagamochi Convex drawings with non-convex boundary, Convex drawings with non-convex boundary, Convex drawings with non-convex boundary, 32nd International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2006) 32nd International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2006) 32nd International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2006) 2006 Refereed English Disclose to all
Kouji Hirata, Takahiro Matsuda, Hiroshi Nagamochi, Tetsuya Takine Kouji Hirata, Takahiro Matsuda, Hiroshi Nagamochi, Tetsuya Takine Kouji Hirata, Takahiro Matsuda, Hiroshi Nagamochi, Tetsuya Takine Contention-free λ-planes in optically burst-switched WDM networks Contention-free λ-planes in optically burst-switched WDM networks Contention-free λ-planes in optically burst-switched WDM networks GLOBECOM - IEEE Global Telecommunications Conference GLOBECOM - IEEE Global Telecommunications Conference GLOBECOM - IEEE Global Telecommunications Conference 2006 Refereed English Disclose to all
Y. Koga, M. Yagiura, K. Nonobe, T. Imamichi, Hiroshi Nagamochi, Toshihide Ibaraki Y. Koga, M. Yagiura, K. Nonobe, T. Imamichi, Hiroshi Nagamochi, Toshihide Ibaraki Y. Koga, M. Yagiura, K. Nonobe, T. Imamichi, Hiroshi Nagamochi, Toshihide Ibaraki Efficient branch-and-bound algorithms for weighted MAX-2-SAT Efficient branch-and-bound algorithms for weighted MAX-2-SAT Efficient branch-and-bound algorithms for weighted MAX-2-SAT Third International Conference on Innovative Applications of Information Technology for the Developing World(Asian Applied Computing Conference (AACC 2005)) Third International Conference on Innovative Applications of Information Technology for the Developing World(Asian Applied Computing Conference (AACC 2005)) Third International Conference on Innovative Applications of Information Technology for the Developing World(Asian Applied Computing Conference (AACC 2005)) 2005 Refereed English Disclose to all
K. Haraguchi, Hiroshi Nagamochi, Toshihide Ibaraki K. Haraguchi, Hiroshi Nagamochi, Toshihide Ibaraki K. Haraguchi, Hiroshi Nagamochi, Toshihide Ibaraki Experimental studies on representation complexity and error rates of iteratively composed features, Experimental studies on representation complexity and error rates of iteratively composed features, Experimental studies on representation complexity and error rates of iteratively composed features, Third International Conference on Innovative Applications of Information Technology for the Developing World (Asian Applied Computing Conference (AACC 2005)) Third International Conference on Innovative Applications of Information Technology for the Developing World (Asian Applied Computing Conference (AACC 2005)) Third International Conference on Innovative Applications of Information Technology for the Developing World (Asian Applied Computing Conference (AACC 2005)) 2005 Refereed English Disclose to all
Y. Karuno, Hiroshi Nagamochi Y. Karuno, Hiroshi Nagamochi Y. Karuno, Hiroshi Nagamochi Minimizing capacitated tree covers of graphs Minimizing capacitated tree covers of graphs Minimizing capacitated tree covers of graphs Third International Conference on Innovative Applications of Information Technology for the Developing World(Asian Applied Computing Conference (AACC 2005) Third International Conference on Innovative Applications of Information Technology for the Developing World(Asian Applied Computing Conference (AACC 2005) Third International Conference on Innovative Applications of Information Technology for the Developing World(Asian Applied Computing Conference (AACC 2005) 2005 Refereed English Disclose to all
Hiroshi Nagamochi Hiroshi Nagamochi Hiroshi Nagamochi Heuristics for the Minmax Subtree Cover in Graphs Heuristics for the Minmax Subtree Cover in Graphs Heuristics for the Minmax Subtree Cover in Graphs The IFORS Triennial 2005 Conference, The IFORS Triennial 2005 Conference, The IFORS Triennial 2005 Conference, 2005 Refereed English Disclose to all
M. Nishihara, M. Yagiura, Toshihide Ibaraki, Hiroshi Nagamochi M. Nishihara, M. Yagiura, Toshihide Ibaraki, Hiroshi Nagamochi M. Nishihara, M. Yagiura, Toshihide Ibaraki, Hiroshi Nagamochi The relation between option pricing and optimization problems The relation between option pricing and optimization problems The relation between option pricing and optimization problems The IFORS Triennial 2005 Conference, The IFORS Triennial 2005 Conference, The IFORS Triennial 2005 Conference, 2005 Refereed English Disclose to all
M. Kenmochi, T. Imamichi, K. Nonobe, M. Yagiura, Hiroshi Nagamochi M. Kenmochi, T. Imamichi, K. Nonobe, M. Yagiura, Hiroshi Nagamochi M. Kenmochi, T. Imamichi, K. Nonobe, M. Yagiura, Hiroshi Nagamochi Exact algorithms for the 2-dimensional strip packing problem with rotations, Exact algorithms for the 2-dimensional strip packing problem with rotations, Exact algorithms for the 2-dimensional strip packing problem with rotations, The IFORS Triennial 2005 Conference The IFORS Triennial 2005 Conference The IFORS Triennial 2005 Conference 2005 Refereed English Disclose to all
T. Imamichi, M. Kenmochi, K. Nonobe, M. Yagiura, Hiroshi Nagamochi T. Imamichi, M. Kenmochi, K. Nonobe, M. Yagiura, Hiroshi Nagamochi T. Imamichi, M. Kenmochi, K. Nonobe, M. Yagiura, Hiroshi Nagamochi Branch-and-bound algorithms for rectangular strip packing and perfect packing problems, Branch-and-bound algorithms for rectangular strip packing and perfect packing problems, Branch-and-bound algorithms for rectangular strip packing and perfect packing problems, ESICUP (EURO Special Interest Group on Cutting and Packing) 2nd Meeting, ESICUP (EURO Special Interest Group on Cutting and Packing) 2nd Meeting, ESICUP (EURO Special Interest Group on Cutting and Packing) 2nd Meeting, 2005 Refereed English Disclose to all
Y. Kamidoi, N. Yoshida, Hiroshi Nagamochi Y. Kamidoi, N. Yoshida, Hiroshi Nagamochi Y. Kamidoi, N. Yoshida, Hiroshi Nagamochi A deterministic algorithm for finding all minimum k-way cuts, A deterministic algorithm for finding all minimum k-way cuts, A deterministic algorithm for finding all minimum k-way cuts, 4th Japanese-Hungarian Symposium on Discrete Mathematics and Its Applications,pp. 224-233., 4th Japanese-Hungarian Symposium on Discrete Mathematics and Its Applications,pp. 224-233., 4th Japanese-Hungarian Symposium on Discrete Mathematics and Its Applications,pp. 224-233., 2005 Refereed English Disclose to all
T. Fukunaga, Hiroshi Nagamochi T. Fukunaga, Hiroshi Nagamochi T. Fukunaga, Hiroshi Nagamochi Edge packing problem with edge capacity constraints Edge packing problem with edge capacity constraints Edge packing problem with edge capacity constraints 4th Janese-Hungarian Symposium on Discrete Mathematics and Its Applications,pp. 69-75. , 4th Janese-Hungarian Symposium on Discrete Mathematics and Its Applications,pp. 69-75. , 4th Janese-Hungarian Symposium on Discrete Mathematics and Its Applications,pp. 69-75. , 2005 Refereed English Disclose to all
K. Haraguchi, Hiroshi Nagamochi, Toshihide Ibaraki K. Haraguchi, Hiroshi Nagamochi, Toshihide Ibaraki K. Haraguchi, Hiroshi Nagamochi, Toshihide Ibaraki Compactness of classifiers by iterative compositions of features Compactness of classifiers by iterative compositions of features Compactness of classifiers by iterative compositions of features 4th Japanese-Hungarian Symposium on Discrete Mathematics and Its Applications,pp. 92-98. 4th Japanese-Hungarian Symposium on Discrete Mathematics and Its Applications,pp. 92-98. 4th Japanese-Hungarian Symposium on Discrete Mathematics and Its Applications,pp. 92-98. 2005 Refereed English Disclose to all
T Ishii, K Iwata, H Nagamochi T Ishii, K Iwata, H Nagamochi T Ishii, K Iwata, H Nagamochi Bisecting a four-connected graph with three resource sets Bisecting a four-connected graph with three resource sets Bisecting a four-connected graph with three resource sets ALGORITHMS AND COMPUTATION, 3827, 176-185 ALGORITHMS AND COMPUTATION, 3827, 176-185 ALGORITHMS AND COMPUTATION, 3827, 176-185 2005 Refereed English Disclose to all
T. Ishii, H. Fujita, Hiroshi Nagamochi T. Ishii, H. Fujita, Hiroshi Nagamochi T. Ishii, H. Fujita, Hiroshi Nagamochi Minimum cost source location problem with local 3-vertex-connectivity requirements, Minimum cost source location problem with local 3-vertex-connectivity requirements, Minimum cost source location problem with local 3-vertex-connectivity requirements, Computing: The Australasian Theory Symposium (CATS) Australasian Computer Science Week, pp.97-105. Computing: The Australasian Theory Symposium (CATS) Australasian Computer Science Week, pp.97-105. Computing: The Australasian Theory Symposium (CATS) Australasian Computer Science Week, pp.97-105. 2005 Refereed English Disclose to all
T Ishii, K Iwata, H Nagamochi T Ishii, K Iwata, H Nagamochi T Ishii, K Iwata, H Nagamochi Bisecting a four-connected graph with three resource sets Bisecting a four-connected graph with three resource sets Bisecting a four-connected graph with three resource sets ALGORITHMS AND COMPUTATION, 3827, 176-185 ALGORITHMS AND COMPUTATION, 3827, 176-185 ALGORITHMS AND COMPUTATION, 3827, 176-185 2005 Refereed English Disclose to all
T Fukunaga, H Nagamochi T Fukunaga, H Nagamochi T Fukunaga, H Nagamochi Approximation algorithms for the b-edge dominating set problem and its related problems Approximation algorithms for the b-edge dominating set problem and its related problems Approximation algorithms for the b-edge dominating set problem and its related problems COMPUTING AND COMBINATORICS, PROCEEDINGS, 3595, 747-756 COMPUTING AND COMBINATORICS, PROCEEDINGS, 3595, 747-756 COMPUTING AND COMBINATORICS, PROCEEDINGS, 3595, 747-756 2005 Refereed English Disclose to all
H Nagamochi, T Kawada H Nagamochi, T Kawada H Nagamochi, T Kawada Approximating the minmax subtree cover problem in a cactus Approximating the minmax subtree cover problem in a cactus Approximating the minmax subtree cover problem in a cactus ALGORITHMS AND COMPUTATION, 3341, 705-716 ALGORITHMS AND COMPUTATION, 3341, 705-716 ALGORITHMS AND COMPUTATION, 3341, 705-716 2004 Refereed English 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 Electronic Notes in Theoretical Computer Science, 78, 243-266 Electronic Notes in Theoretical Computer Science, 78, 243-266 Electronic Notes in Theoretical Computer Science, 78, 243-266 2003/04 Refereed English Disclose to all
Hiroshi Nagamochi, K. Kuroya Hiroshi Nagamochi, K. Kuroya Hiroshi Nagamochi, K. Kuroya Convex drawing for c-planar biconnected clustered graphs Convex drawing for c-planar biconnected clustered graphs Convex drawing for c-planar biconnected clustered graphs The 11th International Symposium on Graph Drawing (GD2003) The 11th International Symposium on Graph Drawing (GD2003) The 11th International Symposium on Graph Drawing (GD2003) 2003 Refereed English Disclose to all
Hiroshi Nagamochi Hiroshi Nagamochi Hiroshi Nagamochi An improved approximation to the one-sided bilayer drawing An improved approximation to the one-sided bilayer drawing An improved approximation to the one-sided bilayer drawing The 11th International Symposium on Graph Drawing (GD2003) The 11th International Symposium on Graph Drawing (GD2003) The 11th International Symposium on Graph Drawing (GD2003) 2003 Refereed English Disclose to all
Hiroshi Nagamochi, N. Yamada Hiroshi Nagamochi, N. Yamada Hiroshi Nagamochi, N. Yamada Fast algorithms for counting bilayer crossings Fast algorithms for counting bilayer crossings Fast algorithms for counting bilayer crossings 7th Japan-Korea Joint Workshop on Algorithms and Computation, pp.203-209. 7th Japan-Korea Joint Workshop on Algorithms and Computation, pp.203-209. 7th Japan-Korea Joint Workshop on Algorithms and Computation, pp.203-209. 2003 Refereed English Disclose to all
永持 仁 永持 仁 永持 仁 Source location problem with local 3-vertex-connectivity requirements, "jointly worked " Source location problem with local 3-vertex-connectivity requirements, "jointly worked " Source location problem with local 3-vertex-connectivity requirements, "jointly worked " the 3rd Hungarian-Japanese Symposium on Discrete Mathematics and Its Applications,/ , 368-377 the 3rd Hungarian-Japanese Symposium on Discrete Mathematics and Its Applications,/ , 368-377 the 3rd Hungarian-Japanese Symposium on Discrete Mathematics and Its Applications,/ , 368-377 2003 Refereed English Disclose to all
永持 仁 永持 仁 永持 仁 Computing extreme sets in graphs and its applications Computing extreme sets in graphs and its applications Computing extreme sets in graphs and its applications the 3rd Hungarian-Japanese Symposium on Discrete Mathematics and Its Applications,/ , 349-357 the 3rd Hungarian-Japanese Symposium on Discrete Mathematics and Its Applications,/ , 349-357 the 3rd Hungarian-Japanese Symposium on Discrete Mathematics and Its Applications,/ , 349-357 2003 Refereed English Disclose to all
永持 仁 永持 仁 永持 仁 Can a hypergraph cover every convex polygon?, "jointly worked " Can a hypergraph cover every convex polygon?, "jointly worked " Can a hypergraph cover every convex polygon?, "jointly worked " the 3rd Hungarian-Japanese Symposium on Discrete Mathematics and Its Applications,/ , 293-302 the 3rd Hungarian-Japanese Symposium on Discrete Mathematics and Its Applications,/ , 293-302 the 3rd Hungarian-Japanese Symposium on Discrete Mathematics and Its Applications,/ , 293-302 2003 Refereed English Disclose to all
永持 仁 永持 仁 永持 仁 A simple recognition of maximal planar graphs, "jointly worked " A simple recognition of maximal planar graphs, "jointly worked " A simple recognition of maximal planar graphs, "jointly worked " Proceedings of the 7th Japan-Korea Joint Workshop on Algorithms and Computation,/ , 182-188 Proceedings of the 7th Japan-Korea Joint Workshop on Algorithms and Computation,/ , 182-188 Proceedings of the 7th Japan-Korea Joint Workshop on Algorithms and Computation,/ , 182-188 2003 Refereed English Disclose to all
永持 仁 永持 仁 永持 仁 A simple and robust algorithm for bisecting a triconnected graph with two resource sets, "jointly worked " A simple and robust algorithm for bisecting a triconnected graph with two resource sets, "jointly worked " A simple and robust algorithm for bisecting a triconnected graph with two resource sets, "jointly worked " Proceedings of the 7th Japan-Korea Joint Workshop on Algorithms and Computation,/ , 210-222 Proceedings of the 7th Japan-Korea Joint Workshop on Algorithms and Computation,/ , 210-222 Proceedings of the 7th Japan-Korea Joint Workshop on Algorithms and Computation,/ , 210-222 2003 Refereed English Disclose to all
T Ishii, S Yamamoto, H Nagamochi T Ishii, S Yamamoto, H Nagamochi T Ishii, S Yamamoto, H Nagamochi Augmenting forests to meet odd diameter requirements Augmenting forests to meet odd diameter requirements Augmenting forests to meet odd diameter requirements ALGORITHMS AND COMPUTATION, PROCEEDINGS, 2906, 434-443 ALGORITHMS AND COMPUTATION, PROCEEDINGS, 2906, 434-443 ALGORITHMS AND COMPUTATION, PROCEEDINGS, 2906, 434-443 2003 Refereed English Disclose to all
Y Karuno, H Nagamochi Y Karuno, H Nagamochi Y Karuno, H Nagamochi A better approximation for the two-machine flowshop scheduling problem with time lags A better approximation for the two-machine flowshop scheduling problem with time lags A better approximation for the two-machine flowshop scheduling problem with time lags ALGORITHMS AND COMPUTATION, PROCEEDINGS, 2906, 309-318 ALGORITHMS AND COMPUTATION, PROCEEDINGS, 2906, 309-318 ALGORITHMS AND COMPUTATION, PROCEEDINGS, 2906, 309-318 2003 Refereed English Disclose to all
H Nagamochi, Y Abe H Nagamochi, Y Abe H Nagamochi, Y Abe An approximation algorithm for dissecting a rectangle into rectangles with specified areas An approximation algorithm for dissecting a rectangle into rectangles with specified areas An approximation algorithm for dissecting a rectangle into rectangles with specified areas ALGORITHMS AND COMPUTATION, PROCEEDINGS, 2906, 280-289 ALGORITHMS AND COMPUTATION, PROCEEDINGS, 2906, 280-289 ALGORITHMS AND COMPUTATION, PROCEEDINGS, 2906, 280-289 2003 Refereed English Disclose to all
H Nagamochi, K Okada H Nagamochi, K Okada H Nagamochi, K Okada Polynomial time 2-approximation algorithms for the minmax subtree cover problem Polynomial time 2-approximation algorithms for the minmax subtree cover problem Polynomial time 2-approximation algorithms for the minmax subtree cover problem ALGORITHMS AND COMPUTATION, PROCEEDINGS, 2906, 138-147 ALGORITHMS AND COMPUTATION, PROCEEDINGS, 2906, 138-147 ALGORITHMS AND COMPUTATION, PROCEEDINGS, 2906, 138-147 2003 Refereed English Disclose to all
H Ito, H Nagamochi H Ito, H Nagamochi H Ito, H Nagamochi Comparing hypergraphs by areas of hyperedges drawn on a convex polygon Comparing hypergraphs by areas of hyperedges drawn on a convex polygon Comparing hypergraphs by areas of hyperedges drawn on a convex polygon DISCRETE AND COMPUTATIONAL GEOMETRY, 2866, 176-181 DISCRETE AND COMPUTATIONAL GEOMETRY, 2866, 176-181 DISCRETE AND COMPUTATIONAL GEOMETRY, 2866, 176-181 2002 Refereed English Disclose to all
H Ito, H Nagamochi, Y Sugiyama, M Fujita H Ito, H Nagamochi, Y Sugiyama, M Fujita H Ito, H Nagamochi, Y Sugiyama, M Fujita File transfer tree problems File transfer tree problems File transfer tree problems ALGORITHMS AND COMPUTATION, PROCEEDINGS, 2518, 441-452 ALGORITHMS AND COMPUTATION, PROCEEDINGS, 2518, 441-452 ALGORITHMS AND COMPUTATION, PROCEEDINGS, 2518, 441-452 2002 Refereed English Disclose to all
Zhao Liang, Nagamochi Hiroshi, Ibaraki Toshihide 趙 亮, 永持 仁, 茨木 俊秀 Zhao Liang, Nagamochi Hiroshi, Ibaraki Toshihide Greedy Splitting : A Unified Approach for Approximating Some Partition Problems (Mathematical Optimization Theory and its Algorithm) Greedy Splitting: A Unified Approach for Approximating Some Partition Problems (数理最適化の理論とアルゴリズム) Greedy Splitting : A Unified Approach for Approximating Some Partition Problems (Mathematical Optimization Theory and its Algorithm) RIMS Kokyuroku, 1241, 139-147 数理解析研究所講究録, 1241, 139-147 RIMS Kokyuroku, 1241, 139-147 2001/12 English Article, review, commentary, editorial, etc.(bulletin of university, research institution) Disclose to all
ASANO Tetsuo, KATOH Naoki, MATSUI Tomomi, NAGAMOCHI Hiroshi, OBOKATA Koji, TOKUYAMA Takeshi 浅野 哲夫, 加藤 直樹, 松井 知己, 永持 仁, 小保方 幸次, 徳山 豪 ASANO Tetsuo, KATOH Naoki, MATSUI Tomomi, NAGAMOCHI Hiroshi, OBOKATA Koji, TOKUYAMA Takeshi Digital Halftoning : Optimization via Network Flow Algorithm ディジタルハーフトーニング : ネットワークフローアルゴリズムによる最適化 Digital Halftoning : Optimization via Network Flow Algorithm IEICE technical report. Theoretical foundations of Computing, 101, 133, 41-48 電子情報通信学会技術研究報告. COMP, コンピュテーション, 101, 133, 41-48 IEICE technical report. Theoretical foundations of Computing, 101, 133, 41-48 2001/06/18 English Disclose to all
Zhao Liang, Nagamochi Hiroshi, Ibaraki Toshihide 趙 亮, 永持 仁, 茨木 俊秀 Zhao Liang, Nagamochi Hiroshi, Ibaraki Toshihide A Primal-Dual Approximation Algorithm for the Survivable Network Design Problem in Hypergraphs (New Developments of Theory of Computation and Algorithms) A Primal-Dual Approximation Algorithm for the Survivable Network Design Problem in Hypergraphs (New Developments of Theory of Computation and Algorithms) A Primal-Dual Approximation Algorithm for the Survivable Network Design Problem in Hypergraphs (New Developments of Theory of Computation and Algorithms) RIMS Kokyuroku, 1205, 7-12 数理解析研究所講究録, 1205, 7-12 RIMS Kokyuroku, 1205, 7-12 2001/05 English Article, review, commentary, editorial, etc.(bulletin of university, research institution) Disclose to all
Asano Tetsuo, Fujikawa Naoki, Katoh Naoki, Matsui Tomomi, Nagamochi Hiroshi, Tokuyama Takeshi, Usui Nobuaki 浅野 哲夫, 藤川 直樹, 加藤 直樹, 松井 知己, 永持 仁, 徳山 豪, 臼井 信昭 Asano Tetsuo, Fujikawa Naoki, Katoh Naoki, Matsui Tomomi, Nagamochi Hiroshi, Tokuyama Takeshi, Usui Nobuaki Digital Halftoning : Formulation as a Combinatorial Optimization Problem and Approximation Algorithms Based on Network Flow (Algorithm Engineering as a New Paradigm) Digital Halftoning : Formulation as a Combinatorial Optimization Problem and Approximation Algorithms Based on Network Flow (Algorithm Engineering as a New Paradigm) Digital Halftoning : Formulation as a Combinatorial Optimization Problem and Approximation Algorithms Based on Network Flow (Algorithm Engineering as a New Paradigm) RIMS Kokyuroku, 1185, 18-27 数理解析研究所講究録, 1185, 18-27 RIMS Kokyuroku, 1185, 18-27 2001/01 English Disclose to all
Y. Karuno, Hiroshi Nagamochi Y. Karuno, Hiroshi Nagamochi Y. Karuno, Hiroshi Nagamochi A 2-approximation algorithm for the multi-vehicle scheduling on a path with release and handling times A 2-approximation algorithm for the multi-vehicle scheduling on a path with release and handling times A 2-approximation algorithm for the multi-vehicle scheduling on a path with release and handling times 9th Annual European Symposium on Algorithms, BRICS, pp. 218-229. 9th Annual European Symposium on Algorithms, BRICS, pp. 218-229. 9th Annual European Symposium on Algorithms, BRICS, pp. 218-229. 2001 Refereed English Disclose to all
Liang Zhao, Hiroshi Nagamochi, T. Ibaraki Liang Zhao, Hiroshi Nagamochi, T. Ibaraki Liang Zhao, Hiroshi Nagamochi, T. Ibaraki A primal-dual approximation algorithm for the survival network design problem in hypergraphs A primal-dual approximation algorithm for the survival network design problem in hypergraphs A primal-dual approximation algorithm for the survival network design problem in hypergraphs 18th International Symposium on Theoretical Aspects of Computer Science (STACS2001),pp. 478--489 18th International Symposium on Theoretical Aspects of Computer Science (STACS2001),pp. 478--489 18th International Symposium on Theoretical Aspects of Computer Science (STACS2001),pp. 478--489 2001 Refereed English 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 problemsExtended Abstract A unified framework for approximating multiway partition problemsExtended Abstract A unified framework for approximating multiway partition problemsExtended Abstract Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2223, 682-694 Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2223, 682-694 Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2223, 682-694 2001 Refereed English Disclose to all
H Nagamochi, T Ishii H Nagamochi, T Ishii H Nagamochi, T Ishii On the minimum local-vertex-connectivity augmentation in graphs On the minimum local-vertex-connectivity augmentation in graphs On the minimum local-vertex-connectivity augmentation in graphs ALGORITHMS AND COMPUTATION, PROCEEDINGS, 2223, 124-135 ALGORITHMS AND COMPUTATION, PROCEEDINGS, 2223, 124-135 ALGORITHMS AND COMPUTATION, PROCEEDINGS, 2223, 124-135 2001 Refereed English Disclose to all
Y Karuno, H Nagamochi Y Karuno, H Nagamochi Y Karuno, H Nagamochi A polynomial time approximation scheme for the multi-vehicle scheduling problem on a path with release and handling times A polynomial time approximation scheme for the multi-vehicle scheduling problem on a path with release and handling times A polynomial time approximation scheme for the multi-vehicle scheduling problem on a path with release and handling times ALGORITHMS AND COMPUTATION, PROCEEDINGS, 2223, 36-47 ALGORITHMS AND COMPUTATION, PROCEEDINGS, 2223, 36-47 ALGORITHMS AND COMPUTATION, PROCEEDINGS, 2223, 36-47 2001 Refereed English 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 Journal of Combinatorial Optimization, 5, 2, 175-212 Journal of Combinatorial Optimization, 5, 2, 175-212 Journal of Combinatorial Optimization, 5, 2, 175-212 2001 Refereed English Disclose to all
Fujito Toshihiro, Nagamochi Hiroshi 藤戸 敏弘, 永持 仁 Fujito Toshihiro, Nagamochi Hiroshi A 2-Approximation Algorithm for the Edge Dominating Set Problem 辺支配集合問題の2倍近似アルゴリズム A 2-Approximation Algorithm for the Edge Dominating Set Problem IEICE technical report. Theoretical foundations of Computing, 99, 724, 57-63 電子情報通信学会技術研究報告. COMP, コンピュテーション, 99, 724, 57-63 IEICE technical report. Theoretical foundations of Computing, 99, 724, 57-63 2000/03/22 Japanese Disclose to all
T. Ishii, Hiroshi Nagamochi T. Ishii, Hiroshi Nagamochi T. Ishii, Hiroshi Nagamochi Simultaneous augmentation of two graphs to an l-edge-connected graph and a biconnected graph Simultaneous augmentation of two graphs to an l-edge-connected graph and a biconnected graph Simultaneous augmentation of two graphs to an l-edge-connected graph and a biconnected graph 11th Annual International Symposium on Algorithms and Computation, ISAAC'00, pp. 326-337. 11th Annual International Symposium on Algorithms and Computation, ISAAC'00, pp. 326-337. 11th Annual International Symposium on Algorithms and Computation, ISAAC'00, pp. 326-337. 2000 Refereed English Disclose to all
Toshimasa Ishii, Hiroshi Nagamochi Toshimasa Ishii, Hiroshi Nagamochi Toshimasa Ishii, Hiroshi Nagamochi On the minimum augmentation of an l-connected graph to a k-connected graph On the minimum augmentation of an l-connected graph to a k-connected graph On the minimum augmentation of an l-connected graph to a k-connected graph Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 1851, 286-299 Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 1851, 286-299 Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 1851, 286-299 2000 Refereed English Disclose to all
Hiroshi Nagamochi, Tibor Jordan, Yoshitaka Nakao, Toshihide Ibaraki Hiroshi Nagamochi, Tibor Jordan, Yoshitaka Nakao, Toshihide Ibaraki Hiroshi Nagamochi, Tibor Jordan, Yoshitaka Nakao, Toshihide Ibaraki Bisecting two subsets in 3-connected graphs Bisecting two subsets in 3-connected graphs Bisecting two subsets in 3-connected graphs Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 1741, 125-434 Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 1741, 125-434 Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 1741, 125-434 1999 Refereed English 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 Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 1741, 373-382 Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 1741, 373-382 Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 1741, 373-382 1999 Refereed English Disclose to all
Hiroshi Nagamochi, Toshihide Ibaraki Hiroshi Nagamochi, Toshihide Ibaraki Hiroshi Nagamochi, Toshihide Ibaraki An approximation for finding a smallest 2-edge-connected subgraph containing a specified spanning tree An approximation for finding a smallest 2-edge-connected subgraph containing a specified spanning tree An approximation for finding a smallest 2-edge-connected subgraph containing a specified spanning tree Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 1627, 31-40 Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 1627, 31-40 Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 1627, 31-40 1999 Refereed English Disclose to all
Hiroshi Nagamochi, Takashi Shiraki, T. Ibaraki Hiroshi Nagamochi, Takashi Shiraki, T. Ibaraki Hiroshi Nagamochi, Takashi Shiraki, T. Ibaraki Augmenting a submodular and posi-modular set function by a multigraph Augmenting a submodular and posi-modular set function by a multigraph Augmenting a submodular and posi-modular set function by a multigraph The 1st Japanese-Hungarian Symposium on Discrete Mathematics and its Applications The 1st Japanese-Hungarian Symposium on Discrete Mathematics and its Applications The 1st Japanese-Hungarian Symposium on Discrete Mathematics and its Applications 1999 Refereed English 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 Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 1627, 164-173 Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 1627, 164-173 Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 1627, 164-173 1999 Refereed English Disclose to all
H Nagamochi, T Ibaraki H Nagamochi, T Ibaraki H Nagamochi, T Ibaraki A fast algorithm for computing minimum 3-way and 4-way cuts A fast algorithm for computing minimum 3-way and 4-way cuts A fast algorithm for computing minimum 3-way and 4-way cuts INTEGER PROGRAMMING AND COMBINATORIAL OPTIMIZATION, 1610, 377-390 INTEGER PROGRAMMING AND COMBINATORIAL OPTIMIZATION, 1610, 377-390 INTEGER PROGRAMMING AND COMBINATORIAL OPTIMIZATION, 1610, 377-390 1999 Refereed English Disclose to all
永持 仁 永持 仁 永持 仁 Optimal augmentation of a biconnected graph to a k-edge-connected and triconnected graph, "jointly worked " Optimal augmentation of a biconnected graph to a k-edge-connected and triconnected graph, "jointly worked " Optimal augmentation of a biconnected graph to a k-edge-connected and triconnected graph, "jointly worked " Proceedings 9th Annual ACM-SIAM Symposium on Discrete Algorithms,/ , 280-289 Proceedings 9th Annual ACM-SIAM Symposium on Discrete Algorithms,/ , 280-289 Proceedings 9th Annual ACM-SIAM Symposium on Discrete Algorithms,/ , 280-289 1998 Refereed English Disclose to all
MIKI Shigeo, NAKAHIRA Yoshihiro, NAGAMOCHI Hiroshi, SUNAHARA Hideki, OIE Yuji 三木 茂生, 中平 佳裕, 永持 仁, 砂原 秀樹, 尾家 祐二 MIKI Shigeo, NAKAHIRA Yoshihiro, NAGAMOCHI Hiroshi, SUNAHARA Hideki, OIE Yuji Optical Path Assignment Problem for Torus Lightwave Networks 格子型光波網におけるパス割り当て問題に関する考察 Optical Path Assignment Problem for Torus Lightwave Networks 電気学会研究会資料. CMN, 通信研究会, 1997, 1, 129-136 電気学会研究会資料. CMN, 通信研究会, 1997, 1, 129-136 電気学会研究会資料. CMN, 通信研究会, 1997, 1, 129-136 1997/02/21 Japanese Disclose to all
H Nagamochi, T Shiraki, T Ibaraki H Nagamochi, T Shiraki, T Ibaraki H Nagamochi, T Shiraki, T Ibaraki Computing edge-connectivity augmentation function in (O)over-tilde-(nm) time Computing edge-connectivity augmentation function in (O)over-tilde-(nm) time Computing edge-connectivity augmentation function in (O)over-tilde-(nm) time PROCEEDINGS OF THE EIGHTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 649-658 PROCEEDINGS OF THE EIGHTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 649-658 PROCEEDINGS OF THE EIGHTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 649-658 1997 Refereed English Disclose to all
Xiaotie Deng, Toshihide Ibaraki, Hiroshi Nagamochi Xiaotie Deng, Toshihide Ibaraki, Hiroshi Nagamochi Xiaotie Deng, Toshihide Ibaraki, Hiroshi Nagamochi Combinatorial optimization games Combinatorial optimization games Combinatorial optimization games Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, 720-729 Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, 720-729 Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, 720-729 1997 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
嘉藤 学, 河北 隆二, 永持 仁, 尾家 祐二 嘉藤 学, 河北 隆二, 永持 仁, 尾家 祐二 光波ネットワークのノート"再配置アルコ"リズムについて 光波ネットワークのノート"再配置アルコ"リズムについて 電子情報通信学会技術研究報告, SSE95-137, 73-78 電子情報通信学会技術研究報告, SSE95-137, 73-78 , SSE95-137, 73-78 1995/12 Disclose to all
永持 仁 永持 仁 アルゴリズム辞典(共著) アルゴリズム辞典(共著) 共立出版, 共立出版, 1995 Refereed Japanese Disclose to all
永持 仁 永持 仁 永持 仁 Complexity of the single vehicle scheduling problem on graphs, "jointly worked " Complexity of the single vehicle scheduling problem on graphs, "jointly worked " Complexity of the single vehicle scheduling problem on graphs, "jointly worked " Proceedings of the International Workshop Intelligent Scheduling of Robots and Flexible Manufacturing Systems,/ , 89-104 Proceedings of the International Workshop Intelligent Scheduling of Robots and Flexible Manufacturing Systems,/ , 89-104 Proceedings of the International Workshop Intelligent Scheduling of Robots and Flexible Manufacturing Systems,/ , 89-104 1995 Refereed English 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
Hiroshi Nagamochi, Toshihide Ibaraki Hiroshi Nagamochi, Toshihide Ibaraki Hiroshi Nagamochi, Toshihide Ibaraki Algorithmic Aspects of Graph Connectivities Algorithmic Aspects of Graph Connectivities Algorithmic Aspects of Graph Connectivities Encyclopedia of Mathematics and Its Applications, Cambridge University Press Encyclopedia of Mathematics and Its Applications, Cambridge University Press Encyclopedia of Mathematics and Its Applications, Cambridge University Press 2008 English Disclose to all
永持 仁 永持 仁 アルゴリズム工学 - 計算困難問題への挑戦 - アルゴリズム工学 - 計算困難問題への挑戦 - 共立出版 共立出版 2001 Japanese Disclose to all
永持 仁 永持 仁 アルゴリズム工学―計算困難問題への挑戦―、第4.1章 グラフの連結度(共著) アルゴリズム工学―計算困難問題への挑戦―、第4.1章 グラフの連結度(共著) 共立出版,/ , 104-109 共立出版,/ , 104-109 2001 Japanese Disclose to all
茨木俊秀, 永持仁 茨木俊秀, 永持仁 「数理工学のすすめ」 「数理工学のすすめ」 現代数学社 現代数学社 2000 Japanese Disclose to all
永持 仁 永持 仁 離散構造とアルゴリズムⅥ、第3章「グラフの連結度増大問題とその周辺」 離散構造とアルゴリズムⅥ、第3章「グラフの連結度増大問題とその周辺」 近代科学社(インプレス) 近代科学社(インプレス) 1999 Japanese Disclose to all
離散構造とアルゴリズム VI 離散構造とアルゴリズム VI 近代科学社 近代科学社 1999 Japanese Disclose to all
永持 仁 永持 仁 数理工学のすすめ/木を見て森を見る 数理工学のすすめ/木を見て森を見る 現代数学社 現代数学社 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章「グラフの最小カット」 近代科学社,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
基盤研究(C) Representative グラフ理論的手法に基づく離散最適化アルゴリズムの設計 (平成30年度分) 2018/04/01-2019/03/31
基盤研究(C) Representative グラフ理論的手法に基づく離散最適化アルゴリズムの設計 (2019年度分) 2019/04/01-2020/03/31
基盤研究(C) Representative グラフ構造に対する実用的な最適化・列挙アルゴリズムの理論設計と実装開発 (2020年度分) 2020/04/01-2021/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
最適化 Optimization 後期 工学部 2019/04-2020/03
最適化 Optimization 後期 経営管理教育部 2019/04-2020/03
グラフ理論 Graph Theory 前期 工学部 2019/04-2020/03
計画数学通論 Operations Research, Advanced 後期 情報学研究科 2019/04-2020/03
離散数理セミナー Seminar in Discrete Mathematics 通年 情報学研究科 2019/04-2020/03
離散数理特論 Discrete Mathematics, Advanced 後期 情報学研究科 2019/04-2020/03
最適化 Optimization 後期 経営管理教育部 2020/04-2021/03
最適化(数理) Optimization 後期 工学部 2020/04-2021/03
グラフ理論(数理) Graph Theory 前期 工学部 2020/04-2021/03
計画数学通論 Operations Research, Advanced 後期 情報学研究科 2020/04-2021/03
離散数理セミナー Seminar in Discrete Mathematics 後期 情報学研究科 2020/04-2021/03
離散数理特論 Discrete Mathematics, Advanced 後期 情報学研究科 2020/04-2021/03
最適化 Optimization 後期 経営管理教育部 2021/04-2022/03
最適化(数理) Optimization 後期 工学部 2021/04-2022/03
グラフ理論(数理) Graph Theory 前期 工学部 2021/04-2022/03
離散数理セミナー Seminar in Discrete Mathematics 後期 情報学研究科 2021/04-2022/03
離散数理特論 Discrete Mathematics, Advanced 後期 情報学研究科 2021/04-2022/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
評価・広報委員会委員 2019/04/01-2020/03/31
企画委員会委員 2020/04/01-2021/03/31
制規委員会委員 2021/04/01-2022/03/31
専攻長 2021/04/01-2022/03/31
情報セキュリティ委員会委員 2021/04/01-2022/03/31

  • <<
  • >>