World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

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

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

Recently Published Articles