Nobuji Saito

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