基本情報

学部兼担

• 工学部 工学部 情報学科

全学メールアドレス

• 全学メールアドレス

  nagamochi.hiroshi.7ckyoto-u.ac.jp

所属学協会

• 日本オペレーションズリサーチ学会
• 情報処理学会
• 電子情報通信学会
• 日本オペレーションズリサーチ学会
• 情報処理学会
• 電子情報通信学会
• Information Processing Society of Japan
• Information and Communication Engineers
• Institute of Electronics
• Operation Research Society of Japan

学位

• 工学修士(京都大学)
• 工学博士(京都大学)

出身大学院・研究科等

• 京都大学, 大学院工学研究科修士課程数理工学専攻, 修了
• 京都大学, 大学院工学研究科博士課程数理工学専攻, 修了

出身学校・専攻等

• 京都大学, 農学部農業工学科, 卒業

プロフィール

• プロフィール

  1988年京都大学大学院工学研究科 博士課程修了。工学博士。豊橋技術科学大学、京都大学，豊橋技術科学大学を経て，2004年より京都大学大学院情報学研究科（数理工学専攻）教授。専門は離散最適化，とりわけ、グラフアルゴリズム，図形パッキング問題，スケジューリング，列挙アルゴリズムなどに従事ししている。主著に Algorithmic Aspects of Graph Connectivities Cambridge University Press, 2008)や「グラフ理論 連結構造とその応用」（朝倉書店, 2010年）がある。日本オペレーションズ・リサーチ学会，電子情報通信学会，情報処理学会各会員。

使用言語

• 英語

ID,URL

• J-Global ID

  200901023894514149

researchmap URL

• https://researchmap.jp/risan_suuri_2021

研究

研究テーマ・研究概要

• 研究テーマ

  グラフ理論における連結性，平面性などのグラフ構造の研究．グラフ・ネットワーク構造などを対象とした，スケジューリング問題，配置問題，ルーティング問題などの離散最適化問題に対する効率の良いアルゴリズムの設計を行う．最近では，機械学習による構造物性相関(QSPR)の逆問題を整数計画を用いて解くことで，所望の物性値を有すると予測される化合物を設計するシステムの開発に取り組んでいる．

• 研究概要

  グラフ理論，グラフの連結性，グラフの平面性，離散最適化，多項式時間アルゴリズム，NP-完全性，近似アルゴリズム，指数時間厳密アルゴリズム

研究キーワード

• 離散最適化
• 離散構造
• アルゴリズム
• 組み合せ最適化
• Discrete optimization
• Discrete structure
• Algorithms
• Compinatorial Optimization

研究分野

• 情報通信, 情報学基礎論

論文

• Enumeration of Support-Closed Subsets in Confluent Systems

  Kazuya Haraguchi; Hiroshi Nagamochi

  Algorithmica, 2022年01月24日

  
• Molecular Design Based on Artificial Neural Networks, Integer Programming and Grid Neighbor Search

  Naveed Ahmed Azam; Jianshen Zhu; Kazuya Haraguchi; Liang Zhao; Hiroshi Nagamochi; Tatsuya Akutsu

  2021 IEEE International Conference on Bioinformatics and Biomedicine (BIBM), 2021年12月09日

  
• 機械学習QSARの整数計画法に基づく逆解析法

  Hiroshi NAGAMOCHI; Jianshen ZHU; Naveed Ahmed AZAM; Kazuya HARAGUCHI; Liang ZHAO; Tatsuya AKUTSU

  Journal of Computer Chemistry, Japan, 2021年

  
• Group Strategy-proof Mechanisms for Shuttle Facility Games

  Yuhei Fukui; Aleksandar Shurbevski; Hiroshi Nagamochi

  Journal of Information Processing, 2020年

  
• A novel method for inference of acyclic chemical compounds with bounded branch-height based on artificial neural networks and integer programming

  Naveed Ahmed Azam; Jianshen Zhu; Yanming Sun; Yu Shi; Aleksandar Shurbevski; Liang Zhao; Hiroshi Nagamochi; Tatsuya Akutsu

  Algorithms for Molecular Biology, 2021年12月

  
• An Inverse QSAR Method Based on a Two-Layered Model and Integer Programming

  Yu Shi; Jianshen Zhu; Naveed Ahmed Azam; Kazuya Haraguchi; Liang Zhao; Hiroshi Nagamochi; Tatsuya Akutsu

  International Journal of Molecular Sciences, 2021年03月11日

  
• A Novel Method for Inferring Chemical Compounds with Prescribed Topological Substructures Based on Integer Programming

  Jianshen Zhu; Naveed Ahmed Azam; Fan Zhang; Aleksandar Shurbevski; Kazuya Haraguchi; Liang Zhao; Hiroshi Nagamochi; Tatsuya Akutsu

  IEEE/ACM Transactions on Computational Biology and Bioinformatics, 2021年

  
• An Inverse QSAR Method Based on Decision Tree and Integer Programming

  Kouki Tanaka; Jianshen Zhu; Naveed Ahmed Azam; Kazuya Haraguchi; Liang Zhao; Hiroshi Nagamochi; Tatsuya Akutsu

  Intelligent Computing Theories and Application, 2021年

  
• An Improved Integer Programming Formulation for Inferring Chemical Compounds with Prescribed Topological Structures

  Jianshen Zhu; Naveed Ahmed Azam; Kazuya Haraguchi; Liang Zhao; Hiroshi Nagamochi; Tatsuya Akutsu

  Advances and Trends in Artificial Intelligence. Artificial Intelligence Practices, 2021年

  
• Enumerating Tree-Like Graphs and Polymer Topologies with a Given Cycle Rank

  Naveed Ahmed Azam; Aleksandar Shurbevski; Hiroshi Nagamochi

  Entropy, 2020年11月13日

  
• An Efficient Algorithm to Count Tree-Like Graphs with a Given Number of Vertices and Self-Loops

  Naveed Ahmed Azam; Aleksandar Shurbevski; Hiroshi Nagamochi

  Entropy, 2020年08月22日

  
• A method for enumerating pairwise compatibility graphs with a given number of vertices

  Naveed Ahmed Azam; Aleksandar Shurbevski; Hiroshi Nagamochi

  Discrete Applied Mathematics, 2020年08月

  
• A Method for the Inverse QSAR/QSPR Based on Artificial Neural Networks and Mixed Integer Linear Programming

  Rachaya Chiewvanichakorn; Chenxi Wang; Zhe Zhang; Aleksandar Shurbevski; Hiroshi Nagamochi; Tatsuya Akutsu

  Proceedings of the 2020 10th International Conference on Bioscience, Biochemistry and Bioinformatics, 2020年01月19日, 査読有り

  
• On the Enumeration of Minimal Non-pairwise Compatibility Graphs

  Naveed Ahmed Azam; Aleksandar Shurbevski; Hiroshi Nagamochi

  Lecture Notes in Computer Science, 2020年

  
• A New Integer Linear Programming Formulation to the Inverse QSAR/QSPR for Acyclic Chemical Compounds Using Skeleton Trees

  Fan Zhang; Jianshen Zhu; Rachaya Chiewvanichakorn; Aleksandar Shurbevski; Hiroshi Nagamochi; Tatsuya Akutsu

  Trends in Artificial Intelligence Theory and Applications. Artificial Intelligence Practices, 2020年

  
• A Novel Method for the Inverse QSAR/QSPR based on Artificial Neural Networks and Mixed Integer Linear Programming with Guaranteed Admissibility

  Naveed Azam; Rachaya Chiewvanichakorn; Fan Zhang; Aleksandar Shurbevski; Hiroshi Nagamochi; Tatsuya Akutsu

  Proceedings of the 13th International Joint Conference on Biomedical Engineering Systems and Technologies, 2020年, 査読有り

  
• Enumerating Chemical Graphs with Two Disjoint Cycles Satisfying Given Path Frequency Specifications.

  Kyousuke Yamashita; Ryuji Masui; Xiang Zhou; Chenxi Wang; Aleksandar Shurbevski; Hiroshi Nagamochi; Tatsuya Akutsu

  CoRR, 2020年, 査読有り

  
• Enumerating Chemical Graphs with Mono-block 2-Augmented Tree Structure from Given Upper and Lower Bounds on Path Frequencies.

  Yuui Tamura; Yuhei Nishiyama; Chenxi Wang; Yanming Sun; Aleksandar Shurbevski; Hiroshi Nagamochi; Tatsuya Akutsu

  CoRR, 2020年, 査読有り

  
• A Novel Method for the Inverse QSAR/QSPR based on Artificial Neural Networks and Mixed Integer Linear Programming with Guaranteed Admissibility.

  Naveed Ahmed Azam; Rachaya Chiewvanichakorn; Fan Zhang; Aleksandar Shurbevski; Hiroshi Nagamochi; Tatsuya Akutsu

  Proceedings of the 13th International Joint Conference on Biomedical Engineering Systems and Technologies (BIOSTEC 2020) - Volume 3: BIOINFORMATICS(BIOINFORMATICS), 2020年, 査読有り

  
• A Novel Method for Inference of Chemical Compounds of Cycle Index Two with Desired Properties Based on Artificial Neural Networks and Integer Programming.

  Jianshen Zhu; Chenxi Wang; Aleksandar Shurbevski; Hiroshi Nagamochi; Tatsuya Akutsu

  Algorithms, 2020年, 査読有り

  
• A Polynomial-delay Algorithm for Enumerating Connectors under Various Connectivity Conditions

  Kazuya Haraguchi; Hiroshi Nagamochi

  Proceedings of The 30th International Symposium on Algorithms and Computation (ISAAC 2019), 2019年, 査読有り

  
• A linear-time algorithm for testing full outer-2-planarity

  Seok-Hee Hong; Hiroshi Nagamochi

  Discrete Applied Mathematics, 2019年, 査読有り

  
• Resource Cut, a New Bounding Procedure to Algorithms for Enumerating Tree-Like Chemical Graphs

  Yuhei Nishiyama; Aleksandar Shurbevski; Hiroshi Nagamochi; Tatsuya Akutsu

  IEEE/ACM Trans. Comput. Biology Bioinform, 2019年, 査読有り

  
• Enumerating Substituted Benzene Isomers of Tree-Like Chemical Graphs

  Jinghui Li; Hiroshi Nagamochi; Tatsuya Akutsu

  IEEE/ACM Transactions on Computational Biology and Bioinformatics, 2018年03月01日, 査読有り

  
• Polynomial-space exact algorithms for the bipartite traveling salesman problem

  Mohd Shahrizan Othman; Aleksandar Shurbevski; Hiroshi Nagamochi

  IEICE Transactions on Information and Systems, 2018年03月01日, 査読有り

  
• Enumerating chemical mono-block 3-augmented trees with two junctions

  Yuui Tamura; Hiroshi Nagamochi; Aleksandar Shurbevski; Tatsuya Akutsu

  ACM International Conference Proceeding Series, 2018年01月18日, 査読有り

  
• Simpler algorithms for testing two-page book embedding of partitioned graphs.

  Seok-Hee Hong; Hiroshi Nagamochi

  Theor. Comput. Sci., 2018年, 査読有り

  
• A refined algorithm for maximum independent set in degree-4 graphs

  Mingyu Xiao; Hiroshi Nagamochi

  JOURNAL OF COMBINATORIAL OPTIMIZATION, 2017年10月, 査読有り

  
• Routing of carrier-vehicle systems with dedicated last-stretch delivery vehicle and fixed carrier route

  Mohd Shahrizan Bin Othman; Aleksandar Shurbevski; Yoshiyuki Karuno; Hiroshi Nagamochi

  Journal of Information Processing, 2017年08月01日, 査読有り

  
• An improved-time polynomial-space exact algorithm for TSP in degree-5 graphs

  Norhazwani Md Yunos; Aleksandar Shurbevski; Hiroshi Nagamochi

  Journal of Information Processing, 2017年08月01日, 査読有り

  
• Exact algorithms for maximum independent set

  Mingyu Xiao; Hiroshi Nagamochi

  INFORMATION AND COMPUTATION, 2017年08月, 査読有り

  
• An Exact Algorithm for Lowest Edge Dominating Set

  Ken Iwaide; Hiroshi Nagamochi

  IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 2017年03月, 査読有り

  
• Complexity and kernels for bipartition into degree-bounded induced graphs

  Mingyu Xiao; Hiroshi Nagamochi

  THEORETICAL COMPUTER SCIENCE, 2017年01月, 査読有り

  
• Parameterization of strategy-proof mechanisms in the obnoxious facility game

  Morito Oomine; Aleksandar Shurbevski; Hiroshi Nagamochi

  Journal of Graph Algorithms and Applications, 2017年, 査読有り

  
• A linear-time algorithm for integral multiterminal flows in trees

  Mingyu Xiao; Hiroshi Nagamochi

  Leibniz International Proceedings in Informatics, LIPIcs, 2016年12月01日, 査読有り

  
• Characterizing Output Locations of GSP Mechanisms to Obnoxious Facility Game in Trees

  Morito Oomine; Hiroshi Nagamochi

  IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 2016年03月, 査読有り

  
• Characterizing Output Locations of GSP Mechanisms to Obnoxious Facility Game in Trees

  Morito Oomine; Hiroshi Nagamochi

  IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 2016年03月, 査読有り

  
• An Improved Exact Algorithm for TSP in Graphs of Maximum Degree 4

  Mingyu Xiao; Hiroshi Nagamochi

  THEORY OF COMPUTING SYSTEMS, 2016年02月, 査読有り

  
• An Exact Algorithm for TSP in Degree-3 Graphs Via Circuit Procedure and Amortization on Connectivity Structure

  Mingyu Xiao; Hiroshi Nagamochi

  ALGORITHMICA, 2016年02月, 査読有り

  
• Approximation algorithms for a sequencing problem with a biased bipartite structure

  Aleksandar Shurbevski; Hiroshi Nagamochi; Yoshiyuki Karuno

  JOURNAL OF ADVANCED MECHANICAL DESIGN SYSTEMS AND MANUFACTURING, 2016年, 査読有り

  
• Testing Full Outer-2-planarity in Linear Time

  Seok-Hee Hong; Hiroshi Nagamochi

  GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE, 2016年, 査読有り

  
• A Polynomial-Space Exact Algorithm for TSP in Degree-6 Graphs

  Norhazwani Md Yunos; Aleksandar Shurbevski; Hiroshi Nagamochi

  DISCRETE AND COMPUTATIONAL GEOMETRY AND GRAPHS, JCDCGG 2015, 2016年, 査読有り

  
• Re-embedding a 1-Plane Graph into a Straight-Line Drawing in Linear Time

  Seok-Hee Hong; Hiroshi Nagamochi

  GRAPH DRAWING AND NETWORK VISUALIZATION (GD 2016), 2016年, 査読有り

  
• Enumerating Naphthalene Isomers of Tree-like Chemical Graphs.

  Fei He; Akiyoshi Hanai; Hiroshi Nagamochi; Tatsuya Akutsu

  Proceedings of the 9th International Joint Conference on Biomedical Engineering Systems and Technologies (BIOSTEC 2016) - Volume 3: BIOINFORMATICS, Rome, Italy, February 21-23, 2016., 2016年, 査読有り

  
• An exact algorithm for maximum independent set in degree-5 graphs

  Mingyu Xiao; Hiroshi Nagamochi

  DISCRETE APPLIED MATHEMATICS, 2016年01月, 査読有り

  
• An improved algorithm for parameterized edge dominating set problem

  Ken Iwaide; Hiroshi Nagamochi

  Journal of Graph Algorithms and Applications, 2016年, 査読有り

  
• An improved exact algorithm for undirected feedback vertex set

  Mingyu Xiao; Hiroshi Nagamochi

  JOURNAL OF COMBINATORIAL OPTIMIZATION, 2015年08月, 査読有り

  
• Exact algorithms for dominating induced matching based on graph partition

  Mingyu Xiao; Hiroshi Nagamochi

  DISCRETE APPLIED MATHEMATICS, 2015年08月, 査読有り

  
• Some Reduction Procedure for Computing Pathwidth of Undirected Graphs

  Masataka Ikeda; Hiroshi Nagamochi

  IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 2015年03月, 査読有り

  
• A refined exact algorithm for Edge Dominating Set

  Mingyu Xiao; Hiroshi Nagamochi

  THEORETICAL COMPUTER SCIENCE, 2014年12月, 査読有り

  
• Efficient enumeration of monocyclic chemical graphs with given path frequencies

  Masaki Suzuki; Hiroshi Nagamochi; Tatsuya Akutsu

  JOURNAL OF CHEMINFORMATICS, 2014年05月, 査読有り

  
• Optimization Techniques for Robot Path Planning

  Aleksandar Shurbevski; Noriaki Hirosue; Hiroshi Nagamochi

  ICT INNOVATIONS 2013: ICT INNOVATIONS AND EDUCATION, 2014年, 査読有り

  
• Exact Algorithms for Dominating Induced Matching Based on Graph Partition.

  Mingyu Xiao; Hiroshi Nagamochi

  CoRR, 2014年, 査読有り

  
• Unranking of small combinations from large sets

  Toshihiro Shimizu; Takuro Fukunagaa; Hiroshi Nagamochi

  Journal of Discrete Algorithms, 2014年, 査読有り

  
• Breadth-first search approach to enumeration of tree-like chemical compounds

  Yang Zhao; Morihiro Hayashida; Jira Jindalertudomdee; Hiroshi Nagamochi; Tatsuya Akutsu

  Journal of Bioinformatics and Computational Biology, 2013年12月, 査読有り

  
