Multicommodity Flows in Planar Undirected Graphs and Shortest Paths - Hitoshi Suzuki; Takao Nishizeki; Nobuji Saito (STOC, 1985)

An Experimental Evaluation of Classifiers Using Spatial Context for Multispectral Images. - Takashi Watanabe; Hitoshi Suzuki (Syst. Comput. Jpn., 1988)

Algorithms for Multicommodity Flows in Planar Graphs. - Hitoshi Suzuki; Takao Nishizeki; Nobuji Saito (Algorithmica, 1989)

Compound decision theory and adaptive classification for multispectral image data. - Takashi Watanabe; Hitoshi Suzuki (Syst. Comput. Jpn., 1989)

Parallel Algorithms for Finding Steiner Forests in Planar Graphs. - Hitoshi Suzuki; Chiseko Yamanaka; Takao Nishizeki (SIGAL International Symposium on Algorithms, 1990)

Finding Steiner Forests in Planar Graphs. - Hitoshi Suzuki; Takehiro Akama; Takao Nishizeki (SODA, 1990)

Edge-disjoint paths in a grid bounded by two nested rectangles. - Hitoshi Suzuki; Akira Ishiguro; Takao Nishizeki (Discret. Appl. Math., 1990)

A Linear Algorithm for Bipartition of Biconnected Graphs. - Hitoshi Suzuki; Naomi Takahashi; Takao Nishizeki (Inf. Process. Lett., 1990)

Algorithms for Finding Non-Crossing Paths with Minimum Total Length in Plane Graphs. - Jun-ya Takahashi; Hitoshi Suzuki; Takao Nishizeki (ISAAC, 1992)

An Efficient Algorithm for Edge-Coloring Series-Parallel Multigraphs. - Xiao Zhou 001; Shin-Ichi Nakano; Hitoshi Suzuki; Takao Nishizeki (LATIN, 1992)

Algorithms for Routing around a Rectangle. - András Frank; Takao Nishizeki; Nobuji Saito; Hitoshi Suzuki; Éva Tardos (Discret. Appl. Math., 1992)

Variable-Priority Queue and Doughnut Routing. - Hitoshi Suzuki; Akira Ishiguro; Takao Nishizeki (J. Algorithms, 1992)

Sequential and parallel algorithms for edge-coloring series-parallel multigraphs. - Xiao Zhou 001; Hitoshi Suzuki; Takao Nishizeki (IPCO, 1993)

Finding Shortest Non-Crossing Rectilinear Paths in Plane Regions. - Jun-ya Takahashi; Hitoshi Suzuki; Takao Nishizeki (ISAAC, 1993)

On Distance-Regular Graphs with ki = kj. - Hitoshi Suzuki (J. Comb. Theory B, 1994)

Finding a Shortest Pair of Paths on the Plane with Obstacles and Crossing Areas. - Yoshiyuki Kusakari; Hitoshi Suzuki; Takao Nishizeki (ISAAC, 1995)

Shortest Noncrossing Paths in Plane Graphs. - Jun-ya Takahashi; Hitoshi Suzuki; Takao Nishizeki (Algorithmica, 1996)

A Linear Algorithm for Edge-Coloring Series-Parallel Multigraphs. - Xiao Zhou 001; Hitoshi Suzuki; Takao Nishizeki (J. Algorithms, 1996)

Shortest Non-Crossing Rectilinear Paths in Plane Regions. - Jun-ya Takahashi; Hitoshi Suzuki; Takao Nishizeki (Int. J. Comput. Geom. Appl., 1997)

An NC Parallel Algorithm for Edge-Coloring Series-Parallel Multigraphs. - Xiao Zhou 001; Hitoshi Suzuki; Takao Nishizeki (J. Algorithms, 1997)

A Shortest Pair of Paths on the Plane with Obstacles and Crossing Areas. - Yoshiyuki Kusakari; Hitoshi Suzuki; Takao Nishizeki (Int. J. Comput. Geom. Appl., 1999)

A Linear-Time Algorithm for Solving the Center Problem on Weighted Cactus Graphs. - Yu-Feng Lan; Yue-Li Wang; Hitoshi Suzuki (Inf. Process. Lett., 1999)

New Imaging and Display System for Wide Gamut Color Reproduction. - Yoshifumi Shimodaira; Hitoshi Suzuki; Maciej Kretkowski (IAS, 2007)

Discrimination of similar characters with a nonlinear compound discriminant function. - Hitoshi Suzuki; Yuji Waizumi; Nei Kato; Yoshiaki Nemoto (Syst. Comput. Jpn., 2007)