Necessary and sufficient conditions for a graph to be three-terminal series-parallel-cascade. - Takao Nishizeki; Nobuji Saito (J. Comb. Theory B, 1978)

An efficient algorithm to find a Hamiltonian circuit in a 4-connected maximal planar graph. - Takao Asano; Shunji Kikuchi; Nobuji Saito (Graph Theory and Algorithms, 1980)

A linear algorithm for five-coloring a planar graph. - Norishige Chiba; Takao Nishizeki; Nobuji Saito (Graph Theory and Algorithms, 1980)

An algorithm for finding a short closed spanning walk in a graph. - K. Takamizawa; Takao Nishizeki; Nobuji Saito (Networks, 1980)

Combinatorial problems on series-parallel graphs. - K. Takamizawa; Takao Nishizeki; Nobuji Saito (Discret. Appl. Math., 1981)

A Linear 5-Coloring Algorithm of Planar Graphs. - Norishige Chiba; Takao Nishizeki; Nobuji Saito (J. Algorithms, 1981)

The smallest 2-connected cubic bipartite planar nonhamiltonian graph. - Takao Asano; Nobuji Saito; Geoffrey Exoo; Frank Harary (Discret. Math., 1982)

Linear-time computability of combinatorial problems on series-parallel graphs. - K. Takamizawa; Takao Nishizeki; Nobuji Saito (J. ACM, 1982)

An Approximation Algorithm for the Maximum Independent Set Problem on Planar Graphs. - Norishige Chiba; Takao Nishizeki; Nobuji Saito (SIAM J. Comput., 1982)

An algorithm for finding a large independent set in planar graphs. - Norishige Chiba; Takao Nishizeki; Nobuji Saito (Networks, 1983)

A linear algorithm for finding Hamiltonian cycles in 4-connected maximal planar graphs. - Takao Asano; Shunji Kikuchi; Nobuji Saito (Discret. Appl. Math., 1984)

A Note on the Critical Problem for Matroids. - Takao Asano; Takao Nishizeki; Nobuji Saito; James G. Oxley (Eur. J. Comb., 1984)

Multicommodity Flows in Planar Undirected Graphs and Shortest Paths - Hitoshi Suzuki; Takao Nishizeki; Nobuji Saito (STOC, 1985)

Lower Bounds for Combinatorial Problems on Graphs. - Hiroyuki Nakayama; Takao Nishizeki; Nobuji Saito (J. Algorithms, 1985)

An Efficient Algorithm for Finding Multicommodity Flows in Planar Networks. - Kazuhiko Matsumoto; Takao Nishizeki; Nobuji Saito (SIAM J. Comput., 1985)

A Linear-Time Routing Algorithm for Convex Grids. - Takao Nishizeki; Nobuji Saito; Kiminobu Suzuki (IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 1985)

Planar Multicommodity Flows, Maximum Matchings and Negative Cycles. - Kazuhiko Matsumoto; Takao Nishizeki; Nobuji Saito (SIAM J. Comput., 1986)

Algorithms for Multicommodity Flows in Planar Graphs. - Hitoshi Suzuki; Takao Nishizeki; Nobuji Saito (Algorithmica, 1989)

On the fg-coloring of graphs. - Shin-Ichi Nakano; Takao Nishizeki; Nobuji Saito (Comb., 1990)

Algorithms for Routing around a Rectangle. - András Frank; Takao Nishizeki; Nobuji Saito; Hitoshi Suzuki; Éva Tardos (Discret. Appl. Math., 1992)

A growth model having the abilities of growth-regulations for simulating visual nature of botanical trees. - Norishige Chiba; Ken Ohshida; Kazunobu Muraoka; Mamoru Miura; Nobuji Saito (Comput. Graph., 1994)

Visual simulation of water currents using a particle-based behavioural model. - Norishige Chiba; Shinji Sanakanishi; Kenichiro Yokoyama; Isao Otawara; Kazunobu Muraoka; Nobuji Saito (Comput. Animat. Virtual Worlds, 1995)

Visual Simulation of Leaf Arrangement and Autumn Colours. - Norishige Chiba; Ken Ohshida; Kazunobu Muraoka; Nobuji Saito (Comput. Animat. Virtual Worlds, 1996)