• Parameterized edge dominating set in graphs with degree bounded by 3

  Mingyu Xiao; Hiroshi Nagamochi

  THEORETICAL COMPUTER SCIENCE, 2013年10月, 査読有り

  
• Exact Algorithms for Annotated Edge Dominating Set in Graphs with Degree Bounded by 3

  Mingyu Xiao; Hiroshi Nagamochi

  IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 2013年03月, 査読有り

  
• Better approximation algorithms for grasp-and-delivery robot routing problems

  Aleksandar Shurbevski; Hiroshi Nagamochi; Yoshiyuki Karuno

  IEICE Transactions on Information and Systems, 2013年, 査読有り

  
• FPTASs for trimming weighted trees

  Mingyu Xiao; Takuro Fukunaga; Hiroshi Nagamochi

  THEORETICAL COMPUTER SCIENCE, 2013年01月, 査読有り

  
• Confining sets and avoiding bottleneck cases: A simple maximum independent set algorithm in degree-3 graphs

  Mingyu Xiao; Hiroshi Nagamochi

  THEORETICAL COMPUTER SCIENCE, 2013年01月, 査読有り

  
• An exact strip packing algorithm based on canonical forms

  Yohei Arahori; Takashi Imamichi; Hiroshi Nagamochi

  COMPUTERS & OPERATIONS RESEARCH, 2012年12月, 査読有り

  
• Protein complex prediction via improved verification methods using constrained domain-domain matching

  Yang Zhao; Morihiro Hayashida; Jose C. Nacher; Hiroshi Nagamochi; Tatsuya Akutsu

  International Journal of Bioinformatics Research and Applications, 2012年09月, 査読有り

  
• Minimum cost star-shaped drawings of plane graphs with a fixed embedding and concave corner constraints

  Seok-Hee Hong; Hiroshi Nagamochi

  THEORETICAL COMPUTER SCIENCE, 2012年08月, 査読有り

  
• A Linear-Time Algorithm for Star-Shaped Drawings of Planar Graphs with the Minimum Number of Concave Corners

  Seok-Hee Hong; Hiroshi Nagamochi

  ALGORITHMICA, 2012年04月, 査読有り

  
• Divide-and-Conquer Algorithms for Partitioning Hypergraphs and Submodular Systems

  Kazumasa Okumoto; Takuro Fukunaga; Hiroshi Nagamochi

  ALGORITHMICA, 2012年04月, 査読有り

  
• A Linear-Time Algorithm for Star-Shaped Drawings of Planar Graphs with the Minimum Number of Concave Corners

  Seok-Hee Hong; Hiroshi Nagamochi

  ALGORITHMICA, 2012年04月, 査読有り

  
• Divide-and-Conquer Algorithms for Partitioning Hypergraphs and Submodular Systems

  Kazumasa Okumoto; Takuro Fukunaga; Hiroshi Nagamochi

  ALGORITHMICA, 2012年04月, 査読有り

  
• Indexing All Rooted Subgraphs of a Rooted Graph

  Tomoki Imada; Hiroshi Nagamochi

  IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 2012年03月, 査読有り

  
• A Dynamic Programming Based Improvement Heuristic for a Repetitive Routing Problem of Grasp-and-Delivery Robots

  Aleksandar Shurbevski; Yoshiyuki Karuno; Hiroshi Nagamochi

  JOURNAL OF ADVANCED MECHANICAL DESIGN SYSTEMS AND MANUFACTURING, 2012年, 査読有り

  
• An FPT algorithm for edge subset feedback edge set

  Mingyu Xiao; Hiroshi Nagamochi

  INFORMATION PROCESSING LETTERS, 2012年01月, 査読有り

  
• AN APPROXIMATION ALGORITHM FOR LOCATING MAXIMAL DISKS WITHIN CONVEX POLYGONS

  Hirofumi Aota; Takuro Fukunaga; Hiroshi Nagamochi

  INTERNATIONAL JOURNAL OF COMPUTATIONAL GEOMETRY & APPLICATIONS, 2011年12月, 査読有り

  
• Extending Steinitz's Theorem to Upward Star-Shaped Polyhedra and Spherical Polyhedra

  Seok-Hee Hong; Hiroshi Nagamochi

  ALGORITHMICA, 2011年12月, 査読有り

  
• Enumerating tree-like chemical graphs with given upper and lower bounds on path frequencies

  Masaaki Shimizu; Hiroshi Nagamochi; Tatsuya Akutsu

  BMC BIOINFORMATICS, 2011年12月, 査読有り

  
• Editorial: ISAAC 2008 Special Issue

  Seok-Hee Hong; Hiroshi Nagamochi

  ALGORITHMICA, 2011年12月, 査読有り

  
• AN APPROXIMATION ALGORITHM FOR LOCATING MAXIMAL DISKS WITHIN CONVEX POLYGONS

  Hirofumi Aota; Takuro Fukunaga; Hiroshi Nagamochi

  INTERNATIONAL JOURNAL OF COMPUTATIONAL GEOMETRY & APPLICATIONS, 2011年12月, 査読有り

  
• Extending Steinitz's Theorem to Upward Star-Shaped Polyhedra and Spherical Polyhedra

  Seok-Hee Hong; Hiroshi Nagamochi

  ALGORITHMICA, 2011年12月, 査読有り

  
• Efficient Enumeration of Stereoisomers of Outerplanar Chemical Graphs Using Dynamic Programming

  Tomoki Imada; Shunsuke Ota; Hiroshi Nagamochi; Tatsuya Akutsu

  JOURNAL OF CHEMICAL INFORMATION AND MODELING, 2011年11月, 査読有り

  
• Efficient Enumeration of Stereoisomers of Outerplanar Chemical Graphs Using Dynamic Programming

  Tomoki Imada; Shunsuke Ota; Hiroshi Nagamochi; Tatsuya Akutsu

  JOURNAL OF CHEMICAL INFORMATION AND MODELING, 2011年11月, 査読有り

  
• Kernel Methods for Chemical Compounds: From Classification to Design

  Tatsuya Akutsu; Hiroshi Nagamochi

  IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 2011年10月, 査読有り

  
• On the one-dimensional stock cutting problem in the paper tube industry

  Kazuki Matsumoto; Shunji Umetani; Hiroshi Nagamochi

  JOURNAL OF SCHEDULING, 2011年06月, 査読有り

  
• Selected Papers from the 19th Annual International Symposium on Algorithms and Computation FOREWORD

  Seok-Hee Hong; Hiroshi Nagamochi

  INTERNATIONAL JOURNAL OF COMPUTATIONAL GEOMETRY & APPLICATIONS, 2011年06月, 査読有り

  
• Kansei engineering, humans and computers: Efficient dynamic programming algorithms for combinatorial food packing problems

  Shinji Imahori; Yoshiyuki Karuno; Hiroshi Nagamochi; Xiaoming Wang

  International Journal of Biometrics, 2011年06月, 査読有り

  
• Guest editors' foreword

  Seok-Hee Hong; Hiroshi Nagamochi

  International Journal of Computational Geometry and Applications, 2011年06月, 査読有り

  
• On the one-dimensional stock cutting problem in the paper tube industry

  Kazuki Matsumoto; Shunji Umetani; Hiroshi Nagamochi

  JOURNAL OF SCHEDULING, 2011年06月, 査読有り

  
• Efficient branch-and-bound algorithms for weighted MAX-2-SAT

  Toshihide Ibaraki; Takashi Imamichi; Yuichi Koga; Hiroshi Nagamochi; Koji Nonobe; Mutsunori Yagiura

  MATHEMATICAL PROGRAMMING, 2011年04月, 査読有り

  
• Efficient enumeration of stereoisomers of tree structured molecules using dynamic programming

  Tomoki Imada; Shunsuke Ota; Hiroshi Nagamochi; Tatsuya Akutsu

  JOURNAL OF MATHEMATICAL CHEMISTRY, 2011年04月, 査読有り

  
• Coprobber guarding game with cycle robber-region

  Hiroshi Nagamochi

  Theoretical Computer Science, 2011年02月04日, 査読有り

  
• Cop-robber guarding game with cycle robber-region

  Hiroshi Nagamochi

  THEORETICAL COMPUTER SCIENCE, 2011年02月, 査読有り

  
• Generation of Symmetric and Asymmetric Biconnected Rooted Outerplanar Graphs

  Bingbing Zhuang; Hiroshi Nagamochi

  IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 2011年02月, 査読有り

  
• Generation of Symmetric and Asymmetric Biconnected Rooted Triangulated Planar Graphs

  Bingbing Zhuang; Hiroshi Nagamochi

  IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 2011年02月, 査読有り

  
• Approximating capacitated tree-routings in networks

  Ehab Morsy; Hiroshi Nagamochi

  JOURNAL OF COMBINATORIAL OPTIMIZATION, 2011年02月, 査読有り

  
• Approximating capacitated tree-routings in networks

  Ehab Morsy; Hiroshi Nagamochi

  JOURNAL OF COMBINATORIAL OPTIMIZATION, 2011年02月, 査読有り

  
• Generation of Symmetric and Asymmetric Biconnected Rooted Outerplanar Graphs

  Bingbing Zhuang; Hiroshi Nagamochi

  IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 2011年02月, 査読有り

  
• Generation of Symmetric and Asymmetric Biconnected Rooted Triangulated Planar Graphs

  Bingbing Zhuang; Hiroshi Nagamochi

  IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 2011年02月, 査読有り

  
• Kernel methods for chemical compounds: From classification to design

  Tatsuya Akutsu; Hiroshi Nagamochi

  IEICE Transactions on Information and Systems, 2011年, 査読有り

  
• An A* Algorithm Framework for the point-to-point Time-Dependent Shortest Path Problem

  Tatsuya Ohshima; Pipaporn Eumthurapojn; Liang Zhao; Hiroshi Nagamochi

  COMPUTATIONAL GEOMETRY, GRAPHS AND APPLICATIONS, 2011年, 査読有り

  
• Minmax tree cover in the euclidean space

  Seigo Karakawa; Ehab Morsy; Hiroshi Nagamochi

  Journal of Graph Algorithms and Applications, 2011年, 査読有り

  
• An approximation algorithm with factor two for a repetitive routing problem of grasp-and-delivery robots

  Yoshiyuki Karuno; Hiroshi Nagamochi; Aleksandar Shurbevski

  Journal of Advanced Computational Intelligence and Intelligent Informatics, 2011年, 査読有り

  
• An A* Algorithm Framework for the point-to-point Time-Dependent Shortest Path Problem

  Tatsuya Ohshima; Pipaporn Eumthurapojn; Liang Zhao; Hiroshi Nagamochi

  COMPUTATIONAL GEOMETRY, GRAPHS AND APPLICATIONS, 2011年, 査読有り

  
• Network design with weighted degree constraints

  Takuro Fukunaga; Hiroshi Nagamochi

  Discrete Optimization, 2010年11月, 査読有り

  
• Network design with weighted degree constraints

  Takuro Fukunaga; Hiroshi Nagamochi

  DISCRETE OPTIMIZATION, 2010年11月, 査読有り

  
• A plane graph representation of triconnected graphs

  Shunsuke Ota; Ehab Morsy; Hiroshi Nagamochi

  THEORETICAL COMPUTER SCIENCE, 2010年10月, 査読有り

  
• Approximation Algorithms for Minimizing Edge Crossings in Radial Drawings

  Seok-Hee Hong; Hiroshi Nagamochi

  ALGORITHMICA, 2010年10月, 査読有り

  
• A Linear-Time Algorithm for Symmetric Convex Drawings of Internally Triconnected Plane Graphs

  Seok-Hee Hong; Hiroshi Nagamochi

  ALGORITHMICA, 2010年10月, 査読有り

  
• A plane graph representation of triconnected graphs

  Shunsuke Ota; Ehab Morsy; Hiroshi Nagamochi

  THEORETICAL COMPUTER SCIENCE, 2010年10月, 査読有り

  
• Approximation Algorithms for Minimizing Edge Crossings in Radial Drawings

  Seok-Hee Hong; Hiroshi Nagamochi

  ALGORITHMICA, 2010年10月, 査読有り

  
• A Linear-Time Algorithm for Symmetric Convex Drawings of Internally Triconnected Plane Graphs

  Seok-Hee Hong; Hiroshi Nagamochi

  ALGORITHMICA, 2010年10月, 査読有り

  
• Convex drawings of hierarchical planar graphs and clustered planar graphs

  Seok-Hee Hong; Hiroshi Nagamochi

  Journal of Discrete Algorithms, 2010年09月, 査読有り

  
• On the approximation of the generalized capacitated tree-routing problem

  Ehab Morsy; Hiroshi Nagamochi

  Journal of Discrete Algorithms, 2010年09月, 査読有り

  
• Branch-and-Bound Algorithms for Enumerating Treelike Chemical Graphs with Given Path Frequency Using Detachment-Cut

  Yusuke Ishida; Yuki Kato; Liang Zhao; Hiroshi Nagamochi; Tatsuya Akutsu

  JOURNAL OF CHEMICAL INFORMATION AND MODELING, 2010年05月, 査読有り

  
• Branch-and-Bound Algorithms for Enumerating Treelike Chemical Graphs with Given Path Frequency Using Detachment-Cut

  Yusuke Ishida; Yuki Kato; Liang Zhao; Hiroshi Nagamochi; Tatsuya Akutsu

  JOURNAL OF CHEMICAL INFORMATION AND MODELING, 2010年05月, 査読有り

  
• Approximation to the Minimum Cost Edge Installation Problem

  Ehab Morsy; Hiroshi Nagamochi

  IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2010年04月, 査読有り

  
• Minimum Augmentation of Edge-Connectivity between Vertices and Sets of Vertices in Undirected Graphs

  Toshimasa Ishii; Yoko Akiyama; Hiroshi Nagamochi

  ALGORITHMICA, 2010年04月, 査読有り

  
• Approximation to the Minimum Cost Edge Installation Problem

  Ehab Morsy; Hiroshi Nagamochi

  IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2010年04月, 査読有り

  
• Minimum Augmentation of Edge-Connectivity between Vertices and Sets of Vertices in Undirected Graphs

  Toshimasa Ishii; Yoko Akiyama; Hiroshi Nagamochi

  ALGORITHMICA, 2010年04月, 査読有り

  
• An algorithm for constructing star-shaped drawings of plane graphs

  Seok-Hee Hong; Hiroshi Nagamochi

  COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 2010年02月, 査読有り

  
• An algorithm for constructing star-shaped drawings of plane graphs

  Seok-Hee Hong; Hiroshi Nagamochi

  COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 2010年02月, 査読有り

  
• Minimum degree orderings

  Hiroshi Nagamochi

  Algorithmica (New York), 2010年01月, 査読有り

  
• Generating Trees on Multisets

  Bingbing Zhuang; Hiroshi Nagamochi

  ALGORITHMS AND COMPUTATION, PT I, 2010年, 査読有り

  
• Listing Triconnected Rooted Plane Graphs

  Bingbing Zhuang; Hiroshi Nagamochi

  COMBINATORIAL OPTIMIZATION AND APPLICATIONS, PT II, 2010年, 査読有り

  
• FPTAS's for Some Cut Problems in Weighted Trees

  Mingyu Xiao; Takuro Fukunaga; Hiroshi Nagamochi

  FRONTIERS IN ALGORITHMICS, 2010年, 査読有り

  
• Constant Time Generation of Biconnected Rooted Plane Graphs

  Bingbing Zhuang; Hiroshi Nagamochi

  FRONTIERS IN ALGORITHMICS, 2010年, 査読有り

  
• Multiclass Visual Classifier Based on Bipartite Graph Representation of Decision Tables

  Kazuya Haraguchi; Seok-Hee Hong; Hiroshi Nagamochi

  LEARNING AND INTELLIGENT OPTIMIZATION, 2010年, 査読有り

  
• Generating Internally Triconnected Rooted Plane Graphs

  Bingbing Zhuang; Hiroshi Nagamochi

  THEORY AND APPLICATIONS OF MODELS OF COMPUTATION, PROCEEDINGS, 2010年, 査読有り

  
• Enumerating Rooted Graphs with Reflectional Block Structures

  Bingbing Zhuang; Hiroshi Nagamochi

  ALGORITHMS AND COMPLEXITY, PROCEEDINGS, 2010年, 査読有り

  
• Optimization Problems and Algorithms in Double-layered Food Packing Systems

  Yoshiyuki Karuno; Hiroshi Nagamochi; Xiaoming Wang

  JOURNAL OF ADVANCED MECHANICAL DESIGN SYSTEMS AND MANUFACTURING, 2010年, 査読有り

  
• Constant Time Generation of Trees with Degree Bounds

  Bingbing Zhuang; Hiroshi Nagamochi

  OPERATIONS RESEARCH AND ITS APPLICATIONS, 2010年, 査読有り

  
• Minimum Degree Orderings

  Hiroshi Nagamochi

  ALGORITHMICA, 2010年01月, 査読有り

  
• An iterated local search algorithm based on nonlinear programming for the irregular strip packing problem

  Takashi Imamichi; Mutsunori Yagiura; Hiroshi Nagamochi

  DISCRETE OPTIMIZATION, 2009年11月, 査読有り

  
• An iterated local search algorithm based on nonlinear programming for the irregular strip packing problem

  Takashi Imamichi; Mutsunori Yagiura; Hiroshi Nagamochi

  DISCRETE OPTIMIZATION, 2009年11月, 査読有り

  
