Nobuji Saito - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 24 from 24

1996

Visual Simulation of Leaf Arrangement and Autumn ColoursNorishige Chiba, Ken Ohshida, Kazunobu Muraoka, Nobuji Saito. jvca, 7(2):79-93, 1996.

1995

Visual simulation of water currents using a particle-based behavioural modelNorishige Chiba, Shinji Sanakanishi, Kenichiro Yokoyama, Isao Ootawara, Kazunobu Muraoka, Nobuji Saito. jvca, 6(3):155-171, 1995. [doi]

1994

A growth model having the abilities of growth-regulations for simulating visual nature of botanical treesNorishige Chiba, Ken Ohshida, Kazunobu Muraoka, Mamoru Miura, Nobuji Saito. cg, 18(4):469-479, 1994. [doi]

1992

Algorithms for Routing around a RectangleAndrás Frank, Takao Nishizeki, Nobuji Saito, Hitoshi Suzuki. DAM, 40(4):363-378, 1992.

1990

On the fg-coloring of graphsShin-Ichi Nakano, Takao Nishizeki, Nobuji Saito. combinatorica, 10(1):67-80, 1990.

1989

Algorithms for Multicommodity Flows in Planar GraphsHitoshi Suzuki, Takao Nishizeki, Nobuji Saito. algorithmica, 4(4):471-501, 1989.

1986

Planar Multicommodity Flows, Maximum Matchings and Negative CyclesKazuhiko Matsumoto, Takao Nishizeki, Nobuji Saito. SICOMP, 15(2):495-510, 1986.

1985

1984

A linear algorithm for finding Hamiltonian cycles in 4-connected maximal planar graphsTakao Asano, Shunji Kikuchi, Nobuji Saito. DAM, 7(1):1-15, 1984. [doi]

A Note on the Critical Problem for MatroidsTakao Asano, Takao Nishizeki, Nobuji Saito, James G. Oxley. ejc, 5(2):93-97, 1984. [doi]

1983

An algorithm for finding a large independent set in planar graphsNorishige Chiba, Takao Nishizeki, Nobuji Saito. networks, 13(2):247-252, 1983. [doi]

1982

The smallest 2-connected cubic bipartite planar nonhamiltonian graphTakao Asano, Nobuji Saito, Geoffrey Exoo, Frank Harary. DM, 38(1):1-6, 1982. [doi]

An Approximation Algorithm for the Maximum Independent Set Problem on Planar GraphsNorishige Chiba, Takao Nishizeki, Nobuji Saito. SICOMP, 11(4):663-675, 1982.

Linear-time computability of combinatorial problems on series-parallel graphsK. Takamizawa, Takao Nishizeki, Nobuji Saito. JACM, 29(3):623-641, 1982. [doi]

1981

A Linear 5-Coloring Algorithm of Planar GraphsNorishige Chiba, Takao Nishizeki, Nobuji Saito. jal, 2(4):317-327, 1981.

Combinatorial problems on series-parallel graphsK. Takamizawa, Takao Nishizeki, Nobuji Saito. DAM, 3(1):75-76, 1981. [doi]

1980

1978

Necessary and sufficient conditions for a graph to be three-terminal series-parallel-cascadeTakao Nishizeki, Nobuji Saito. JCT, 24(3):344-361, 1978. [doi]

Sign in or sign up to see more results.

runs on WebDSL