Nobuji Saito

发表

Visual Simulation of Leaf Arrangement and Autumn Colours

Norishige Chiba, Ken Ohshida, Kazunobu Muraoka, 1996 .

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

Nobuji Saito, Takao Nishizeki, K. Takamizawa, 1982, JACM.

Lower Bounds for Combinatorial Problems on Graphs

Nobuji Saito, Takao Nishizeki, Hiroyuki Nakayama, 1985, J. Algorithms.

Algorithms for multicommodity flows in planar graphs

Nobuji Saito, Takao Nishizeki, Hitoshi Suzuki, 2005, Algorithmica.

Visual simulation of water currents using a particle-based behavioural model

Norishige Chiba, Kazunobu Muraoka, Nobuji Saito, 1995, Comput. Animat. Virtual Worlds.

An Approximation Algorithm for the Maximum Independent Set Problem on Planar Graphs

Norishige Chiba, Nobuji Saito, Takao Nishizeki, 1982, SIAM J. Comput..

Algorithms for Routing around a Rectangle

Nobuji Saito, András Frank, Éva Tardos, 1992, Discret. Appl. Math..

A Linear 5-Coloring Algorithm of Planar Graphs

Norishige Chiba, Nobuji Saito, Takao Nishizeki, 1981, J. Algorithms.

A class of nonuniform coupled transmission lines and their equivalent circuits

Nobuji Saito, Kunikatsu Kobayashi, N. Saito, 1987 .

On thefg-coloring of graphs

Nobuji Saito, Shin-Ichi Nakano, Takao Nishizeki, 1990, Comb..

The smallest 2-connected cubic bipartite planar nonhamiltonian graph

Nobuji Saito, Frank Harary, Takao Asano, 1982, Discret. Math..

An O(p^3) Algorithm for Finding Hamiltonian Cycles in Certain Digraphs

Nobuji Saito, Takao Nishizeki, K. Takamizawa, 1980 .

An efficient algorithm to find a Hamiltonian circuit in a 4-connected maximal planar graph

Nobuji Saito, Takao Asano, Shunji Kikuchi, 1980, Graph Theory and Algorithms.

A linear algorithm for five-coloring a planar graph

Norishige Chiba, Nobuji Saito, Takao Nishizeki, 1980, Graph Theory and Algorithms.

NP-Completeness of the Hamiltonian Cycle Problem for Bipartite Graphs

Nobuji Saito, Takao Nishizeki, T. Akiyama, 1980 .

An algorithm for finding a short closed spanning walk in a graph

Nobuji Saito, Takao Nishizeki, K. Takamizawa, 1980, Networks.

A linear algorithm for finding Hamiltonian cycles in 4-connected maximal planar graphs

Nobuji Saito, Takao Asano, Shunji Kikuchi, 1984, Discret. Appl. Math..

A growth model having the abilities of growth-regulations for simulating visual nature of botanical trees

Norishige Chiba, Ken Ohshida, Kazunobu Muraoka, 1994, Comput. Graph..

An algorithm for finding a large independent set in planar graphs

Norishige Chiba, Nobuji Saito, Takao Nishizeki, 1983, Networks.

A Variable Priority Queue and its Applications

Nobuji Saito, Takao Nishizeki, Hitoshi Suzuki, 1987 .

Image Media Technology for Virtual Reality Applications. Motion Simulation of Virtual Varicolored Carp Based on the Vibration Wing Theory.

Norishige Chiba, Nobuji Saito, Toshio Harima, 1998 .

An Efficient Algorithm for Finding Multicommodity Flows in Planar Networks

Nobuji Saito, Takao Nishizeki, Kazuhiko Matsumoto, 1985, SIAM J. Comput..

Multicommodity flows in planar undirected graphs and shortest paths

Nobuji Saito, Takao Nishizeki, Hitoshi Suzuki, 1985, STOC '85.

Applications of the Lipton and Tarjan's Planar Separator Theorem

Norishige Chiba, Nobuji Saito, Takao Nishizeki, 1981 .

Visual Simulation of Leaf Arrangement and Autumn Colours

Norishige Chiba, Ken Ohshida, Kazunobu Muraoka, 1996, Comput. Animat. Virtual Worlds.

A Linear-Time Routing Algorithm for Convex Grids

Nobuji Saito, Takao Nishizeki, Kiminobu Suzuki, 1985, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

Combinatorial problems on series-parallel graphs

Nobuji Saito, Takao Nishizeki, K. Takamizawa, 1981, Discret. Appl. Math..

Planar Multicommodity Flows, Maximum Matchings and Negative Cycles

Nobuji Saito, Takao Nishizeki, Kazuhiko Matsumoto, 1986, SIAM J. Comput..

Necessary and sufficient conditions for a graph to be three-terminal series-parallel-cascade

Nobuji Saito, Takao Nishizeki, 1978, J. Comb. Theory, Ser. B.

A Note on the Critical Problem for Matroids

Nobuji Saito, Takao Asano, Takao Nishizeki, 1984, Eur. J. Comb..

Proceedings of the 17th Symposium of Research Institute of Electric Communication on Graph Theory and Algorithms

Nobuji Saito, Takao Nishizeki, Takao Nishizeki, 1980 .

Combinatorial problems on series-parallel graphs

Nobuji Saito, Takao Nishizeki, K. Takamizawa, 1980, Graph Theory and Algorithms.

Using the JSP Model 2 architecture modelling agents for a lifelong learning environment

Nobuji Saito, Gerardo Ayala, 2003 .

An algorithm for multicommodity flows in a class of planar networks

Nobuji Saito, Takao Nishizeki, Hitoshi Suzuki, 1987 .

Algorithms for Routing around a Rectangle: Extended Abstract

Nobuji Saito, Takao Nishizeki, Hitoshi Suzuki, 1987 .