• Exact algorithms for the two-dimensional strip packing problem with and without rotations

  Mitsutoshi Kenmochi; Takashi Imamichi; Koji Nonobe; Mutsunori Yagiura; Hiroshi Nagamochi

  EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2009年10月, 査読有り

  
• Network Design with Edge-Connectivity and Degree Constraints

  Takuro Fukunaga; Hiroshi Nagamochi

  THEORY OF COMPUTING SYSTEMS, 2009年10月, 査読有り

  
• Exact algorithms for the two-dimensional strip packing problem with and without rotations

  Mitsutoshi Kenmochi; Takashi Imamichi; Koji Nonobe; Mutsunori Yagiura; Hiroshi Nagamochi

  EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2009年10月, 査読有り

  
• Network design with edge-connectivity and degree constraints

  Takuro Fukunaga; Hiroshi Nagamochi

  Theory of Computing Systems, 2009年07月, 査読有り

  
• Drawing slicing graphs with face areas

  Akifumi Kawaguchi; Hiroshi Nagamochi

  THEORETICAL COMPUTER SCIENCE, 2009年03月, 査読有り

  
• Drawing slicing graphs with face areas

  Akifumi Kawaguchi; Hiroshi Nagamochi

  THEORETICAL COMPUTER SCIENCE, 2009年03月, 査読有り

  
• Eulerian detachments with local edge-connectivity

  Takuro Fukunaga; Hiroshi Nagamochi

  Discrete Applied Mathematics, 2009年02月28日, 査読有り

  
• A detachment algorithm for inferring a graph from path frequency

  Hiroshi Nagamochi

  Algorithmica (New York), 2009年02月, 査読有り

  
• Eulerian detachments with local edge-connectivity

  Takuro Fukunaga; Hiroshi Nagamochi

  DISCRETE APPLIED MATHEMATICS, 2009年02月, 査読有り

  
• A Detachment Algorithm for Inferring a Graph from Path Frequency

  Hiroshi Nagamochi

  ALGORITHMICA, 2009年02月, 査読有り

  
• Scheduling Capacitated One-Way Vehicles on Paths with Deadlines

  UCHIDA Jun; KARUNO Yoshiyuki; NAGAMOCHI Hiroshi

  SICE J Control Meas Syst Integr, 2009年01月31日, 査読有り

  
• New approximation to the one-sided radial crossing minimization

  Seok-Hee Hong; Hiroshi Nagamochi

  Journal of Graph Algorithms and Applications, 2009年, 査読有り

  
• Worst Case Analysis for Pickup and Delivery Problems with Consecutive Pickups and Deliveries

  Yoshitaka Nakao; Hiroshi Nagamochi

  ALGORITHMS AND COMPUTATION, PROCEEDINGS, 2009年, 査読有り

  
• Divide-and-Conquer Algorithms for Partitioning Hypergraphs and Submodular Systems

  Kazumasa Okumoto; Takuro Fukunaga; Hiroshi Nagamochi

  ALGORITHMS AND COMPUTATION, PROCEEDINGS, 2009年, 査読有り

  
• Upward Star-Shaped Polyhedral Graphs

  Seok-Hee Hong; Hiroshi Nagamochi

  ALGORITHMS AND COMPUTATION, PROCEEDINGS, 2009年, 査読有り

  
• Cop-robber guarding game with cycle robber region

  Hiroshi Nagamochi

  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2009年, 査読有り

  
• Removing Node Overlaps Using Multi-sphere Scheme

  Takashi Imamichi; Yohei Arahori; Jaeseong Gim; Seok-Hee Hong; Hiroshi Nagamochi

  GRAPH DRAWING, 2009年, 査読有り

  
• Minmax Tree Cover in the Euclidean Space

  Seigo Karakawa; Ehab Morsy; Hiroshi Nagamochi

  WALCOM: ALGORITHMS AND COMPUTATION, PROCEEDINGS, 2009年, 査読有り

  
• Network design with weighted degree constraints

  Takuro Fukunaga; Hiroshi Nagamochi

  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2009年, 査読有り

  
• MINIMUM TRANSVERSALS IN POSIMODULAR SYSTEMS

  Mariko Sakashita; Kazuhisa Makino; Hiroshi Nagamochi; Satoru Fujishige

  SIAM JOURNAL ON DISCRETE MATHEMATICS, 2009年, 査読有り

  
• Worst case analysis for pickup and delivery problems with transfer

  Yoshitaka Nakao; Hiroshi Nagamochi

  IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2008年09月, 査読有り

  
• Performance analysis of a collision detection algorithm of spheres based on slab partitioning

  Takashi Imamichi; Hiroshi Nagamochi

  IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2008年09月, 査読有り

  
• Worst case analysis for pickup and delivery problems with transfer

  Yoshitaka Nakao; Hiroshi Nagamochi

  IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2008年09月, 査読有り

  
• Performance analysis of a collision detection algorithm of spheres based on slab partitioning

  Takashi Imamichi; Hiroshi Nagamochi

  IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2008年09月, 査読有り

  
• Enumerating treelike chemical graphs with given path frequency

  Hiroki Fujiwara; Jiexun Wang; Liang Zhao; Hiroshi Nagamochi; Tatsuya Akutsu

  JOURNAL OF CHEMICAL INFORMATION AND MODELING, 2008年07月, 査読有り

  
• Enumerating treelike chemical graphs with given path frequency

  Hiroki Fujiwara; Jiexun Wang; Liang Zhao; Hiroshi Nagamochi; Tatsuya Akutsu

  JOURNAL OF CHEMICAL INFORMATION AND MODELING, 2008年07月, 査読有り

  
• Convex drawings of graphs with non-convex boundary constraints

  Seok-Hee Hong; Hiroshi Nagamochi

  DISCRETE APPLIED MATHEMATICS, 2008年06月, 査読有り

  
• Convex drawings of graphs with non-convex boundary constraints

  Seok-Hee Hong; Hiroshi Nagamochi

  DISCRETE APPLIED MATHEMATICS, 2008年06月, 査読有り

  
• A Clustering Method for Analysis of Sequence Similarity Networks of Proteins Using Maximal Components of Graphs

  HAYASHIDA Morihiro; AKUTSU Tatsuya; NAGAMOCHI Hiroshi

  情報処理学会論文誌, 2008年03月15日, 査読有り

  
• Approximating a vehicle scheduling problem with time windows and handling times

  Hiroshi Nagamochi; Takaharu Ohnishi

  THEORETICAL COMPUTER SCIENCE, 2008年03月, 査読有り

  
• Approximating a vehicle scheduling problem with time windows and handling times

  Hiroshi Nagamochi; Takaharu Ohnishi

  THEORETICAL COMPUTER SCIENCE, 2008年03月, 査読有り

  
• An improved approximation algorithm for capacitated multicast routings in networks

  Ehab Morsy; Hiroshi Nagamochi

  THEORETICAL COMPUTER SCIENCE, 2008年01月, 査読有り

  
• Star-shaped drawings of graphs with fixed embedding and concave corner constraints

  Seok-Hee Hong; Hiroshi Nagamochi

  COMPUTING AND COMBINATORICS, PROCEEDINGS, 2008年, 査読有り

  
• Approximating the generalized capacitated tree-routing problem

  Ehab Morsy; Hiroshi Nagamochi

  COMPUTING AND COMBINATORICS, PROCEEDINGS, 2008年, 査読有り

  
• Approximating crossing minimization in radial layouts

  Seok-Hee Hong; Hiroshi Nagamochi

  LATIN 2008: THEORETICAL INFORMATICS, 2008年, 査読有り

  
• An improved approximation algorithm for capacitated multicast routings in networks

  Ehab Morsy; Hiroshi Nagamochi

  THEORETICAL COMPUTER SCIENCE, 2008年01月, 査読有り

  
• Bi-criteria food packing by dynamic programming

  Yoshiyuki Karuno; Hiroshi Nagamochi; Xiaoming Wang

  JOURNAL OF THE OPERATIONS RESEARCH SOCIETY OF JAPAN, 2007年12月, 査読有り

  
• Approximating minimum cost multigraphs of specified edge-connectivity under degree bounds

  Takuro Fukunaga; Hiroshi Nagamochi

  JOURNAL OF THE OPERATIONS RESEARCH SOCIETY OF JAPAN, 2007年12月, 査読有り

  
• Approximating the minmax rooted-tree cover in a tree

  Hiroshi Nagamochi; Kohei Okada

  INFORMATION PROCESSING LETTERS, 2007年11月, 査読有り

  
• The source location problem with local 3-vertex-connectivity requirements

  Toshimasa Ishii; Hitoshi Fujita; Hiroshi Nagamochi

  DISCRETE APPLIED MATHEMATICS, 2007年11月, 査読有り

  
• Approximating the minmax rooted-tree cover in a tree

  Hiroshi Nagamochi; Kohei Okada

  INFORMATION PROCESSING LETTERS, 2007年11月, 査読有り

  
• The source location problem with local 3-vertex-connectivity requirements

  Toshimasa Ishii; Hitoshi Fujita; Hiroshi Nagamochi

  DISCRETE APPLIED MATHEMATICS, 2007年11月, 査読有り

  
• Approximability of the capacitated b-edge dominating set problem

  Andre Berger; Takuro Fukunaga; Hiroshi Nagamochi; Ojas Parekh

  THEORETICAL COMPUTER SCIENCE, 2007年10月, 査読有り

  
• Approximability of the capacitated b-edge dominating set problem

  Andre Berger; Takuro Fukunaga; Hiroshi Nagamochi; Ojas Parekh

  THEORETICAL COMPUTER SCIENCE, 2007年10月, 査読有り

  
• Contention-free lambda-planes in optically burst-switched WDM networks

  Kouji Hiratata; Takahiro Matsuda; Hiroshi Nagamochi; Tetsuya Takine

  IEICE TRANSACTIONS ON COMMUNICATIONS, 2007年09月, 査読有り

  
• Contention-free lambda-planes in optically burst-switched WDM networks

  Kouji Hiratata; Takahiro Matsuda; Hiroshi Nagamochi; Tetsuya Takine

  IEICE TRANSACTIONS ON COMMUNICATIONS, 2007年09月, 査読有り

  
• Generalizing the induced matching by edge capacity constraints

  Takuro Fukunaga; Hiroshi Nagamochi

  Discrete Optimization, 2007年06月01日, 査読有り

  
• Bisecting a 4-connected graph with three resource sets

  Toshimasa Ishii; Kengo Iwata; Hiroshi Nagamochi

  DISCRETE APPLIED MATHEMATICS, 2007年06月, 査読有り

  
• Generalizing the induced matching by edge capacity constraints

  Takuro Fukunaga; Hiroshi Nagamochi

  DISCRETE OPTIMIZATION, 2007年06月, 査読有り

  
• Bisecting a 4-connected graph with three resource sets

  Toshimasa Ishii; Kengo Iwata; Hiroshi Nagamochi

  DISCRETE APPLIED MATHEMATICS, 2007年06月, 査読有り

  
• Drawing c-planar biconnected clustered graphs

  Hiroshi Nagamochi; Katsutoshi Kuroya

  DISCRETE APPLIED MATHEMATICS, 2007年05月, 査読有り

  
• Approximation algorithms for multicast routings in a network with multi-sources

  Ehab Mosry; Hiroshi Nagamochi

  IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2007年05月, 査読有り

  
• Approximation algorithms for multicast routings in a network with multi-sources

  Ehab Mosry; Hiroshi Nagamochi

  IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2007年05月, 査読有り

  
• Drawing c-planar biconnected clustered graphs

  Hiroshi Nagamochi; Katsutoshi Kuroya

  DISCRETE APPLIED MATHEMATICS, 2007年05月, 査読有り

  
• Minimum cost subpartitions in graphs

  Hiroshi Nagamochi; Yoko Kamidoi

  INFORMATION PROCESSING LETTERS, 2007年04月, 査読有り

  
• Minimum cost subpartitions in graphs

  Hiroshi Nagamochi; Yoko Kamidoi

  INFORMATION PROCESSING LETTERS, 2007年04月, 査読有り

  
• Minimum cost source location problem with local 3-vertex-connectivity requirements

  Toshimasa Ishii; Hitoshi Fujita; Hiroshi Nagamochi

  THEORETICAL COMPUTER SCIENCE, 2007年03月, 査読有り

  
• Minimum cost source location problem with local 3-vertex-connectivity requirements

  Toshimasa Ishii; Hitoshi Fujita; Hiroshi Nagamochi

  THEORETICAL COMPUTER SCIENCE, 2007年03月, 査読有り

  
• An approximation algorithm for dissecting a rectangle into rectangles with specified areas

  Hiroshi Nagamochi; Yuusuke Abe

  DISCRETE APPLIED MATHEMATICS, 2007年02月, 査読有り

  
• Computing a minimum cut in a graph with dynamic edges incident to a designated vertex

  Hiroshi Nagamochi

  IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 2007年02月, 査読有り

  
• Approximating a generalization of metric TSP

  Takuro Fukunaga; Hiroshi Nagamochi

  IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 2007年02月, 査読有り

  
• An approximation algorithm for dissecting a rectangle into rectangles with specified areas

  Hiroshi Nagamochi; Yuusuke Abe

  DISCRETE APPLIED MATHEMATICS, 2007年02月, 査読有り

  
• Approximating a generalization of metric TSP

  Takuro Fukunaga; Hiroshi Nagamochi

  IEICE Transactions on Information and Systems, 2007年, 査読有り

  
• A path relinking approach for the multi-resource generalized quadratic assignment problem

  Mutsunori Yagiura; Akira Komiya; Kenya Kojima; Koji Nonobe; Hiroshi Nagamochi; Toshihide Ibaraki; Fred Glover

  ENGINEERING STOCHASTIC LOCAL SEARCH ALGORITHMS: DESIGNING, IMPLEMENTING AND ANALYZING EFFECTIVE HEURISTICS, 2007年, 査読有り

  
• Algorithms for the minimum partitioning problems in graphs

  Hiroshi Nagamochi

  ELECTRONICS AND COMMUNICATIONS IN JAPAN PART III-FUNDAMENTAL ELECTRONIC SCIENCE, 2007年, 査読有り

  
• Selective vehicle scheduling on paths with a due date involving criterion

  Y. Karuno; H. Nagamochi; J. Uchida

  Nihon Kikai Gakkai Ronbunshu, C Hen/Transactions of the Japan Society of Mechanical Engineers, Part C, 2007年, 査読有り

  
• A DP-based Heuristic Algorithm for the Discrete Split Delivery Vehicle Routing Problem

  Yoshitaka Nakao; Hiroshi Nagamochi

  JOURNAL OF ADVANCED MECHANICAL DESIGN SYSTEMS AND MANUFACTURING, 2007年, 査読有り

  
• Practical Algorithms for Two-Dimensional Packing.

  Mutsunori Yagiura; Hiroshi Nagamochi; Shinji Imahori

  Handbook of Approximation Algorithms and Metaheuristics., 2007年, 査読有り

  
• Vehicle Scheduling Problems in Graphs.

  Yoshiyuki Karuno; Hiroshi Nagamochi

  Handbook of Approximation Algorithms and Metaheuristics., 2007年, 査読有り

  
• An efficient algorithm for generating colored outerplanar graphs

  Jiexun Wang; Liang Zhao; Hiroshi Nagamochi; Tatsuya Akutsu

  THEORY AND APPLICATIONS OF MODELS OF COMPUTATION, PROCEEDINGS, 2007年, 査読有り

  
• Approximation to the minimum cost edge installation problem

  Ehab Morsy; Hiroshi Nagamochi

  ALGORITHMS AND COMPUTATION, 2007年, 査読有り

  
• The set connector problem in graphs

  Takuro Fukunaga; Hiroshi Nagamochi

  INTEGER PROGRAMMING AND COMBINATORIAL OPTIMIZATION, PROCEEDINGS, 2007年, 査読有り

  
• Computing a minimum cut in a graph with dynamic edges incident to a designated vertex

  Hiroshi Nagamochi

  IEICE Transactions on Information and Systems, 2007年, 査読有り

  
• Sparse connectivity certificates via MA orderings in graphs

  Hiroshi Nagamochi

  Discrete Applied Mathematics, 2006年11月01日, 査読有り

  
• Two equivalent measures on weighted hypergraphs

  Hiro Ito; Hiroshi Nagamochi

  DISCRETE APPLIED MATHEMATICS, 2006年11月, 査読有り

  
• Sparse connectivity certificates via MA orderings in graphs

  Hiroshi Nagamochi

  DISCRETE APPLIED MATHEMATICS, 2006年11月, 査読有り

  
• Two equivalent measures on weighted hypergraphs

  Hiro Ito; Hiroshi Nagamochi

  DISCRETE APPLIED MATHEMATICS, 2006年11月, 査読有り

  
• Packing soft rectangles

  Hiroshi Nagamochi

  International Journal of Foundations of Computer Science, 2006年10月, 査読有り

  
• Packing soft rectangles

  Hiroshi Nagamochi

  INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2006年10月, 査読有り

  
• Some Theorems on Detachments Preserving Local-Edge-Connectivity

  Takuro Fukunaga; Hiroshi Nagamochi

  Electronic Notes in Discrete Mathematics, 2006年07月15日, 査読有り

  
• Augmenting forests to meet odd diameter requirements

  Toshimasa Ishii; Shigeyuki Yamamoto; Hiroshi Nagamochi

  DISCRETE OPTIMIZATION, 2006年06月, 査読有り

  
• Augmenting forests to meet odd diameter requirements

  Toshimasa Ishii; Shigeyuki Yamamoto; Hiroshi Nagamochi

  DISCRETE OPTIMIZATION, 2006年06月, 査読有り

  
