Hitoshi Suzuki

2007
20	EE	Hitoshi Suzuki, Yuji Waizumi, Nei Kato, Yoshiaki Nemoto: Discrimination of similar characters with a nonlinear compound discriminant function. Systems and Computers in Japan 38(11): 36-48 (2007)
1999
19	EE	Yu-Feng Lan, Yue-Li Wang, Hitoshi Suzuki: A Linear-Time Algorithm for Solving the Center Problem on Weighted Cactus Graphs. Inf. Process. Lett. 71(5-6): 205-212 (1999)
18		Yoshiyuki Kusakari, Hitoshi Suzuki, Takao Nishizeki: A Shortest Pair of Paths on the Plane with Obstacles and Crossing Areas. Int. J. Comput. Geometry Appl. 9(2): 151-170 (1999)
1997
17		Jun-ya Takahashi, Hitoshi Suzuki, Takao Nishizeki: Shortest Non-Crossing Rectilinear Paths in Plane Regions. Int. J. Comput. Geometry Appl. 7(5): 419-436 (1997)
16		Xiao Zhou, Hitoshi Suzuki, Takao Nishizeki: An NC Parallel Algorithm for Edge-Coloring Series-Parallel Multigraphs. J. Algorithms 23(2): 359-374 (1997)
1996
15		Jun-ya Takahashi, Hitoshi Suzuki, Takao Nishizeki: Shortest Noncrossing Paths in Plane Graphs. Algorithmica 16(3): 339-357 (1996)
14		Xiao Zhou, Hitoshi Suzuki, Takao Nishizeki: A Linear Algorithm for Edge-Coloring Series-Parallel Multigraphs. J. Algorithms 20(1): 174-201 (1996)
1995
13		Yoshiyuki Kusakari, Hitoshi Suzuki, Takao Nishizeki: Finding a Shortest Pair of Paths on the Plane with Obstacles and Crossing Areas. ISAAC 1995: 42-51
1994
12	EE	Hitoshi Suzuki: On Distance-Regular Graphs with ki = kj. J. Comb. Theory, Ser. B 61(1): 103-110 (1994)
1993
11		Xiao Zhou, Hitoshi Suzuki, Takao Nishizeki: Sequential and parallel algorithms for edge-coloring series-parallel multigraphs. IPCO 1993: 129-145
10		Jun-ya Takahashi, Hitoshi Suzuki, Takao Nishizeki: Finding Shortest Non-Crossing Rectilinear Paths in Plane Regions. ISAAC 1993: 98-107
1992
9		Jun-ya Takahashi, Hitoshi Suzuki, Takao Nishizeki: Algorithms for Finding Non-Crossing Paths with Minimum Total Length in Plane Graphs. ISAAC 1992: 400-409
8		Xiao Zhou, Shin-Ichi Nakano, Hitoshi Suzuki, Takao Nishizeki: An Efficient Algorithm for Edge-Coloring Series-Parallel Multigraphs. LATIN 1992: 516-529
7		András Frank, Takao Nishizeki, Nobuji Saito, Hitoshi Suzuki: Algorithms for Routing around a Rectangle. Discrete Applied Mathematics 40(4): 363-378 (1992)
6		Hitoshi Suzuki, Akira Ishiguro, Takao Nishizeki: Variable-Priority Queue and Doughnut Routing. J. Algorithms 13(4): 606-635 (1992)
1990
5		Hitoshi Suzuki, Chiseko Yamanaka, Takao Nishizeki: Parallel Algorithms for Finding Steiner Forests in Planar Graphs. SIGAL International Symposium on Algorithms 1990: 458-467
4		Hitoshi Suzuki, Takehiro Akama, Takao Nishizeki: Finding Steiner Forests in Planar Graphs. SODA 1990: 444-453
3		Hitoshi Suzuki, Naomi Takahashi, Takao Nishizeki: A Linear Algorithm for Bipartition of Biconnected Graphs. Inf. Process. Lett. 33(5): 227-231 (1990)
1989
2		Hitoshi Suzuki, Takao Nishizeki, Nobuji Saito: Algorithms for Multicommodity Flows in Planar Graphs. Algorithmica 4(4): 471-501 (1989)
1985
1		Hitoshi Suzuki, Takao Nishizeki, Nobuji Saito: Multicommodity Flows in Planar Undirected Graphs and Shortest Paths STOC 1985: 195-204

Coauthor Index

1	Takehiro Akama	[4]
2	András Frank	[7]
3	Akira Ishiguro	[6]
4	Nei Kato	[20]
5	Yoshiyuki Kusakari	[13] [18]
6	Yu-Feng Lan	[19]
7	Shin-Ichi Nakano	[8]
8	Yoshiaki Nemoto	[20]
9	Takao Nishizeki	[1] [2] [3] [4] [5] [6] [7] [8] [9] [10] [11] [13] [14] [15] [16] [17] [18]
10	Nobuji Saito	[1] [2] [7]
11	Jun-ya Takahashi	[9] [10] [15] [17]
12	Naomi Takahashi	[3]
13	Yuji Waizumi	[20]
14	Yue-Li Wang	[19]
15	Chiseko Yamanaka	[5]
16	Xiao Zhou	[8] [11] [14] [16]

Colors in the list of coauthors