World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
33
Citations
5740
World Ranking
12523
National Ranking
197

Naoki Katoh publication distribution in Computer Science in 2026

The chart shows the distribution of publications by all Research.com ranked scientists in the field of Computer Science in 2026. The highlighted bar marks where Naoki Katoh sits on this spectrum.

32–41 publications: 7 scientists 42–51 publications: 22 scientists 52–61 publications: 82 scientists 62–71 publications: 134 scientists 72–81 publications: 250 scientists 82–91 publications: 324 scientists 92–101 publications: 421 scientists 102–111 publications: 420 scientists 112–121 publications: 497 scientists 122–131 publications: 544 scientists 132–141 publications: 555 scientists 142–151 publications: 609 scientists 152–161 publications: 560 scientists 162–171 publications: 534 scientists 172–181 publications: 556 scientists 182–191 publications: 583 scientists 192–201 publications: 519 scientists 202–211 publications: 508 scientists 212–221 publications: 490 scientists 222–231 publications: 437 scientists 232–241 publications: 424 scientists 242–251 publications: 408 scientists 252–261 publications: 378 scientists 262–271 publications: 300 scientists 272–281 publications: 335 scientists 282–291 publications: 320 scientists 292–301 publications: 293 scientists 302–311 publications: 250 scientists 312–321 publications: 238 scientists 322–331 publications: 206 scientists 332–341 publications: 209 scientists 342–351 publications: 208 scientists 352–361 publications: 162 scientists 362–371 publications: 176 scientists 372–381 publications: 127 scientists 382–391 publications: 158 scientists 392–401 publications: 128 scientists 402–411 publications: 104 scientists 412–421 publications: 94 scientists 422–431 publications: 99 scientists 432–441 publications: 83 scientists 442–451 publications: 108 scientists 452–461 publications: 73 scientists 462–471 publications: 77 scientists 472–481 publications: 69 scientists 482–491 publications: 84 scientists 492–501 publications: 62 scientists 502–511 publications: 54 scientists 512–521 publications: 57 scientists 522–531 publications: 51 scientists 532–541 publications: 51 scientists 542–551 publications: 32 scientists 552–561 publications: 38 scientists 562–571 publications: 28 scientists 572–581 publications: 43 scientists 582–591 publications: 33 scientists 592–601 publications: 41 scientists 602–611 publications: 32 scientists 612–621 publications: 28 scientists 622–631 publications: 25 scientists 632–641 publications: 27 scientists 642–651 publications: 17 scientists 652–661 publications: 20 scientists 662–671 publications: 17 scientists 672–681 publications: 15 scientists 682–691 publications: 14 scientists 692–701 publications: 21 scientists 702–711 publications: 13 scientists 712–721 publications: 12 scientists 722–731 publications: 19 scientists 732–741 publications: 14 scientists 742–751 publications: 12 scientists 752–761 publications: 10 scientists 762–771 publications: 10 scientists 772–781 publications: 11 scientists 782–791 publications: 10 scientists 792–801 publications: 11 scientists 802–811 publications: 8 scientists 812–821 publications: 8 scientists 822–831 publications: 7 scientists 832–841 publications: 11 scientists 842–851 publications: 10 scientists 852–861 publications: 5 scientists 862–871 publications: 9 scientists 872–881 publications: 4 scientists 882–891 publications: 6 scientists 892–901 publications: 3 scientists 902–911 publications: 6 scientists 912–921 publications: 3 scientists 922–931 publications: 2 scientists 932–941 publications: 2 scientists 942–951 publications: 2 scientists 952–961 publications: 3 scientists 962–971 publications: 3 scientists 972–981 publications: 3 scientists 982–990 publications: 5 scientists 991+ publications: 100 scientists
32 publications 991+

This scientist: 283 publications — 70th percentile

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

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

Naoki Katoh D-index placement in Computer Science in 2026

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