• Minmax subtree cover problem on cacti

  H Nagamochi; T Kawada

  DISCRETE APPLIED MATHEMATICS, 2006年05月, 査読有り

  
• A fast edge-splitting algorithm in edge-weighted graphs

  Hiroshi Nagamochi

  IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2006年05月, 査読有り

  
• Minmax subtree cover problem on cacti

  H Nagamochi; T Kawada

  DISCRETE APPLIED MATHEMATICS, 2006年05月, 査読有り

  
• Augmenting a (k-1)-vertex-connected multigraph to an l-edge-connected and k-vertex-connected multigraph

  T Ishii; H Nagamochi; T Ibaraki

  ALGORITHMICA, 2006年04月, 査読有り

  
• Augmenting a (k-1)-vertex-connected multigraph to an l-edge-connected and k-vertex-connected multigraph

  T Ishii; H Nagamochi; T Ibaraki

  ALGORITHMICA, 2006年04月, 査読有り

  
• 光バースト交換網における専用波長を用いた全域木形成による衝突回避法

  平田孝志; 松田崇弘; 永持 仁; 滝根哲哉

  電子情報通信学会技術報告, 2006年03月

  
• Increasing the edge-connectivity by contracting a vertex subset in graphs

  H Nagamochi

  IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 2006年02月, 査読有り

  
• Straight-line drawing algorithms for hierarchical graphs and clustered graphs

  P Eades; QW Feng; XM Lin; H Nagamochi

  ALGORITHMICA, 2006年01月, 査読有り

  
• A dynamic programming approach for a food packing problem

  Y. Karuno; H. Nagamochi; Y. Ohshima

  Nihon Kikai Gakkai Ronbunshu, C Hen/Transactions of the Japan Society of Mechanical Engineers, Part C, 2006年, 査読有り

  
• A deterministic algorithm for finding all minimum k-way cuts

  Yoko Kamidoi; Noriyoshi Yoshida; Hiroshi Nagamochi

  SIAM JOURNAL ON COMPUTING, 2006年, 査読有り

  
• Convex drawings of graphs with non-convex boundary

  Seok-Hee Hong; Hiroshi Nagamochi

  GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE, 2006年, 査読有り

  
• Contention-Free lambda-Planes in Optically Burst-Switched WDM Networks

  Kouji Hirata; Takahiro Matsuda; Hiroshi Nagamochi; Tetsuya Takine

  GLOBECOM 2006 - 2006 IEEE GLOBAL TELECOMMUNICATIONS CONFERENCE, 2006年, 査読有り

  
• A fast edge-splitting algorithm in edge-weighted graphs

  Hiroshi Nagamochi

  IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, 2006年, 査読有り

  
• Increasing the edge-connectivity by contracting a vertex subset in graphs

  Hiroshi Nagamochi

  IEICE Transactions on Information and Systems, 2006年, 査読有り

  
• Straight-line drawing algorithms for hierarchical graphs and clustered graphs

  P Eades; QW Feng; XM Lin; H Nagamochi

  ALGORITHMICA, 2006年01月, 査読有り

  
• A deterministic algorithm for finding all minimum k-way cuts

  Yoko Kamidoi; Noriyoshi Yoshida; Hiroshi Nagamochi

  SIAM JOURNAL ON COMPUTING, 2006年, 査読有り

  
• A robust algorithm for bisecting a triconnected graph with two resource sets

  H Nagamochi; K Iwata; T Ishii

  THEORETICAL COMPUTER SCIENCE, 2005年09月, 査読有り

  
• A robust algorithm for bisecting a triconnected graph with two resource sets

  H Nagamochi; K Iwata; T Ishii

  THEORETICAL COMPUTER SCIENCE, 2005年09月, 査読有り

  
• A 4/3-approximation for the minimum 2-local-vertex-connectivity augmentation in a connected graph

  H Nagamochi

  JOURNAL OF ALGORITHMS, 2005年08月, 査読有り

  
• A 4/3-approximation for the minimum 2-local-vertex-connectivity augmentation in a connected graph

  Hiroshi Nagamochi

  Journal of Algorithms, 2005年08月, 査読有り

  
• Packing unit squares in a rectangle

  H. Nagamochi

  Electronic Journal of Combinatorics, 2005年07月29日, 査読有り

  
• Packing unit squares in a rectangle

  H Nagamochi

  ELECTRONIC JOURNAL OF COMBINATORICS, 2005年07月, 査読有り

  
• タンク繰りにおける経路探索法

  石井利昌; 永持仁; 西垣豊; 高橋健吾; 武田真人

  システム制御情報学会論文誌, 2005年06月, 査読有り

  
• Approximating the minmax rooted-subtree cover problem

  H Nagamochi

  IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2005年05月, 査読有り

  
• An improved bound on the one-sided minimum crossing number in two-layered drawings

  H Nagamochi

  DISCRETE & COMPUTATIONAL GEOMETRY, 2005年04月, 査読有り

  
• On computing minimum (s,t)-cuts in digraphs

  Hiroshi Nagamochi

  Information Processing Letters, 2005年03月16日, 査読有り

  
• On computing minimum (s,t)-cuts in digraphs

  H Nagamochi

  INFORMATION PROCESSING LETTERS, 2005年03月, 査読有り

  
• On the one-sided crossing minimization in a bipartite graph with large degrees

  Hiroshi Nagamochi

  Theoretical Computer Science, 2005年02月28日, 査読有り

  
• On the one-sided crossing minimization in a bipartite graph with large degrees

  H Nagamochi

  THEORETICAL COMPUTER SCIENCE, 2005年02月, 査読有り

  
• An improved bound on the one-sided minimum crossing number in two-layered drawings

  Hiroshi Nagamochi

  Discrete and Computational Geometry, 2005年, 査読有り

  
• On 2-approximation to the vertex-connectivity in graphs

  Hiroshi Nagamochi

  IEICE Transactions on Information and Systems, 2005年, 査読有り

  
• Greedy splitting algorithms for approximating multiway partition problems

  L Zhao; H Nagamochi; T Ibaraki

  MATHEMATICAL PROGRAMMING, 2005年01月, 査読有り

  
• Scheduling vehicles on trees

  Y. Karuno; Hiroshi Nagamochi

  Pacific Journal of Optimization,vol. 1, no. 3, pp. 527-543., 2005年, 査読有り

  
• Greedy splitting algorithms for approximating multiway partition problems

  L Zhao; H Nagamochi; T Ibaraki

  MATHEMATICAL PROGRAMMING, 2005年01月, 査読有り

  
• Approximating the minmax rooted-subtree cover problem

  Hiroshi Nagamochi

  IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, 2005年, 査読有り

  
• On 2-approximation to the vertex-connectivity in graphs

  H Nagamochi

  IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 2005年01月, 査読有り

  
• Graph algorithms for network connectivity problems

  H Nagamochi

  JOURNAL OF THE OPERATIONS RESEARCH SOCIETY OF JAPAN, 2004年12月, 査読有り

  
• On generalized greedy splitting algorithms for multiway partition problems

  L Zhao; H Nagamochi; T Ibarakic

  DISCRETE APPLIED MATHEMATICS, 2004年09月, 査読有り

  
• Counting edge crossings in a 2-layered drawing

  H Nagamochi; N Yamada

  INFORMATION PROCESSING LETTERS, 2004年09月, 査読有り

  
• Counting edge crossings in a 2-layered drawing

  H Nagamochi; N Yamada

  INFORMATION PROCESSING LETTERS, 2004年09月, 査読有り

  
• On generalized greedy splitting algorithms for multiway partition problems

  L Zhao; H Nagamochi; T Ibarakic

  DISCRETE APPLIED MATHEMATICS, 2004年09月, 査読有り

  
• A faster 2-approximation algorithm for the minmax p-traveling salesmen problem on a tree

  H Nagamochi; K Okada

  DISCRETE APPLIED MATHEMATICS, 2004年05月, 査読有り

  
• A faster 2-approximation algorithm for the minmax p-traveling salesmen problem on a tree

  H Nagamochi; K Okada

  DISCRETE APPLIED MATHEMATICS, 2004年05月, 査読有り

  
• A simple recognition of maximal planar graphs

  H Nagamochi; T Suzuki; T Ishii

  INFORMATION PROCESSING LETTERS, 2004年03月, 査読有り

  
• A simple recognition of maximal planar graphs

  H Nagamochi; T Suzuki; T Ishii

  INFORMATION PROCESSING LETTERS, 2004年03月, 査読有り

  
• An approximability result of the multi-vehicle scheduling problem on a path with release and handling times

  Y Karuno; H Nagamochi

  THEORETICAL COMPUTER SCIENCE, 2004年01月, 査読有り

  
• An improved approximation to the one-sided bilayer drawing

  H Nagamochi

  GRAPH DRAWING, 2004年, 査読有り

  
• Convex drawing for c-planar biconnected clustered graphs

  H Nagamochi; K Kuroya

  GRAPH DRAWING, 2004年, 査読有り

  
• An approximability result of the multi-vehicle scheduling problem on a path with release and handling times

  Y Karuno; H Nagamochi

  THEORETICAL COMPUTER SCIENCE, 2004年01月, 査読有り

  
• Approximability of the minimum maximal matching problem in planar graphs

  H Nagamochi; Y Nishida; T Ibaraki

  IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2003年12月, 査読有り

  
• On the minimum local-vertex-connectivity augmentation in graphs

  Nagamochi, H; Ishii, T

  DISCRETE APPLIED MATHEMATICS, 2003年08月01日, 査読有り

  
• 2-Approximation algorithms for the multi-vehicle scheduling problem on a path with release and handling times

  Y Karuno; H Nagamochi

  DISCRETE APPLIED MATHEMATICS, 2003年08月, 査読有り

  
• On the minimum local-vertex-connectivity augmentation in graphs

  H Nagamochi; T Ishii

  DISCRETE APPLIED MATHEMATICS, 2003年08月, 査読有り

  
• 2-Approximation algorithms for the multi-vehicle scheduling problem on a path with release and handling times

  Y Karuno; H Nagamochi

  DISCRETE APPLIED MATHEMATICS, 2003年08月, 査読有り

  
• An edge-splitting algorithm in planar graphs

  H Nagamochi; P Eades

  JOURNAL OF COMBINATORIAL OPTIMIZATION, 2003年06月, 査読有り

  
• An edge-splitting algorithm in planar graphs

  H Nagamochi; P Eades

  JOURNAL OF COMBINATORIAL OPTIMIZATION, 2003年06月, 査読有り

  
• A linear time 5/3-approximation for the minimum 3 strongly-connected spanning subgraph problem

  L Zhao; H Nagamochi; T Ibaraki

  INFORMATION PROCESSING LETTERS, 2003年04月, 査読有り

  
• A linear time 5/3-approximation for the minimum 3 strongly-connected spanning subgraph problem

  L Zhao; H Nagamochi; T Ibaraki

  INFORMATION PROCESSING LETTERS, 2003年04月, 査読有り

  
• A primal-dual approximation algorithm for the survivable network design problem in hypergraphs

  L Zhao; H Nagamochi; T Ibaraki

  DISCRETE APPLIED MATHEMATICS, 2003年03月, 査読有り

  
• An approximation for finding a smallest 2-edge-connected subgraph containing a specified spanning tree

  H Nagamochi

  DISCRETE APPLIED MATHEMATICS, 2003年03月, 査読有り

  
• A primal-dual approximation algorithm for the survivable network design problem in hypergraphs

  L Zhao; H Nagamochi; T Ibaraki

  DISCRETE APPLIED MATHEMATICS, 2003年03月, 査読有り

  
• グラフの最小分割問題に対するアルゴリズム(<小特集>LAシンポジウム(計算機科学基礎理論ワークショップ)論文小特集)

  永持 仁

  電子情報通信学会論文誌. D-I, 情報・システム, I-情報処理, 2003年02月01日, 査読有り

  
• Constructing a cactus for minimum cuts of a graph in O (mn+n(2) log n) time and O(m) Space

  H Nagamochi; S Nakamura; T Ishii

  IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 2003年02月, 査読有り

  
• Algorithms for the minimum partitioning problems in graphs

  永持 仁

  The Institute of Electronics, Information and Communication Engineers Transactions on Information and Systems,J86-D-I/2, 53-68, 2003年, 査読有り

  
• Graph connectivity and its augmentation: applications of MA orderings

  H Nagamochi; T Ibaraki

  DISCRETE APPLIED MATHEMATICS, 2002年11月, 査読有り

  
• Graph connectivity and its augmentation: applications of MA orderings

  H Nagamochi; T Ibaraki

  DISCRETE APPLIED MATHEMATICS, 2002年11月, 査読有り

  
• Better approximation ratios for the single-vehicle scheduling problems on line-shaped networks

  Y Karuno; H Nagamochi; T Ibaraki

  NETWORKS, 2002年07月, 査読有り

  
• Better approximation ratios for the single-vehicle scheduling problems on line-shaped networks

  Y Karuno; H Nagamochi; T Ibaraki

  NETWORKS, 2002年07月, 査読有り

  
• A 2-approximation algorithm for the minimum weight edge dominating set problem

  Toshihiro Fujito; Hiroshi Nagamochi

  Discrete Applied Mathematics, 2002年05月15日, 査読有り

  
• A 2-approximation algorithm for the minimum weight edge dominating set problem

  T Fujito; H Nagamochi

  DISCRETE APPLIED MATHEMATICS, 2002年05月, 査読有り

  
• A note on approximating the survivable network design problem in hypergraphs

  L Zhao; H Nagamochi; T Ibaraki

  IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 2002年02月, 査読有り

  
• On the minimum edge- and vertex-connectivity augmentation in multigraphs, "jointly worked "

  永持 仁

  The Second Japanese-Sino Optimization Meeting,/ , 61, 2002年, 査読有り

  
• A better approximation for the two-stage assembly scheduling problem with two machines at the first stage

  Y Karuno; H Nagamochi

  ALGORITHMS AND COMPUTATION, PROCEEDINGS, 2002年, 査読有り

  
• Comparing hypergraphs by areas of hyperedges drawn on a convex polygon

  H. Ito; H. Nagamochi

  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2002年, 査読有り

  
• Convex embeddings and bisections of 3-connected graphs

  H Nagamochi; T Jordan; Y Nakao; T Ibaraki

  COMBINATORICA, 2002年, 査読有り

  
• Convex embeddings and bisections of 3-connected graphs

  H Nagamochi; T Jordan; Y Nakao; T Ibaraki

  COMBINATORICA, 2002年, 査読有り

  
• Minimum cost source location problem with vertex-connectivity requirements in digraphs

  H. Nagamochi; T. Ishii; H. Ito

  Information Processing Letters, 2001年12月31日, 査読有り

  
• Approximating the minimum k-way cut in a graph via minimum 3-way cuts

  L Zhao; H Nagamochi; T Ibaraki

  JOURNAL OF COMBINATORIAL OPTIMIZATION, 2001年12月, 査読有り

  
• Approximating the minimum k-way cut in a graph via minimum 3-way cuts

  L Zhao; H Nagamochi; T Ibaraki

  JOURNAL OF COMBINATORIAL OPTIMIZATION, 2001年12月, 査読有り

  
• Minimum cost source location problem with vertex-connectivity requirements in digraphs

  H Nagamochi; T Ishii; H Ito

  INFORMATION PROCESSING LETTERS, 2001年12月, 査読有り

  
• Bounds on the number of isolates in sum graph labeling

  H Nagamochi; M Miller; Slamin

  DISCRETE MATHEMATICS, 2001年09月, 査読有り

  
• Independent spanning trees with small depths in iterated line digraphs

  Toru Hasunuma; Hiroshi Nagamochi

  Discrete Applied Mathematics, 2001年06月15日, 査読有り

  
• Augmenting a submodular and posi-modular set function by a multigraph

  H Nagamochi; T Shiraki; T Ibaraki

  JOURNAL OF COMBINATORIAL OPTIMIZATION, 2001年06月, 査読有り

  
• Augmenting a submodular and posi-modular set function by a multigraph

  H Nagamochi; T Shiraki; T Ibaraki

  JOURNAL OF COMBINATORIAL OPTIMIZATION, 2001年06月, 査読有り

  
• Independent spanning trees with small depths in iterated line digraphs

  T Hasunuma; H Nagamochi

  DISCRETE APPLIED MATHEMATICS, 2001年06月, 査読有り

  
• Solving the single-vehicle scheduling problems for all home locations under depth-first routing on a tree

  H Nagamochi; K Mochizuki; T Ibaraki

  IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2001年05月, 査読有り

  
• Multigraph augmentation under biconnectivity and general edge-connectivity requirements

  T Ishii; H Nagamochi; T Ibaraki

  NETWORKS, 2001年05月, 査読有り

  
• Multigraph augmentation under biconnectivity and general edge-connectivity requirements

  T Ishii; H Nagamochi; T Ibaraki

  NETWORKS, 2001年05月, 査読有り

  
• An efficient NC algorithm for a sparse k-edge-connectivity certificate

  H Nagamochi; T Hasunuma

  JOURNAL OF ALGORITHMS, 2001年02月, 査読有り

  
• An Efficient script N signScript C sign Algorithm for a Sparse k-Edge-Connectivity Certificate

  Hiroshi Nagamochi; Toru Hasunuma

  Journal of Algorithms, 2001年, 査読有り

  
• Bounds on sum number in graphs

  Hiroshi Nagamochi; M. Miller; Slamin

  Discrete Mathematics, vol.240, no.1-3,pp.175-185, 2001年, 査読有り

  
