Nobuji Saito

According to our database1, Nobuji Saito authored at least 23 papers between 1978 and 1996.

Collaborative distances:

Awards

IEEE Fellow

IEEE Fellow 1993, "For contributions to network theory and engineering education.".

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

1996
Visual Simulation of Leaf Arrangement and Autumn Colours.
Comput. Animat. Virtual Worlds, 1996

1995
Visual simulation of water currents using a particle-based behavioural model.
Comput. Animat. Virtual Worlds, 1995

1994
A growth model having the abilities of growth-regulations for simulating visual nature of botanical trees.
Comput. Graph., 1994

1992
Algorithms for Routing around a Rectangle.
Discret. Appl. Math., 1992

1990
On the fg-coloring of graphs.
Comb., 1990

1989
Algorithms for Multicommodity Flows in Planar Graphs.
Algorithmica, 1989

1986
Planar Multicommodity Flows, Maximum Matchings and Negative Cycles.
SIAM J. Comput., 1986

1985
A Linear-Time Routing Algorithm for Convex Grids.
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 1985

An Efficient Algorithm for Finding Multicommodity Flows in Planar Networks.
SIAM J. Comput., 1985

Lower Bounds for Combinatorial Problems on Graphs.
J. Algorithms, 1985

Multicommodity Flows in Planar Undirected Graphs and Shortest Paths
Proceedings of the 17th Annual ACM Symposium on Theory of Computing, 1985

1984
A Note on the Critical Problem for Matroids.
Eur. J. Comb., 1984

A linear algorithm for finding Hamiltonian cycles in 4-connected maximal planar graphs.
Discret. Appl. Math., 1984

1983
An algorithm for finding a large independent set in planar graphs.
Networks, 1983

1982
An Approximation Algorithm for the Maximum Independent Set Problem on Planar Graphs.
SIAM J. Comput., 1982

Linear-time computability of combinatorial problems on series-parallel graphs.
J. ACM, 1982

The smallest 2-connected cubic bipartite planar nonhamiltonian graph.
Discret. Math., 1982

1981
A Linear 5-Coloring Algorithm of Planar Graphs.
J. Algorithms, 1981

Combinatorial problems on series-parallel graphs.
Discret. Appl. Math., 1981

1980
An algorithm for finding a short closed spanning walk in a graph.
Networks, 1980

A linear algorithm for five-coloring a planar graph.
Proceedings of the Graph Theory and Algorithms, 1980

An efficient algorithm to find a Hamiltonian circuit in a 4-connected maximal planar graph.
Proceedings of the Graph Theory and Algorithms, 1980

1978
Necessary and sufficient conditions for a graph to be three-terminal series-parallel-cascade.
J. Comb. Theory B, 1978


  Loading...