30–31 D-Index: 879 scientists 32–33 D-Index: 984 scientists 34–35 D-Index: 918 scientists 36–37 D-Index: 990 scientists 38–39 D-Index: 969 scientists 40–41 D-Index: 907 scientists 42–43 D-Index: 821 scientists 44–45 D-Index: 765 scientists 46–47 D-Index: 689 scientists 48–49 D-Index: 543 scientists 50–51 D-Index: 543 scientists 52–53 D-Index: 517 scientists 54–55 D-Index: 500 scientists 56–57 D-Index: 458 scientists 58–59 D-Index: 400 scientists 60–61 D-Index: 337 scientists 62–63 D-Index: 308 scientists 64–65 D-Index: 292 scientists 66–67 D-Index: 249 scientists 68–69 D-Index: 213 scientists 70–71 D-Index: 192 scientists 72–73 D-Index: 189 scientists 74–75 D-Index: 165 scientists 76–77 D-Index: 139 scientists 78–79 D-Index: 119 scientists 80–81 D-Index: 121 scientists 82–83 D-Index: 113 scientists 84–85 D-Index: 88 scientists 86–87 D-Index: 87 scientists 88–89 D-Index: 75 scientists 90–91 D-Index: 69 scientists 92–93 D-Index: 57 scientists 94–95 D-Index: 46 scientists 96–97 D-Index: 38 scientists 98–99 D-Index: 34 scientists 100–101 D-Index: 36 scientists 102–103 D-Index: 27 scientists 104–105 D-Index: 37 scientists 106–107 D-Index: 18 scientists 108–109 D-Index: 31 scientists 110–111 D-Index: 19 scientists 112–113 D-Index: 16 scientists 114–115 D-Index: 12 scientists 116–117 D-Index: 20 scientists 118–119 D-Index: 15 scientists 120–121 D-Index: 5 scientists 122–123 D-Index: 20 scientists 124–125 D-Index: 8 scientists 126–127 D-Index: 5 scientists 128–129 D-Index: 7 scientists 130 D-Index: 3 scientists 131+ D-Index: 98 scientists
30 D-Index 131+

This scientist: 33 D-Index — 13th percentile

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

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

Overview

Naoki Katoh is affiliated with the University of Hyogo in Japan, contributing to research primarily in computer science and engineering with additional work in business, management, and accounting. Their scholarly output spans diverse subfields including computational theory and mathematics, computer networks and communications, organizational behavior and human resource management, ocean engineering, and computer graphics and computer-aided design.

Their research prominently addresses topics such as facility location and emergency management, evacuation and crowd dynamics, computational geometry and mesh generation, advanced graph theory research, vehicle routing optimization methods, smart parking systems research, and complexity and algorithms in graphs.

Katoh has published extensively, with notable recent papers covering various algorithmic and optimization problems related to dynamic flow networks and geometric graphs. Selected recent publications include:

  • Almost Linear Time Algorithms for Minsum k-Sink Problems on Dynamic Flow Path Networks (2020, arXiv)
  • Efficient Algorithms and Edge Crossing Properties of Euclidean Minimum Weight Laman Graphs (2023, International Journal of Computer Mathematics Computer Systems Theory)
  • Almost Linear Time Algorithms for Minsum k-Sink Problems on Dynamic Flow Path Networks (2021, Theoretical Computer Science)
  • Minmax Regret 1-Sink Location Problems on Dynamic Flow Path Networks with Parametric Weights (2020, arXiv)
  • Locating Evacuation Centers Optimally in Path and Cycle Networks (2021, Leibniz-Zentrum für Informatik)

Frequent coauthors in Katoh's work include Yuya Higashikawa, Junichi Teruyama, Yuki Tokuni, Binhai Zhu, and Sergey Bereg.

Their research has been disseminated through several publication venues with a concentration on arXiv, where four papers appeared, Theoretical Computer Science publishing three, and additional papers appearing in the Journal of Combinatorial Optimization, International Journal of Computer Mathematics Computer Systems Theory, and the Leibniz-Zentrum für Informatik (Schloss Dagstuhl).