• Bounds on sum number in graphs, "jointly worked "

  永持 仁

  Discrete Mathematics,240/1-3, 175-185, 2001年, 査読有り

  
• A unified framework for approximating some partition problems via greedy splitting, "jointly worked "

  永持 仁

  Lecture Notes in Computer Science,V2223, 682-694, 2001年, 査読有り

  
• A primal-dual approximation algorithm for the survivable network design problem in hypergraphs, "jointly worked "

  永持 仁

  Lecture Notes in Computer Science,V2010, 478-489, 2001年, 査読有り

  
• A 2-approximation algorithm for the multi-vehicle scheduling on a path with release and handling times, "jointly worked "

  永持 仁

  Lecture Notes in Computer Science,V 2161, 218-229, 2001年, 査読有り

  
• Digital Halftoning: Its Computational Complexity and Approximation Algorithms Based on Network Flow

  ASANO Tetsuo; FUJIKAWA Naoki; KATOH Naoki; Matsui Tomomi; NAGAMOCHI Hiroshi; OBOKATA Koji; TOKUYAMA Takeshi

  Proceedings of the 6th KOREA-JAPAN Joint Workshop on Algorithms and Computation, 2001年, 査読有り

  
• A Primal-Dual Approximation Algorithm for the Survivable Network Design Problem in Hypergraph.

  Liang Zhao; Hiroshi Nagamochi; Toshihide Ibaraki

  STACS 2001, 18th Annual Symposium on Theoretical Aspects of Computer Science, Dresden, Germany, February 15-17, 2001, Proceedings, 2001年, 査読有り

  
• A unified framework for approximating multiway partition problems - (Extended abstract)

  L Zhao; H Nagamochi; T Ibaraki

  ALGORITHMS AND COMPUTATION, PROCEEDINGS, 2001年, 査読有り

  
• A 2-Approximation Algorithm for the Multi-vehicle Scheduling Problem on a Path with Release and Handling Times.

  Yoshiyuki Karuno; Hiroshi Nagamochi

  Algorithms - ESA 2001, 9th Annual European Symposium, Aarhus, Denmark, August 28-31, 2001, Proceedings, 2001年, 査読有り

  
• Polyhedral structure of submodular and posi-modular systems

  H Nagamochi; T Ibaraki

  DISCRETE APPLIED MATHEMATICS, 2000年12月, 査読有り

  
• Polyhedral structure of submodular and posi-modular systems

  H Nagamochi; T Ibaraki

  DISCRETE APPLIED MATHEMATICS, 2000年12月, 査読有り

  
• A fast algorithm for computing minimum 3-way and 4-way cuts

  H Nagamochi; T Ibaraki

  MATHEMATICAL PROGRAMMING, 2000年09月, 査読有り

  
• A fast algorithm for cactus representations of minimum cuts

  H Nagamochi; Y Nakao; T Ibaraki

  JAPAN JOURNAL OF INDUSTRIAL AND APPLIED MATHEMATICS, 2000年06月, 査読有り

  
• A faster algorithm for computing minimum 5-way and 6-way cuts in graphs

  H Nagamochi; S Katayama; T Ibaraki

  JOURNAL OF COMBINATORIAL OPTIMIZATION, 2000年06月, 査読有り

  
• A faster algorithm for computing minimum 5-way and 6-way cuts in graphs

  H Nagamochi; S Katayama; T Ibaraki

  JOURNAL OF COMBINATORIAL OPTIMIZATION, 2000年06月, 査読有り

  
• Totally balanced combinatorial optimization games

  XT Deng; T Ibaraki; H Nagamochi; WN Zang

  MATHEMATICAL PROGRAMMING, 2000年05月, 査読有り

  
• Totally balanced combinatorial optimization games

  XT Deng; T Ibaraki; H Nagamochi; WN Zang

  MATHEMATICAL PROGRAMMING, 2000年05月, 査読有り

  
• A 7/3-approximation for the minimum weight 3-connected spanning subgraph problem

  H Nagamochi; K Seki; T Ibaraki

  IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2000年04月, 査読有り

  
• Recent development of graph connectivity augmentation algorithms

  H Nagamochi

  IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 2000年03月, 査読有り

  
• Optimal Augmentation of a 2-Vertex-Connected Multigraph to an ℓ-Edge-Connected and 3-Vertex-Connected Multigraph

  T. Ishii; H. Nagamochi; T. Baraki

  Journal of Combinatorial Optimization, 2000年03月, 査読有り

  
• Optimal augmentation of a 2-vertex-connected multigraph to an l-edge-connected and 3-vertex-connected multigraph

  T Ishii; H Nagamochi; T Ibaraki

  JOURNAL OF COMBINATORIAL OPTIMIZATION, 2000年03月, 査読有り

  
• A fast algorithm for computing minimum 3-way and 4-way cuts

  Hiroshi Nagamochi; Toshihide Ibaraki

  Mathematical Programming, Series B, 2000年, 査読有り

  
• A simplified (O)over-tilde(nm) time edge-splitting algorithm in undirected graphs

  H Nagamochi; S Nakamura; T Ibaraki

  ALGORITHMICA, 2000年01月, 査読有り

  
• Simultaneous augmentation of two graphs to an l-edge-connected graph and a biconnected graph, "jointly worked "

  永持 仁

  Lecture Notes in Computer Science,V1969, 326-337, 2000年, 査読有り

  
• A Simplified Õ(nm) Time Edge-Splitting Algorithm in Undirected Graphs.

  Hiroshi Nagamochi; S. Nakamura; Toshihide Ibaraki

  Algorithmica, 2000年01月, 査読有り

  
• Bisecting two subsets in 3-connected graphs

  H Nagamochi; T Jordan; Y Nakao; T Ibaraki

  ALGORITHMS AND COMPUTATIONS, 2000年, 査読有り

  
• An approximation of the minimum vertex cover in a graph

  H Nagamochi; T Ibaraki

  JAPAN JOURNAL OF INDUSTRIAL AND APPLIED MATHEMATICS, 1999年10月, 査読有り

  
• A simple proof of a minimum cut algorithm and its applications

  H Nagamochi; T Ishii; T Ibaraki

  IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 1999年10月, 査読有り

  
• Algorithmic aspects of the core of combinatorial optimization games

  XT Deng; T Ibaraki; H Nagamochi

  MATHEMATICS OF OPERATIONS RESEARCH, 1999年08月, 査読有り

  
• Algorithmic aspects of the core of combinatorial optimization games

  XT Deng; T Ibaraki; H Nagamochi

  MATHEMATICS OF OPERATIONS RESEARCH, 1999年08月, 査読有り

  
• A reconfigurative algorithm for torus lightwave networks

  M Kato; R Kawakita; H Nagamochi; Y Oie

  ELECTRONICS AND COMMUNICATIONS IN JAPAN PART I-COMMUNICATIONS, 1999年06月, 査読有り

  
• Augmenting edge-connectivity over the entire range in (O)over-tilde(nm) time

  H Nagamochi; T Ibaraki

  JOURNAL OF ALGORITHMS, 1999年02月, 査読有り

  
• Augmenting Edge-Connectivity over the Entire Range in Õ(nm) Time.

  Hiroshi Nagamochi; Toshihide Ibaraki

  J. Algorithms, 1999年02月, 査読有り

  
• Approximating the minimum k-way cut in a graph via minimum 3-way cuts

  Liang Zhao; Hiroshi Nagamochi; Toshihide Ibaraki

  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 1999年, 査読有り

  
• Drawing Clustered Graphs on an Orthogonal Grid.

  Peter Eades; Qing-Wen Feng; Hiroshi Nagamochi

  J. Graph Algorithms Appl., 1999年, 査読有り

  
• Drawing clustered graphs on an orthogonal grid, "jointly worked "

  永持 仁

  Journal of Graph Algorithms and Application,3/4, 3-29, 1999年, 査読有り

  
• An approximation for finding a smallest 2-edge-connected subgraph containing a specified spanning tree

  Hiroshi Nagamochi; Toshihide Ibaraki

  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 1999年, 査読有り

  
• A faster algorithm for computing minimum 5-way and 6-way cuts in graphs

  Hiroshi Nagamochi; Shigeki Katayama; Toshihide Ibaraki

  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 1999年, 査読有り

  
• Augmentin a (k-1)-vertex-connected multigraph to an l-edge-connected and k-vertex-connected multigraph

  T Ishii; H Nagamochi; T Ibaraki

  ALGORITHMS - ESA'99, 1999年, 査読有り

  
• Augmentin a (k-1)-vertex-connected multigraph to an l-edge-connected and k-vertex-connected multigraph

  T Ishii; H Nagamochi; T Ibaraki

  ALGORITHMS - ESA'99, 1999年, 査読有り

  
• Two arc-disjoint paths in Eulerian digraphs

  A Frank; T Ibaraki; H Nagamochi

  SIAM JOURNAL ON DISCRETE MATHEMATICS, 1998年11月, 査読有り

  
• Two arc-disjoint paths in Eulerian digraphs

  A Frank; T Ibaraki; H Nagamochi

  SIAM JOURNAL ON DISCRETE MATHEMATICS, 1998年11月, 査読有り

  
• A note on minimizing submodular functions

  H Nagamochi; T Ibaraki

  INFORMATION PROCESSING LETTERS, 1998年09月, 査読有り

  
• A note on minimizing submodular functions

  H Nagamochi; T Ibaraki

  INFORMATION PROCESSING LETTERS, 1998年09月, 査読有り

  
• 数理工学のすすめ--木を見て森を見る

  永持 仁

  理系への数学, 1998年08月, 査読有り

  
• Convexity of Elementary Flow Games.

  永持仁; 牧野和久; ZENG D‐Z; 村田真紀; 茨木俊秀

  電子情報通信学会論文誌 D-1, 1998年06月, 査読有り

  
• グラフの連結度増大問題

  永持仁

  応用数理, 1998年03月, 査読有り

  
• Independent spanning trees with small depths in iterated line digraphs

  T Hasunuma; H Nagamochi

  PROCEEDINGS OF THE 4TH AUSTRALASIAN THEORY SYMPOSIUM, CATS'98, 1998年, 査読有り

  
• An efficient NC algorithm for a sparse k-edge-connectivity certificate

  H Nagamochi; T Hasunuma

  ALGORITHMS AND COMPUTATIONS, 1998年, 査読有り

  
• Polyhedral structure of submodular and posi-modular systems

  H Nagamochi; T Ibaraki

  ALGORITHMS AND COMPUTATIONS, 1998年, 査読有り

  
• k-edge and 3-vertex connectivity augmentation in an arbitrary multigraph

  T Ishii; H Nagamochi; T Ibaraki

  ALGORITHMS AND COMPUTATIONS, 1998年, 査読有り

  
• Edge-splitting and edge-connectivity augmentation in planar graphs

  H Nagamochi; P Eades

  INTEGER PROGRAMMING AND COMBINATORIAL OPTIMIZATION, 1998年, 査読有り

  
• A fast algorithm for finding a maximum free multiflow in an inner Eulerian network and some generalizations

  T Ibaraki; AV Karzanov; H Nagamochi

  COMBINATORICA, 1998年, 査読有り

  
• Optimal Augmentation to Make a Graph k-Edge-Connected and Triconnected.

  Toshimasa Ishii; Hiroshi Nagamochi; Toshihide Ibaraki

  Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 25-27 January 1998, San Francisco, California., 1998年, 査読有り

  
• Complexity of the single vehicle scheduling problem on graphs

  H Nagamochi; K Mochizuki; T Ibaraki

  INFOR, 1997年11月, 査読有り

  
• 格子型光波ネットワークの再構成アルゴリズムについて

  嘉藤学; 河北隆二; 永持仁; 尾家祐二

  電子情報通信学会論文誌 B-1, 1997年10月, 査読有り

  
• Computing all small cuts in an undirected network

  H Nagamochi; K Nishimura; T Ibaraki

  SIAM JOURNAL ON DISCRETE MATHEMATICS, 1997年08月, 査読有り

  
• Computing all small cuts in an undirected network

  H Nagamochi; K Nishimura; T Ibaraki

  SIAM JOURNAL ON DISCRETE MATHEMATICS, 1997年08月, 査読有り

  
• Complexity of the minimum base game on matroids

  H Nagamochi; DZ Zeng; N Kabutoya; T Ibaraki

  MATHEMATICS OF OPERATIONS RESEARCH, 1997年02月, 査読有り

  
• Complexity of the minimum base game on matroids

  H Nagamochi; DZ Zeng; N Kabutoya; T Ibaraki

  MATHEMATICS OF OPERATIONS RESEARCH, 1997年02月, 査読有り

  
• Deterministic Õ(nm) Time Edge-Splitting in Undirected Graphs.

  Hiroshi Nagamochi; Toshihide Ibaraki

  J. Comb. Optim., 1997年, 査読有り

  
• Augmenting edge and vertex connectivities simultaneously

  Toshimasa, I; H Nagamochi; Toshihide, I

  ALGORITHMS AND COMPUTATION, PROCEEDINGS, 1997年, 査読有り

  
• Vehicle scheduling on a tree with release and handling times

  Y Karuno; H Nagamochi; T Ibaraki

  ANNALS OF OPERATIONS RESEARCH, 1997年, 査読有り

  
• Computing Edge-Connectivity Augmentation Function in Õ(nm) Time.

  Hiroshi Nagamochi; Takashi Shiraki; Toshihide Ibaraki

  Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 5-7 January 1997, New Orleans, Louisiana., 1997年, 査読有り

  
• Vehicle scheduling on a tree to minimize maximum lateness

  Y Karuno; H Nagamochi; T Ibaraki

  JOURNAL OF THE OPERATIONS RESEARCH SOCIETY OF JAPAN, 1996年09月, 査読有り

  
• Constructing cactus representation for all minimum cuts in an undirected network

  H Nagamochi; T Kameda

  JOURNAL OF THE OPERATIONS RESEARCH SOCIETY OF JAPAN, 1996年06月, 査読有り

  
• Computational Complexity of the Traveling Salesman Problem on a Line with Deadlines and General Handling Times.

  KARUNO Y; NAGAMOCHI H; IBARAKI T

  Mem Fac Eng Des Kyoto Inst Technol Ser Sci Technol, 1996年, 査読有り

  
• Deterministic Õ(nm) Time Edge-Splitting in Undirected Graphs.

  Hiroshi Nagamochi; Toshihide Ibaraki

  Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing, Philadelphia, Pennsylvania, USA, May 22-24, 1996, 1996年, 査読有り

  
• OPTIMAL COTERIES FOR RINGS AND RELATED NETWORKS

  T IBARAKI; H NAGAMOCHI; T KAMEDA

  DISTRIBUTED COMPUTING, 1995年06月, 査読有り

  
• OPTIMAL COTERIES FOR RINGS AND RELATED NETWORKS

  T IBARAKI; H NAGAMOCHI; T KAMEDA

  DISTRIBUTED COMPUTING, 1995年06月, 査読有り

  
• サブツアー交換交叉に対する2つのコメント（共著）

  永持 仁

  人工知能学会論文誌,10/3, 464-467, 1995年, 査読有り

  
• Two arc-disjoint paths in Eulerian digraphs, "jointly worked "

  永持 仁

  Lecture Notes in Computer Science,V1004, 92-101, 1995年, 査読有り

  
• A Faster Edge Splitting Algorithm in Multigraphs and its Application to the Edge-Connectivity Augmentation Problem.

  Hiroshi Nagamochi; Toshihide Ibaraki

  Integer Programming and Combinatorial Optimization, 4th International IPCO Conference, Copenhagen, Denmark, May 29-31, 1995, Proceedings, 1995年, 査読有り

  
• Two Arc Disjoint Paths in Eulerian Diagraphs.

  András Frank; Toshihide Ibaraki; Hiroshi Nagamochi

  Algorithms and Computation, 6th International Symposium, ISAAC '95, Cairns, Australia, December 4-6, 1995, Proceedings, 1995年, 査読有り

  
• IMPLEMENTING AN EFFICIENT MINIMUM CAPACITY CUT ALGORITHM

  H NAGAMOCHI; T ONO; T IBARAKI

  MATHEMATICAL PROGRAMMING, 1994年12月, 査読有り

  
• AN EXACT LOWER-BOUND ON THE NUMBER OF CUT-SETS IN MULTIGRAPHS

  H HARADA; Z SUN; H NAGAMOCHI

  NETWORKS, 1994年12月, 査読有り

  
• AN EXACT LOWER-BOUND ON THE NUMBER OF CUT-SETS IN MULTIGRAPHS

  H HARADA; Z SUN; H NAGAMOCHI

  NETWORKS, 1994年12月, 査読有り

  
• IMPLEMENTING AN EFFICIENT MINIMUM CAPACITY CUT ALGORITHM

  H NAGAMOCHI; T ONO; T IBARAKI

  MATHEMATICAL PROGRAMMING, 1994年12月, 査読有り

  
• Canonical cactus representation for minimum cuts

  Hiroshi Nagamochi; Tiko Kameda

  Japan Journal of Industrial and Applied Mathematics, 1994年10月, 査読有り

  
• Computing all small cuts in undirected networks, "jointly worked "

  永持 仁

  Lecture Notes in Computer Science,V834, 190-198, 1994年, 査読有り

  
• Computing All Small Cuts in Undirected Networks.

  Hiroshi Nagamochi; Kazuhiro Nishimura; Toshihide Ibaraki

  Algorithms and Computation, 5th International Symposium, ISAAC '94, Beijing, P. R. China, August 25-27, 1994, Proceedings, 1994年, 査読有り

  
