Nobuji Saito

1996
19		Norishige Chiba, Ken Ohshida, Kazunobu Muraoka, Nobuji Saito: Visual Simulation of Leaf Arrangement and Autumn Colours. Journal of Visualization and Computer Animation 7(2): 79-93 (1996)
1994
18	EE	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. Computers & Graphics 18(4): 469-479 (1994)
1992
17		András Frank, Takao Nishizeki, Nobuji Saito, Hitoshi Suzuki: Algorithms for Routing around a Rectangle. Discrete Applied Mathematics 40(4): 363-378 (1992)
1990
16		Shin-Ichi Nakano, Takao Nishizeki, Nobuji Saito: On the fg-coloring of graphs. Combinatorica 10(1): 67-80 (1990)
1989
15		Hitoshi Suzuki, Takao Nishizeki, Nobuji Saito: Algorithms for Multicommodity Flows in Planar Graphs. Algorithmica 4(4): 471-501 (1989)
1986
14		Kazuhiko Matsumoto, Takao Nishizeki, Nobuji Saito: Planar Multicommodity Flows, Maximum Matchings and Negative Cycles. SIAM J. Comput. 15(2): 495-510 (1986)
1985
13		Hitoshi Suzuki, Takao Nishizeki, Nobuji Saito: Multicommodity Flows in Planar Undirected Graphs and Shortest Paths STOC 1985: 195-204
12	EE	Takao Nishizeki, Nobuji Saito, Kiminobu Suzuki: A Linear-Time Routing Algorithm for Convex Grids. IEEE Trans. on CAD of Integrated Circuits and Systems 4(1): 68-76 (1985)
11		Hiroyuki Nakayama, Takao Nishizeki, Nobuji Saito: Lower Bounds for Combinatorial Problems on Graphs. J. Algorithms 6(3): 393-399 (1985)
10		Kazuhiko Matsumoto, Takao Nishizeki, Nobuji Saito: An Efficient Algorithm for Finding Multicommodity Flows in Planar Networks. SIAM J. Comput. 14(2): 289-302 (1985)
1982
9	EE	Takao Asano, Nobuji Saito, Geoffrey Exoo, Frank Harary: The smallest 2-connected cubic bipartite planar nonhamiltonian graph. Discrete Mathematics 38(1): 1-6 (1982)
8	EE	K. Takamizawa, Takao Nishizeki, Nobuji Saito: Linear-time computability of combinatorial problems on series-parallel graphs. J. ACM 29(3): 623-641 (1982)
7		Norishige Chiba, Takao Nishizeki, Nobuji Saito: An Approximation Algorithm for the Maximum Independent Set Problem on Planar Graphs. SIAM J. Comput. 11(4): 663-675 (1982)
1981
6		Nobuji Saito, Takao Nishizeki: Graph Theory and Algorithms, 17th Symposium of Research Institute of Electric Communication, Tohoku University, Sendai, Japan, October 24-25, 1980, Proceedings Springer 1981
5		Norishige Chiba, Takao Nishizeki, Nobuji Saito: A Linear 5-Coloring Algorithm of Planar Graphs. J. Algorithms 2(4): 317-327 (1981)
1980
4		Takao Asano, S. Kikuchi, Nobuji Saito: An efficient algorithm to find a Hamiltonian circuit in a 4-connected maximal planar graph. Graph Theory and Algorithms 1980: 182-195
3		K. Takamizawa, Takao Nishizeki, Nobuji Saito: Combinatorial problems on series-parallel graphs. Graph Theory and Algorithms 1980: 79-94
2		Norishige Chiba, Takao Nishizeki, Nobuji Saito: A linear algorithm for five-coloring a planar graph. Graph Theory and Algorithms 1980: 9-19
1978
1	EE	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): 344-361 (1978)

Coauthor Index

1	Takao Asano	[4] [9]
2	Norishige Chiba	[2] [5] [7] [18] [19]
3	Geoffrey Exoo	[9]
4	András Frank	[17]
5	Frank Harary	[9]
6	S. Kikuchi	[4]
7	Kazuhiko Matsumoto	[10] [14]
8	Mamoru Miura	[18]
9	Kazunobu Muraoka	[18] [19]
10	Shin-Ichi Nakano	[16]
11	Hiroyuki Nakayama	[11]
12	Takao Nishizeki	[1] [2] [3] [5] [6] [7] [8] [10] [11] [12] [13] [14] [15] [16] [17]
13	Ken Ohshida	[18] [19]
14	Hitoshi Suzuki	[13] [15] [17]
15	Kiminobu Suzuki	[12]
16	K. Takamizawa	[3] [8]