World's Best Scientists 2026 revealed!
Hiroshi Nagamochi

Hiroshi Nagamochi

D-Index & Metrics

Mathematics

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

Computer Science

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

Hiroshi Nagamochi publication distribution in Mathematics in 2026

The chart shows the distribution of publications by all Research.com ranked scientists in the field of Mathematics in 2026. The highlighted bar marks where Hiroshi Nagamochi sits on this spectrum.

42–46 publications: 3 scientists 47–51 publications: 5 scientists 52–56 publications: 7 scientists 57–61 publications: 20 scientists 62–66 publications: 14 scientists 67–71 publications: 25 scientists 72–76 publications: 19 scientists 77–81 publications: 35 scientists 82–86 publications: 50 scientists 87–91 publications: 60 scientists 92–96 publications: 86 scientists 97–101 publications: 84 scientists 102–106 publications: 83 scientists 107–111 publications: 90 scientists 112–116 publications: 99 scientists 117–121 publications: 90 scientists 122–126 publications: 91 scientists 127–131 publications: 109 scientists 132–136 publications: 110 scientists 137–141 publications: 98 scientists 142–146 publications: 112 scientists 147–151 publications: 102 scientists 152–156 publications: 88 scientists 157–161 publications: 106 scientists 162–166 publications: 83 scientists 167–171 publications: 102 scientists 172–176 publications: 77 scientists 177–181 publications: 81 scientists 182–186 publications: 78 scientists 187–191 publications: 71 scientists 192–196 publications: 92 scientists 197–201 publications: 64 scientists 202–206 publications: 69 scientists 207–211 publications: 64 scientists 212–216 publications: 62 scientists 217–221 publications: 58 scientists 222–226 publications: 53 scientists 227–231 publications: 50 scientists 232–236 publications: 46 scientists 237–241 publications: 46 scientists 242–246 publications: 46 scientists 247–251 publications: 43 scientists 252–256 publications: 29 scientists 257–261 publications: 45 scientists 262–266 publications: 30 scientists 267–271 publications: 33 scientists 272–276 publications: 34 scientists 277–281 publications: 30 scientists 282–286 publications: 31 scientists 287–291 publications: 21 scientists 292–296 publications: 34 scientists 297–301 publications: 26 scientists 302–306 publications: 10 scientists 307–311 publications: 17 scientists 312–316 publications: 23 scientists 317–321 publications: 13 scientists 322–326 publications: 16 scientists 327–331 publications: 26 scientists 332–336 publications: 13 scientists 337–341 publications: 13 scientists 342–346 publications: 16 scientists 347–351 publications: 17 scientists 352–356 publications: 12 scientists 357–361 publications: 18 scientists 362–366 publications: 18 scientists 367–371 publications: 9 scientists 372–376 publications: 11 scientists 377–381 publications: 8 scientists 382–386 publications: 8 scientists 387–391 publications: 9 scientists 392–396 publications: 9 scientists 397–401 publications: 8 scientists 402–406 publications: 11 scientists 407–411 publications: 6 scientists 412–416 publications: 6 scientists 417–421 publications: 9 scientists 422–426 publications: 8 scientists 427–431 publications: 5 scientists 432–436 publications: 8 scientists 437–441 publications: 8 scientists 442–446 publications: 4 scientists 447–451 publications: 4 scientists 452–456 publications: 4 scientists 457–461 publications: 2 scientists 462–466 publications: 2 scientists 467–471 publications: 4 scientists 472–476 publications: 3 scientists 477–481 publications: 3 scientists 482–486 publications: 6 scientists 487–491 publications: 3 scientists 492–496 publications: 5 scientists 497–501 publications: 5 scientists 502–506 publications: 1 scientists 507–511 publications: 6 scientists 512–516 publications: 4 scientists 517–521 publications: 1 scientists 522–526 publications: 3 scientists 527–531 publications: 1 scientists 532–536 publications: 4 scientists 537+ publications: 100 scientists
42 publications 537+

This scientist: 428 publications — 95th percentile

95% of scientists in this discipline score the same or lower.

The last bar groups every scientist with 537 publications or more.

Hiroshi Nagamochi D-index placement in Mathematics in 2026

The chart shows the D-index (discipline H-index) distribution of Mathematics scientists ranked by Research.com in 2026. The highlighted bar marks where Hiroshi Nagamochi sits on this spectrum.

30 D-Index: 174 scientists 31 D-Index: 151 scientists 32 D-Index: 174 scientists 33 D-Index: 117 scientists 34 D-Index: 136 scientists 35 D-Index: 127 scientists 36 D-Index: 145 scientists 37 D-Index: 153 scientists 38 D-Index: 150 scientists 39 D-Index: 150 scientists 40 D-Index: 138 scientists 41 D-Index: 136 scientists 42 D-Index: 93 scientists 43 D-Index: 108 scientists 44 D-Index: 115 scientists 45 D-Index: 112 scientists 46 D-Index: 103 scientists 47 D-Index: 75 scientists 48 D-Index: 59 scientists 49 D-Index: 67 scientists 50 D-Index: 60 scientists 51 D-Index: 57 scientists 52 D-Index: 59 scientists 53 D-Index: 62 scientists 54 D-Index: 60 scientists 55 D-Index: 50 scientists 56 D-Index: 42 scientists 57 D-Index: 54 scientists 58 D-Index: 50 scientists 59 D-Index: 42 scientists 60 D-Index: 41 scientists 61 D-Index: 35 scientists 62 D-Index: 40 scientists 63 D-Index: 21 scientists 64 D-Index: 31 scientists 65 D-Index: 27 scientists 66 D-Index: 29 scientists 67 D-Index: 19 scientists 68 D-Index: 25 scientists 69 D-Index: 17 scientists 70 D-Index: 18 scientists 71 D-Index: 12 scientists 72 D-Index: 14 scientists 73 D-Index: 13 scientists 74 D-Index: 18 scientists 75 D-Index: 9 scientists 76 D-Index: 11 scientists 77 D-Index: 10 scientists 78 D-Index: 9 scientists 79 D-Index: 16 scientists 80 D-Index: 12 scientists 81 D-Index: 10 scientists 82 D-Index: 5 scientists 83 D-Index: 5 scientists 84 D-Index: 13 scientists 85 D-Index: 6 scientists 86+ D-Index: 99 scientists
30 D-Index 86+

This scientist: 32 D-Index — 14th percentile

14% of scientists in this discipline score the same or lower.

The last bar groups every scientist with 86 D-Index or more.

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