• ON SPARSE SUBGRAPHS PRESERVING CONNECTIVITY PROPERTIES

  A FRANK; T IBARAKI; H NAGAMOCHI

  JOURNAL OF GRAPH THEORY, 1993年07月, 査読有り

  
• ON SPARSE SUBGRAPHS PRESERVING CONNECTIVITY PROPERTIES

  A FRANK; T IBARAKI; H NAGAMOCHI

  JOURNAL OF GRAPH THEORY, 1993年07月, 査読有り

  
• COMPUTING K-EDGE-CONNECTED COMPONENTS OF A MULTIGRAPH

  H NAGAMOCHI; T WATANABE

  IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 1993年04月, 査読有り

  
• Computing k-edge-connected components in multigraphs, "jointly worked "

  永持 仁

  Inst. Electron. Inform. Comm. Eng. Trans,E76-A,/ 4, \t513-517, 1993年, 査読有り

  
• Vehicle Scheduling on a Tree with Release and Handling Times.

  Yoshiyuki Karuno; Hiroshi Nagamochi; Toshihide Ibaraki

  Algorithms and Computation, 4th International Symposium, ISAAC '93, Hong Kong, December 15-17, 1993, Proceedings, 1993年, 査読有り

  
• ON ONAGAS UPPER BOUND ON THE MEAN-VALUES OF PROBABILISTIC MAXIMUM FLOWS

  H NAGAMOCHI; T IBARAKI

  IEEE TRANSACTIONS ON RELIABILITY, 1992年06月, 査読有り

  
• A linear time algorithm for computing 3-edge-connected components in a multigraph

  Hiroshi Nagamochi; Toshihide Ibaraki

  Japan Journal of Industrial and Applied Mathematics, 1992年06月, 査読有り

  
• COMPUTING EDGE-CONNECTIVITY IN MULTIGRAPHS AND CAPACITATED GRAPHS

  H NAGAMOCHI; T IBARAKI

  SIAM JOURNAL ON DISCRETE MATHEMATICS, 1992年02月, 査読有り

  
• COMPUTING EDGE-CONNECTIVITY IN MULTIGRAPHS AND CAPACITATED GRAPHS

  H NAGAMOCHI; T IBARAKI

  SIAM JOURNAL ON DISCRETE MATHEMATICS, 1992年02月, 査読有り

  
• OPTIMAL COTERIES FOR RINGS AND RELATED NETWORKS

  T IBARAKI; H NAGAMOCHI; T KAMEDA

  PROCEEDINGS OF THE 12TH INTERNATIONAL CONFERENCE ON DISTRIBUTED COMPUTING SYSTEMS, 1992年, 査読有り

  
• A LINEAR-TIME ALGORITHM FOR FINDING A SPARSE K-CONNECTED SPANNING SUBGRAPH OF A K-CONNECTED GRAPH

  H NAGAMOCHI; T IBARAKI

  ALGORITHMICA, 1992年, 査読有り

  
• A LINEAR-TIME ALGORITHM FOR FINDING A SPARSE K-CONNECTED SPANNING SUBGRAPH OF A K-CONNECTED GRAPH

  H NAGAMOCHI; T IBARAKI

  ALGORITHMICA, 1992年, 査読有り

  
• COUNTING THE NUMBER OF MINIMUM CUTS IN UNDIRECTED MULTIGRAPHS

  H NAGAMOCHI; Z SUN; T IBARAKI

  IEEE TRANSACTIONS ON RELIABILITY, 1991年12月, 査読有り

  
• MAXIMUM FLOWS IN PROBABILISTIC NETWORKS

  H NAGAMOCHI; T IBARAKI

  NETWORKS, 1991年10月, 査読有り

  
• MAXIMUM FLOWS IN PROBABILISTIC NETWORKS

  H NAGAMOCHI; T IBARAKI

  NETWORKS, 1991年10月, 査読有り

  
• 基数3のカットセット数を最小にする2-辺連結グラフ

  永持 仁

  電子情報通信学会論文誌 A 基礎・境界, 1990年07月, 査読有り

  
• RELAXATION METHODS FOR THE STRICTLY CONVEX MULTICOMMODITY FLOW PROBLEM WITH CAPACITY CONSTRAINTS ON INDIVIDUAL COMMODITIES

  H NAGAMOCHI; M FUKUSHIMA; T IBARAKI

  NETWORKS, 1990年07月, 査読有り

  
• RELAXATION METHODS FOR THE STRICTLY CONVEX MULTICOMMODITY FLOW PROBLEM WITH CAPACITY CONSTRAINTS ON INDIVIDUAL COMMODITIES

  H NAGAMOCHI; M FUKUSHIMA; T IBARAKI

  NETWORKS, 1990年07月, 査読有り

  
• MULTICOMMODITY FLOWS IN CERTAIN PLANAR DIRECTED NETWORKS

  H NAGAMOCHI; T IBARAKI

  DISCRETE APPLIED MATHEMATICS, 1990年05月, 査読有り

  
• MULTICOMMODITY FLOWS IN CERTAIN PLANAR DIRECTED NETWORKS

  H NAGAMOCHI; T IBARAKI

  DISCRETE APPLIED MATHEMATICS, 1990年05月, 査読有り

  
• 組合せ最適化におけるTardosの新解法 (最近の数理計画特集)

  永持 仁

  システム・制御・情報, 1990年04月, 査読有り

  
• Multiple graphs minimizing the number of minimum cut-sets, "jointly worked "

  永持 仁

  Trans. Inst. Electron. Inform. Comm. Eng. Jap,E73/6, 915-921, 1990年, 査読有り

  
• Computing the edge-connectivity of multigraphs and capacitated graphs, "jointly worked "

  永持 仁

  Lecture Notes in Computer Science,V450, 12-20, 1990年, 査読有り

  
• COMPUTING EDGE-CONNECTIVITY IN MULTIPLE AND CAPACITATED GRAPHS

  H NAGAMOCHI; T IBARAKI

  ALGORITHMS, 1990年, 査読有り

  
• COMPUTING EDGE-CONNECTIVITY IN MULTIPLE AND CAPACITATED GRAPHS

  H NAGAMOCHI; T IBARAKI

  LECTURE NOTES IN COMPUTER SCIENCE, 1990年, 査読有り

  
• 与えられた基数のカットセット数を最小にするグラフ

  永持 仁

  電子情報通信学会論文誌 A 基礎・境界, 1989年10月, 査読有り

  
• ON MAX-FLOW MIN-CUT AND INTEGRAL FLOW PROPERTIES FOR MULTICOMMODITY FLOWS IN DIRECTED NETWORKS

  H NAGAMOCHI; T IBARAKI

  INFORMATION PROCESSING LETTERS, 1989年06月, 査読有り

  
• ON MAX-FLOW MIN-CUT AND INTEGRAL FLOW PROPERTIES FOR MULTICOMMODITY FLOWS IN DIRECTED NETWORKS

  H NAGAMOCHI; T IBARAKI

  INFORMATION PROCESSING LETTERS, 1989年06月, 査読有り

  
• Max‐flow min‐cut theorem for the multicommodity flows in certain planar directed networks

  Hiroshi Nagamochi; Toshihide Ibaraki

  Electronics and Communications in Japan (Part III: Fundamental Electronic Science), 1989年, 査読有り

  
• ある種の平面有向ネットワーク上の多品種流問題に対する最大流ー最小カットの定理（共著）

  永持 仁

  電子情報通信学会誌,J71-A/1, 71-82, 1988年, 査読有り

  
• ある種の平面有向ネットワーク上の多品種流問題の実行可能性判定法（共著）

  永持 仁

  電子情報通信学会誌,J71-A/3, 804-810, 1988年, 査読有り

  
• On the multi‐commodity flow problem in certain planar directed networks

  Hiroshi Nagamochi; Toshihide Ibaraki; Toshiharu Hasegawa

  Electronics and Communications in Japan (Part I: Communications), 1988年, 査読有り

  
• ある種の平面有向ネットワーク上の多品種流問題について

  永持仁; 茨木俊秀; 長谷川利治

  電子情報通信学会論文誌 A, 1987年02月, 査読有り

  
• 平面有向ネットワークのクラスCUに対する多品種流問題（共著）

  永持 仁

  電子情報通信学会誌,J71-A/9, 1328-1339, 1987年, 査読有り

  
• Deterministic Õ(nm) time edge-splitting in undirected graphs, "jointly worked "

  永持 仁

  J. Combinatorial Optimization,1/1, 5-46, 査読有り

  
• Augmenting edge-connectivity over the entire range in Õ(nm) time, "jointly worked "

  永持 仁

  J. Algorithms,V30, 253-301, 査読有り

  
• 確率付きネットワーク上の期待最大流について（共著）

  永持 仁

  電子情報通信学会誌,J72-A/10, 1611-1620, 査読有り

  

MISC

• Constant Time Generation of Trees with Degree Bounds (アルゴリズム(AL))

  Bingbing Zhuang; Hiroshi Nagamochi

  研究報告アルゴリズム（AL）, 2010年09月15日

  
• 一次元連続ビンパッキング問題に対する厳密解法 (21世紀の数理計画 : アルゴリズムとモデリング)

  荒堀 洋平; 今道 貴司; 永持 仁

  数理解析研究所講究録, 2010年04月

  
• Approximating the generalized capacitated tree-routing problem (21世紀の数理計画--アルゴリズムとモデリング--RIMS研究集会報告集)

  Morsy Ehab; 永持 仁

  数理解析研究所講究録, 2010年04月

  
• Enumerating Colored and Rooted Outerplanar Graphs

  Jiexun Wang; Hiroshi Nagamochi

  研究報告アルゴリズム（AL）, 2010年02月26日

  
• A Memory-Efficient Algorithm and Its Implementation of Variable-Size All-to-All Communication (ハイパフォーマンスコンピューティング(HPC) Vol.2009-HPC-121)

  Bingbing Zhuang; Hiroshi Nakashima; Hiroshi Nagamochi

  研究報告ハイパフォーマンスコンピューティング（HPC）, 2009年07月28日

  
• Approximation Algorithm for Optimization Problems Related to the Edge Dominating Set (最適化数理の手法と実際 RIMS研究集会報告集)

  福永 拓郎; 永持 仁

  数理解析研究所講究録, 2005年12月

  
• Routing of Carrier-vehicle Systems with Dedicated Last-stretch Delivery Vehicle and Fixed Carrier Route

  Mohd Shahrizan bin Othman; Aleksandar Shurbevski; Yoshiyuki Karuno; Hiroshi Nagamochi

  情報処理学会論文誌, 2017年08月15日

  
• Accelerating A* algorithms by sweeping out small-degree nodes (アルゴリズム(AL) Vol.2011-AL-134)

  ZHAO LIANG; EUMTHURAPOJN PIPAPORN; NAGAMOCHI HIROSHI

  情報処理学会研究報告, 2011年04月

  
• 劣モジュラシステム分割問題に対するアルゴリズム

  奥本 和正; 福永 拓郎; 永持 仁

  電子情報通信学会技術研究報告. COMP, コンピュテーション, 2009年04月10日

  
• Acute Constrains in Straight-Line Drawings of Planar Graphs (コンピュテーション)

  瀬戸 明嶺; シュルベフスキ アレクサンダル; 永持 仁

  電子情報通信学会技術研究報告 = IEICE technical report : 信学技報, 2017年05月12日

  
• λ Group Strategy Proof Mechanisms for the Obnoxious Facility Game in Star Networks (コンピュテーション)

  福井 悠平; シュルベフスキ アレクサンダル; 永持 仁

  電子情報通信学会技術研究報告 = IEICE technical report : 信学技報, 2017年05月12日

  
• COOMA: A Components Overlaid Mining Algorithm for Enumerating Connected Subgraphs with Common Itemsets

  Kazuya Haraguchi; Yusuke Momoi; Aleksandar Shurbevski; Hiroshi Nagamochi

  Technical Reports, Department of Applied Mathematics and Physics, Kyoto University, 2018年12月

  
• 動的計画法に基づく無ラベル根なし木の列挙アルゴリズム (コンピュテーション)

  増井 隆治; シュルベフスキ アレクサンダル; 永持 仁

  電子情報通信学会技術研究報告 = IEICE technical report : 信学技報, 2017年08月18日

  
• Enumerating Naphthalene Isomers of Tree-like Chemical Graphs.

  Fei He; Akiyoshi Hanai; 永持 仁; Tatsuya Akutsu

  BIOINFORMATICS, 2016年02月, 査読有り

  
• Parameterization of strategy-proof mechanisms in the obnoxious facility game

  Morito Oomine; Aleksandar Shurbevski; Hiroshi Nagamochi

  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2016年, 査読有り

  
• Testing Full Outer-2-planarity in Linear Time

  Seok-Hee Hong; Hiroshi Nagamochi

  GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE, 2016年, 査読有り

  
• A Polynomial-Space Exact Algorithm for TSP in Degree-6 Graphs

  永持 仁

  The 18th Japan Conference on Discrete and Computational Geometry and Graphs, 2015年09月, 査読有り

  
• 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, 2015年08月, 査読有り

  
• A Method for Generating Colorings over Graph Automorphism

  Fei He; 永持 仁

  he 12th International Symposium on Operations Research and its Applications in Engineering, Technology and Management, 2015年08月, 査読有り

  
• An Improved Algorithm for Parameterized Edge Dominating Set Problem.

  永持 仁

  WALCOM 2015:, 2015年, 査読有り

  
• サイクル上の忌避型施設配置ゲームにおける,3-候補地もしくは4-候補地の戦略耐性メカニズム (最適化の基礎理論と応用)

  井原 謙; 永持 仁

  数理解析研究所講究録, 2014年04月

  
• Approximating the Bipartite TSP and Its Biased Generalization

  Aleksandar Shurbevski; Hiroshi Nagamochi; Yoshiyuki Karuno

  ALGORITHMS AND COMPUTATION, WALCOM 2014, 2014年, 査読有り

  
• Complexity and Kernels for Bipartition into Degree-bounded Induced Graphs

  Mingyu Xiao; Hiroshi Nagamochi

  ALGORITHMS AND COMPUTATION, ISAAC 2014, 2014年, 査読有り

  
• Simpler Algorithms for Testing Two-Page Book Embedding of Partitioned Graphs

  Seok-Hee Hong; Hiroshi Nagamochi

  COMPUTING AND COMBINATORICS, COCOON 2014, 2014年, 査読有り

  
• Breadth-first Search Approach to Enumeration of Tree-like Chemical Compounds

  Yang Zhao; Morihiro Hayashida; Jira Jindalertudomdee; Hiroshi Nagamochi; Tatsuya Akutsu

  研究報告バイオ情報学（BIO）, 2013年12月04日

  
• Breadth-first Search Approach to Enumeration of Tree-like Chemical Compounds

  Yang Zhao; Morihiro Hayashida; Jira Jindalertudomdee; Hiroshi Nagamochi; Tatsuya Akutsu

  研究報告数理モデル化と問題解決（MPS）, 2013年12月04日

  
• Comparison and enumeration of chemical graphs

  Tatsuya Akutsu; Hiroshi Nagamochi

  Computational and Structural Biotechnology Journal, 2013年

  
• An exact algorithm for TSP in degree-3 graphs via circuit procedure and amortization on connectivity structure

  Mingyu Xiao; Hiroshi Nagamochi

  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2013年, 査読有り

  
• Exact Algorithms for Maximum Independent Set

  Mingyu Xiao; Hiroshi Nagamochi

  ALGORITHMS AND COMPUTATION, 2013年, 査読有り

  
• An improved exact algorithm for undirected feedback vertex set

  Mingyu Xiao; Hiroshi Nagamochi

  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2013年, 査読有り

  
• An exact algorithm for maximum independent set in degree-5 graphs

  Mingyu Xiao; Hiroshi Nagamochi

  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2013年, 査読有り

  
• CONSTANT FACTOR APPROXIMATION ALGORITHMS FOR REPETITIVE ROUTING PROBLEMS OF GRASP-AND-DELIVERY ROBOTS IN PRODUCTION OF PRINTED CIRCUIT BOARDS

  Karuno Yoshiyuki; Nagamochi Hiroshi; Shurbevski Aleksandar

  Journal of the Operations Research Society of Japan, 2012年09月01日

  
• 平面無向グラフで2番目に短い経路を求めるアルゴリズム

  張 聡; 永持 仁

  電子情報通信学会技術研究報告. COMP, コンピュテーション, 2012年06月14日

  
• Submodular minimization via pathwidth

  H. Nagamochi

  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2012年, 査読有り

  
• Linear Layouts in Submodular Systems

  Hiroshi Nagamochi

  ALGORITHMS AND COMPUTATION, ISAAC 2012, 2012年, 査読有り

  
• A refined exact algorithm for edge dominating set

  Mingyu Xiao; Hiroshi Nagamochi

  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2012年, 査読有り

  
• An improved exact algorithm for TSP in degree-4 graphs

  Mingyu Xiao; Hiroshi Nagamochi

  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2012年, 査読有り

  
• Characterizing mechanisms in obnoxious facility game

  Ken Ibara; Hiroshi Nagamochi

  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2012年, 査読有り

  
• The next-to-shortest path in undirected graphs with nonnegative weights

  C. Zhang; H. Nagamochi

  Conferences in Research and Practice in Information Technology Series, 2012年, 査読有り

  
• Enumerating tree-like chemical graphs with given upper and lower bounds on path frequencies

  Masaaki Shimizu; Hiroshi Nagamochi; Tatsuya Akutsu

  BMC BIOINFORMATICS, 2011年12月, 査読有り

  
