Hitoshi Suzuki

24 papers A* 2B 5C 1Journal 15Unranked 1
YearRankTypeTitle / Venue / Authors
2007 J jnl
Discrimination of similar characters with a nonlinear compound discriminant function.
Syst. Comput. Jpn.
Hitoshi Suzuki, Yuji Waizumi, Nei Kato, Yoshiaki Nemoto
2007 C conf
New Imaging and Display System for Wide Gamut Color Reproduction.
IAS
Yoshifumi Shimodaira, Hitoshi Suzuki, Maciej Kretkowski
1999 J jnl
A Linear-Time Algorithm for Solving the Center Problem on Weighted Cactus Graphs.
Inf. Process. Lett.
Yu-Feng Lan, Yue-Li Wang, Hitoshi Suzuki
1999 J jnl
A Shortest Pair of Paths on the Plane with Obstacles and Crossing Areas.
Int. J. Comput. Geom. Appl.
Yoshiyuki Kusakari, Hitoshi Suzuki, Takao Nishizeki
1997 J jnl
An NC Parallel Algorithm for Edge-Coloring Series-Parallel Multigraphs.
J. Algorithms
Xiao Zhou, Hitoshi Suzuki, Takao Nishizeki
1997 J jnl
Shortest Non-Crossing Rectilinear Paths in Plane Regions.
Int. J. Comput. Geom. Appl.
Jun-ya Takahashi, Hitoshi Suzuki, Takao Nishizeki
1996 J jnl
A Linear Algorithm for Edge-Coloring Series-Parallel Multigraphs.
J. Algorithms
Xiao Zhou, Hitoshi Suzuki, Takao Nishizeki
1996 J jnl
Shortest Noncrossing Paths in Plane Graphs.
Algorithmica
Jun-ya Takahashi, Hitoshi Suzuki, Takao Nishizeki
1995 B conf
Finding a Shortest Pair of Paths on the Plane with Obstacles and Crossing Areas.
ISAAC
Yoshiyuki Kusakari, Hitoshi Suzuki, Takao Nishizeki
1994 J jnl
On Distance-Regular Graphs with
J. Comb. Theory B
Hitoshi Suzuki
1993 B conf
Finding Shortest Non-Crossing Rectilinear Paths in Plane Regions.
ISAAC
Jun-ya Takahashi, Hitoshi Suzuki, Takao Nishizeki
1993 B conf
Sequential and parallel algorithms for edge-coloring series-parallel multigraphs.
IPCO
Xiao Zhou, Hitoshi Suzuki, Takao Nishizeki
1992 B conf
Algorithms for Finding Non-Crossing Paths with Minimum Total Length in Plane Graphs.
ISAAC
Jun-ya Takahashi, Hitoshi Suzuki, Takao Nishizeki
1992 J jnl
Algorithms for Routing around a Rectangle.
Discret. Appl. Math.
András Frank, Takao Nishizeki, Nobuji Saito, Hitoshi Suzuki, Éva Tardos
1992 B conf
An Efficient Algorithm for Edge-Coloring Series-Parallel Multigraphs.
LATIN
Xiao Zhou, Shin-Ichi Nakano, Hitoshi Suzuki, Takao Nishizeki
1992 J jnl
Variable-Priority Queue and Doughnut Routing.
J. Algorithms
Hitoshi Suzuki, Akira Ishiguro, Takao Nishizeki
1990 J jnl
A Linear Algorithm for Bipartition of Biconnected Graphs.
Inf. Process. Lett.
Hitoshi Suzuki, Naomi Takahashi, Takao Nishizeki
1990 J jnl
Edge-disjoint paths in a grid bounded by two nested rectangles.
Discret. Appl. Math.
Hitoshi Suzuki, Akira Ishiguro, Takao Nishizeki
1990 A* conf
Finding Steiner Forests in Planar Graphs.
SODA
Hitoshi Suzuki, Takehiro Akama, Takao Nishizeki
1990 — conf
Parallel Algorithms for Finding Steiner Forests in Planar Graphs.
SIGAL International Symposium on Algorithms
Hitoshi Suzuki, Chiseko Yamanaka, Takao Nishizeki
1989 J jnl
Algorithms for Multicommodity Flows in Planar Graphs.
Algorithmica
Hitoshi Suzuki, Takao Nishizeki, Nobuji Saito
1989 J jnl
Compound decision theory and adaptive classification for multispectral image data.
Syst. Comput. Jpn.
Takashi Watanabe, Hitoshi Suzuki
1988 J jnl
An Experimental Evaluation of Classifiers Using Spatial Context for Multispectral Images.
Syst. Comput. Jpn.
Takashi Watanabe, Hitoshi Suzuki
1985 A* conf
Multicommodity Flows in Planar Undirected Graphs and Shortest Paths
STOC
Hitoshi Suzuki, Takao Nishizeki, Nobuji Saito