Best Publications

  • Resource Allocation Problems: Algorithmic Approaches

    Toshihide Ibaraki;Naoki Katoh

  • Applications of weighted Voronoi diagrams and randomization to variance-based k-clustering: (extended abstract)

    Mary Inaba;Naoki Katoh;Hiroshi Imai

  • An efficient algorithm for K shortest simple paths

    Naoki Katoh;Toshihide Ibaraki;Hisashi Mine

  • Resource Allocation Problems

    Naoki Katoh;Toshihide Ibaraki

  • Finding k points with minimum diameter and related problems

    Alok Aggarwal;Hiroshi Imai;Naoki Katoh;Subhash Suri

  • Parallel K-means Clustering Algorithm on NOWs

    Sanpawat Kantabutra;Alva L. Couch;Mary Inaba;Naoki Katoh

  • Semi-definite programming for topology optimization of trusses under multiple eigenvalue constraints

    M. Ohsaki;K. Fujisawa;N. Katoh;Y. Kanno

  • An Algorithm for Finding K Minimum Spanning Trees

    Naoki Katoh;Toshihide Ibaraki;Hisashi Mine

  • On-line computation of transitive closures of graphs☆

    Toshihide Ibaraki;Naoki Katoh

  • Polynomial-time solutions to image segmentation

    Tetsuo Asano;Danny Z. Chen;Naoki Katoh;Takeshi Tokuyama

  • A proof of the molecular conjecture

    Naoki Katoh;Shin-ichi Tanigawa

  • Algorithms and Computations

    John Staples;Peter Eades;Naoki Katoh;Alistair Moffat

  • Topology optimization of trusses with stress and local constraints on nodal stability and member intersection

    M. Ohsaki;N. Katoh

  • Triangulations intersect nicely

    O. Aichholzer;F. Aurenhammer;Siu-Wing Cheng;N. Katoh

  • Covering points in the plane by k-tours: towards a polynomial time approximation scheme for general k

    Tetsuo Asano;Naoki Katoh;Hisao Tamaki;Takeshi Tokuyama

  • Mining Pharmacy Data Helps to Make Profits

    Yukinobu Hamuro;Naoki Katoh;Yasuyuki Matsuda;Katsutoshi Yada

  • A Linear-Time Algorithm for Testing Outer-1-Planarity

    Seok-Hee Hong;Peter Eades;Naoki Katoh;Giuseppe Liotta

  • The Supported Solutions Used as a Genetic Information in a Population Heuristics

    Xavier Gandibleux;Hiroyuki Morita;Naoki Katoh

  • Group Symmetry in Interior-Point Methods for Semidefinite Program

    Yoshihiro Kanno;Makoto Ohsaki;Kazuo Murota;Kazuo Murota;Naoki Katoh

  • A Polynomial Time Algorithm for the Resource Allocation Problem with a Convex Objective Function

    N. Katoh;T. Ibaraki;H. Mine

  • A Proof of the Molecular Conjecture

    Naoki Katoh;Tanigawa Shin-ichi

Frequent Co-Authors

Toshihide Ibaraki
Toshihide Ibaraki Kyoto College of Graduate Studies for Informatics
David Avis
David Avis McGill University
Hiroshi Imai
Hiroshi Imai University of Tokyo
Peter Eades
Peter Eades University of Sydney
Danny Z. Chen
Danny Z. Chen University of Notre Dame
Giuseppe Liotta
Giuseppe Liotta University of Perugia
Kurt Mehlhorn
Kurt Mehlhorn Max Planck Institute for Informatics
Franz Aurenhammer
Franz Aurenhammer Graz University of Technology
Edward H. Ip
Edward H. Ip Wake Forest University
Kouhei Tsumoto
Kouhei Tsumoto University of Tokyo

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

If you’re interested in Computer Science, a variety of related online degrees can help you broaden your career prospects. Many students choose to enroll in an accelerated cs degree program to complete their education faster and enter the workforce sooner. These programs are designed for motivated learners seeking flexibility and speed.

For those passionate about sustainability and the environment, pursuing an environmental engineer degree online can open doors to meaningful, impactful careers. Similarly, those interested in design and innovation may explore the cheapest online mechanical engineering degree programs to gain technical skills in one of the most versatile engineering disciplines.

If your interests are more theoretical, studying the best online physics degree can provide a strong foundation in analytical thinking, problem-solving, and research. Each of these online pathways offers flexibility and accessibility, allowing you to study from anywhere while positioning yourself for diverse tech-focused careers.

Best Scientists Citing Naoki Katoh

Trending Scientists