• 1-D-1 Algorithms for Covering Digraphs by Length-Bounded Walks

  瀬島 賢治; 福永 拓郎; 永持 仁

  日本オペレーションズ・リサーチ学会秋季研究発表会アブストラクト集, 2011年09月13日

  
• Heuristics for a repetitive routing problem of a single grasp-and-delivery robot with an asymmetric edge cost function

  A.r Shurbevski; H. Nagamochi; Y. Karuno

  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月, 査読有り

  
• A practical speed-up technique for A* algorithms

  L. Zhao; P. Eumthurapojn; H. Nagamochi

  the 4th Annual Meeting of the Asian Association for Algorithms and Computation (AAAC 2011), in Hsinchu, Taiwan, 2011年04月, 査読有り

  
• Construction of visual classifier by edge crossing minimization (最適化モデルとアルゴリズムの新展開--RIMS研究集会報告集)

  原口 和也; Hong Seok-Hee; 永持 仁

  数理解析研究所講究録, 2011年02月

  
• Accelerating A^* algorithms by sweeping out small-degree nodes

  Liang Zhao; Pipaporn Eumthurapojn; Hiroshi Nagamochi

  研究報告アルゴリズム（AL）, 2011年02月

  
• 5B3 APPROXIMATING CYCLIC ROUTING PROBLEMS OF GRASP-AND-DELIVERY ROBOTS IN PRODUCTION OF PRINTED CIRCUIT BOARDS(Technical session 5B: Routing problems) :

  KARUNO Yoshiyuki; NAGAMOCHI Hiroshi; SHURBEVSKI Aleksandar

  Proceedings of International Symposium on Scheduling, 2011年

  
• Improved implementation of an approximation algorithm with factor two for a cyclic routing problem of grasp-and-delivery robots

  A. Shurbevski; Y. Karuno; H. Nagamochi

  Proceedings of International Symposium on Scheduling 2011 (ISS2011), JSME No. 11-205, pp. 235--240, 2011年, 査読有り

  
• Network transformation heuristics for multi-story storage rack problems

  Y. Karuno; H. Nagamochi

  Proceedings of International Symposium on Scheduling 2011 (ISS2011), JSME No. 11-205, pp. 161--164,, 2011年, 査読有り

  
• Parameterized Edge Dominating Set in Cubic Graphs

  Mingyu Xiao; Hiroshi Nagamochi

  FRONTIERS IN ALGORITHMICS AND ALGORITHMIC ASPECTS IN INFORMATION AND MANAGEMENT, (FAW-AAIM 2011), 2011年, 査読有り

  
• Further Improvement on Maximum Independent Set in Degree-4 Graphs

  Mingyu Xiao; Hiroshi Nagamochi

  COMBINATORIAL OPTIMIZATION AND APPLICATIONS, 2011年, 査読有り

  
• Improved Bounds for Minimum Fault-Tolerant Gossip Graphs

  Toru Hasunuma; Hiroshi Nagamochi

  GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE, 2011年, 査読有り

  
• Multiclass Visual Classifier Based on Bipartite Graph Representation of Decision Tables

  Kazuya Haraguchi; Seok-Hee Hong; Hiroshi Nagamochi

  LEARNING AND INTELLIGENT OPTIMIZATION, 2010年, 査読有り

  
• Approximation algorithms for a cyclic routing problem of grasp-and-delivery robots

  Y. Karuno; H. Nagamochi; A. Shurbevski

  SCIS and ISIS 2010 - Joint 5th International Conference on Soft Computing and Intelligent Systems and 11th International Symposium on Advanced Intelligent Systems, 2010年, 査読有り

  
• FPTAS's for Some Cut Problems in Weighted Trees

  Mingyu Xiao; Takuro Fukunaga; Hiroshi Nagamochi

  FRONTIERS IN ALGORITHMICS, 2010年, 査読有り

  
• Heuristics for scheduling problems on identical machines like storage allocation

  Yoshiyuki Karuno; Hiroshi Nagamochi; Akira Nakashima; Kougaku Yamashita

  IEEE International Conference on Industrial Informatics (INDIN), 2010年, 査読有り

  
• Optimization Problems and Algorithms in Double-layered Food Packing Systems

  Yoshiyuki Karuno; Hiroshi Nagamochi; Xiaoming Wang

  JOURNAL OF ADVANCED MECHANICAL DESIGN SYSTEMS AND MANUFACTURING, 2010年, 査読有り

  
• 4C1 SCHEDULING MULTIPROCESSOR TASKS WITH PROMPT SERVICE CONSTRAINTS ON ALIGNED IDENTICAL PROCESSORS

  Yoshiyuki Karuno; Kougaku Yamashita; Eishi Chiba; Hiroshi Nagamochi

  Proceedings of International Symposium on Scheduling, 2009年07月04日, 査読有り

  
• Classification by Ordering Data Samples (Acceleration and Visualization of Computation for Enumeration Problems)

  原口 和也; Hong Seok-Hee; 永持 仁

  数理解析研究所講究録, 2009年04月

  
• DS-1-5 An Efficient Algorithm for Large-scale Beacon Placement Problem

  金 在成; 佐々木 方太; 趙 亮; 永持 仁

  電子情報通信学会総合大会講演論文集, 2009年03月

  
• Upward Star-Shaped Polyhedral Graphs

  Seok-Hee Hong; Hiroshi Nagamochi

  ALGORITHMS AND COMPUTATION, PROCEEDINGS, 2009年, 査読有り

  
• Worst Case Analysis for Pickup and Delivery Problems with Consecutive Pickups and Deliveries

  Yoshitaka Nakao; Hiroshi Nagamochi

  ALGORITHMS AND COMPUTATION, PROCEEDINGS, 2009年, 査読有り

  
• Cop-Robber Guarding Game with Cycle Robber Region

  Hiroshi Nagamochi

  FRONTIERS IN ALGORITHMICS, PROCEEDINGS, 2009年, 査読有り

  
• Minmax Tree Cover in the Euclidean Space

  Seigo Karakawa; Ehab Morsy; Hiroshi Nagamochi

  WALCOM: ALGORITHMS AND COMPUTATION, PROCEEDINGS, 2009年, 査読有り

  
• Removing Node Overlaps Using Multi-sphere Scheme

  Takashi Imamichi; Yohei Arahori; Jaeseong Gim; Seok-Hee Hong; Hiroshi Nagamochi

  GRAPH DRAWING, 2009年, 査読有り

  
• Divide-and-Conquer Algorithms for Partitioning Hypergraphs and Submodular Systems

  Kazumasa Okumoto; Takuro Fukunaga; Hiroshi Nagamochi

  ALGORITHMS AND COMPUTATION, PROCEEDINGS, 2009年, 査読有り

  
• Visualization can improve multiple decision table classifiers

  K. Haraguchi; S.-H. Hong; Hiroshi Nagamochi

  The 6th International Conference on Modeling Decisions for Artificial Intelligence (MDAI 2009) pp. 41-52., 2009年, 査読有り

  
• Visualized Multiple Decision Table Classifiers without Discretization

  K. Haraguchi; S.-H. Hong; Hiroshi Nagamochi

  4th Korea-Japan Workshop on Operations Research in Service Science pp. 19-28., 2009年, 査読有り

  
• Efficient approximate algorithms for the beacon placement and its dual problem,

  J. Wang; J. Gim; M. Sasaki; L. Zhao; Hiroshi Nagamochi

  2009 Korea-Japan Joint Workshop on Algorithms and Computation, , pp. 101-108., 2009年, 査読有り

  
• Toward characterization of vertex-edge graphs of three-dimensional nonconvex polyhedra,

  S.-H. Hong; Hiroshi Nagamochi

  6th Japanese-Hungarian Symposium on Discrete Mathematics and Its Applications, 2009年, 査読有り

  
• One-dimensional cutting stock problem for a paper tube industry

  S. Umetani; K. Matsumoto; Hiroshi Nagamochi

  The 6th ESICUP Meeting, 2009年, 査読有り

  
• Efficient branch-and-bound algorithms for one-dimensional contiguous bin packing problem and two-dimensional strip packing problem,

  T. Imamichi; Y. Arahori; Hiroshi Nagamochi

  The 6th ESICUP Meeting, 2009年, 査読有り

  
• Efficient approximate algorithms for the beacon placement and its dual problem (abstract)

  Jiexun Wang; Jaeseong Gim; Masahiro Sasaki; Liang Zhao; Hiroshi Nagamochi

  Proceedings - 2009 International Conference on Computational Intelligence and Software Engineering, CiSE 2009, 2009年, 査読有り

  
• Enumerating Stereoisomers of Tree Structured Molecules Using Dynamic Programming

  Tomoki Imada; Shunsuke Ota; Hiroshi Nagamochi; Tatsuya Akutsu

  ALGORITHMS AND COMPUTATION, PROCEEDINGS, 2009年, 査読有り

  
• Bipartite Graph Representation of Multiple Decision Table Classifiers

  Kazuya Haraguchi; Seok-Hee Hong; Hiroshi Nagamochi

  STOCHASTIC ALGORITHMS: FOUNDATIONS AND APPLICATIONS, PROCEEDINGS, 2009年, 査読有り

  
• Star-shaped drawings of graphs with fixed embedding and concave corner constraints

  Seok-Hee Hong; Hiroshi Nagamochi

  COMPUTING AND COMBINATORICS, PROCEEDINGS, 2008年, 査読有り

  
• Approximating crossing minimization in radial layouts

  Seok-Hee Hong; Hiroshi Nagamochi

  LATIN 2008: THEORETICAL INFORMATICS, 2008年, 査読有り

  
• Efficient algorithms for combinatorial food packing problems

  Shinji IMAHORI; Yoshiyuki KARUNO; Hiroshi NAGAMOCHI; Xiaoming WANG

  Proc. of the 11th International Conference on Humans and Computers (HC'2008), pp. 317-322, 2008年, 査読有り

  
• Improved algorithm for enumerating tree-likee chemical graphs,

  Y. Ishida; L. Zhao; Hiroshi Nagamochi; T. Akutsu

  The 19th International Conference on Genome Informatics (GIW2008), 2008年, 査読有り

  
• A fast collision detection algorithm for a multi-sphere scheme

  T. Imamichi; Hiroshi Nagamochi

  The 11th Japan-Korea Joint Workshop on Algorithms and Computation (WAAC08), pp. 173-180., 2008年, 査読有り

  
• A* algorithm for the time-dependent shortest path problem

  L. Zhao; T. Ohshima; Hiroshi Nagamochi

  The 11th Japan-Korea Joint Workshop on Algorithms and Computation (WAAC08)pp. 36-43., 2008年, 査読有り

  
• Approximating the generalized capacitated tree-routing problem

  Ehab Morsy; Hiroshi Nagamochi

  COMPUTING AND COMBINATORICS, PROCEEDINGS, 2008年, 査読有り

  
• Visual analysis of hierarchical data using 2.5D drawing with minimum occlusion

  K. Haraguchi; Seok-Hee Hong; Hiroshi Nagamochi

  the poster session of 2008 IEEE Pacific Visualization Symposium (PacificVis 2008), 2008年, 査読有り

  
• Overlap removal in label layouts by a multi-sphere scheme,

  Jaeseong Gim; Yohei Arahori; Takashi Imamichi; Seok-Hee Hong; Hiroshi Nagamochi

  the poster session of 2008 IEEE Pacific Visualization Symposium (PacificVis 2008), 2008年, 査読有り

  
• Designing algorithms with multi-sphere scheme

  Takashi Imamichi; Hiroshi Nagamochi

  INTERNATIONAL CONFERENCE ON INFORMATICS EDUCATION AND RESEARCH FOR KNOWLEDGE-CIRCULATING SOCIETY, PROCEEDINGS, 2008年, 査読有り

  
• Security-Aware Beacon Based Network Monitoring

  Masahiro Sasaki; Liang Zhao; Hiroshi Nagamochi

  2008 11TH IEEE SINGAPORE INTERNATIONAL CONFERENCE ON COMMUNICATION SYSTEMS (ICCS), VOLS 1-3, 2008年, 査読有り

  
• Robust Cost Colorings

  Takuro Fukunaga; Magnus M. Halldorsson; Hiroshi Nagamochi

  PROCEEDINGS OF THE NINETEENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2008年, 査読有り

  
• P2Pシステムのための深さ最小木の構築について (メディア工学)

  三輪 直樹; 趙 亮; 永持 仁

  映像情報メディア学会技術報告, 2007年09月

  
• "Rent-or-Buy" scheduling and cost coloring problems

  Takuro Fukunaga; Magnus M. Halldorsson; Hiroshi Nagamochi

  FSTTCS 2007: FOUNDATIONS OF SOFTWARE TECHNOLOGY AND THEORETICAL COMPUTER SCIENCE, PROCEEDINGS, 2007年, 査読有り

  
• Minimum degree orderings

  Hiroshi Nagamochi

  ALGORITHMS AND COMPUTATION, 2007年, 査読有り

  
• Star-shaped drawings of planar graphs

  S.-H. Hong; Hiroshi Nagamochi

  18th International Workshop on Combinatorial Algorithms,, 2007年, 査読有り

  
• A path relinking approach for the multi-resource generalized quadratic assignment problem

  Mutsunori Yagiura; Akira Komiya; Kenya Kojima; Koji Nonobe; Hiroshi Nagamochi; Toshihide Ibaraki; Fred Glover

  ENGINEERING STOCHASTIC LOCAL SEARCH ALGORITHMS: DESIGNING, IMPLEMENTING AND ANALYZING EFFECTIVE HEURISTICS, 2007年, 査読有り

  
• A multi-sphere scheme for 2D and 3D packing problems

  Takashi Imamichi; Hiroshi Nagamochi

  ENGINEERING STOCHASTIC LOCAL SEARCH ALGORITHMS: DESIGNING, IMPLEMENTING AND ANALYZING EFFECTIVE HEURISTICS, 2007年, 査読有り

  
• Enumerating tree-like chemical structures from feature vector

  H. Fujiwara; L. Zhao; Hiroshi Nagamochi; T. Akutsu; W. Jiexun

  2007 Korea-Japan Joint Workshop on Algorithms and Computation, pp. 48-55, 2007年, 査読有り

  
• An Iterated Local Search Algorithm in a Multi-sphere Scheme for 2D and 3D Packing Problems,

  T. Imamichi; Hiroshi Nagamochi

  2007 Korea-Japan Joint Workshop on Algorithms and Computation, pp. 72-79., 2007年, 査読有り

  
• Fully convex drawings of clustered planar graphs

  S.-H. Hong; Hiroshi Nagamochi

  2007 Korea-Japan Joint Workshop on Algorithms and Computation, pp. 32-39., 2007年, 査読有り

  
• Packing sets of circles with shape-memory,

  T. Imamichi; Hiroshi Nagamochi

  INFORMS International Puerto Rico 2007, 2007年, 査読有り

  
• The set connector problems in graphs

  T. Fukunaga; Hiroshi Nagamochi

  The Twelfth Conference on Integer Programming and Combinatorial Optimization, IPCO 2007,, 2007年, 査読有り

  
• A linear time algorithm for symmetric convex drawings of triconnected planar graphs,

  S.-H. Hong; Hiroshi Nagamochi

  The Kyoto International Conference on Computational Geometry and Graph Theory (KyotoCGGT2007), 2007年, 査読有り

  
• An efficient enumeration of colored outerplanar graphs

  J. Wang; L. Zhao; Hiroshi Nagamochi; T. Akutsu

  The 4th Annual Conference on Theory and Applications of Models of Computation(TAMC07), 2007年, 査読有り

  
• Approximating capacitated tree-routings in networks

  Ehab Morsy; Hiroshi Nagamochi

  THEORY AND APPLICATIONS OF MODELS OF COMPUTATION, PROCEEDINGS, 2007年, 査読有り

  
• Approximating minimum k-partitions in submodular systems

  Hiroshi Nagamochi

  ICKS 2007: Second International Conference on Informatics Research for Development of Knowledge Society Infrastructure, Proceedings, 2007年, 査読有り

  
• Extension of ICF classifiers to real world data sets

  Kazuya Haraguchi; Hiroshi Nagamochi

  NEW TRENDS IN APPLIED ARTIFICIAL INTELLIGENCE, PROCEEDINGS, 2007年, 査読有り

  
• Heuristics for a scheduling problem of minimizing the number of one-way vehicles on paths with deadlines

  Jun Uchida; Yoshiyuki Karuno; Hiroshi Nagamochi

  PROCEEDINGS OF SICE ANNUAL CONFERENCE, VOLS 1-8, 2007年, 査読有り

  
• Linear-tree rule structure for firewall optimization

  Liang Zhao; Akira Shimae; Hiroshi Nagamochi

  PROCEEDINGS OF THE SIXTH IASTED INTERNATIONAL CONFERENCE ON COMMUNICATIONS, INTERNET, AND INFORMATION TECHNOLOGY, 2007年, 査読有り

  
• Orthogonal drawings for plane graphs with specified face areas

  Akifumi Kawaguchi; Hiroshi Nagamochi

  THEORY AND APPLICATIONS OF MODELS OF COMPUTATION, PROCEEDINGS, 2007年, 査読有り

  
• A novel clustering method for analysis of biological networks using maximal components of graphs

  Morihiro Hayashida; Tatsuya Akutsu; Hiroshi Nagamochi

  PROCEEDINGS OF THE 5TH ASIA- PACIFIC BIOINFOMATICS CONFERENCE 2007, 2007年, 査読有り

  
• グラフの極大成分を用いた生物ネットワークの解析

  林田 守広; 阿久津 達也; 永持仁

  情報処理学会研究報告バイオ情報学（BIO）, 2006年09月15日

  
• 1A2 AN IMPROVED APPROXIMATION ALGORITHM FOR CAPACITATED MULTICAST ROUTINGS IN NETWORKS(Technical session 1A: Combinatorial optimization)

  Morsy Ehab; Nagamochi Hiroshi

  Proceedings of International Symposium on Scheduling, 2006年07月18日, 査読有り

  
• 2B1 A DP-BASED HEURISTIC ALGORITHM FOR THE DISCRETE SPLIT DELIVERY VEHICLE ROUTING PROBLEM(Technical session 2B: Vehicle scheduling and communication)

  Nakao Yoshitaka; Nagamochi Hiroshi

  Proceedings of International Symposium on Scheduling, 2006年07月18日, 査読有り

  
• 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)

  Ibaraki Toshihide; Ishikawa Akihiro; Nagamochi Hiroshi; Nonobe Koji; Yagiura Mutsunori

  Proceedings of International Symposium on Scheduling, 2006年07月18日, 査読有り

  
