Researchers Information System

日本語に切り替えるswitch to english

Nagamochi, Hiroshi

Graduate School of Informatics, Department of Applied Mathematics and Physics Professor

Nagamochi, Hiroshi
list
    Last Updated :2022/05/14

    Basic Information

    Faculty

    • 工学部 工学部 情報学科

    Email Address

    • Email Address

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

    Professional Memberships

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

    Academic Degree

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

    Academic Resume (Graduate Schools)

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

    Academic Resume (Undergraduate School/Majors)

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

    Profile

    • Profile

      He received the D.E. degrees from Kyoto University in 1988. He became a Professor in the Department of Applied Mathematics and Physics, Graduate School of Informatics, Kyoto University in 2004 after serving for Toyohashi University of Technology. His research interests include Discrete Optimization, Packing Problem, Graph Algorithms, Scheduling, Packing Problem Chemical Graphs, etc. He is a member of the Operation Research Society of Japan, Institute of Electronics, Information and Communication Engineers and Information Processing Society of Japan. He wrote over 150 journal papers and two books, Algorithmic Aspects of Graph Connectivities
      (Cambridge University Press, 2008), and Graph Theory: Connectivity Structure and Its Applications (in Japanese) (Asakura Shoten, 2010).

    Language of Instruction

    • English

    ID,URL

    researchmap URL

    list
      Last Updated :2022/05/14

      Research

      Research Topics, Overview of the research

      • Research Topics

        Study on graph structure with respect to connectivity and planarity in graph theory. Design of efficient algorithms for discrete optimization such as scheduling problem, location problem and routing problem in graph, network structure. Development of a system of designing a chemical graph that has a desired chemical property by solving the inverse problem of QSPR with a machine learning.
      • Overview of the research

        graph theory, graph connectivity, graph planarity, discrete optimization, polynomial-time algorithm, NP-completeness, approximation algorithm, exponential-time exact algorithm

      Research Interests

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

      Research Areas

      • Informatics, Information theory

      Papers

      • 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, Dec. 2021
      • 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, 11 Mar. 2021
      • 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, 13 Nov. 2020
      • 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, 22 Aug. 2020
      • A method for enumerating pairwise compatibility graphs with a given number of vertices
        Naveed Ahmed Azam; Aleksandar Shurbevski; Hiroshi Nagamochi
        Discrete Applied Mathematics, Aug. 2020
      • 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, 19 Jan. 2020, Peer-reviewed
      • 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, Peer-reviewed
      • 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, Peer-reviewed
      • 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, Peer-reviewed
      • 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, Peer-reviewed
      • 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, Peer-reviewed
      • 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, Peer-reviewed
      • A linear-time algorithm for testing full outer-2-planarity
        Seok-Hee Hong; Hiroshi Nagamochi
        Discrete Applied Mathematics, 2019, Peer-reviewed
      • 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, Peer-reviewed
      • Enumerating Substituted Benzene Isomers of Tree-Like Chemical Graphs
        Jinghui Li; Hiroshi Nagamochi; Tatsuya Akutsu
        IEEE/ACM Transactions on Computational Biology and Bioinformatics, 01 Mar. 2018, Peer-reviewed
      • Polynomial-space exact algorithms for the bipartite traveling salesman problem
        Mohd Shahrizan Othman; Aleksandar Shurbevski; Hiroshi Nagamochi
        IEICE Transactions on Information and Systems, 01 Mar. 2018, Peer-reviewed
      • Enumerating chemical mono-block 3-augmented trees with two junctions
        Yuui Tamura; Hiroshi Nagamochi; Aleksandar Shurbevski; Tatsuya Akutsu
        ACM International Conference Proceeding Series, 18 Jan. 2018, Peer-reviewed
      • Simpler algorithms for testing two-page book embedding of partitioned graphs.
        Seok-Hee Hong; Hiroshi Nagamochi
        Theor. Comput. Sci., 2018, Peer-reviewed
      • A refined algorithm for maximum independent set in degree-4 graphs
        Mingyu Xiao; Hiroshi Nagamochi
        JOURNAL OF COMBINATORIAL OPTIMIZATION, Oct. 2017, Peer-reviewed
      • 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, 01 Aug. 2017, Peer-reviewed
      • An improved-time polynomial-space exact algorithm for TSP in degree-5 graphs
        Norhazwani Md Yunos; Aleksandar Shurbevski; Hiroshi Nagamochi
        Journal of Information Processing, 01 Aug. 2017, Peer-reviewed
      • Exact algorithms for maximum independent set
        Mingyu Xiao; Hiroshi Nagamochi
        INFORMATION AND COMPUTATION, Aug. 2017, Peer-reviewed
      • An Exact Algorithm for Lowest Edge Dominating Set
        Ken Iwaide; Hiroshi Nagamochi
        IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, Mar. 2017, Peer-reviewed
      • Complexity and kernels for bipartition into degree-bounded induced graphs
        Mingyu Xiao; Hiroshi Nagamochi
        THEORETICAL COMPUTER SCIENCE, Jan. 2017, Peer-reviewed
      • Parameterization of strategy-proof mechanisms in the obnoxious facility game
        Morito Oomine; Aleksandar Shurbevski; Hiroshi Nagamochi
        Journal of Graph Algorithms and Applications, 2017, Peer-reviewed
      • A linear-time algorithm for integral multiterminal flows in trees
        Mingyu Xiao; Hiroshi Nagamochi
        Leibniz International Proceedings in Informatics, LIPIcs, 01 Dec. 2016, Peer-reviewed
      • Characterizing Output Locations of GSP Mechanisms to Obnoxious Facility Game in Trees
        Morito Oomine; Hiroshi Nagamochi
        IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, Mar. 2016, Peer-reviewed
      • Characterizing Output Locations of GSP Mechanisms to Obnoxious Facility Game in Trees
        Morito Oomine; Hiroshi Nagamochi
        IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, Mar. 2016, Peer-reviewed
      • An Improved Exact Algorithm for TSP in Graphs of Maximum Degree 4
        Mingyu Xiao; Hiroshi Nagamochi
        THEORY OF COMPUTING SYSTEMS, Feb. 2016, Peer-reviewed
      • An Exact Algorithm for TSP in Degree-3 Graphs Via Circuit Procedure and Amortization on Connectivity Structure
        Mingyu Xiao; Hiroshi Nagamochi
        ALGORITHMICA, Feb. 2016, Peer-reviewed
      • 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, Peer-reviewed
      • Testing Full Outer-2-planarity in Linear Time
        Seok-Hee Hong; Hiroshi Nagamochi
        GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE, 2016, Peer-reviewed
      • 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, Peer-reviewed
      • 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, Peer-reviewed
      • 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, Peer-reviewed
      • An exact algorithm for maximum independent set in degree-5 graphs
        Mingyu Xiao; Hiroshi Nagamochi
        DISCRETE APPLIED MATHEMATICS, Jan. 2016, Peer-reviewed
      • An improved algorithm for parameterized edge dominating set problem
        Ken Iwaide; Hiroshi Nagamochi
        Journal of Graph Algorithms and Applications, 2016, Peer-reviewed
      • An improved exact algorithm for undirected feedback vertex set
        Mingyu Xiao; Hiroshi Nagamochi
        JOURNAL OF COMBINATORIAL OPTIMIZATION, Aug. 2015, Peer-reviewed
      • Exact algorithms for dominating induced matching based on graph partition
        Mingyu Xiao; Hiroshi Nagamochi
        DISCRETE APPLIED MATHEMATICS, Aug. 2015, Peer-reviewed
      • Some Reduction Procedure for Computing Pathwidth of Undirected Graphs
        Masataka Ikeda; Hiroshi Nagamochi
        IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, Mar. 2015, Peer-reviewed
      • A refined exact algorithm for Edge Dominating Set
        Mingyu Xiao; Hiroshi Nagamochi
        THEORETICAL COMPUTER SCIENCE, Dec. 2014, Peer-reviewed
      • Efficient enumeration of monocyclic chemical graphs with given path frequencies
        Masaki Suzuki; Hiroshi Nagamochi; Tatsuya Akutsu
        JOURNAL OF CHEMINFORMATICS, May 2014, Peer-reviewed
      • Optimization Techniques for Robot Path Planning
        Aleksandar Shurbevski; Noriaki Hirosue; Hiroshi Nagamochi
        ICT INNOVATIONS 2013: ICT INNOVATIONS AND EDUCATION, 2014, Peer-reviewed
      • Exact Algorithms for Dominating Induced Matching Based on Graph Partition.
        Mingyu Xiao; Hiroshi Nagamochi
        CoRR, 2014, Peer-reviewed
      • Unranking of small combinations from large sets
        Toshihiro Shimizu; Takuro Fukunagaa; Hiroshi Nagamochi
        Journal of Discrete Algorithms, 2014, Peer-reviewed
      • 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, Dec. 2013, Peer-reviewed
      • Parameterized edge dominating set in graphs with degree bounded by 3
        Mingyu Xiao; Hiroshi Nagamochi
        THEORETICAL COMPUTER SCIENCE, Oct. 2013, Peer-reviewed
      • Exact Algorithms for Annotated Edge Dominating Set in Graphs with Degree Bounded by 3
        Mingyu Xiao; Hiroshi Nagamochi
        IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, Mar. 2013, Peer-reviewed
      • Better approximation algorithms for grasp-and-delivery robot routing problems
        Aleksandar Shurbevski; Hiroshi Nagamochi; Yoshiyuki Karuno
        IEICE Transactions on Information and Systems, 2013, Peer-reviewed
      • FPTASs for trimming weighted trees
        Mingyu Xiao; Takuro Fukunaga; Hiroshi Nagamochi
        THEORETICAL COMPUTER SCIENCE, Jan. 2013, Peer-reviewed
      • Confining sets and avoiding bottleneck cases: A simple maximum independent set algorithm in degree-3 graphs
        Mingyu Xiao; Hiroshi Nagamochi
        THEORETICAL COMPUTER SCIENCE, Jan. 2013, Peer-reviewed
      • An exact strip packing algorithm based on canonical forms
        Yohei Arahori; Takashi Imamichi; Hiroshi Nagamochi
        COMPUTERS & OPERATIONS RESEARCH, Dec. 2012, Peer-reviewed
      • 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, Sep. 2012, Peer-reviewed
      • Minimum cost star-shaped drawings of plane graphs with a fixed embedding and concave corner constraints
        Seok-Hee Hong; Hiroshi Nagamochi
        THEORETICAL COMPUTER SCIENCE, Aug. 2012, Peer-reviewed
      • A Linear-Time Algorithm for Star-Shaped Drawings of Planar Graphs with the Minimum Number of Concave Corners
        Seok-Hee Hong; Hiroshi Nagamochi
        ALGORITHMICA, Apr. 2012, Peer-reviewed
      • Divide-and-Conquer Algorithms for Partitioning Hypergraphs and Submodular Systems
        Kazumasa Okumoto; Takuro Fukunaga; Hiroshi Nagamochi
        ALGORITHMICA, Apr. 2012, Peer-reviewed
      • A Linear-Time Algorithm for Star-Shaped Drawings of Planar Graphs with the Minimum Number of Concave Corners
        Seok-Hee Hong; Hiroshi Nagamochi
        ALGORITHMICA, Apr. 2012, Peer-reviewed
      • Divide-and-Conquer Algorithms for Partitioning Hypergraphs and Submodular Systems
        Kazumasa Okumoto; Takuro Fukunaga; Hiroshi Nagamochi
        ALGORITHMICA, Apr. 2012, Peer-reviewed
      • Indexing All Rooted Subgraphs of a Rooted Graph
        Tomoki Imada; Hiroshi Nagamochi
        IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, Mar. 2012, Peer-reviewed
      • 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, Peer-reviewed
      • An FPT algorithm for edge subset feedback edge set
        Mingyu Xiao; Hiroshi Nagamochi
        INFORMATION PROCESSING LETTERS, Jan. 2012, Peer-reviewed
      • AN APPROXIMATION ALGORITHM FOR LOCATING MAXIMAL DISKS WITHIN CONVEX POLYGONS
        Hirofumi Aota; Takuro Fukunaga; Hiroshi Nagamochi
        INTERNATIONAL JOURNAL OF COMPUTATIONAL GEOMETRY & APPLICATIONS, Dec. 2011, Peer-reviewed
      • Extending Steinitz's Theorem to Upward Star-Shaped Polyhedra and Spherical Polyhedra
        Seok-Hee Hong; Hiroshi Nagamochi
        ALGORITHMICA, Dec. 2011, Peer-reviewed
      • Enumerating tree-like chemical graphs with given upper and lower bounds on path frequencies
        Masaaki Shimizu; Hiroshi Nagamochi; Tatsuya Akutsu
        BMC BIOINFORMATICS, Dec. 2011, Peer-reviewed
      • Editorial: ISAAC 2008 Special Issue
        Seok-Hee Hong; Hiroshi Nagamochi
        ALGORITHMICA, Dec. 2011, Peer-reviewed
      • AN APPROXIMATION ALGORITHM FOR LOCATING MAXIMAL DISKS WITHIN CONVEX POLYGONS
        Hirofumi Aota; Takuro Fukunaga; Hiroshi Nagamochi
        INTERNATIONAL JOURNAL OF COMPUTATIONAL GEOMETRY & APPLICATIONS, Dec. 2011, Peer-reviewed
      • Extending Steinitz's Theorem to Upward Star-Shaped Polyhedra and Spherical Polyhedra
        Seok-Hee Hong; Hiroshi Nagamochi
        ALGORITHMICA, Dec. 2011, Peer-reviewed
      • 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, Nov. 2011, Peer-reviewed
      • 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, Nov. 2011, Peer-reviewed
      • Kernel Methods for Chemical Compounds: From Classification to Design
        Tatsuya Akutsu; Hiroshi Nagamochi
        IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, Oct. 2011, Peer-reviewed
      • On the one-dimensional stock cutting problem in the paper tube industry
        Kazuki Matsumoto; Shunji Umetani; Hiroshi Nagamochi
        JOURNAL OF SCHEDULING, Jun. 2011, Peer-reviewed
      • Selected Papers from the 19th Annual International Symposium on Algorithms and Computation FOREWORD
        Seok-Hee Hong; Hiroshi Nagamochi
        INTERNATIONAL JOURNAL OF COMPUTATIONAL GEOMETRY & APPLICATIONS, Jun. 2011, Peer-reviewed
      • 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, Jun. 2011, Peer-reviewed
      • Guest editors' foreword
        Seok-Hee Hong; Hiroshi Nagamochi
        International Journal of Computational Geometry and Applications, Jun. 2011, Peer-reviewed
      • On the one-dimensional stock cutting problem in the paper tube industry
        Kazuki Matsumoto; Shunji Umetani; Hiroshi Nagamochi
        JOURNAL OF SCHEDULING, Jun. 2011, Peer-reviewed
      • Efficient branch-and-bound algorithms for weighted MAX-2-SAT
        Toshihide Ibaraki; Takashi Imamichi; Yuichi Koga; Hiroshi Nagamochi; Koji Nonobe; Mutsunori Yagiura
        MATHEMATICAL PROGRAMMING, Apr. 2011, Peer-reviewed
      • Efficient enumeration of stereoisomers of tree structured molecules using dynamic programming
        Tomoki Imada; Shunsuke Ota; Hiroshi Nagamochi; Tatsuya Akutsu
        JOURNAL OF MATHEMATICAL CHEMISTRY, Apr. 2011, Peer-reviewed
      • Coprobber guarding game with cycle robber-region
        Hiroshi Nagamochi
        Theoretical Computer Science, 04 Feb. 2011, Peer-reviewed
      • Cop-robber guarding game with cycle robber-region
        Hiroshi Nagamochi
        THEORETICAL COMPUTER SCIENCE, Feb. 2011, Peer-reviewed
      • Generation of Symmetric and Asymmetric Biconnected Rooted Outerplanar Graphs
        Bingbing Zhuang; Hiroshi Nagamochi
        IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, Feb. 2011, Peer-reviewed
      • Generation of Symmetric and Asymmetric Biconnected Rooted Triangulated Planar Graphs
        Bingbing Zhuang; Hiroshi Nagamochi
        IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, Feb. 2011, Peer-reviewed
      • Approximating capacitated tree-routings in networks
        Ehab Morsy; Hiroshi Nagamochi
        JOURNAL OF COMBINATORIAL OPTIMIZATION, Feb. 2011, Peer-reviewed
      • Approximating capacitated tree-routings in networks
        Ehab Morsy; Hiroshi Nagamochi
        JOURNAL OF COMBINATORIAL OPTIMIZATION, Feb. 2011, Peer-reviewed
      • Generation of Symmetric and Asymmetric Biconnected Rooted Outerplanar Graphs
        Bingbing Zhuang; Hiroshi Nagamochi
        IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, Feb. 2011, Peer-reviewed
      • Generation of Symmetric and Asymmetric Biconnected Rooted Triangulated Planar Graphs
        Bingbing Zhuang; Hiroshi Nagamochi
        IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, Feb. 2011, Peer-reviewed
      • Kernel methods for chemical compounds: From classification to design
        Tatsuya Akutsu; Hiroshi Nagamochi
        IEICE Transactions on Information and Systems, 2011, Peer-reviewed
      • 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, Peer-reviewed
      • Minmax tree cover in the euclidean space
        Seigo Karakawa; Ehab Morsy; Hiroshi Nagamochi
        Journal of Graph Algorithms and Applications, 2011, Peer-reviewed
      • 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, Peer-reviewed
      • 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, Peer-reviewed
      • Network design with weighted degree constraints
        Takuro Fukunaga; Hiroshi Nagamochi
        Discrete Optimization, Nov. 2010, Peer-reviewed
      • Network design with weighted degree constraints
        Takuro Fukunaga; Hiroshi Nagamochi
        DISCRETE OPTIMIZATION, Nov. 2010, Peer-reviewed
      • A plane graph representation of triconnected graphs
        Shunsuke Ota; Ehab Morsy; Hiroshi Nagamochi
        THEORETICAL COMPUTER SCIENCE, Oct. 2010, Peer-reviewed
      • Approximation Algorithms for Minimizing Edge Crossings in Radial Drawings
        Seok-Hee Hong; Hiroshi Nagamochi
        ALGORITHMICA, Oct. 2010, Peer-reviewed
      • A Linear-Time Algorithm for Symmetric Convex Drawings of Internally Triconnected Plane Graphs
        Seok-Hee Hong; Hiroshi Nagamochi
        ALGORITHMICA, Oct. 2010, Peer-reviewed
      • A plane graph representation of triconnected graphs
        Shunsuke Ota; Ehab Morsy; Hiroshi Nagamochi
        THEORETICAL COMPUTER SCIENCE, Oct. 2010, Peer-reviewed
      • Approximation Algorithms for Minimizing Edge Crossings in Radial Drawings
        Seok-Hee Hong; Hiroshi Nagamochi
        ALGORITHMICA, Oct. 2010, Peer-reviewed
      • A Linear-Time Algorithm for Symmetric Convex Drawings of Internally Triconnected Plane Graphs
        Seok-Hee Hong; Hiroshi Nagamochi
        ALGORITHMICA, Oct. 2010, Peer-reviewed
      • Convex drawings of hierarchical planar graphs and clustered planar graphs
        Seok-Hee Hong; Hiroshi Nagamochi
        Journal of Discrete Algorithms, Sep. 2010, Peer-reviewed
      • On the approximation of the generalized capacitated tree-routing problem
        Ehab Morsy; Hiroshi Nagamochi
        Journal of Discrete Algorithms, Sep. 2010, Peer-reviewed
      • 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, May 2010, Peer-reviewed
      • 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, May 2010, Peer-reviewed
      • Approximation to the Minimum Cost Edge Installation Problem
        Ehab Morsy; Hiroshi Nagamochi
        IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, Apr. 2010, Peer-reviewed
      • Minimum Augmentation of Edge-Connectivity between Vertices and Sets of Vertices in Undirected Graphs
        Toshimasa Ishii; Yoko Akiyama; Hiroshi Nagamochi
        ALGORITHMICA, Apr. 2010, Peer-reviewed
      • Approximation to the Minimum Cost Edge Installation Problem
        Ehab Morsy; Hiroshi Nagamochi
        IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, Apr. 2010, Peer-reviewed
      • Minimum Augmentation of Edge-Connectivity between Vertices and Sets of Vertices in Undirected Graphs
        Toshimasa Ishii; Yoko Akiyama; Hiroshi Nagamochi
        ALGORITHMICA, Apr. 2010, Peer-reviewed
      • An algorithm for constructing star-shaped drawings of plane graphs
        Seok-Hee Hong; Hiroshi Nagamochi
        COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, Feb. 2010, Peer-reviewed
      • An algorithm for constructing star-shaped drawings of plane graphs
        Seok-Hee Hong; Hiroshi Nagamochi
        COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, Feb. 2010, Peer-reviewed
      • Minimum degree orderings
        Hiroshi Nagamochi
        Algorithmica (New York), Jan. 2010, Peer-reviewed
      • Generating Trees on Multisets
        Bingbing Zhuang; Hiroshi Nagamochi
        ALGORITHMS AND COMPUTATION, PT I, 2010, Peer-reviewed
      • Listing Triconnected Rooted Plane Graphs
        Bingbing Zhuang; Hiroshi Nagamochi
        COMBINATORIAL OPTIMIZATION AND APPLICATIONS, PT II, 2010, Peer-reviewed
      • FPTAS's for Some Cut Problems in Weighted Trees
        Mingyu Xiao; Takuro Fukunaga; Hiroshi Nagamochi
        FRONTIERS IN ALGORITHMICS, 2010, Peer-reviewed
      • Constant Time Generation of Biconnected Rooted Plane Graphs
        Bingbing Zhuang; Hiroshi Nagamochi
        FRONTIERS IN ALGORITHMICS, 2010, Peer-reviewed
      • Multiclass Visual Classifier Based on Bipartite Graph Representation of Decision Tables
        Kazuya Haraguchi; Seok-Hee Hong; Hiroshi Nagamochi
        LEARNING AND INTELLIGENT OPTIMIZATION, 2010, Peer-reviewed
      • Generating Internally Triconnected Rooted Plane Graphs
        Bingbing Zhuang; Hiroshi Nagamochi
        THEORY AND APPLICATIONS OF MODELS OF COMPUTATION, PROCEEDINGS, 2010, Peer-reviewed
      • Enumerating Rooted Graphs with Reflectional Block Structures
        Bingbing Zhuang; Hiroshi Nagamochi
        ALGORITHMS AND COMPLEXITY, PROCEEDINGS, 2010, Peer-reviewed
      • 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, Peer-reviewed
      • Constant Time Generation of Trees with Degree Bounds
        Bingbing Zhuang; Hiroshi Nagamochi
        OPERATIONS RESEARCH AND ITS APPLICATIONS, 2010, Peer-reviewed
      • Minimum Degree Orderings
        Hiroshi Nagamochi
        ALGORITHMICA, Jan. 2010, Peer-reviewed
      • An iterated local search algorithm based on nonlinear programming for the irregular strip packing problem
        Takashi Imamichi; Mutsunori Yagiura; Hiroshi Nagamochi
        DISCRETE OPTIMIZATION, Nov. 2009, Peer-reviewed
      • An iterated local search algorithm based on nonlinear programming for the irregular strip packing problem
        Takashi Imamichi; Mutsunori Yagiura; Hiroshi Nagamochi
        DISCRETE OPTIMIZATION, Nov. 2009, Peer-reviewed
      • 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, Oct. 2009, Peer-reviewed
      • Network Design with Edge-Connectivity and Degree Constraints
        Takuro Fukunaga; Hiroshi Nagamochi
        THEORY OF COMPUTING SYSTEMS, Oct. 2009, Peer-reviewed
      • 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, Oct. 2009, Peer-reviewed
      • Network design with edge-connectivity and degree constraints
        Takuro Fukunaga; Hiroshi Nagamochi
        Theory of Computing Systems, Jul. 2009, Peer-reviewed
      • Drawing slicing graphs with face areas
        Akifumi Kawaguchi; Hiroshi Nagamochi
        THEORETICAL COMPUTER SCIENCE, Mar. 2009, Peer-reviewed
      • Drawing slicing graphs with face areas
        Akifumi Kawaguchi; Hiroshi Nagamochi
        THEORETICAL COMPUTER SCIENCE, Mar. 2009, Peer-reviewed
      • Eulerian detachments with local edge-connectivity
        Takuro Fukunaga; Hiroshi Nagamochi
        Discrete Applied Mathematics, 28 Feb. 2009, Peer-reviewed
      • A detachment algorithm for inferring a graph from path frequency
        Hiroshi Nagamochi
        Algorithmica (New York), Feb. 2009, Peer-reviewed
      • Eulerian detachments with local edge-connectivity
        Takuro Fukunaga; Hiroshi Nagamochi
        DISCRETE APPLIED MATHEMATICS, Feb. 2009, Peer-reviewed
      • A Detachment Algorithm for Inferring a Graph from Path Frequency
        Hiroshi Nagamochi
        ALGORITHMICA, Feb. 2009, Peer-reviewed
      • Scheduling Capacitated One-Way Vehicles on Paths with Deadlines
        UCHIDA Jun; KARUNO Yoshiyuki; NAGAMOCHI Hiroshi
        SICE J Control Meas Syst Integr, 31 Jan. 2009, Peer-reviewed
      • New approximation to the one-sided radial crossing minimization
        Seok-Hee Hong; Hiroshi Nagamochi
        Journal of Graph Algorithms and Applications, 2009, Peer-reviewed
      • Worst Case Analysis for Pickup and Delivery Problems with Consecutive Pickups and Deliveries
        Yoshitaka Nakao; Hiroshi Nagamochi
        ALGORITHMS AND COMPUTATION, PROCEEDINGS, 2009, Peer-reviewed
      • Divide-and-Conquer Algorithms for Partitioning Hypergraphs and Submodular Systems
        Kazumasa Okumoto; Takuro Fukunaga; Hiroshi Nagamochi
        ALGORITHMS AND COMPUTATION, PROCEEDINGS, 2009, Peer-reviewed
      • Upward Star-Shaped Polyhedral Graphs
        Seok-Hee Hong; Hiroshi Nagamochi
        ALGORITHMS AND COMPUTATION, PROCEEDINGS, 2009, Peer-reviewed
      • 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, Peer-reviewed
      • Removing Node Overlaps Using Multi-sphere Scheme
        Takashi Imamichi; Yohei Arahori; Jaeseong Gim; Seok-Hee Hong; Hiroshi Nagamochi
        GRAPH DRAWING, 2009, Peer-reviewed
      • Minmax Tree Cover in the Euclidean Space
        Seigo Karakawa; Ehab Morsy; Hiroshi Nagamochi
        WALCOM: ALGORITHMS AND COMPUTATION, PROCEEDINGS, 2009, Peer-reviewed
      • 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, Peer-reviewed
      • MINIMUM TRANSVERSALS IN POSIMODULAR SYSTEMS
        Mariko Sakashita; Kazuhisa Makino; Hiroshi Nagamochi; Satoru Fujishige
        SIAM JOURNAL ON DISCRETE MATHEMATICS, 2009, Peer-reviewed
      • Worst case analysis for pickup and delivery problems with transfer
        Yoshitaka Nakao; Hiroshi Nagamochi
        IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, Sep. 2008, Peer-reviewed
      • 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, Sep. 2008, Peer-reviewed
      • Worst case analysis for pickup and delivery problems with transfer
        Yoshitaka Nakao; Hiroshi Nagamochi
        IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, Sep. 2008, Peer-reviewed
      • 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, Sep. 2008, Peer-reviewed
      • Enumerating treelike chemical graphs with given path frequency
        Hiroki Fujiwara; Jiexun Wang; Liang Zhao; Hiroshi Nagamochi; Tatsuya Akutsu
        JOURNAL OF CHEMICAL INFORMATION AND MODELING, Jul. 2008, Peer-reviewed
      • Enumerating treelike chemical graphs with given path frequency
        Hiroki Fujiwara; Jiexun Wang; Liang Zhao; Hiroshi Nagamochi; Tatsuya Akutsu
        JOURNAL OF CHEMICAL INFORMATION AND MODELING, Jul. 2008, Peer-reviewed
      • Convex drawings of graphs with non-convex boundary constraints
        Seok-Hee Hong; Hiroshi Nagamochi
        DISCRETE APPLIED MATHEMATICS, Jun. 2008, Peer-reviewed
      • Convex drawings of graphs with non-convex boundary constraints
        Seok-Hee Hong; Hiroshi Nagamochi
        DISCRETE APPLIED MATHEMATICS, Jun. 2008, Peer-reviewed
      • A Clustering Method for Analysis of Sequence Similarity Networks of Proteins Using Maximal Components of Graphs
        HAYASHIDA Morihiro; AKUTSU Tatsuya; NAGAMOCHI Hiroshi
        情報処理学会論文誌, 15 Mar. 2008, Peer-reviewed
      • Approximating a vehicle scheduling problem with time windows and handling times
        Hiroshi Nagamochi; Takaharu Ohnishi
        THEORETICAL COMPUTER SCIENCE, Mar. 2008, Peer-reviewed
      • Approximating a vehicle scheduling problem with time windows and handling times
        Hiroshi Nagamochi; Takaharu Ohnishi
        THEORETICAL COMPUTER SCIENCE, Mar. 2008, Peer-reviewed
      • An improved approximation algorithm for capacitated multicast routings in networks
        Ehab Morsy; Hiroshi Nagamochi
        THEORETICAL COMPUTER SCIENCE, Jan. 2008, Peer-reviewed
      • Star-shaped drawings of graphs with fixed embedding and concave corner constraints
        Seok-Hee Hong; Hiroshi Nagamochi
        COMPUTING AND COMBINATORICS, PROCEEDINGS, 2008, Peer-reviewed
      • Approximating the generalized capacitated tree-routing problem
        Ehab Morsy; Hiroshi Nagamochi
        COMPUTING AND COMBINATORICS, PROCEEDINGS, 2008, Peer-reviewed
      • Approximating crossing minimization in radial layouts
        Seok-Hee Hong; Hiroshi Nagamochi
        LATIN 2008: THEORETICAL INFORMATICS, 2008, Peer-reviewed
      • An improved approximation algorithm for capacitated multicast routings in networks
        Ehab Morsy; Hiroshi Nagamochi
        THEORETICAL COMPUTER SCIENCE, Jan. 2008, Peer-reviewed
      • Bi-criteria food packing by dynamic programming
        Yoshiyuki Karuno; Hiroshi Nagamochi; Xiaoming Wang
        JOURNAL OF THE OPERATIONS RESEARCH SOCIETY OF JAPAN, Dec. 2007, Peer-reviewed
      • Approximating minimum cost multigraphs of specified edge-connectivity under degree bounds
        Takuro Fukunaga; Hiroshi Nagamochi
        JOURNAL OF THE OPERATIONS RESEARCH SOCIETY OF JAPAN, Dec. 2007, Peer-reviewed
      • Approximating the minmax rooted-tree cover in a tree
        Hiroshi Nagamochi; Kohei Okada
        INFORMATION PROCESSING LETTERS, Nov. 2007, Peer-reviewed
      • The source location problem with local 3-vertex-connectivity requirements
        Toshimasa Ishii; Hitoshi Fujita; Hiroshi Nagamochi
        DISCRETE APPLIED MATHEMATICS, Nov. 2007, Peer-reviewed
      • Approximating the minmax rooted-tree cover in a tree
        Hiroshi Nagamochi; Kohei Okada
        INFORMATION PROCESSING LETTERS, Nov. 2007, Peer-reviewed
      • The source location problem with local 3-vertex-connectivity requirements
        Toshimasa Ishii; Hitoshi Fujita; Hiroshi Nagamochi
        DISCRETE APPLIED MATHEMATICS, Nov. 2007, Peer-reviewed
      • Approximability of the capacitated b-edge dominating set problem
        Andre Berger; Takuro Fukunaga; Hiroshi Nagamochi; Ojas Parekh
        THEORETICAL COMPUTER SCIENCE, Oct. 2007, Peer-reviewed
      • Approximability of the capacitated b-edge dominating set problem
        Andre Berger; Takuro Fukunaga; Hiroshi Nagamochi; Ojas Parekh
        THEORETICAL COMPUTER SCIENCE, Oct. 2007, Peer-reviewed
      • Contention-free lambda-planes in optically burst-switched WDM networks
        Kouji Hiratata; Takahiro Matsuda; Hiroshi Nagamochi; Tetsuya Takine
        IEICE TRANSACTIONS ON COMMUNICATIONS, Sep. 2007, Peer-reviewed
      • Contention-free lambda-planes in optically burst-switched WDM networks
        Kouji Hiratata; Takahiro Matsuda; Hiroshi Nagamochi; Tetsuya Takine
        IEICE TRANSACTIONS ON COMMUNICATIONS, Sep. 2007, Peer-reviewed
      • Generalizing the induced matching by edge capacity constraints
        Takuro Fukunaga; Hiroshi Nagamochi
        Discrete Optimization, 01 Jun. 2007, Peer-reviewed
      • Bisecting a 4-connected graph with three resource sets
        Toshimasa Ishii; Kengo Iwata; Hiroshi Nagamochi
        DISCRETE APPLIED MATHEMATICS, Jun. 2007, Peer-reviewed
      • Generalizing the induced matching by edge capacity constraints
        Takuro Fukunaga; Hiroshi Nagamochi
        DISCRETE OPTIMIZATION, Jun. 2007, Peer-reviewed
      • Bisecting a 4-connected graph with three resource sets
        Toshimasa Ishii; Kengo Iwata; Hiroshi Nagamochi
        DISCRETE APPLIED MATHEMATICS, Jun. 2007, Peer-reviewed
      • Drawing c-planar biconnected clustered graphs
        Hiroshi Nagamochi; Katsutoshi Kuroya
        DISCRETE APPLIED MATHEMATICS, May 2007, Peer-reviewed
      • 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, May 2007, Peer-reviewed
      • 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, May 2007, Peer-reviewed
      • Drawing c-planar biconnected clustered graphs
        Hiroshi Nagamochi; Katsutoshi Kuroya
        DISCRETE APPLIED MATHEMATICS, May 2007, Peer-reviewed
      • Minimum cost subpartitions in graphs
        Hiroshi Nagamochi; Yoko Kamidoi
        INFORMATION PROCESSING LETTERS, Apr. 2007, Peer-reviewed
      • Minimum cost subpartitions in graphs
        Hiroshi Nagamochi; Yoko Kamidoi
        INFORMATION PROCESSING LETTERS, Apr. 2007, Peer-reviewed
      • Minimum cost source location problem with local 3-vertex-connectivity requirements
        Toshimasa Ishii; Hitoshi Fujita; Hiroshi Nagamochi
        THEORETICAL COMPUTER SCIENCE, Mar. 2007, Peer-reviewed
      • Minimum cost source location problem with local 3-vertex-connectivity requirements
        Toshimasa Ishii; Hitoshi Fujita; Hiroshi Nagamochi
        THEORETICAL COMPUTER SCIENCE, Mar. 2007, Peer-reviewed
      • An approximation algorithm for dissecting a rectangle into rectangles with specified areas
        Hiroshi Nagamochi; Yuusuke Abe
        DISCRETE APPLIED MATHEMATICS, Feb. 2007, Peer-reviewed
      • Computing a minimum cut in a graph with dynamic edges incident to a designated vertex
        Hiroshi Nagamochi
        IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, Feb. 2007, Peer-reviewed
      • Approximating a generalization of metric TSP
        Takuro Fukunaga; Hiroshi Nagamochi
        IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, Feb. 2007, Peer-reviewed
      • An approximation algorithm for dissecting a rectangle into rectangles with specified areas
        Hiroshi Nagamochi; Yuusuke Abe
        DISCRETE APPLIED MATHEMATICS, Feb. 2007, Peer-reviewed
      • Approximating a generalization of metric TSP
        Takuro Fukunaga; Hiroshi Nagamochi
        IEICE Transactions on Information and Systems, 2007, Peer-reviewed
      • 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, Peer-reviewed
      • Algorithms for the minimum partitioning problems in graphs
        Hiroshi Nagamochi
        ELECTRONICS AND COMMUNICATIONS IN JAPAN PART III-FUNDAMENTAL ELECTRONIC SCIENCE, 2007, Peer-reviewed
      • 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, Peer-reviewed
      • 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, Peer-reviewed
      • Practical Algorithms for Two-Dimensional Packing.
        Mutsunori Yagiura; Hiroshi Nagamochi; Shinji Imahori
        Handbook of Approximation Algorithms and Metaheuristics., 2007, Peer-reviewed
      • Vehicle Scheduling Problems in Graphs.
        Yoshiyuki Karuno; Hiroshi Nagamochi
        Handbook of Approximation Algorithms and Metaheuristics., 2007, Peer-reviewed
      • 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, Peer-reviewed
      • Approximation to the minimum cost edge installation problem
        Ehab Morsy; Hiroshi Nagamochi
        ALGORITHMS AND COMPUTATION, 2007, Peer-reviewed
      • The set connector problem in graphs
        Takuro Fukunaga; Hiroshi Nagamochi
        INTEGER PROGRAMMING AND COMBINATORIAL OPTIMIZATION, PROCEEDINGS, 2007, Peer-reviewed
      • Computing a minimum cut in a graph with dynamic edges incident to a designated vertex
        Hiroshi Nagamochi
        IEICE Transactions on Information and Systems, 2007, Peer-reviewed
      • Sparse connectivity certificates via MA orderings in graphs
        Hiroshi Nagamochi
        Discrete Applied Mathematics, 01 Nov. 2006, Peer-reviewed
      • Two equivalent measures on weighted hypergraphs
        Hiro Ito; Hiroshi Nagamochi
        DISCRETE APPLIED MATHEMATICS, Nov. 2006, Peer-reviewed
      • Sparse connectivity certificates via MA orderings in graphs
        Hiroshi Nagamochi
        DISCRETE APPLIED MATHEMATICS, Nov. 2006, Peer-reviewed
      • Two equivalent measures on weighted hypergraphs
        Hiro Ito; Hiroshi Nagamochi
        DISCRETE APPLIED MATHEMATICS, Nov. 2006, Peer-reviewed
      • Packing soft rectangles
        Hiroshi Nagamochi
        International Journal of Foundations of Computer Science, Oct. 2006, Peer-reviewed
      • Packing soft rectangles
        Hiroshi Nagamochi
        INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, Oct. 2006, Peer-reviewed
      • Some Theorems on Detachments Preserving Local-Edge-Connectivity
        Takuro Fukunaga; Hiroshi Nagamochi
        Electronic Notes in Discrete Mathematics, 15 Jul. 2006, Peer-reviewed
      • Augmenting forests to meet odd diameter requirements
        Toshimasa Ishii; Shigeyuki Yamamoto; Hiroshi Nagamochi
        DISCRETE OPTIMIZATION, Jun. 2006, Peer-reviewed
      • Augmenting forests to meet odd diameter requirements
        Toshimasa Ishii; Shigeyuki Yamamoto; Hiroshi Nagamochi
        DISCRETE OPTIMIZATION, Jun. 2006, Peer-reviewed
      • Minmax subtree cover problem on cacti
        H Nagamochi; T Kawada
        DISCRETE APPLIED MATHEMATICS, May 2006, Peer-reviewed
      • A fast edge-splitting algorithm in edge-weighted graphs
        Hiroshi Nagamochi
        IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, May 2006, Peer-reviewed
      • Minmax subtree cover problem on cacti
        H Nagamochi; T Kawada
        DISCRETE APPLIED MATHEMATICS, May 2006, Peer-reviewed
      • Augmenting a (k-1)-vertex-connected multigraph to an l-edge-connected and k-vertex-connected multigraph
        T Ishii; H Nagamochi; T Ibaraki
        ALGORITHMICA, Apr. 2006, Peer-reviewed
      • Augmenting a (k-1)-vertex-connected multigraph to an l-edge-connected and k-vertex-connected multigraph
        T Ishii; H Nagamochi; T Ibaraki
        ALGORITHMICA, Apr. 2006, Peer-reviewed
      • Contention Avoidance based on Spanning Trees with Dedicated Wavelengths in Optically Burst-Switched WDM Networks
        Koji Hirata; Takahiro Matsuda; Hiroshi Nagamochi; Tetsuya Takine
        電子情報通信学会技術報告, Mar. 2006
      • Increasing the edge-connectivity by contracting a vertex subset in graphs
        H Nagamochi
        IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, Feb. 2006, Peer-reviewed
      • Straight-line drawing algorithms for hierarchical graphs and clustered graphs
        P Eades; QW Feng; XM Lin; H Nagamochi
        ALGORITHMICA, Jan. 2006, Peer-reviewed
      • 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, Peer-reviewed
      • A deterministic algorithm for finding all minimum k-way cuts
        Yoko Kamidoi; Noriyoshi Yoshida; Hiroshi Nagamochi
        SIAM JOURNAL ON COMPUTING, 2006, Peer-reviewed
      • Convex drawings of graphs with non-convex boundary
        Seok-Hee Hong; Hiroshi Nagamochi
        GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE, 2006, Peer-reviewed
      • 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, Peer-reviewed
      • A fast edge-splitting algorithm in edge-weighted graphs
        Hiroshi Nagamochi
        IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, 2006, Peer-reviewed
      • Increasing the edge-connectivity by contracting a vertex subset in graphs
        Hiroshi Nagamochi
        IEICE Transactions on Information and Systems, 2006, Peer-reviewed
      • Straight-line drawing algorithms for hierarchical graphs and clustered graphs
        P Eades; QW Feng; XM Lin; H Nagamochi
        ALGORITHMICA, Jan. 2006, Peer-reviewed
      • A deterministic algorithm for finding all minimum k-way cuts
        Yoko Kamidoi; Noriyoshi Yoshida; Hiroshi Nagamochi
        SIAM JOURNAL ON COMPUTING, 2006, Peer-reviewed
      • A robust algorithm for bisecting a triconnected graph with two resource sets
        H Nagamochi; K Iwata; T Ishii
        THEORETICAL COMPUTER SCIENCE, Sep. 2005, Peer-reviewed
      • A robust algorithm for bisecting a triconnected graph with two resource sets
        H Nagamochi; K Iwata; T Ishii
        THEORETICAL COMPUTER SCIENCE, Sep. 2005, Peer-reviewed
      • A 4/3-approximation for the minimum 2-local-vertex-connectivity augmentation in a connected graph
        H Nagamochi
        JOURNAL OF ALGORITHMS, Aug. 2005, Peer-reviewed
      • A 4/3-approximation for the minimum 2-local-vertex-connectivity augmentation in a connected graph
        Hiroshi Nagamochi
        Journal of Algorithms, Aug. 2005, Peer-reviewed
      • Packing unit squares in a rectangle
        H. Nagamochi
        Electronic Journal of Combinatorics, 29 Jul. 2005, Peer-reviewed
      • Packing unit squares in a rectangle
        H Nagamochi
        ELECTRONIC JOURNAL OF COMBINATORICS, Jul. 2005, Peer-reviewed
      • タンク繰りにおける経路探索法
        石井利昌; 永持仁; 西垣豊; 高橋健吾; 武田真人
        システム制御情報学会論文誌, Jun. 2005, Peer-reviewed
      • Approximating the minmax rooted-subtree cover problem
        H Nagamochi
        IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, May 2005, Peer-reviewed
      • An improved bound on the one-sided minimum crossing number in two-layered drawings
        H Nagamochi
        DISCRETE & COMPUTATIONAL GEOMETRY, Apr. 2005, Peer-reviewed
      • On computing minimum (s,t)-cuts in digraphs
        Hiroshi Nagamochi
        Information Processing Letters, 16 Mar. 2005, Peer-reviewed
      • On computing minimum (s,t)-cuts in digraphs
        H Nagamochi
        INFORMATION PROCESSING LETTERS, Mar. 2005, Peer-reviewed
      • On the one-sided crossing minimization in a bipartite graph with large degrees
        Hiroshi Nagamochi
        Theoretical Computer Science, 28 Feb. 2005, Peer-reviewed
      • On the one-sided crossing minimization in a bipartite graph with large degrees
        H Nagamochi
        THEORETICAL COMPUTER SCIENCE, Feb. 2005, Peer-reviewed
      • An improved bound on the one-sided minimum crossing number in two-layered drawings
        Hiroshi Nagamochi
        Discrete and Computational Geometry, 2005, Peer-reviewed
      • On 2-approximation to the vertex-connectivity in graphs
        Hiroshi Nagamochi
        IEICE Transactions on Information and Systems, 2005, Peer-reviewed
      • Greedy splitting algorithms for approximating multiway partition problems
        L Zhao; H Nagamochi; T Ibaraki
        MATHEMATICAL PROGRAMMING, Jan. 2005, Peer-reviewed
      • Scheduling vehicles on trees
        Y. Karuno; Hiroshi Nagamochi
        Pacific Journal of Optimization,vol. 1, no. 3, pp. 527-543., 2005, Peer-reviewed
      • Greedy splitting algorithms for approximating multiway partition problems
        L Zhao; H Nagamochi; T Ibaraki
        MATHEMATICAL PROGRAMMING, Jan. 2005, Peer-reviewed
      • Approximating the minmax rooted-subtree cover problem
        Hiroshi Nagamochi
        IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, 2005, Peer-reviewed
      • On 2-approximation to the vertex-connectivity in graphs
        H Nagamochi
        IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, Jan. 2005, Peer-reviewed
      • Graph algorithms for network connectivity problems
        H Nagamochi
        JOURNAL OF THE OPERATIONS RESEARCH SOCIETY OF JAPAN, Dec. 2004, Peer-reviewed
      • On generalized greedy splitting algorithms for multiway partition problems
        L Zhao; H Nagamochi; T Ibarakic
        DISCRETE APPLIED MATHEMATICS, Sep. 2004, Peer-reviewed
      • Counting edge crossings in a 2-layered drawing
        H Nagamochi; N Yamada
        INFORMATION PROCESSING LETTERS, Sep. 2004, Peer-reviewed
      • Counting edge crossings in a 2-layered drawing
        H Nagamochi; N Yamada
        INFORMATION PROCESSING LETTERS, Sep. 2004, Peer-reviewed
      • On generalized greedy splitting algorithms for multiway partition problems
        L Zhao; H Nagamochi; T Ibarakic
        DISCRETE APPLIED MATHEMATICS, Sep. 2004, Peer-reviewed
      • A faster 2-approximation algorithm for the minmax p-traveling salesmen problem on a tree
        H Nagamochi; K Okada
        DISCRETE APPLIED MATHEMATICS, May 2004, Peer-reviewed
      • A faster 2-approximation algorithm for the minmax p-traveling salesmen problem on a tree
        H Nagamochi; K Okada
        DISCRETE APPLIED MATHEMATICS, May 2004, Peer-reviewed
      • A simple recognition of maximal planar graphs
        H Nagamochi; T Suzuki; T Ishii
        INFORMATION PROCESSING LETTERS, Mar. 2004, Peer-reviewed
      • A simple recognition of maximal planar graphs
        H Nagamochi; T Suzuki; T Ishii
        INFORMATION PROCESSING LETTERS, Mar. 2004, Peer-reviewed
      • An approximability result of the multi-vehicle scheduling problem on a path with release and handling times
        Y Karuno; H Nagamochi
        THEORETICAL COMPUTER SCIENCE, Jan. 2004, Peer-reviewed
      • An improved approximation to the one-sided bilayer drawing
        H Nagamochi
        GRAPH DRAWING, 2004, Peer-reviewed
      • Convex drawing for c-planar biconnected clustered graphs
        H Nagamochi; K Kuroya
        GRAPH DRAWING, 2004, Peer-reviewed
      • An approximability result of the multi-vehicle scheduling problem on a path with release and handling times
        Y Karuno; H Nagamochi
        THEORETICAL COMPUTER SCIENCE, Jan. 2004, Peer-reviewed
      • 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, Dec. 2003, Peer-reviewed
      • On the minimum local-vertex-connectivity augmentation in graphs
        Nagamochi, H; Ishii, T
        DISCRETE APPLIED MATHEMATICS, 01 Aug. 2003, Peer-reviewed
      • 2-Approximation algorithms for the multi-vehicle scheduling problem on a path with release and handling times
        Y Karuno; H Nagamochi
        DISCRETE APPLIED MATHEMATICS, Aug. 2003, Peer-reviewed
      • On the minimum local-vertex-connectivity augmentation in graphs
        H Nagamochi; T Ishii
        DISCRETE APPLIED MATHEMATICS, Aug. 2003, Peer-reviewed
      • 2-Approximation algorithms for the multi-vehicle scheduling problem on a path with release and handling times
        Y Karuno; H Nagamochi
        DISCRETE APPLIED MATHEMATICS, Aug. 2003, Peer-reviewed
      • An edge-splitting algorithm in planar graphs
        H Nagamochi; P Eades
        JOURNAL OF COMBINATORIAL OPTIMIZATION, Jun. 2003, Peer-reviewed
      • An edge-splitting algorithm in planar graphs
        H Nagamochi; P Eades
        JOURNAL OF COMBINATORIAL OPTIMIZATION, Jun. 2003, Peer-reviewed
      • A linear time 5/3-approximation for the minimum 3 strongly-connected spanning subgraph problem
        L Zhao; H Nagamochi; T Ibaraki
        INFORMATION PROCESSING LETTERS, Apr. 2003, Peer-reviewed
      • A linear time 5/3-approximation for the minimum 3 strongly-connected spanning subgraph problem
        L Zhao; H Nagamochi; T Ibaraki
        INFORMATION PROCESSING LETTERS, Apr. 2003, Peer-reviewed
      • A primal-dual approximation algorithm for the survivable network design problem in hypergraphs
        L Zhao; H Nagamochi; T Ibaraki
        DISCRETE APPLIED MATHEMATICS, Mar. 2003, Peer-reviewed
      • An approximation for finding a smallest 2-edge-connected subgraph containing a specified spanning tree
        H Nagamochi
        DISCRETE APPLIED MATHEMATICS, Mar. 2003, Peer-reviewed
      • A primal-dual approximation algorithm for the survivable network design problem in hypergraphs
        L Zhao; H Nagamochi; T Ibaraki
        DISCRETE APPLIED MATHEMATICS, Mar. 2003, Peer-reviewed
      • グラフの最小分割問題に対するアルゴリズム(<小特集>LAシンポジウム(計算機科学基礎理論ワークショップ)論文小特集)
        永持 仁
        電子情報通信学会論文誌. D-I, 情報・システム, I-情報処理, 01 Feb. 2003, Peer-reviewed
      • 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, Feb. 2003, Peer-reviewed
      • 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, Peer-reviewed
      • Graph connectivity and its augmentation: applications of MA orderings
        H Nagamochi; T Ibaraki
        DISCRETE APPLIED MATHEMATICS, Nov. 2002, Peer-reviewed
      • Graph connectivity and its augmentation: applications of MA orderings
        H Nagamochi; T Ibaraki
        DISCRETE APPLIED MATHEMATICS, Nov. 2002, Peer-reviewed
      • Better approximation ratios for the single-vehicle scheduling problems on line-shaped networks
        Y Karuno; H Nagamochi; T Ibaraki
        NETWORKS, Jul. 2002, Peer-reviewed
      • Better approximation ratios for the single-vehicle scheduling problems on line-shaped networks
        Y Karuno; H Nagamochi; T Ibaraki
        NETWORKS, Jul. 2002, Peer-reviewed
      • A 2-approximation algorithm for the minimum weight edge dominating set problem
        Toshihiro Fujito; Hiroshi Nagamochi
        Discrete Applied Mathematics, 15 May 2002, Peer-reviewed
      • A 2-approximation algorithm for the minimum weight edge dominating set problem
        T Fujito; H Nagamochi
        DISCRETE APPLIED MATHEMATICS, May 2002, Peer-reviewed
      • A note on approximating the survivable network design problem in hypergraphs
        L Zhao; H Nagamochi; T Ibaraki
        IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, Feb. 2002, Peer-reviewed
      • On the minimum edge- and vertex-connectivity augmentation in multigraphs, "jointly worked "
        永持 仁
        The Second Japanese-Sino Optimization Meeting,/ , 61, 2002, Peer-reviewed
      • 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, Peer-reviewed
      • 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, Peer-reviewed
      • Convex embeddings and bisections of 3-connected graphs
        H Nagamochi; T Jordan; Y Nakao; T Ibaraki
        COMBINATORICA, 2002, Peer-reviewed
      • Convex embeddings and bisections of 3-connected graphs
        H Nagamochi; T Jordan; Y Nakao; T Ibaraki
        COMBINATORICA, 2002, Peer-reviewed
      • Minimum cost source location problem with vertex-connectivity requirements in digraphs
        H. Nagamochi; T. Ishii; H. Ito
        Information Processing Letters, 31 Dec. 2001, Peer-reviewed
      • Approximating the minimum k-way cut in a graph via minimum 3-way cuts
        L Zhao; H Nagamochi; T Ibaraki
        JOURNAL OF COMBINATORIAL OPTIMIZATION, Dec. 2001, Peer-reviewed
      • Approximating the minimum k-way cut in a graph via minimum 3-way cuts
        L Zhao; H Nagamochi; T Ibaraki
        JOURNAL OF COMBINATORIAL OPTIMIZATION, Dec. 2001, Peer-reviewed
      • Minimum cost source location problem with vertex-connectivity requirements in digraphs
        H Nagamochi; T Ishii; H Ito
        INFORMATION PROCESSING LETTERS, Dec. 2001, Peer-reviewed
      • Bounds on the number of isolates in sum graph labeling
        H Nagamochi; M Miller; Slamin
        DISCRETE MATHEMATICS, Sep. 2001, Peer-reviewed
      • Independent spanning trees with small depths in iterated line digraphs
        Toru Hasunuma; Hiroshi Nagamochi
        Discrete Applied Mathematics, 15 Jun. 2001, Peer-reviewed
      • Augmenting a submodular and posi-modular set function by a multigraph
        H Nagamochi; T Shiraki; T Ibaraki
        JOURNAL OF COMBINATORIAL OPTIMIZATION, Jun. 2001, Peer-reviewed
      • Augmenting a submodular and posi-modular set function by a multigraph
        H Nagamochi; T Shiraki; T Ibaraki
        JOURNAL OF COMBINATORIAL OPTIMIZATION, Jun. 2001, Peer-reviewed
      • Independent spanning trees with small depths in iterated line digraphs
        T Hasunuma; H Nagamochi
        DISCRETE APPLIED MATHEMATICS, Jun. 2001, Peer-reviewed
      • 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, May 2001, Peer-reviewed
      • Multigraph augmentation under biconnectivity and general edge-connectivity requirements
        T Ishii; H Nagamochi; T Ibaraki
        NETWORKS, May 2001, Peer-reviewed
      • Multigraph augmentation under biconnectivity and general edge-connectivity requirements
        T Ishii; H Nagamochi; T Ibaraki
        NETWORKS, May 2001, Peer-reviewed
      • An efficient NC algorithm for a sparse k-edge-connectivity certificate
        H Nagamochi; T Hasunuma
        JOURNAL OF ALGORITHMS, Feb. 2001, Peer-reviewed
      • An Efficient script N signScript C sign Algorithm for a Sparse k-Edge-Connectivity Certificate
        Hiroshi Nagamochi; Toru Hasunuma
        Journal of Algorithms, 2001, Peer-reviewed
      • Bounds on sum number in graphs
        Hiroshi Nagamochi; M. Miller; Slamin
        Discrete Mathematics, vol.240, no.1-3,pp.175-185, 2001, Peer-reviewed
      • Bounds on sum number in graphs, "jointly worked "
        永持 仁
        Discrete Mathematics,240/1-3, 175-185, 2001, Peer-reviewed
      • A unified framework for approximating some partition problems via greedy splitting, "jointly worked "
        永持 仁
        Lecture Notes in Computer Science,V2223, 682-694, 2001, Peer-reviewed
      • A primal-dual approximation algorithm for the survivable network design problem in hypergraphs, "jointly worked "
        永持 仁
        Lecture Notes in Computer Science,V2010, 478-489, 2001, Peer-reviewed
      • 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, Peer-reviewed
      • 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, Peer-reviewed
      • 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, Peer-reviewed
      • A unified framework for approximating multiway partition problems - (Extended abstract)
        L Zhao; H Nagamochi; T Ibaraki
        ALGORITHMS AND COMPUTATION, PROCEEDINGS, 2001, Peer-reviewed
      • 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, Peer-reviewed
      • Polyhedral structure of submodular and posi-modular systems
        H Nagamochi; T Ibaraki
        DISCRETE APPLIED MATHEMATICS, Dec. 2000, Peer-reviewed
      • Polyhedral structure of submodular and posi-modular systems
        H Nagamochi; T Ibaraki
        DISCRETE APPLIED MATHEMATICS, Dec. 2000, Peer-reviewed
      • A fast algorithm for computing minimum 3-way and 4-way cuts
        H Nagamochi; T Ibaraki
        MATHEMATICAL PROGRAMMING, Sep. 2000, Peer-reviewed
      • A fast algorithm for cactus representations of minimum cuts
        H Nagamochi; Y Nakao; T Ibaraki
        JAPAN JOURNAL OF INDUSTRIAL AND APPLIED MATHEMATICS, Jun. 2000, Peer-reviewed
      • A faster algorithm for computing minimum 5-way and 6-way cuts in graphs
        H Nagamochi; S Katayama; T Ibaraki
        JOURNAL OF COMBINATORIAL OPTIMIZATION, Jun. 2000, Peer-reviewed
      • A faster algorithm for computing minimum 5-way and 6-way cuts in graphs
        H Nagamochi; S Katayama; T Ibaraki
        JOURNAL OF COMBINATORIAL OPTIMIZATION, Jun. 2000, Peer-reviewed
      • Totally balanced combinatorial optimization games
        XT Deng; T Ibaraki; H Nagamochi; WN Zang
        MATHEMATICAL PROGRAMMING, May 2000, Peer-reviewed
      • Totally balanced combinatorial optimization games
        XT Deng; T Ibaraki; H Nagamochi; WN Zang
        MATHEMATICAL PROGRAMMING, May 2000, Peer-reviewed
      • 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, Apr. 2000, Peer-reviewed
      • Recent development of graph connectivity augmentation algorithms
        H Nagamochi
        IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, Mar. 2000, Peer-reviewed
      • 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, Mar. 2000, Peer-reviewed
      • 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, Mar. 2000, Peer-reviewed
      • A fast algorithm for computing minimum 3-way and 4-way cuts
        Hiroshi Nagamochi; Toshihide Ibaraki
        Mathematical Programming, Series B, 2000, Peer-reviewed
      • A simplified (O)over-tilde(nm) time edge-splitting algorithm in undirected graphs
        H Nagamochi; S Nakamura; T Ibaraki
        ALGORITHMICA, Jan. 2000, Peer-reviewed
      • 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, Peer-reviewed
      • A simplified (O)over-tilde(nm) time edge-splitting algorithm in undirected graphs
        H Nagamochi; S Nakamura; T Ibaraki
        ALGORITHMICA, Jan. 2000, Peer-reviewed
      • Bisecting two subsets in 3-connected graphs
        H Nagamochi; T Jordan; Y Nakao; T Ibaraki
        ALGORITHMS AND COMPUTATIONS, 2000, Peer-reviewed
      • An approximation of the minimum vertex cover in a graph
        H Nagamochi; T Ibaraki
        JAPAN JOURNAL OF INDUSTRIAL AND APPLIED MATHEMATICS, Oct. 1999, Peer-reviewed
      • 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, Oct. 1999, Peer-reviewed
      • Algorithmic aspects of the core of combinatorial optimization games
        XT Deng; T Ibaraki; H Nagamochi
        MATHEMATICS OF OPERATIONS RESEARCH, Aug. 1999, Peer-reviewed
      • Algorithmic aspects of the core of combinatorial optimization games
        XT Deng; T Ibaraki; H Nagamochi
        MATHEMATICS OF OPERATIONS RESEARCH, Aug. 1999, Peer-reviewed
      • A reconfigurative algorithm for torus lightwave networks
        M Kato; R Kawakita; H Nagamochi; Y Oie
        ELECTRONICS AND COMMUNICATIONS IN JAPAN PART I-COMMUNICATIONS, Jun. 1999, Peer-reviewed
      • Augmenting edge-connectivity over the entire range in (O)over-tilde(nm) time
        H Nagamochi; T Ibaraki
        JOURNAL OF ALGORITHMS, Feb. 1999, Peer-reviewed
      • Augmenting edge-connectivity over the entire range in (O)over-tilde(nm) time
        H Nagamochi; T Ibaraki
        JOURNAL OF ALGORITHMS, Feb. 1999, Peer-reviewed
      • 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, Peer-reviewed
      • Drawing clustered graphs on an orthogonal grid
        P. Eades; Q. Feng; Hiroshi Nagamochi
        Journal of Graph Algorithms and Application,vol.3, no.4,, pp. 3-29, 1999, Peer-reviewed
      • Drawing clustered graphs on an orthogonal grid, "jointly worked "
        永持 仁
        Journal of Graph Algorithms and Application,3/4, 3-29, 1999, Peer-reviewed
      • 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, Peer-reviewed
      • 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, Peer-reviewed
      • 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, Peer-reviewed
      • 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, Peer-reviewed
      • Two arc-disjoint paths in Eulerian digraphs
        A Frank; T Ibaraki; H Nagamochi
        SIAM JOURNAL ON DISCRETE MATHEMATICS, Nov. 1998, Peer-reviewed
      • Two arc-disjoint paths in Eulerian digraphs
        A Frank; T Ibaraki; H Nagamochi
        SIAM JOURNAL ON DISCRETE MATHEMATICS, Nov. 1998, Peer-reviewed
      • A note on minimizing submodular functions
        H Nagamochi; T Ibaraki
        INFORMATION PROCESSING LETTERS, Sep. 1998, Peer-reviewed
      • A note on minimizing submodular functions
        H Nagamochi; T Ibaraki
        INFORMATION PROCESSING LETTERS, Sep. 1998, Peer-reviewed
      • 数理工学のすすめ--木を見て森を見る
        永持 仁
        理系への数学, Aug. 1998, Peer-reviewed
      • Convexity of Elementary Flow Games.
        永持仁; 牧野和久; ZENG D‐Z; 村田真紀; 茨木俊秀
        電子情報通信学会論文誌 D-1, Jun. 1998, Peer-reviewed
      • グラフの連結度増大問題
        永持仁
        応用数理, Mar. 1998, Peer-reviewed
      • Independent spanning trees with small depths in iterated line digraphs
        T Hasunuma; H Nagamochi
        PROCEEDINGS OF THE 4TH AUSTRALASIAN THEORY SYMPOSIUM, CATS'98, 1998, Peer-reviewed
      • An efficient NC algorithm for a sparse k-edge-connectivity certificate
        H Nagamochi; T Hasunuma
        ALGORITHMS AND COMPUTATIONS, 1998, Peer-reviewed
      • Polyhedral structure of submodular and posi-modular systems
        H Nagamochi; T Ibaraki
        ALGORITHMS AND COMPUTATIONS, 1998, Peer-reviewed
      • k-edge and 3-vertex connectivity augmentation in an arbitrary multigraph
        T Ishii; H Nagamochi; T Ibaraki
        ALGORITHMS AND COMPUTATIONS, 1998, Peer-reviewed
      • Edge-splitting and edge-connectivity augmentation in planar graphs
        H Nagamochi; P Eades
        INTEGER PROGRAMMING AND COMBINATORIAL OPTIMIZATION, 1998, Peer-reviewed
      • 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, Peer-reviewed
      • 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, Peer-reviewed
      • Complexity of the single vehicle scheduling problem on graphs
        H Nagamochi; K Mochizuki; T Ibaraki
        INFOR, Nov. 1997, Peer-reviewed
      • 格子型光波ネットワークの再構成アルゴリズムについて
        嘉藤学; 河北隆二; 永持仁; 尾家祐二
        電子情報通信学会論文誌 B-1, Oct. 1997, Peer-reviewed
      • Computing all small cuts in an undirected network
        H Nagamochi; K Nishimura; T Ibaraki
        SIAM JOURNAL ON DISCRETE MATHEMATICS, Aug. 1997, Peer-reviewed
      • Computing all small cuts in an undirected network
        H Nagamochi; K Nishimura; T Ibaraki
        SIAM JOURNAL ON DISCRETE MATHEMATICS, Aug. 1997, Peer-reviewed
      • Complexity of the minimum base game on matroids
        H Nagamochi; DZ Zeng; N Kabutoya; T Ibaraki
        MATHEMATICS OF OPERATIONS RESEARCH, Feb. 1997, Peer-reviewed
      • Complexity of the minimum base game on matroids
        H Nagamochi; DZ Zeng; N Kabutoya; T Ibaraki
        MATHEMATICS OF OPERATIONS RESEARCH, Feb. 1997, Peer-reviewed
      • Deterministic (O)over-tilde(nm) time edge-splitting in undirected graphs
        H Nagamochi; T Ibaraki
        JOURNAL OF COMBINATORIAL OPTIMIZATION, 1997, Peer-reviewed
      • Augmenting edge and vertex connectivities simultaneously
        Toshimasa, I; H Nagamochi; Toshihide, I
        ALGORITHMS AND COMPUTATION, PROCEEDINGS, 1997, Peer-reviewed
      • Vehicle scheduling on a tree with release and handling times
        Y Karuno; H Nagamochi; T Ibaraki
        ANNALS OF OPERATIONS RESEARCH, 1997, Peer-reviewed
      • 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, Peer-reviewed
      • Vehicle scheduling on a tree to minimize maximum lateness
        Y Karuno; H Nagamochi; T Ibaraki
        JOURNAL OF THE OPERATIONS RESEARCH SOCIETY OF JAPAN, Sep. 1996, Peer-reviewed
      • Constructing cactus representation for all minimum cuts in an undirected network
        H Nagamochi; T Kameda
        JOURNAL OF THE OPERATIONS RESEARCH SOCIETY OF JAPAN, Jun. 1996, Peer-reviewed
      • 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, Peer-reviewed
      • 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, Peer-reviewed
      • OPTIMAL COTERIES FOR RINGS AND RELATED NETWORKS
        T IBARAKI; H NAGAMOCHI; T KAMEDA
        DISTRIBUTED COMPUTING, Jun. 1995, Peer-reviewed
      • OPTIMAL COTERIES FOR RINGS AND RELATED NETWORKS
        T IBARAKI; H NAGAMOCHI; T KAMEDA
        DISTRIBUTED COMPUTING, Jun. 1995, Peer-reviewed
      • サブツアー交換交叉に対する2つのコメント(共著)
        永持 仁
        人工知能学会論文誌,10/3, 464-467, 1995, Peer-reviewed
      • Two arc-disjoint paths in Eulerian digraphs, "jointly worked "
        永持 仁
        Lecture Notes in Computer Science,V1004, 92-101, 1995, Peer-reviewed
      • A Faster Edge Splitting Algorithm in Multigraphs and its Application to the Edge-Connectivity Augmentation Problem.
        NAGAMOCHI H; IBARAKI T
        Lect Notes Comput Sci, 1995, Peer-reviewed
      • 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, Peer-reviewed
      • IMPLEMENTING AN EFFICIENT MINIMUM CAPACITY CUT ALGORITHM
        H NAGAMOCHI; T ONO; T IBARAKI
        MATHEMATICAL PROGRAMMING, Dec. 1994, Peer-reviewed
      • AN EXACT LOWER-BOUND ON THE NUMBER OF CUT-SETS IN MULTIGRAPHS
        H HARADA; Z SUN; H NAGAMOCHI
        NETWORKS, Dec. 1994, Peer-reviewed
      • AN EXACT LOWER-BOUND ON THE NUMBER OF CUT-SETS IN MULTIGRAPHS
        H HARADA; Z SUN; H NAGAMOCHI
        NETWORKS, Dec. 1994, Peer-reviewed
      • IMPLEMENTING AN EFFICIENT MINIMUM CAPACITY CUT ALGORITHM
        H NAGAMOCHI; T ONO; T IBARAKI
        MATHEMATICAL PROGRAMMING, Dec. 1994, Peer-reviewed
      • Canonical cactus representation for minimum cuts
        Hiroshi Nagamochi; Tiko Kameda
        Japan Journal of Industrial and Applied Mathematics, Oct. 1994, Peer-reviewed
      • Computing all small cuts in undirected networks, "jointly worked "
        永持 仁
        Lecture Notes in Computer Science,V834, 190-198, 1994, Peer-reviewed
      • 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, Peer-reviewed
      • ON SPARSE SUBGRAPHS PRESERVING CONNECTIVITY PROPERTIES
        A FRANK; T IBARAKI; H NAGAMOCHI
        JOURNAL OF GRAPH THEORY, Jul. 1993, Peer-reviewed
      • ON SPARSE SUBGRAPHS PRESERVING CONNECTIVITY PROPERTIES
        A FRANK; T IBARAKI; H NAGAMOCHI
        JOURNAL OF GRAPH THEORY, Jul. 1993, Peer-reviewed
      • COMPUTING K-EDGE-CONNECTED COMPONENTS OF A MULTIGRAPH
        H NAGAMOCHI; T WATANABE
        IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, Apr. 1993, Peer-reviewed
      • Computing k-edge-connected components in multigraphs, "jointly worked "
        永持 仁
        Inst. Electron. Inform. Comm. Eng. Trans,E76-A,/ 4, \t513-517, 1993, Peer-reviewed
      • Vehicle Scheduling on a Tree with Release and Handling Times.
        KARUNO Y; NAGAMOCHI H; IBARAKI T
        Lect Notes Comput Sci, 1993, Peer-reviewed
      • ON ONAGAS UPPER BOUND ON THE MEAN-VALUES OF PROBABILISTIC MAXIMUM FLOWS
        H NAGAMOCHI; T IBARAKI
        IEEE TRANSACTIONS ON RELIABILITY, Jun. 1992, Peer-reviewed
      • A linear time algorithm for computing 3-edge-connected components in a multigraph
        Hiroshi Nagamochi; Toshihide Ibaraki
        Japan Journal of Industrial and Applied Mathematics, Jun. 1992, Peer-reviewed
      • COMPUTING EDGE-CONNECTIVITY IN MULTIGRAPHS AND CAPACITATED GRAPHS
        H NAGAMOCHI; T IBARAKI
        SIAM JOURNAL ON DISCRETE MATHEMATICS, Feb. 1992, Peer-reviewed
      • COMPUTING EDGE-CONNECTIVITY IN MULTIGRAPHS AND CAPACITATED GRAPHS
        H NAGAMOCHI; T IBARAKI
        SIAM JOURNAL ON DISCRETE MATHEMATICS, Feb. 1992, Peer-reviewed
      • OPTIMAL COTERIES FOR RINGS AND RELATED NETWORKS
        T IBARAKI; H NAGAMOCHI; T KAMEDA
        PROCEEDINGS OF THE 12TH INTERNATIONAL CONFERENCE ON DISTRIBUTED COMPUTING SYSTEMS, 1992, Peer-reviewed
      • A LINEAR-TIME ALGORITHM FOR FINDING A SPARSE K-CONNECTED SPANNING SUBGRAPH OF A K-CONNECTED GRAPH
        H NAGAMOCHI; T IBARAKI
        ALGORITHMICA, 1992, Peer-reviewed
      • A LINEAR-TIME ALGORITHM FOR FINDING A SPARSE K-CONNECTED SPANNING SUBGRAPH OF A K-CONNECTED GRAPH
        H NAGAMOCHI; T IBARAKI
        ALGORITHMICA, 1992, Peer-reviewed
      • COUNTING THE NUMBER OF MINIMUM CUTS IN UNDIRECTED MULTIGRAPHS
        H NAGAMOCHI; Z SUN; T IBARAKI
        IEEE TRANSACTIONS ON RELIABILITY, Dec. 1991, Peer-reviewed
      • MAXIMUM FLOWS IN PROBABILISTIC NETWORKS
        H NAGAMOCHI; T IBARAKI
        NETWORKS, Oct. 1991, Peer-reviewed
      • MAXIMUM FLOWS IN PROBABILISTIC NETWORKS
        H NAGAMOCHI; T IBARAKI
        NETWORKS, Oct. 1991, Peer-reviewed
      • 基数3のカットセット数を最小にする2-辺連結グラフ
        永持 仁
        電子情報通信学会論文誌 A 基礎・境界, Jul. 1990, Peer-reviewed
      • RELAXATION METHODS FOR THE STRICTLY CONVEX MULTICOMMODITY FLOW PROBLEM WITH CAPACITY CONSTRAINTS ON INDIVIDUAL COMMODITIES
        H NAGAMOCHI; M FUKUSHIMA; T IBARAKI
        NETWORKS, Jul. 1990, Peer-reviewed
      • RELAXATION METHODS FOR THE STRICTLY CONVEX MULTICOMMODITY FLOW PROBLEM WITH CAPACITY CONSTRAINTS ON INDIVIDUAL COMMODITIES
        H NAGAMOCHI; M FUKUSHIMA; T IBARAKI
        NETWORKS, Jul. 1990, Peer-reviewed
      • MULTICOMMODITY FLOWS IN CERTAIN PLANAR DIRECTED NETWORKS
        H NAGAMOCHI; T IBARAKI
        DISCRETE APPLIED MATHEMATICS, May 1990, Peer-reviewed
      • MULTICOMMODITY FLOWS IN CERTAIN PLANAR DIRECTED NETWORKS
        H NAGAMOCHI; T IBARAKI
        DISCRETE APPLIED MATHEMATICS, May 1990, Peer-reviewed
      • 組合せ最適化におけるTardosの新解法 (最近の数理計画特集)
        永持 仁
        システム・制御・情報, Apr. 1990, Peer-reviewed
      • Multiple graphs minimizing the number of minimum cut-sets, "jointly worked "
        永持 仁
        Trans. Inst. Electron. Inform. Comm. Eng. Jap,E73/6, 915-921, 1990, Peer-reviewed
      • Computing the edge-connectivity of multigraphs and capacitated graphs, "jointly worked "
        永持 仁
        Lecture Notes in Computer Science,V450, 12-20, 1990, Peer-reviewed
      • COMPUTING EDGE-CONNECTIVITY IN MULTIPLE AND CAPACITATED GRAPHS
        H NAGAMOCHI; T IBARAKI
        ALGORITHMS, 1990, Peer-reviewed
      • COMPUTING EDGE-CONNECTIVITY IN MULTIPLE AND CAPACITATED GRAPHS
        H NAGAMOCHI; T IBARAKI
        LECTURE NOTES IN COMPUTER SCIENCE, 1990, Peer-reviewed
      • 与えられた基数のカットセット数を最小にするグラフ
        永持 仁
        電子情報通信学会論文誌 A 基礎・境界, Oct. 1989, Peer-reviewed
      • ON MAX-FLOW MIN-CUT AND INTEGRAL FLOW PROPERTIES FOR MULTICOMMODITY FLOWS IN DIRECTED NETWORKS
        H NAGAMOCHI; T IBARAKI
        INFORMATION PROCESSING LETTERS, Jun. 1989, Peer-reviewed
      • ON MAX-FLOW MIN-CUT AND INTEGRAL FLOW PROPERTIES FOR MULTICOMMODITY FLOWS IN DIRECTED NETWORKS
        H NAGAMOCHI; T IBARAKI
        INFORMATION PROCESSING LETTERS, Jun. 1989, Peer-reviewed
      • 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, Peer-reviewed
      • ある種の平面有向ネットワーク上の多品種流問題に対する最大流ー最小カットの定理(共著)
        永持 仁
        電子情報通信学会誌,J71-A/1, 71-82, 1988, Peer-reviewed
      • ある種の平面有向ネットワーク上の多品種流問題の実行可能性判定法(共著)
        永持 仁
        電子情報通信学会誌,J71-A/3, 804-810, 1988, Peer-reviewed
      • 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, Peer-reviewed
      • ある種の平面有向ネットワーク上の多品種流問題について
        永持仁; 茨木俊秀; 長谷川利治
        電子情報通信学会論文誌 A, Feb. 1987, Peer-reviewed
      • 平面有向ネットワークのクラスCUに対する多品種流問題(共著)
        永持 仁
        電子情報通信学会誌,J71-A/9, 1328-1339, 1987, Peer-reviewed
      • Deterministic Õ(nm) time edge-splitting in undirected graphs, "jointly worked "
        永持 仁
        J. Combinatorial Optimization,1/1, 5-46, Peer-reviewed
      • Augmenting edge-connectivity over the entire range in Õ(nm) time, "jointly worked "
        永持 仁
        J. Algorithms,V30, 253-301, Peer-reviewed
      • 確率付きネットワーク上の期待最大流について(共著)
        永持 仁
        電子情報通信学会誌,J72-A/10, 1611-1620, Peer-reviewed

      Misc.

      • 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, Dec. 2018
      • A dynamic programming based algorithm for enumerating unlabeled unrooted trees
        増井 隆治; シュルベフスキ アレクサンダル; 永持 仁
        電子情報通信学会技術研究報告 = IEICE technical report : 信学技報, 18 Aug. 2017
      • Enumerating Naphthalene Isomers of Tree-like Chemical Graphs.
        Fei He; Akiyoshi Hanai; NAGAMOCHI Hiroshi; Tatsuya Akutsu
        BIOINFORMATICS, Feb. 2016, Peer-reviewed
      • 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, Peer-reviewed
      • Testing Full Outer-2-planarity in Linear Time
        Seok-Hee Hong; Hiroshi Nagamochi
        GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE, 2016, Peer-reviewed
      • A Polynomial-Space Exact Algorithm for TSP in Degree-6 Graphs
        N. Md Yunos; A. Shurbevski; NAGAMOCHI Hiroshi
        The 18th Japan Conference on Discrete and Computational Geometry and Graphs, Sep. 2015, Peer-reviewed
      • A Polynomial-Space Exact Algorithm for TSP in Degree-5 Graphs
        N. Md Yunos; A. Shurbevski; NAGAMOCHI Hiroshi
        The 12th International Symposium on Operations Research and its Applications in Engineering, Technology and Management, Aug. 2015, Peer-reviewed
      • A Method for Generating Colorings over Graph Automorphism
        Fei He; NAGAMOCHI Hiroshi
        he 12th International Symposium on Operations Research and its Applications in Engineering, Technology and Management, Aug. 2015, Peer-reviewed
      • An Improved Algorithm for Parameterized Edge Dominating Set Problem.
        Ken Iwaide; Hiroshi Nagamochi
        WALCOM 2015:, 2015, Peer-reviewed
      • サイクル上の忌避型施設配置ゲームにおける,3-候補地もしくは4-候補地の戦略耐性メカニズム (最適化の基礎理論と応用)
        井原 謙; 永持 仁
        数理解析研究所講究録, Apr. 2014
      • Approximating the Bipartite TSP and Its Biased Generalization
        Aleksandar Shurbevski; Hiroshi Nagamochi; Yoshiyuki Karuno
        ALGORITHMS AND COMPUTATION, WALCOM 2014, 2014, Peer-reviewed
      • Complexity and Kernels for Bipartition into Degree-bounded Induced Graphs
        Mingyu Xiao; Hiroshi Nagamochi
        ALGORITHMS AND COMPUTATION, ISAAC 2014, 2014, Peer-reviewed
      • Simpler Algorithms for Testing Two-Page Book Embedding of Partitioned Graphs
        Seok-Hee Hong; Hiroshi Nagamochi
        COMPUTING AND COMBINATORICS, COCOON 2014, 2014, Peer-reviewed
      • Breadth-first Search Approach to Enumeration of Tree-like Chemical Compounds
        Yang Zhao; Morihiro Hayashida; Jira Jindalertudomdee; Hiroshi Nagamochi; Tatsuya Akutsu
        IPSJ SIG technical reports, 04 Dec. 2013
      • Breadth-first Search Approach to Enumeration of Tree-like Chemical Compounds
        Yang Zhao; Morihiro Hayashida; Jira Jindalertudomdee; Hiroshi Nagamochi; Tatsuya Akutsu
        IPSJ SIG Notes, 04 Dec. 2013
      • 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, Peer-reviewed
      • Exact Algorithms for Maximum Independent Set
        Mingyu Xiao; Hiroshi Nagamochi
        ALGORITHMS AND COMPUTATION, 2013, Peer-reviewed
      • 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, Peer-reviewed
      • 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, Peer-reviewed
      • 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, 01 Sep. 2012
      • An Algorithm for the Next-to-Shortest Path in Undirected Planar Graphs
        ZHANG Cong; NAGAMOCHI Hiroshi
        IEICE technical report. Theoretical foundations of Computing, 14 Jun. 2012
      • Submodular minimization via pathwidth
        H. Nagamochi
        Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2012, Peer-reviewed
      • Linear Layouts in Submodular Systems
        Hiroshi Nagamochi
        ALGORITHMS AND COMPUTATION, ISAAC 2012, 2012, Peer-reviewed
      • 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, Peer-reviewed
      • 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, Peer-reviewed
      • 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, Peer-reviewed
      • 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, Peer-reviewed
      • Enumerating tree-like chemical graphs with given upper and lower bounds on path frequencies
        Masaaki Shimizu; Hiroshi Nagamochi; Tatsuya Akutsu
        BMC BIOINFORMATICS, Dec. 2011, Peer-reviewed
      • 1-D-1 Algorithms for Covering Digraphs by Length-Bounded Walks
        SEJIMA Kenji; FUKUNAGA Takuro; NAGAMOCHI Hiroshi
        日本オペレーションズ・リサーチ学会秋季研究発表会アブストラクト集, 13 Sep. 2011
      • 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)., Sep. 2011, Peer-reviewed
      • 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, Apr. 2011, Peer-reviewed
      • Construction of Visual Classifier by Edge Crossing Minimization (The evolution of optimization models and algorithms)
        Haraguchi Kazuya; Hong Seok-Hee; Nagamochi Hiroshi
        RIMS Kokyuroku, Feb. 2011
      • Accelerating A* algorithms by sweeping out small-degree nodes
        Liang Zhao; Pipaporn Eumthurapojn; Hiroshi Nagamochi
        研究報告アルゴリズム(AL), Feb. 2011
      • 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, Peer-reviewed
      • 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, Peer-reviewed
      • 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, Peer-reviewed
      • Further Improvement on Maximum Independent Set in Degree-4 Graphs
        Mingyu Xiao; Hiroshi Nagamochi
        COMBINATORIAL OPTIMIZATION AND APPLICATIONS, 2011, Peer-reviewed
      • Improved Bounds for Minimum Fault-Tolerant Gossip Graphs
        Toru Hasunuma; Hiroshi Nagamochi
        GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE, 2011, Peer-reviewed
      • Multiclass Visual Classifier Based on Bipartite Graph Representation of Decision Tables
        Kazuya Haraguchi; Seok-Hee Hong; Hiroshi Nagamochi
        LEARNING AND INTELLIGENT OPTIMIZATION, 2010, Peer-reviewed
      • 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, Peer-reviewed
      • FPTAS's for Some Cut Problems in Weighted Trees
        Mingyu Xiao; Takuro Fukunaga; Hiroshi Nagamochi
        FRONTIERS IN ALGORITHMICS, 2010, Peer-reviewed
      • 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, Peer-reviewed
      • 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, Peer-reviewed
      • 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, 04 Jul. 2009, Peer-reviewed
      • Classification by Ordering Data Samples (Acceleration and Visualization of Computation for Enumeration Problems)
        Haraguchi Kazuya; Hong Seok-Hee; Nagamochi Hiroshi
        RIMS Kokyuroku, Apr. 2009
      • DS-1-5 An Efficient Algorithm for Large-scale Beacon Placement Problem
        Gim Jaeseong; Sasaki Masahiro; Zhao Liang; Nagamochi Hiroshi
        Proceedings of the IEICE General Conference, Mar. 2009
      • Upward Star-Shaped Polyhedral Graphs
        Seok-Hee Hong; Hiroshi Nagamochi
        ALGORITHMS AND COMPUTATION, PROCEEDINGS, 2009, Peer-reviewed
      • Worst Case Analysis for Pickup and Delivery Problems with Consecutive Pickups and Deliveries
        Yoshitaka Nakao; Hiroshi Nagamochi
        ALGORITHMS AND COMPUTATION, PROCEEDINGS, 2009, Peer-reviewed
      • Cop-Robber Guarding Game with Cycle Robber Region
        Hiroshi Nagamochi
        FRONTIERS IN ALGORITHMICS, PROCEEDINGS, 2009, Peer-reviewed
      • Minmax Tree Cover in the Euclidean Space
        Seigo Karakawa; Ehab Morsy; Hiroshi Nagamochi
        WALCOM: ALGORITHMS AND COMPUTATION, PROCEEDINGS, 2009, Peer-reviewed
      • Removing Node Overlaps Using Multi-sphere Scheme
        Takashi Imamichi; Yohei Arahori; Jaeseong Gim; Seok-Hee Hong; Hiroshi Nagamochi
        GRAPH DRAWING, 2009, Peer-reviewed
      • Divide-and-Conquer Algorithms for Partitioning Hypergraphs and Submodular Systems
        Kazumasa Okumoto; Takuro Fukunaga; Hiroshi Nagamochi
        ALGORITHMS AND COMPUTATION, PROCEEDINGS, 2009, Peer-reviewed
      • 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, Peer-reviewed
      • 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, Peer-reviewed
      • 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, Peer-reviewed
      • 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, Peer-reviewed
      • One-dimensional cutting stock problem for a paper tube industry
        S. Umetani; K. Matsumoto; Hiroshi Nagamochi
        The 6th ESICUP Meeting, 2009, Peer-reviewed
      • 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, Peer-reviewed
      • 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, Peer-reviewed
      • Enumerating Stereoisomers of Tree Structured Molecules Using Dynamic Programming
        Tomoki Imada; Shunsuke Ota; Hiroshi Nagamochi; Tatsuya Akutsu
        ALGORITHMS AND COMPUTATION, PROCEEDINGS, 2009, Peer-reviewed
      • Bipartite Graph Representation of Multiple Decision Table Classifiers
        Kazuya Haraguchi; Seok-Hee Hong; Hiroshi Nagamochi
        STOCHASTIC ALGORITHMS: FOUNDATIONS AND APPLICATIONS, PROCEEDINGS, 2009, Peer-reviewed
      • Star-shaped drawings of graphs with fixed embedding and concave corner constraints
        Seok-Hee Hong; Hiroshi Nagamochi
        COMPUTING AND COMBINATORICS, PROCEEDINGS, 2008, Peer-reviewed
      • Approximating crossing minimization in radial layouts
        Seok-Hee Hong; Hiroshi Nagamochi
        LATIN 2008: THEORETICAL INFORMATICS, 2008, Peer-reviewed
      • 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, Peer-reviewed
      • 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, Peer-reviewed
      • 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, Peer-reviewed
      • 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, Peer-reviewed
      • Approximating the generalized capacitated tree-routing problem
        Ehab Morsy; Hiroshi Nagamochi
        COMPUTING AND COMBINATORICS, PROCEEDINGS, 2008, Peer-reviewed
      • 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, Peer-reviewed
      • 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, Peer-reviewed
      • Designing algorithms with multi-sphere scheme
        Takashi Imamichi; Hiroshi Nagamochi
        INTERNATIONAL CONFERENCE ON INFORMATICS EDUCATION AND RESEARCH FOR KNOWLEDGE-CIRCULATING SOCIETY, PROCEEDINGS, 2008, Peer-reviewed
      • 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, Peer-reviewed
      • Robust Cost Colorings
        Takuro Fukunaga; Magnus M. Halldorsson; Hiroshi Nagamochi
        PROCEEDINGS OF THE NINETEENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2008, Peer-reviewed
      • On the construction of the minimum depth tree for P2P system
        三輪 直樹; 趙 亮; 永持 仁
        ITE technical report, Sep. 2007
      • "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, Peer-reviewed
      • Minimum degree orderings
        Hiroshi Nagamochi
        ALGORITHMS AND COMPUTATION, 2007, Peer-reviewed
      • Star-shaped drawings of planar graphs
        S.-H. Hong; Hiroshi Nagamochi
        18th International Workshop on Combinatorial Algorithms,, 2007, Peer-reviewed
      • 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, Peer-reviewed
      • 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, Peer-reviewed
      • 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, Peer-reviewed
      • 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, Peer-reviewed
      • 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, Peer-reviewed
      • Packing sets of circles with shape-memory,
        T. Imamichi; Hiroshi Nagamochi
        INFORMS International Puerto Rico 2007, 2007, Peer-reviewed
      • The set connector problems in graphs
        T. Fukunaga; Hiroshi Nagamochi
        The Twelfth Conference on Integer Programming and Combinatorial Optimization, IPCO 2007,, 2007, Peer-reviewed
      • 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, Peer-reviewed
      • 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, Peer-reviewed
      • Approximating capacitated tree-routings in networks
        Ehab Morsy; Hiroshi Nagamochi
        THEORY AND APPLICATIONS OF MODELS OF COMPUTATION, PROCEEDINGS, 2007, Peer-reviewed
      • 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, Peer-reviewed
      • Extension of ICF classifiers to real world data sets
        Kazuya Haraguchi; Hiroshi Nagamochi
        NEW TRENDS IN APPLIED ARTIFICIAL INTELLIGENCE, PROCEEDINGS, 2007, Peer-reviewed
      • 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, Peer-reviewed
      • 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, Peer-reviewed
      • Orthogonal drawings for plane graphs with specified face areas
        Akifumi Kawaguchi; Hiroshi Nagamochi
        THEORY AND APPLICATIONS OF MODELS OF COMPUTATION, PROCEEDINGS, 2007, Peer-reviewed
      • 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, Peer-reviewed
      • A novel clustering method for analysis of biological networks using maximal components of graphs
        HAYASHIDA Morihiro; AKUTSU Tatsuya; NAGAMOCHI Hiroshi
        IPSJ SIG technical reports, 15 Sep. 2006
      • 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, 18 Jul. 2006, Peer-reviewed
      • 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, 18 Jul. 2006, Peer-reviewed
      • 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, 18 Jul. 2006, Peer-reviewed
      • 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, 18 Jul. 2006, Peer-reviewed
      • Some theorems on detachments preserving local-edge-connectivity
        T. Fukunaga; Hiroshi Nagamochi
        Fifth CRACOW Conference on Graph Theory (USTRON '06), CCGT, 2006, Peer-reviewed
      • A detachment algorithm for inferring a graph from path frequency
        Hiroshi Nagamochi
        COMPUTING AND COMBINATORICS, PROCEEDINGS, 2006, Peer-reviewed
      • Network design with edge-connectivity and degree constraints
        Takuro Fukunaga; Hiroshi Nagamochi
        APPROXIMATION AND ONLINE ALGORITHMS, 2006, Peer-reviewed
      • 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, Peer-reviewed
      • 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, Peer-reviewed
      • Contention-free λ-planes in optically burst-switched WDM networks
        Kouji Hirata; Takahiro Matsuda; Hiroshi Nagamochi; Tetsuya Takine
        GLOBECOM - IEEE Global Telecommunications Conference, 2006, Peer-reviewed
      • Minimum transversals in posi-modular systems
        M. Sakashita; K. Makino; Hiroshi Nagamochi; S. Fujishige
        ESA 2006, 14th Annual European Symposium on Algorithms, 2006, Peer-reviewed
      • Convex drawings of hierarchical plane graphs
        S.-H. Hong; Hiroshi Nagamochi
        17th Australasian Workshop on Combinatorial Algorithms (AWOCA 2006), 2006, Peer-reviewed
      • 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, Peer-reviewed
      • Convex drawings with non-convex boundary,
        S.-H. Hong; Hiroshi Nagamochi
        32nd International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2006), 2006, Peer-reviewed
      • Contention-free λ-planes in optically burst-switched WDM networks
        Kouji Hirata; Takahiro Matsuda; Hiroshi Nagamochi; Tetsuya Takine
        GLOBECOM - IEEE Global Telecommunications Conference, 2006, Peer-reviewed
      • 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, Peer-reviewed
      • 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, Peer-reviewed
      • 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, Peer-reviewed
      • Heuristics for the Minmax Subtree Cover in Graphs
        Hiroshi Nagamochi
        The IFORS Triennial 2005 Conference,, 2005, Peer-reviewed
      • The relation between option pricing and optimization problems
        M. Nishihara; M. Yagiura; Toshihide Ibaraki; Hiroshi Nagamochi
        The IFORS Triennial 2005 Conference,, 2005, Peer-reviewed
      • 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, Peer-reviewed
      • 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, Peer-reviewed
      • 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, Peer-reviewed
      • 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, Peer-reviewed
      • 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, Peer-reviewed
      • Bisecting a four-connected graph with three resource sets
        T Ishii; K Iwata; H Nagamochi
        ALGORITHMS AND COMPUTATION, 2005, Peer-reviewed
      • 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, Peer-reviewed
      • Bisecting a four-connected graph with three resource sets
        T Ishii; K Iwata; H Nagamochi
        ALGORITHMS AND COMPUTATION, 2005, Peer-reviewed
      • Approximation algorithms for the b-edge dominating set problem and its related problems
        T Fukunaga; H Nagamochi
        COMPUTING AND COMBINATORICS, PROCEEDINGS, 2005, Peer-reviewed
      • Approximating the minmax subtree cover problem in a cactus
        H Nagamochi; T Kawada
        ALGORITHMS AND COMPUTATION, 2004, Peer-reviewed
      • 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, Apr. 2003, Peer-reviewed
      • Convex drawing for c-planar biconnected clustered graphs
        Hiroshi Nagamochi; K. Kuroya
        The 11th International Symposium on Graph Drawing (GD2003), 2003, Peer-reviewed
      • An improved approximation to the one-sided bilayer drawing
        Hiroshi Nagamochi
        The 11th International Symposium on Graph Drawing (GD2003), 2003, Peer-reviewed
      • Fast algorithms for counting bilayer crossings
        Hiroshi Nagamochi; N. Yamada
        7th Japan-Korea Joint Workshop on Algorithms and Computation, pp.203-209., 2003, Peer-reviewed
      • 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, Peer-reviewed
      • Computing extreme sets in graphs and its applications
        永持 仁
        the 3rd Hungarian-Japanese Symposium on Discrete Mathematics and Its Applications,/ , 349-357, 2003, Peer-reviewed
      • Can a hypergraph cover every convex polygon?, "jointly worked "
        永持 仁
        the 3rd Hungarian-Japanese Symposium on Discrete Mathematics and Its Applications,/ , 293-302, 2003, Peer-reviewed
      • A simple recognition of maximal planar graphs, "jointly worked "
        永持 仁
        Proceedings of the 7th Japan-Korea Joint Workshop on Algorithms and Computation,/ , 182-188, 2003, Peer-reviewed
      • 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, Peer-reviewed
      • Augmenting forests to meet odd diameter requirements
        T Ishii; S Yamamoto; H Nagamochi
        ALGORITHMS AND COMPUTATION, PROCEEDINGS, 2003, Peer-reviewed
      • A better approximation for the two-machine flowshop scheduling problem with time lags
        Y Karuno; H Nagamochi
        ALGORITHMS AND COMPUTATION, PROCEEDINGS, 2003, Peer-reviewed
      • An approximation algorithm for dissecting a rectangle into rectangles with specified areas
        H Nagamochi; Y Abe
        ALGORITHMS AND COMPUTATION, PROCEEDINGS, 2003, Peer-reviewed
      • Polynomial time 2-approximation algorithms for the minmax subtree cover problem
        H Nagamochi; K Okada
        ALGORITHMS AND COMPUTATION, PROCEEDINGS, 2003, Peer-reviewed
      • Comparing hypergraphs by areas of hyperedges drawn on a convex polygon
        H Ito; H Nagamochi
        DISCRETE AND COMPUTATIONAL GEOMETRY, 2002, Peer-reviewed
      • File transfer tree problems
        H Ito; H Nagamochi; Y Sugiyama; M Fujita
        ALGORITHMS AND COMPUTATION, PROCEEDINGS, 2002, Peer-reviewed
      • Greedy Splitting : A Unified Approach for Approximating Some Partition Problems (Mathematical Optimization Theory and its Algorithm)
        Zhao Liang; Nagamochi Hiroshi; Ibaraki Toshihide
        RIMS Kokyuroku, Dec. 2001
      • Digital Halftoning : Optimization via Network Flow Algorithm
        ASANO Tetsuo; KATOH Naoki; MATSUI Tomomi; NAGAMOCHI Hiroshi; OBOKATA Koji; TOKUYAMA Takeshi
        IEICE technical report. Theoretical foundations of Computing, 18 Jun. 2001
      • A Primal-Dual Approximation Algorithm for the Survivable Network Design Problem in Hypergraphs (New Developments of Theory of Computation and Algorithms)
        Zhao Liang; Nagamochi Hiroshi; Ibaraki Toshihide
        RIMS Kokyuroku, May 2001
      • Digital Halftoning : Formulation as a Combinatorial Optimization Problem and Approximation Algorithms Based on Network Flow (Algorithm Engineering as a New Paradigm)
        Asano Tetsuo; Fujikawa Naoki; Katoh Naoki; Matsui Tomomi; Nagamochi Hiroshi; Tokuyama Takeshi; Usui Nobuaki
        RIMS Kokyuroku, Jan. 2001
      • 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, Peer-reviewed
      • 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, Peer-reviewed
      • 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, Peer-reviewed
      • On the minimum local-vertex-connectivity augmentation in graphs
        H Nagamochi; T Ishii
        ALGORITHMS AND COMPUTATION, PROCEEDINGS, 2001, Peer-reviewed
      • 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, Peer-reviewed
      • Augmenting a Submodular and Posi-modular Set Function by a Multigraph
        Hiroshi Nagamochi; Takashi Shiraki; Toshihide Ibaraki
        Journal of Combinatorial Optimization, 2001, Peer-reviewed
      • A 2-Approximation Algorithm for the Edge Dominating Set Problem
        Fujito Toshihiro; Nagamochi Hiroshi
        IEICE technical report. Theoretical foundations of Computing, 22 Mar. 2000
      • 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, Peer-reviewed
      • 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, Peer-reviewed
      • 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, Peer-reviewed
      • 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, Peer-reviewed
      • 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, Peer-reviewed
      • 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, Peer-reviewed
      • 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, Peer-reviewed
      • A fast algorithm for computing minimum 3-way and 4-way cuts
        H Nagamochi; T Ibaraki
        INTEGER PROGRAMMING AND COMBINATORIAL OPTIMIZATION, 1999, Peer-reviewed
      • 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, Peer-reviewed
      • Optical Path Assignment Problem for Torus Lightwave Networks
        MIKI Shigeo; NAKAHIRA Yoshihiro; NAGAMOCHI Hiroshi; SUNAHARA Hideki; OIE Yuji
        電気学会研究会資料. CMN, 通信研究会, 21 Feb. 1997
      • 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, Peer-reviewed
      • Combinatorial optimization games
        Xiaotie Deng; Toshihide Ibaraki; Hiroshi Nagamochi
        Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, 1997, Peer-reviewed
      • 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, Peer-reviewed
      • 光波ネットワークのノート"再配置アルコ"リズムについて
        嘉藤 学; 河北 隆二; 永持 仁; 尾家 祐二
        電子情報通信学会技術研究報告, Dec. 1995
      • アルゴリズム辞典(共著)
        永持 仁
        共立出版,, 1995, Peer-reviewed
      • 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, Peer-reviewed
      • 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

      Books and Other Publications

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

      Awards

      • 1990
        情報処理学会, 研究賞
      • 1990
        情報処理学会, 研究賞(アルゴリズム研究会)
      • 1998
        電子情報通信学会, 論文賞
      • 1998
        電子情報通信学会, 論文賞
      • 1999
        電子情報通信学会, 論文賞
      • 2000
        第14回 日本IBM科学賞(コンピューターサインス分野)
      • 2006
        文献賞日本オペレーションズ・リサーチ学会, 文献賞
      • 2006
        スケジューリング学会, 学会賞 (学術賞)
      • 2010
        電子情報通信学会, 業績賞

      External funds: Kakenhi

      • グラフ構造に対する実用的な最適化・列挙アルゴリズムの理論設計と実装開発
        Grant-in-Aid for Scientific Research (C)
        Basic Section 60020:Mathematical informatics-related
        Kyoto University
        永持 仁
        From 01 Apr. 2020, To 31 Mar. 2023, Granted
        離散最適化;グラフ理論;アルゴリズム;整数計画法;動的計画法;グラフ・ネットワーク;計算量
      • Analysis and Applications of Discrete Preimage Problems
        Grant-in-Aid for Scientific Research (A)
        Medium-sized Section 61:Human informatics and related fields
        Kyoto University
        阿久津 達也
        From 01 Apr. 2018, To 31 Mar. 2023, Granted
        逆問題;グラフアルゴリズム;特徴ベクトル;ニューラルネットワーク;バイオインフォマティクス
      • Design of Algorithms for Discrete Optimization Based on Graph-Theoretical Methods
        Grant-in-Aid for Scientific Research (C)
        Kyoto University
        Hiroshi NAGAMOCHI
        From 01 Apr. 2017, To 31 Mar. 2020, Project Closed
        アルゴリズム;離散最適化;グラフ;データマイニング;NP-困難;グラフ描画;人工ニューラルネットワーク;機械学習;グラフ理論;ネットワーク;計算量;近似アルゴリズム;経路探索;ゲーム理論;情報工学;高速コンピューティング;数理計画;最適化
      • Design Theory and Implementation of Fast Algorithms to Graph Optimization
        Grant-in-Aid for Scientific Research (C)
        Kyoto University
        Nagamochi Hiroshi
        From 01 Apr. 2014, To 31 Mar. 2017, Project Closed
        情報工学;アルゴリズム;高速コンピューティング;数理計画;最適化;グラフ理論;計算量;ネットワーク構造;離散最適化;グラフ描画;スケジューリング
      • An Approach to Novel Structure Design by Combining Discrete Methods and Statistical Methods
        Grant-in-Aid for Scientific Research (A)
        Kyoto University
        Tatsuya AKUTSU
        From 01 Apr. 2014, To 31 Mar. 2019, Project Closed
        ケモインフォマティクス;構造列挙;グラフアルゴリズム;カーネル法;生物情報ネットワーク;化学構造;特徴ベクトル;ヶモインフォマティクス;グラフ列挙
      • Algorithm design techniques based on transformation into network structure
        Grant-in-Aid for Scientific Research (C)
        Kyoto University
        Hiroshi NAGAMOCHI
        From 28 Apr. 2011, To 31 Mar. 2014, Project Closed
        数理工学;計算機科学;グラフ理論;離散最適化;厳密解法;計算量解析;近似解法;アルゴリズム;列挙法
      • A Novel Learning Method That Highlights the Order Relation between Data Examples
        Grant-in-Aid for Young Scientists (B)
        Ishinomaki Senshu University
        Kazuya HARAGUCHI
        From 01 Apr. 2010, To 31 Mar. 2013, Project Closed
        計算論的学習理論;機械学習;人工知能;アルゴリズム;グラフ理論;半順序集合
      • An Approach to Novel Structural Design by Combining Discrete Methods and Kernel Methods
        Grant-in-Aid for Scientific Research (A)
        Kyoto University
        Tatsuya AKUTSU
        From 01 Apr. 2010, To 31 Mar. 2015, Project Closed
        特徴ベクトル;カーネル法;化学構造;グラフ理論;立体異性体;構造列挙;木構造;異性体;ベンゼン環;構造比較;外平面的グラフ
      • A Novel Learning Method Based on Combinatorial Feature of Data
        Grant-in-Aid for Young Scientists (Start-up)
        Ishinomaki Senshu University
        Kazuya HARAGUCHI
        Project Closed
        アルゴリズム;機械学習;情報可視化;人工知能
      • Construction of Plat-form Models for the Problemof Packing Geometrical Objects
        Grant-in-Aid for Scientific Research (C)
        Kyoto University
        Hiroshi NAGAMOCHI
        Project Closed
        可視化;詰め込み問題;パッキング;アルゴリズム;最適化;機械学習;グラフ描;準ニュートン法;離散最適化;配置問題;グラフ描画;ルーティング問題;近似解法;計算幾何学;組合せ最適;図形配置;データ構造;非線形最適化;情報可視化
      • New Methods for Designing Chemical Structures Using Graph Theory and Kernel Methods
        Grant-in-Aid for Scientific Research (A)
        Kyoto University
        Tatsuya AKUTSU
        Project Closed
        カーネル法;グラフアルゴリズム;特徴ベクトル;サポートベクターマシン;列挙アルゴリズム;動的計画法;ケモインフォマティクス;グラフ理論;RNA二次構造;タンパク質立体構造;化学構造;立体異性体;木構造;外平面的グラフ;構造活性相関;光学異性体;外平面グラフ
      • Analysis of properties on the connectivity of graphs and networks and its applications to design of algorithms
        Grant-in-Aid for Scientific Research (C)
        Kyoto University
        Hiroshi NAGAMOCHI
        Project Closed
        アルゴリズム;応用数学;数理工学;情報基礎;グラフ理論;ネットワーク;近似アルゴリズム;連結特性;ネットワーク設計;連結度;最小カット;グラフ分割;グラフの直径;グラフ増大問題, Algorithm;Applied Mathematics;Mathematical Engineering;Fundamentals of Informatics;Graph Theory;Network;Approximation Algorithm;Connectivity
      • Design of Approximation Algorithms for the Problems with Grapth Structure
        Grant-in-Aid for Scientific Research on Priority Areas
        Science and Engineering
        Kyoto University
        Hiroshi NAGAMOCHI
        Project Closed
        グラフアルゴリズム;連結度;ネットワーク設計;最適化;配送スケジューリング;近似アルゴリズム;パッキング;グラフ描画;離散最適化;グラフ連結度;図形パッキング;ファイアウォール高速化;最長路問題;スケジューリング;部分木被覆;パッキング問題;グラフのランキング;分枝限定法;ミニマックス問題;最小カット;グラフ分割;機械スケジューリング
      • Construction of Approximation Algorithms Based on Graph Theory and Its Application to Network Problems
        Grant-in-Aid for Scientific Research (C)
        Kyoto University;Toyohashi University of Technology
        Hiroshi NAGAMOCHI
        Project Closed
        グラフ連結度;多項式アルゴリズム;近似アルゴリズム;ネットワーク問題;最大流問題;点連結度;枝連結度;最大隣接順序;スケジューリング問題;矩形分割問題;供給点配置問題;連結度増大問題;耐故障性;ネットワークトポロジー;グラフ理論;ネットワーク設計;スケジューリングアルゴリズム;最適化アルゴリズム;NP-困難性;連結度;データ構造, graph connectivity;polynomial algorithm;approximation algorithm;network problem;maximum flow problem;vertex connectivity;edge connectivity;maximum adjacency order
      • Development of algorithms for solving graph/network problems
        Grant-in-Aid for Scientific Research on Priority Areas (B)
        Toyohashi University of Technology (TUT);Kyoto University
        Hiroshi NAGAMOCHI
        Project Closed
        グラフアルゴリズム;最小カット;連結度;組合せ最適化;組合せ最適化ゲーム;グラフ分割;近似アルゴリズム;連結度増大;離散最適化;ネットワーク問題;最小カット問題;協力ゲーム;グラフ連結度;劣モジュール関数;アルゴリズム;グラフ・ネットワーク;最適化;劣モジュラ関数, graph algorithm;minimum cut;connectivity;combinatorial optimization;combinatorial optimization game;graph partition;approximation algorithm;connectivity augmentation
      • 組合せ構造を持つ問題を解くアルゴリズムの研究
        Grant-in-Aid for Encouragement of Young Scientists (A)
        Kyoto University
        永持 仁
        Project Closed
        グラフ・ネットワーク;アルゴリズム;連結度;グラフ分割;最小カット;スケジューリング;劣モジュラ関数;最適化;ゲーム理論;最大フロー
      • Logical Analysis of Data and Knowledge Acquisition
        Grant-in-Aid for international Scientific Research
        KYOTO UNIVESITY
        Toshihide IBARAKI
        Project Closed
        データの論理的解析;知識獲得;データマイニング;知識発見;ブール関数, Logical Analysis of Data;Knowledge Aquisition;Data Mining;Knowldge Discovery;Booleam functions
      • 組合せ構造を持つ問題に対するアルゴリズムの開発
        Grant-in-Aid for Encouragement of Young Scientists (A)
        Kyoto University
        永持 仁
        Project Closed
        algorithm;graph;connectivity;minimum cut;edge splitting;angmenting problem;polynemial time;network
      • Studies on combinatorial algorithms as problem solving engine
        Grant-in-Aid for Scientific Research (A)
        KYOTO UNIVERSITY
        Toshihide IBARAKI
        Project Closed
        問題解決エンジン;メタヒューリスティクス;CSP(制約充足問題);組合せ最適化;組合せアルゴリズム;タブ-探索;制約充足問題;一般化割当問題;問題解決;組合セアルゴリズム;メタ・ヒューリスティックス, problem solving engine;metaheuristics;CSP (constraint satisfaction problem);combinatorial optimization
      • 離散構造を有する問題を解くアルゴリズムの研究
        Grant-in-Aid for Encouragement of Young Scientists (A)
        Kyoto University
        永持 仁
        Project Closed
        グラフ;ネットワーク;アルゴリズム;多項式時間;カット;フロー;パス;連結度
      • ネットワーク構造を有する問題に対するアルゴリズムの開発
        Grant-in-Aid for Encouragement of Young Scientists (A)
        Kyoto University
        永持 仁
        Project Closed
        network flow;minimum cut;polynomial algorithm;network reliability;connectivity;graph
      • Logical analysis and optimization of distributed systems
        Grant-in-Aid for international Scientific Research
        KYOTO UNIVERSITY
        Toshihide IBARAKI
        Project Closed
        分散システム;論理的解析;最適化;ブール関数;コテリ;プール関数, distributed systems;logical analysis;optimization;Boolean function;coterie
      • Study on largescale combinatorial optimization problems by graph-network
        Grant-in-Aid for General Scientific Research (B)
        KYOTO UNIVERSITY
        Toshihide IBARAKI
        Project Closed
        グラフ;ネットワーク;組合せ最適化;メタ・ヒューリスティックス;遺伝アルゴリズム;メタ・ヒューリスティック;グラフ・ネットワーク;最適化;アルゴリズム;近似アルゴリズム, graphs;networks;combinatorial optimization;metaheuristics;genetic algorithms
      • Distributed algorithms for database management, control and recovery
        Grant-in-Aid for international Scientific Research
        Kyoto University
        Toshihide IBARAKI
        Project Closed
        分散データベース;分散アルゴリズム;コテリー;グラフ・ネットワーク;最小カット;並行処理アルゴリズム;非線形最適化;分散デ-タベ-ス;排他制御;コテリ-;グラフの連結性;ブ-ル代数, Distributed databases;Distributed algorithms;Coteries;Graphs and networks;Minimum cut;Concurrency control;Nonlinear optimization
      • Studies on parallel algorithms for mathematical programming
        Grant-in-Aid for General Scientific Research (C)
        Kyoto University
        Masao FUKUSHIMA
        Project Closed
        数理計画;並列アルゴリズム;最適化;分解法, Mathematical Programming;parallel algorithm;optimization
      • Applications of Optimization Techniques to Problems in Information Science
        Grant-in-Aid for General Scientific Research (B)
        KYOTO UNIVERSITY
        Toshihide IBARAKI
        Project Closed
        最適化;アルゴリズム;分散システム;グラフ・ネットワーク;非線形システム;演繹データベース;確率システム;分散アルゴリズム;オンラインアルゴリズム;ネットワークの分割;スケジューリング;ネットワ-ク;グラフ理論;計算の複雑さ;情報学的諸問題;VLSI最適設計;演繹デ-タベ-ス;スケジュ-リング理論, Optimization;Algorithm;Distributed Systems;Graphs. Networks;Nonlinear Systems;Deductive Databases;Probabilistic Systems

      External funds: others

      • Algorithms for Discrete optimization
      • Development of Efficient Algorithms for Network Problems
        From 1988
      list
        Last Updated :2022/05/14

        Education

        Teaching subject(s)

        • From Apr. 2011, To Mar. 2012
          グラフ理論(数理)
          Spring, 工学部
        • From Apr. 2011, To Mar. 2012
          離散数理特論
          Fall, 情報学研究科
        • From Apr. 2011, To Mar. 2012
          数理工学特別研究1
          Year-long, 情報学研究科
        • From Apr. 2011, To Mar. 2012
          数理工学特別研究1
          Spring, 情報学研究科
        • From Apr. 2011, To Mar. 2012
          数理工学特別研究1
          Fall, 情報学研究科
        • From Apr. 2011, To Mar. 2012
          数理工学特別研究2
          Year-long, 情報学研究科
        • From Apr. 2011, To Mar. 2012
          数理工学特別研究2
          Fall, 情報学研究科
        • From Apr. 2011, To Mar. 2012
          数理工学特別セミナー
          Year-long, 情報学研究科
        • From Apr. 2011, To Mar. 2012
          応用数学特別セミナー
          Fall, 情報学研究科
        • From Apr. 2011, To Mar. 2012
          数理工学概論
          Spring, 工学部
        • From Apr. 2011, To Mar. 2012
          Optimization
          Fall, 経営管理教育部
        • From Apr. 2011, To Mar. 2012
          最適化(数理)
          Fall, 工学部
        • From Apr. 2011, To Mar. 2012
          計画数学通論
          Fall, 情報学研究科
        • From Apr. 2012, To Mar. 2013
          Seminar on Applied Mathematics, Advanced
          Fall, 情報学研究科
        • From Apr. 2012, To Mar. 2013
          Seminar on Applied Mathematics and Physics, Advanced
          Year-long, 情報学研究科
        • From Apr. 2012, To Mar. 2013
          Advanced Study in Applied Mathematics and Physics II
          Year-long, 情報学研究科
        • From Apr. 2012, To Mar. 2013
          Advanced Study in Applied Mathematics and Physics II
          Fall, 情報学研究科
        • From Apr. 2012, To Mar. 2013
          Advanced Study in Applied Mathematics and Physics II
          Year-long, 情報学研究科
        • From Apr. 2012, To Mar. 2013
          Advanced Study in Applied Mathematics and Physics I
          Spring, 情報学研究科
        • From Apr. 2012, To Mar. 2013
          Advanced Study in Applied Mathematics and Physics I
          Fall, 情報学研究科
        • From Apr. 2012, To Mar. 2013
          Advanced Study in Applied Mathematics and Physics I
          Year-long, 情報学研究科
        • From Apr. 2012, To Mar. 2013
          English for Mathematical Science
          Fall, 工学部
        • From Apr. 2012, To Mar. 2013
          Optimization
          Fall, 工学部
        • From Apr. 2012, To Mar. 2013
          Optimization
          Fall, 経営管理教育部
        • From Apr. 2012, To Mar. 2013
          Graph Theory
          Spring, 工学部
        • From Apr. 2012, To Mar. 2013
          Scientific English
          Fall, 全学共通科目
        • From Apr. 2012, To Mar. 2013
          Operations Research, Advanced
          Fall, 情報学研究科
        • From Apr. 2012, To Mar. 2013
          Discrete Mathematics, Advanced
          Fall, 情報学研究科
        • From Apr. 2013, To Mar. 2014
          Graph Theory
          Spring, 工学部
        • From Apr. 2013, To Mar. 2014
          Optimization
          Fall, 工学部
        • From Apr. 2013, To Mar. 2014
          English for Mathematical Science
          Fall, 工学部
        • From Apr. 2013, To Mar. 2014
          Discrete Mathematics, Advanced
          Fall, 情報学研究科
        • From Apr. 2013, To Mar. 2014
          Advanced Study in Applied Mathematics and Physics I
          Year-long, 情報学研究科
        • From Apr. 2013, To Mar. 2014
          Advanced Study in Applied Mathematics and Physics II
          Year-long, 情報学研究科
        • From Apr. 2013, To Mar. 2014
          Seminar on Applied Mathematics and Physics, Advanced
          Year-long, 情報学研究科
        • From Apr. 2013, To Mar. 2014
          Seminar on Applied Mathematics, Advanced
          Fall, 情報学研究科
        • From Apr. 2013, To Mar. 2014
          Optimization
          Fall, 経営管理教育部
        • From Apr. 2013, To Mar. 2014
          Scientific English
          Fall, 全学共通科目
        • From Apr. 2014, To Mar. 2015
          Graph Theory
          Spring, 工学部
        • From Apr. 2014, To Mar. 2015
          Optimization
          Fall, 工学部
        • From Apr. 2014, To Mar. 2015
          English for Mathematical Science
          Fall, 工学部
        • From Apr. 2014, To Mar. 2015
          Discrete Mathematics, Advanced
          Fall, 情報学研究科
        • From Apr. 2014, To Mar. 2015
          Operations Research, Advanced
          Fall, 情報学研究科
        • From Apr. 2014, To Mar. 2015
          Advanced Study in Applied Mathematics and Physics I
          Year-long, 情報学研究科
        • From Apr. 2014, To Mar. 2015
          Advanced Study in Applied Mathematics and Physics II
          Year-long, 情報学研究科
        • From Apr. 2014, To Mar. 2015
          Seminar on Applied Mathematics and Physics, Advanced
          Year-long, 情報学研究科
        • From Apr. 2014, To Mar. 2015
          Seminar on Applied Mathematics, Advanced
          Fall, 情報学研究科
        • From Apr. 2014, To Mar. 2015
          Optimization
          Fall, 経営管理教育部
        • From Apr. 2014, To Mar. 2015
          Scientific English
          Fall, 全学共通科目
        • From Apr. 2014, To Mar. 2015
          Graduation Thesis 1
          Spring, 工学部
        • From Apr. 2014, To Mar. 2015
          Graduation Thesis 1
          Fall, 工学部
        • From Apr. 2014, To Mar. 2015
          Graduation Thesis 2
          Spring, 工学部
        • From Apr. 2014, To Mar. 2015
          Graduation Thesis 2
          Fall, 工学部
        • From Apr. 2015, To Mar. 2016
          Seminar on Applied Mathematics, Advanced
          Fall, 情報学研究科
        • From Apr. 2015, To Mar. 2016
          Seminar on Applied Mathematics and Physics, Advanced
          Year-long, 情報学研究科
        • From Apr. 2015, To Mar. 2016
          Advanced Study in Applied Mathematics and Physics II
          Year-long, 情報学研究科
        • From Apr. 2015, To Mar. 2016
          Advanced Study in Applied Mathematics and Physics I
          Year-long, 情報学研究科
        • From Apr. 2015, To Mar. 2016
          Optimization
          Fall, 工学部
        • From Apr. 2015, To Mar. 2016
          Optimization
          Fall, 経営管理教育部
        • From Apr. 2015, To Mar. 2016
          Graph Theory
          Spring, 工学部
        • From Apr. 2015, To Mar. 2016
          Discrete Mathematics, Advanced
          Fall, 情報学研究科
        • From Apr. 2016, To Mar. 2017
          Seminar on Applied Mathematics, Advanced
          Fall, 情報学研究科
        • From Apr. 2016, To Mar. 2017
          Seminar on Applied Mathematics and Physics, Advanced
          Year-long, 情報学研究科
        • From Apr. 2016, To Mar. 2017
          Advanced Study in Applied Mathematics and Physics II
          Year-long, 情報学研究科
        • From Apr. 2016, To Mar. 2017
          Advanced Study in Applied Mathematics and Physics I
          Year-long, 情報学研究科
        • From Apr. 2016, To Mar. 2017
          Optimization
          Fall, 工学部
        • From Apr. 2016, To Mar. 2017
          Optimization
          Fall, 経営管理教育部
        • From Apr. 2016, To Mar. 2017
          Graph Theory
          Spring, 工学部
        • From Apr. 2016, To Mar. 2017
          Operations Research, Advanced
          Fall, 情報学研究科
        • From Apr. 2016, To Mar. 2017
          Discrete Mathematics, Advanced
          Fall, 情報学研究科
        • From Apr. 2017, To Mar. 2018
          Seminar on Applied Mathematics, Advanced
          Fall, 情報学研究科
        • From Apr. 2017, To Mar. 2018
          Seminar on Applied Mathematics and Physics, Advanced
          Year-long, 情報学研究科
        • From Apr. 2017, To Mar. 2018
          Advanced Study in Applied Mathematics and Physics II
          Year-long, 情報学研究科
        • From Apr. 2017, To Mar. 2018
          Advanced Study in Applied Mathematics and Physics I
          Year-long, 情報学研究科
        • From Apr. 2017, To Mar. 2018
          Optimization
          Fall, 工学部
        • From Apr. 2017, To Mar. 2018
          Optimization
          Fall, 経営管理教育部
        • From Apr. 2017, To Mar. 2018
          Graph Theory
          Spring, 工学部
        • From Apr. 2017, To Mar. 2018
          Operations Research, Advanced
          Fall, 情報学研究科
        • From Apr. 2017, To Mar. 2018
          Discrete Mathematics, Advanced
          Fall, 情報学研究科
        • From Apr. 2018, To Mar. 2019
          Optimization
          Fall, 工学部
        • From Apr. 2018, To Mar. 2019
          Optimization
          Fall, 経営管理教育部
        • From Apr. 2018, To Mar. 2019
          Graph Theory
          Spring, 工学部
        • From Apr. 2018, To Mar. 2019
          Operations Research, Advanced
          Fall, 情報学研究科
        • From Apr. 2018, To Mar. 2019
          Discrete Mathematics, Advanced
          Fall, 情報学研究科
        • From Apr. 2019, To Mar. 2020
          Optimization
          Fall, 工学部
        • From Apr. 2019, To Mar. 2020
          Optimization
          Fall, 経営管理教育部
        • From Apr. 2019, To Mar. 2020
          Graph Theory
          Spring, 工学部
        • From Apr. 2019, To Mar. 2020
          Operations Research, Advanced
          Fall, 情報学研究科
        • From Apr. 2019, To Mar. 2020
          Seminar in Discrete Mathematics
          Year-long, 情報学研究科
        • From Apr. 2019, To Mar. 2020
          Discrete Mathematics, Advanced
          Fall, 情報学研究科
        • From Apr. 2020, To Mar. 2021
          Optimization
          Fall, 経営管理教育部
        • From Apr. 2020, To Mar. 2021
          Optimization
          Fall, 工学部
        • From Apr. 2020, To Mar. 2021
          Graph Theory
          Spring, 工学部
        • From Apr. 2020, To Mar. 2021
          Operations Research, Advanced
          Fall, 情報学研究科
        • From Apr. 2020, To Mar. 2021
          Seminar in Discrete Mathematics
          Fall, 情報学研究科
        • From Apr. 2020, To Mar. 2021
          Discrete Mathematics, Advanced
          Fall, 情報学研究科
        • From Apr. 2021, To Mar. 2022
          Optimization
          Fall, 経営管理教育部
        • From Apr. 2021, To Mar. 2022
          Optimization
          Fall, 工学部
        • From Apr. 2021, To Mar. 2022
          Graph Theory
          Spring, 工学部
        • From Apr. 2021, To Mar. 2022
          Seminar in Discrete Mathematics
          Fall, 情報学研究科
        • From Apr. 2021, To Mar. 2022
          Discrete Mathematics, Advanced
          Fall, 情報学研究科
        list
          Last Updated :2022/05/14

          Administration

          School management (title, position)

          • From 01 Apr. 2009, To 31 Mar. 2010
            発明評価委員会(ソフトウェア・コンテンツ分野拠点) 委員
          • From 01 Apr. 2010, To 31 Mar. 2011
            発明評価委員会(メディカル・バイオ分野拠点) 委員
          • From 01 Apr. 2010, To 31 Mar. 2011
            ジュニアキャンパス実施検討会 委員
          • From 01 Apr. 2010, To 31 Mar. 2014
            ジュニアキャンパス実施検討会
          • From 01 Apr. 2012, To 31 Mar. 2014
            ジュニアキャンパス実施検討会
          • From 01 Jul. 2013, To 30 Jun. 2015
            国際交流委員会 委員
          • From 01 Apr. 2014, To 31 Mar. 2016
            ジュニアキャンパス実施検討会 委員
          • From 01 Apr. 2010, To 31 Mar. 2016
            ジュニアキャンパス実施検討会 委員

          Faculty management (title, position)

          • From 01 Apr. 2011, To 31 Mar. 2012
            専攻長会議
          • From 01 Apr. 2011, To 31 Mar. 2012
            情報セキュリティ委員委員
          • From 01 Apr. 2012, To 31 Mar. 2015
            企画委員会委員
          • From 01 Apr. 2015, To 31 Mar. 2016
            評価・広報委員会委員
          • From 01 Apr. 2016, To 31 Mar. 2017
            評価・広報委員会副委員長
          • From 01 Apr. 2017, To 31 Mar. 2018
            専攻長会議
          • From 01 Apr. 2017, To 31 Mar. 2018
            制規委員会委員
          • From 01 Apr. 2017, To 31 Mar. 2018
            情報セキュリティ委員会委員
          • From 01 Apr. 2018, To 31 Mar. 2019
            評価・広報委員会委員
          • From 01 Apr. 2018, To 31 Mar. 2020
            工学研究科・工学部広報委員会委員
          • From 01 Apr. 2019, To 31 Mar. 2020
            評価・広報委員会委員
          • From 01 Apr. 2020, To 31 Mar. 2021
            企画委員会委員
          • From 01 Apr. 2021, To 31 Mar. 2022
            制規委員会委員
          • From 01 Apr. 2021, To 31 Mar. 2022
            専攻長
          • From 01 Apr. 2021, To 31 Mar. 2022
            情報セキュリティ委員会委員

          ページ上部へ戻る