Nobuji Saito

Publication Activity (10 Years)

Years Active: 1978-1996
Publications (10 Years): 0

Publications

Norishige Chiba, Ken Ohshida, Kazunobu Muraoka, Nobuji Saito
Visual Simulation of Leaf Arrangement and Autumn Colours. Comput. Animat. Virtual Worlds 7 (2) (1996)
Norishige Chiba, Shinji Sanakanishi, Kenichiro Yokoyama, Isao Otawara, Kazunobu Muraoka, Nobuji Saito
Visual simulation of water currents using a particle-based behavioural model. Comput. Animat. Virtual Worlds 6 (3) (1995)
Norishige Chiba, Ken Ohshida, Kazunobu Muraoka, Mamoru Miura, Nobuji Saito
A growth model having the abilities of growth-regulations for simulating visual nature of botanical trees. Comput. Graph. 18 (4) (1994)
András Frank, Takao Nishizeki, Nobuji Saito, Hitoshi Suzuki, Éva Tardos
Algorithms for Routing around a Rectangle. Discret. Appl. Math. 40 (4) (1992)
Shin-Ichi Nakano, Takao Nishizeki, Nobuji Saito
On the fg-coloring of graphs. Comb. 10 (1) (1990)
Hitoshi Suzuki, Takao Nishizeki, Nobuji Saito
Algorithms for Multicommodity Flows in Planar Graphs. Algorithmica 4 (4) (1989)
Kazuhiko Matsumoto, Takao Nishizeki, Nobuji Saito
Planar Multicommodity Flows, Maximum Matchings and Negative Cycles. SIAM J. Comput. 15 (2) (1986)
Kazuhiko Matsumoto, Takao Nishizeki, Nobuji Saito
An Efficient Algorithm for Finding Multicommodity Flows in Planar Networks. SIAM J. Comput. 14 (2) (1985)
Hitoshi Suzuki, Takao Nishizeki, Nobuji Saito
Multicommodity Flows in Planar Undirected Graphs and Shortest Paths STOC (1985)
Takao Nishizeki, Nobuji Saito, Kiminobu Suzuki
A Linear-Time Routing Algorithm for Convex Grids. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 4 (1) (1985)
Hiroyuki Nakayama, Takao Nishizeki, Nobuji Saito
Lower Bounds for Combinatorial Problems on Graphs. J. Algorithms 6 (3) (1985)
Takao Asano, Shunji Kikuchi, Nobuji Saito
A linear algorithm for finding Hamiltonian cycles in 4-connected maximal planar graphs. Discret. Appl. Math. 7 (1) (1984)
Takao Asano, Takao Nishizeki, Nobuji Saito, James G. Oxley
A Note on the Critical Problem for Matroids. Eur. J. Comb. 5 (2) (1984)
Norishige Chiba, Takao Nishizeki, Nobuji Saito
An algorithm for finding a large independent set in planar graphs. Networks 13 (2) (1983)
Takao Asano, Nobuji Saito, Geoffrey Exoo, Frank Harary
The smallest 2-connected cubic bipartite planar nonhamiltonian graph. Discret. Math. 38 (1) (1982)
Norishige Chiba, Takao Nishizeki, Nobuji Saito
An Approximation Algorithm for the Maximum Independent Set Problem on Planar Graphs. SIAM J. Comput. 11 (4) (1982)
K. Takamizawa, Takao Nishizeki, Nobuji Saito
Linear-time computability of combinatorial problems on series-parallel graphs. J. ACM 29 (3) (1982)
K. Takamizawa, Takao Nishizeki, Nobuji Saito
Combinatorial problems on series-parallel graphs. Discret. Appl. Math. 3 (1) (1981)
Norishige Chiba, Takao Nishizeki, Nobuji Saito
A Linear 5-Coloring Algorithm of Planar Graphs. J. Algorithms 2 (4) (1981)
K. Takamizawa, Takao Nishizeki, Nobuji Saito
An algorithm for finding a short closed spanning walk in a graph. Networks 10 (3) (1980)
K. Takamizawa, Takao Nishizeki, Nobuji Saito
Combinatorial problems on series-parallel graphs. Graph Theory and Algorithms (1980)
Takao Asano, Shunji Kikuchi, Nobuji Saito
An efficient algorithm to find a Hamiltonian circuit in a 4-connected maximal planar graph. Graph Theory and Algorithms (1980)
Norishige Chiba, Takao Nishizeki, Nobuji Saito
A linear algorithm for five-coloring a planar graph. Graph Theory and Algorithms (1980)
Takao Nishizeki, Nobuji Saito
Necessary and sufficient conditions for a graph to be three-terminal series-parallel-cascade. J. Comb. Theory, Ser. B 24 (3) (1978)