World's Best Scientists 2026 revealed!
Hiroshi Nagamochi

Hiroshi Nagamochi

D-Index & Metrics

Computer Science

D-Index
32
Citations
6317
World Ranking
12951
National Ranking
210

Mathematics

D-Index
32
Citations
6235
World Ranking
3133
National Ranking
52

Overview

Hiroshi Nagamochi is affiliated with Kyoto University in Japan. Their research primarily spans the field of Computer Science, with a focus on Computational Theory and Mathematics. The scientist's work also intersects with Materials Chemistry, Molecular Biology, Control and Systems Engineering, and Spectroscopy.

The main topics of Nagamochi's research include:

  • Computational Drug Discovery Methods
  • Machine Learning in Materials Science
  • Advanced Graph Theory Research
  • Analytical Chemistry and Chromatography
  • Process Optimization and Integration
  • Complexity and Algorithms in Graphs
  • Chemistry and Chemical Engineering

Recent publications by Nagamochi and collaborators reflect these interests. Examples include:

  • "A Novel Method for Inference of Chemical Compounds of Cycle Index Two with Desired Properties Based on Artificial Neural Networks and Integer Programming" (2020), published in Algorithms
  • "An Inverse QSAR Method Based on a Two-Layered Model and Integer Programming" (2021), published in International Journal of Molecular Sciences
  • "A novel method for inference of acyclic chemical compounds with bounded branch-height based on artificial neural networks and integer programming" (2021), published in Algorithms for Molecular Biology
  • "Characterizing Star-PCGs" (2020), published in Algorithmica
  • "A novel method for inference of chemical compounds with prescribed topological substructures based on integer programming" (2020), published on arXiv (Cornell University)

Nagamochi's frequent coauthors include:

  • Tatsuya Akutsu
  • Naveed Ahmed Azam
  • Jianshen Zhu
  • Kazuya Haraguchi
  • Aleksandar Shurbevski

The scientist's publications commonly appear in venues such as:

  • arXiv (Cornell University)
  • IEEE/ACM Transactions on Computational Biology and Bioinformatics
  • Algorithmica
  • Entropy
  • Theoretical Computer Science

Best Publications

  • Computing edge-connectivity in multigraphs and capacitated graphs

    Hiroshi Nagamochi;Toshihide Ibaraki

  • A linear-time algorithm for finding a sparse k -connected spanning subgraph of a k -connected graph

    Hiroshi Nagamochi;Toshihide Ibaraki

  • Exact algorithms for maximum independent set

    Mingyu Xiao;Hiroshi Nagamochi

  • Algorithmic Aspects of the Core of Combinatorial Optimization Games

    Xiaotie Deng;Toshihide Ibaraki;Hiroshi Nagamochi

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

    Mitsutoshi Kenmochi;Takashi Imamichi;Koji Nonobe;Mutsunori Yagiura

  • Straight-Line Drawing Algorithms for Hierarchical Graphs and Clustered Graphs

    Peter Eades;Qing-Wen Feng;Xuemin Lin

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

    Takashi Imamichi;Mutsunori Yagiura;Hiroshi Nagamochi

  • Algorithmic Aspects of Graph Connectivity

    Hiroshi Nagamochi;Toshihide Ibaraki

  • Straight-Line Drawing Algorithms for Hierarchical Graphs and Clustered Graphs

    Peter Eades;Qingwen Feng;Xuemin Lin;Hiroshi Nagamochi

  • Computing All Small Cuts in an Undirected Network

    Hiroshi Nagamochi;Kazuhiro Nishimura;Toshihide Ibaraki

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

    Toshihiro Fujito;Hiroshi Nagamochi

  • Greedy splitting algorithms for approximating multiway partition problems

    Liang Zhao;Hiroshi Nagamochi;Toshihide Ibaraki

  • Implementing an efficient minimum capacity cut algorithm

    Hiroshi Nagamochi;Tadashi Ono;Toshihide Ibaraki

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

    Hiroshi Nagamochi;Toshihide Ibaraki

  • Enumerating treelike chemical graphs with given path frequency.

    Hiroki Fujiwara;Jiexun Wang;Liang Zhao;Hiroshi Nagamochi

  • Vehicle scheduling on a tree with release and handling times

    Yoshiyuki Karuno;Hiroshi Nagamochi;Toshihide Ibaraki

  • Totally balanced combinatorial optimization games

    Xiaotie Deng;Toshihide Ibaraki;Hiroshi Nagamochi;Wenan Zang

  • Independent spanning trees with small depths in iterated line digraphs

    Toru Hasunuma;Hiroshi Nagamochi

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

    Yoshiyuki Karuno;Hiroshi Nagamochi

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

    Hiroshi Nagamochi;Toshihide Ibaraki

  • Graph connectivity and its augmentation: applications of MA orderings

    Hiroshi Nagamochi;Toshihide Ibaraki

  • On sparse subgraphs preserving connectivity properties

    András Frank;Toshihide Ibaraki;Hiroshi Nagamochi

Frequent Co-Authors

Toshihide Ibaraki
Toshihide Ibaraki Kyoto College of Graduate Studies for Informatics
Tatsuya Akutsu
Tatsuya Akutsu Kyoto University
Xiaotie Deng
Xiaotie Deng Peking University
Peter Eades
Peter Eades University of Sydney
András Frank
András Frank Eötvös Loránd University
Naoki Katoh
Naoki Katoh University of Hyogo
Magnús M. Halldórsson
Magnús M. Halldórsson Reykjavík University
Satoru Fujishige
Satoru Fujishige Kyoto University
Osamu Watanabe
Osamu Watanabe Tokyo Institute of Technology
Masao Fukushima
Masao Fukushima Kyoto University

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

Pursuing Mathematics in the USA opens the door to various complementary online degrees and career options. Students often enhance their skill set with finance knowledge, making a master of finance online a popular choice. This degree helps merge quantitative skills with financial expertise, increasing job prospects in the financial sector.

For those interested in leadership roles, fast-tracked business education can be advantageous. The fastest mba programs online allow students to gain managerial knowledge efficiently, making it easier to transition into executive positions.

Marketing professionals who want to leverage data-driven strategies often opt for an affordable and practical route. The cheapest online marketing degree programs combine affordability with rewarding career outcomes, ideal for math graduates seeking diverse roles.

Additionally, pursuing a concise business degree can accelerate career growth. The cheapest 1 year online mba programs offer a limited timeframe without compromising on quality, perfect for professionals eager to advance quickly.

Best Scientists Citing Hiroshi Nagamochi

Trending Scientists

Recently Published Articles