2026 Takao Nishizeki: Mathematics Researcher – H-Index, Publications & Awards

Discipline name	D-Index	World Ranking	National Ranking	Publications	Citations
Mathematics	34	2861	46	281	7071
Computer Science	34	11975	183	293	7117

Takao Nishizeki 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 Takao Nishizeki sits on this spectrum.

42 publications 537+

This scientist: 281 publications — 83rd percentile

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

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

Takao Nishizeki 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 Takao Nishizeki sits on this spectrum.

30 D-Index 86+

This scientist: 34 D-Index — 21st percentile

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

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

Research.com Recognitions

1996 - ACM Fellow For contributions to the design and analysis of efficient algorithms for planar graphs, network flows and VLSI routing.
1995 - IEEE Fellow For contributions to graph algorithms with applications to physical design of electronic systems.

Overview

Takao Nishizeki is affiliated with Tohoku University in Japan, where their research contributions have focused on algorithm design and analysis. This affiliation situates them within a significant academic environment known for contributions to computer science and engineering disciplines.

Nishizeki's recognized expertise lies primarily in the design and analysis of efficient algorithms concerning planar graphs, network flows, and VLSI routing. They have made specific contributions to graph algorithms as applied to the physical design of electronic systems, indicating a cross-disciplinary impact involving both theoretical computer science and practical engineering applications.

Among their honors, Nishizeki was named an IEEE Fellow in 1995. This fellowship was awarded for advances in graph algorithms with practical applications in the design of electronic systems. The following year, in 1996, Nishizeki received the ACM Fellow distinction for contributions to efficient algorithm design in planar graphs, network flows, and VLSI routing.

While detailed data on recent papers, frequent co-authors, publication venues, book publications, and specific topics of study is not available, Nishizeki's career is marked by a focus on algorithms with relevance to electronic system design and graph theory. Their awards reflect a standing in the scientific community related to these themes.

Best Publications

Secret sharing scheme realizing general access structure

Mitsuru Ito;Akira Saito;Takao Nishizeki

1093
Citations
Arboricity and subgraph listing algorithms

Norishige Chiba;Takao Nishizeki

794
Citations
Planar Graphs: Theory and Algorithms

T. Nishizeki

521
Citations
Linear-time computability of combinatorial problems on series-parallel graphs

K. Takamizawa;T. Nishizeki;N. Saito

401
Citations
A linear algorithm for embedding planar graphs using PQ -trees

Norishige Chiba;Takao Nishizeki;Shigenobu Abe;Takao Ozawa

337
Citations
Drawing plane graphs nicely

Norishige Chiba;Kazunori Onoguchi;Takao Nishizeki

160
Citations
On the 1.1 edge-coloring of multigraphs

Takao Nishizeki;Kenichi Kashiwagi

151
Citations
NP-Completeness of the Hamiltonian Cycle Problem for Bipartite Graphs

T. Akiyama;Takao Nishizeki;Nobuji Saito

138
Citations
The Hamiltonian cycle problem is linear-time solvable for 4-connected planar graphs

N. Chiba;T. Nishizeki

137
Citations
Multiple assignment scheme for sharing secret

Mitsuru Ito;Akira Saito;Takao Nishizeki

130
Citations
Graph Theory and Algorithms

N. Saito;T. Nishizeki

126
Citations
Planar Graph Drawing

Unknown

126
Citations
The edge-disjoint path problem is NP-complete for series-parallel graphs

Takao Nishizeki;Jens Vygen;Xiao Zhou

99
Citations
Algorithms for routing around a rectangle

András Frank;Takao Nishizeki;Nobuji Saito;Hitoshi Suzuki

93
Citations
Lower bounds on the cardinality of the maximum matchings of planar graphs

Takao Nishizeki;Ilker Baybars

81
Citations
A better than “best possible” algorithm to edge color multigraphs

Dorit S Hochbaum;Takao Nishizeki;David B Shmoys

75
Citations
A Linear Algorithm for Bend-Optimal Orthogonal Drawings of Triconnected Cubic Plane Graphs

Md. Saidur Rahman;Shin-Ichi Nakano;Takao Nishizeki

72
Citations
A linear algorithm for bipartition of biconnected graphs

H. Suzuki;N. Takahashi;T. Nishizeki

71
Citations
Edge-Coloring Partialk-Trees

Xiao Zhou;Shin-ichi Nakano;Takao Nishizeki

70
Citations
Rectangular grid drawings of plane graphs

Md. Saidur Rahman;Shin-Ichi Nakano;Takao Nishizeki

69
Citations
Handbook of Graph Theory, Combinatorial Optimization, and Algorithms

Krishnaiyan "Kt" Thulasiraman;Subramanian Arumugam;Andreas Brandstädt;Takao Nishizeki

39
Citations

Frequent Co-Authors

Toshihide Ibaraki Kyoto College of Graduate Studies for Informatics

Hiroshi Imai University of Tokyo

Kazuo Iwama Kyoto University

Motoji Ohmori Panasonic (Japan)

Masafumi Yamashita Kyushu University

Takeaki Uno National Institute of Informatics

Kurt Mehlhorn Max Planck Institute for Informatics

Masaru Kitsuregawa University of Tokyo

Paul Seymour Princeton University

Marek Chrobak University of California, Riverside

External Links

Wikipedia of Takao Nishizeki Personal website of Takao Nishizeki Google Scholar page

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

Related Online Degrees & Career Pathways

For students studying Mathematics in the USA, exploring related online degrees can open diverse career pathways. Many professionals combine their mathematical skills with business knowledge by pursuing an 1 year MBA programs. These accelerated options offer a quick transition into management roles without compromising academic quality.

When considering further education, it's important to know if you can seamlessly continue your studies. Fortunately, many institutions offer flexible pathways where can you transfer MBA programs credits to reduce redundant coursework and save time and money.

Another complementary avenue is pursuing a data analytics masters programs. These programs align well with mathematical foundations and prepare graduates for in-demand roles in data-driven industries, providing strong job market relevance.

For those seeking accessible options, many students look into the easiest MBA available online. These programs offer flexible admissions criteria, making graduate education more attainable without sacrificing essential business acumen.