• 5B2 AN ITERATED LOCAL SEARCH ALGORITHM BASED ON NONLINEAR PROGRAMMING FOR THE IRREGULAR STRIP PACKING PROBLEM(Technical session 5B: Packing problem)

  Imamichi Takashi; Nagamochi Hiroshi; Yagiura Mutsunori

  Proceedings of International Symposium on Scheduling, 2006年07月18日, 査読有り

  
• Some theorems on detachments preserving local-edge-connectivity

  T. Fukunaga; Hiroshi Nagamochi

  Fifth CRACOW Conference on Graph Theory (USTRON '06), CCGT, 2006年, 査読有り

  
• A detachment algorithm for inferring a graph from path frequency

  Hiroshi Nagamochi

  COMPUTING AND COMBINATORICS, PROCEEDINGS, 2006年, 査読有り

  
• Network design with edge-connectivity and degree constraints

  Takuro Fukunaga; Hiroshi Nagamochi

  APPROXIMATION AND ONLINE ALGORITHMS, 2006年, 査読有り

  
• Efficient branch-and-bound algorithms for weighted MAX-2-SAT

  M. Yagiura; Toshihide Ibaraki; T. Imamichi; Y. Koga; Hiroshi Nagamochi; K. Nonobe

  The 21st European Conference on Operational Research (EURO XXI), 2006年, 査読有り

  
• An iterated local search algorithm based on nonlinear programming for the irregular strip packing problem

  T. Imamichi; M. Yagiura; Hiroshi Nagamochi

  The 19th conference of the European Chapter on Combinatorial Optimization (ECCO XIX) and the International Symposium on Combinatorial Optimisation 2006 (CO 2006), 2006年, 査読有り

  
• Contention-free λ-planes in optically burst-switched WDM networks

  Kouji Hirata; Takahiro Matsuda; Hiroshi Nagamochi; Tetsuya Takine

  GLOBECOM - IEEE Global Telecommunications Conference, 2006年, 査読有り

  
• Minimum transversals in posi-modular systems

  M. Sakashita; K. Makino; Hiroshi Nagamochi; S. Fujishige

  ESA 2006, 14th Annual European Symposium on Algorithms, 2006年, 査読有り

  
• Convex drawings of hierarchical plane graphs

  S.-H. Hong; Hiroshi Nagamochi

  17th Australasian Workshop on Combinatorial Algorithms (AWOCA 2006), 2006年, 査読有り

  
• Approximating minimum cost multigraphs of specified edge-connectivity under degree bounds,

  T. Fukunaga; H. Nagamochi

  Proceedings of the 9th Japan-Korea Joint Workshop on Algorithm and Computation (WAAC06),, pp. 25-32., 2006年, 査読有り

  
• Convex drawings with non-convex boundary,

  S.-H. Hong; Hiroshi Nagamochi

  32nd International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2006), 2006年, 査読有り

  
• Contention-free λ-planes in optically burst-switched WDM networks

  Kouji Hirata; Takahiro Matsuda; Hiroshi Nagamochi; Tetsuya Takine

  GLOBECOM - IEEE Global Telecommunications Conference, 2006年, 査読有り

  
• Efficient branch-and-bound algorithms for weighted MAX-2-SAT

  Y. Koga; M. Yagiura; K. Nonobe; T. Imamichi; Hiroshi Nagamochi; Toshihide Ibaraki

  Third International Conference on Innovative Applications of Information Technology for the Developing World(Asian Applied Computing Conference (AACC 2005)), 2005年, 査読有り

  
• Experimental studies on representation complexity and error rates of iteratively composed features,

  K. Haraguchi; Hiroshi Nagamochi; Toshihide Ibaraki

  Third International Conference on Innovative Applications of Information Technology for the Developing World (Asian Applied Computing Conference (AACC 2005)), 2005年, 査読有り

  
• Minimizing capacitated tree covers of graphs

  Y. Karuno; Hiroshi Nagamochi

  Third International Conference on Innovative Applications of Information Technology for the Developing World(Asian Applied Computing Conference (AACC 2005), 2005年, 査読有り

  
• Heuristics for the Minmax Subtree Cover in Graphs

  Hiroshi Nagamochi

  The IFORS Triennial 2005 Conference,, 2005年, 査読有り

  
• The relation between option pricing and optimization problems

  M. Nishihara; M. Yagiura; Toshihide Ibaraki; Hiroshi Nagamochi

  The IFORS Triennial 2005 Conference,, 2005年, 査読有り

  
• Exact algorithms for the 2-dimensional strip packing problem with rotations,

  M. Kenmochi; T. Imamichi; K. Nonobe; M. Yagiura; Hiroshi Nagamochi

  The IFORS Triennial 2005 Conference, 2005年, 査読有り

  
• Branch-and-bound algorithms for rectangular strip packing and perfect packing problems,

  T. Imamichi; M. Kenmochi; K. Nonobe; M. Yagiura; Hiroshi Nagamochi

  ESICUP (EURO Special Interest Group on Cutting and Packing) 2nd Meeting,, 2005年, 査読有り

  
• A deterministic algorithm for finding all minimum k-way cuts,

  Y. Kamidoi; N. Yoshida; Hiroshi Nagamochi

  4th Japanese-Hungarian Symposium on Discrete Mathematics and Its Applications,pp. 224-233.,, 2005年, 査読有り

  
• Edge packing problem with edge capacity constraints

  T. Fukunaga; Hiroshi Nagamochi

  4th Janese-Hungarian Symposium on Discrete Mathematics and Its Applications,pp. 69-75. ,, 2005年, 査読有り

  
• Compactness of classifiers by iterative compositions of features

  K. Haraguchi; Hiroshi Nagamochi; Toshihide Ibaraki

  4th Japanese-Hungarian Symposium on Discrete Mathematics and Its Applications,pp. 92-98., 2005年, 査読有り

  
• Bisecting a four-connected graph with three resource sets

  T Ishii; K Iwata; H Nagamochi

  ALGORITHMS AND COMPUTATION, 2005年, 査読有り

  
• Minimum cost source location problem with local 3-vertex-connectivity requirements,

  T. Ishii; H. Fujita; Hiroshi Nagamochi

  Computing: The Australasian Theory Symposium (CATS) Australasian Computer Science Week, pp.97-105., 2005年, 査読有り

  
• Bisecting a four-connected graph with three resource sets

  T Ishii; K Iwata; H Nagamochi

  ALGORITHMS AND COMPUTATION, 2005年, 査読有り

  
• Approximation algorithms for the b-edge dominating set problem and its related problems

  T Fukunaga; H Nagamochi

  COMPUTING AND COMBINATORICS, PROCEEDINGS, 2005年, 査読有り

  
• Approximating the minmax subtree cover problem in a cactus

  H Nagamochi; T Kawada

  ALGORITHMS AND COMPUTATION, 2004年, 査読有り

  
• Minimum augmentation of edge-connectivity between vertices and sets of vertices in undirected graphs

  Toshimasa Ishii; Yoko Akiyama; Hiroshi Nagamochi

  Electronic Notes in Theoretical Computer Science, 2003年04月, 査読有り

  
• Convex drawing for c-planar biconnected clustered graphs

  Hiroshi Nagamochi; K. Kuroya

  The 11th International Symposium on Graph Drawing (GD2003), 2003年, 査読有り

  
• An improved approximation to the one-sided bilayer drawing

  Hiroshi Nagamochi

  The 11th International Symposium on Graph Drawing (GD2003), 2003年, 査読有り

  
• Fast algorithms for counting bilayer crossings

  Hiroshi Nagamochi; N. Yamada

  7th Japan-Korea Joint Workshop on Algorithms and Computation, pp.203-209., 2003年, 査読有り

  
• Source location problem with local 3-vertex-connectivity requirements, "jointly worked "

  永持 仁

  the 3rd Hungarian-Japanese Symposium on Discrete Mathematics and Its Applications,/ , 368-377, 2003年, 査読有り

  
• Computing extreme sets in graphs and its applications

  永持 仁

  the 3rd Hungarian-Japanese Symposium on Discrete Mathematics and Its Applications,/ , 349-357, 2003年, 査読有り

  
• Can a hypergraph cover every convex polygon?, "jointly worked "

  永持 仁

  the 3rd Hungarian-Japanese Symposium on Discrete Mathematics and Its Applications,/ , 293-302, 2003年, 査読有り

  
• A simple recognition of maximal planar graphs, "jointly worked "

  永持 仁

  Proceedings of the 7th Japan-Korea Joint Workshop on Algorithms and Computation,/ , 182-188, 2003年, 査読有り

  
• A simple and robust algorithm for bisecting a triconnected graph with two resource sets, "jointly worked "

  永持 仁

  Proceedings of the 7th Japan-Korea Joint Workshop on Algorithms and Computation,/ , 210-222, 2003年, 査読有り

  
• Augmenting forests to meet odd diameter requirements

  T Ishii; S Yamamoto; H Nagamochi

  ALGORITHMS AND COMPUTATION, PROCEEDINGS, 2003年, 査読有り

  
• A better approximation for the two-machine flowshop scheduling problem with time lags

  Y Karuno; H Nagamochi

  ALGORITHMS AND COMPUTATION, PROCEEDINGS, 2003年, 査読有り

  
• An approximation algorithm for dissecting a rectangle into rectangles with specified areas

  H Nagamochi; Y Abe

  ALGORITHMS AND COMPUTATION, PROCEEDINGS, 2003年, 査読有り

  
• Polynomial time 2-approximation algorithms for the minmax subtree cover problem

  H Nagamochi; K Okada

  ALGORITHMS AND COMPUTATION, PROCEEDINGS, 2003年, 査読有り

  
• Comparing hypergraphs by areas of hyperedges drawn on a convex polygon

  H Ito; H Nagamochi

  DISCRETE AND COMPUTATIONAL GEOMETRY, 2002年, 査読有り

  
• File transfer tree problems

  H Ito; H Nagamochi; Y Sugiyama; M Fujita

  ALGORITHMS AND COMPUTATION, PROCEEDINGS, 2002年, 査読有り

  
• Greedy Splitting: A Unified Approach for Approximating Some Partition Problems (数理最適化の理論とアルゴリズム)

  趙 亮; 永持 仁; 茨木 俊秀

  数理解析研究所講究録, 2001年12月

  
• ディジタルハーフトーニング : ネットワークフローアルゴリズムによる最適化

  浅野 哲夫; 加藤 直樹; 松井 知己; 永持 仁; 小保方 幸次; 徳山 豪

  電子情報通信学会技術研究報告. COMP, コンピュテーション, 2001年06月18日

  
• A Primal-Dual Approximation Algorithm for the Survivable Network Design Problem in Hypergraphs (New Developments of Theory of Computation and Algorithms)

  趙 亮; 永持 仁; 茨木 俊秀

  数理解析研究所講究録, 2001年05月

  
• Digital Halftoning : Formulation as a Combinatorial Optimization Problem and Approximation Algorithms Based on Network Flow (Algorithm Engineering as a New Paradigm)

  浅野 哲夫; 藤川 直樹; 加藤 直樹; 松井 知己; 永持 仁; 徳山 豪; 臼井 信昭

  数理解析研究所講究録, 2001年01月

  
• A 2-approximation algorithm for the multi-vehicle scheduling on a path with release and handling times

  Y. Karuno; Hiroshi Nagamochi

  9th Annual European Symposium on Algorithms, BRICS, pp. 218-229., 2001年, 査読有り

  
• A primal-dual approximation algorithm for the survival network design problem in hypergraphs

  Liang Zhao; Hiroshi Nagamochi; T. Ibaraki

  18th International Symposium on Theoretical Aspects of Computer Science (STACS2001),pp. 478--489, 2001年, 査読有り

  
• A unified framework for approximating multiway partition problemsExtended Abstract

  Liang Zhao; Hiroshi Nagamochi; Toshihide Ibaraki

  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2001年, 査読有り

  
• On the minimum local-vertex-connectivity augmentation in graphs

  H Nagamochi; T Ishii

  ALGORITHMS AND COMPUTATION, PROCEEDINGS, 2001年, 査読有り

  
• A polynomial time approximation scheme for the multi-vehicle scheduling problem on a path with release and handling times

  Y Karuno; H Nagamochi

  ALGORITHMS AND COMPUTATION, PROCEEDINGS, 2001年, 査読有り

  
• Augmenting a Submodular and Posi-modular Set Function by a Multigraph

  Hiroshi Nagamochi; Takashi Shiraki; Toshihide Ibaraki

  Journal of Combinatorial Optimization, 2001年, 査読有り

  
• 辺支配集合問題の2倍近似アルゴリズム

  藤戸 敏弘; 永持 仁

  電子情報通信学会技術研究報告. COMP, コンピュテーション, 2000年03月22日

  
• Simultaneous augmentation of two graphs to an l-edge-connected graph and a biconnected graph

  T. Ishii; Hiroshi Nagamochi

  11th Annual International Symposium on Algorithms and Computation, ISAAC'00, pp. 326-337., 2000年, 査読有り

  
• On the minimum augmentation of an l-connected graph to a k-connected graph

  Toshimasa Ishii; Hiroshi Nagamochi

  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2000年, 査読有り

  
• Bisecting two subsets in 3-connected graphs

  Hiroshi Nagamochi; Tibor Jordan; Yoshitaka Nakao; Toshihide Ibaraki

  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 1999年, 査読有り

  
• Approximating the minimum k-way cut in a graph via minimum 3-way cuts

  Liang Zhao; Hiroshi Nagamochi; Toshihide Ibaraki

  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 1999年, 査読有り

  
• An approximation for finding a smallest 2-edge-connected subgraph containing a specified spanning tree

  Hiroshi Nagamochi; Toshihide Ibaraki

  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 1999年, 査読有り

  
• Augmenting a submodular and posi-modular set function by a multigraph

  Hiroshi Nagamochi; Takashi Shiraki; T. Ibaraki

  The 1st Japanese-Hungarian Symposium on Discrete Mathematics and its Applications, 1999年, 査読有り

  
• A faster algorithm for computing minimum 5-way and 6-way cuts in graphs

  Hiroshi Nagamochi; Shigeki Katayama; Toshihide Ibaraki

  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 1999年, 査読有り

  
• A fast algorithm for computing minimum 3-way and 4-way cuts

  H Nagamochi; T Ibaraki

  INTEGER PROGRAMMING AND COMBINATORIAL OPTIMIZATION, 1999年, 査読有り

  
• Optimal augmentation of a biconnected graph to a k-edge-connected and triconnected graph, "jointly worked "

  永持 仁

  Proceedings 9th Annual ACM-SIAM Symposium on Discrete Algorithms,/ , 280-289, 1998年, 査読有り

  
• 格子型光波網におけるパス割り当て問題に関する考察

  三木 茂生; 中平 佳裕; 永持 仁; 砂原 秀樹; 尾家 祐二

  電気学会研究会資料. CMN, 通信研究会, 1997年02月21日

  
• Computing edge-connectivity augmentation function in (O)over-tilde-(nm) time

  H Nagamochi; T Shiraki; T Ibaraki

  PROCEEDINGS OF THE EIGHTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 1997年, 査読有り

  
• Combinatorial optimization games

  Xiaotie Deng; Toshihide Ibaraki; Hiroshi Nagamochi

  Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, 1997年, 査読有り

  
• Deterministic qq(nm) time edge-splitting in undirected graphs

  Hiroshi Nagamochi; Toshihide Ibaraki

  Conference Proceedings of the Annual ACM Symposium on Theory of Computing, 1996年, 査読有り

  
• 光波ネットワークのノート"再配置アルコ"リズムについて

  嘉藤 学; 河北 隆二; 永持 仁; 尾家 祐二

  電子情報通信学会技術研究報告, 1995年12月

  
• アルゴリズム辞典（共著）

  永持 仁

  共立出版,, 1995年, 査読有り

  
• Complexity of the single vehicle scheduling problem on graphs, "jointly worked "

  永持 仁

  Proceedings of the International Workshop Intelligent Scheduling of Robots and Flexible Manufacturing Systems,/ , 89-104, 1995年, 査読有り

  
• Complexity of Single Vehicle Scheduling Problem on Graphs

  NAGAMOCHI H.

  Technical Report of IEICE, 1994年

  
• An Efficient Algorithm for the Multicommodity Flow Problem with Many Commodities

  NAGAMOCHI H.

  Technical Report, 1989年