Hitoshi Suzuki

According to our database, Hitoshi Suzuki authored at least 24 papers between 1985 and 2007.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2007

Discrimination of similar characters with a nonlinear compound discriminant function.

Hitoshi Suzuki, Yuji Waizumi, Nei Kato, Yoshiaki Nemoto

Syst. Comput. Jpn., 2007

New Imaging and Display System for Wide Gamut Color Reproduction.

Yoshifumi Shimodaira, Hitoshi Suzuki, Maciej Kretkowski

Proceedings of the Conference Record of the 2007 IEEE Industry Applications Conference Forty-Second IAS Annual Meeting, 2007

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

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

1997

An NC Parallel Algorithm for Edge-Coloring Series-Parallel Multigraphs.

Xiao Zhou, Hitoshi Suzuki, Takao Nishizeki

J. Algorithms, 1997

Shortest Non-Crossing Rectilinear Paths in Plane Regions.

Jun-ya Takahashi, Hitoshi Suzuki, Takao Nishizeki

Int. J. Comput. Geom. Appl., 1997

1996

A Linear Algorithm for Edge-Coloring Series-Parallel Multigraphs.

Xiao Zhou, Hitoshi Suzuki, Takao Nishizeki

J. Algorithms, 1996

Shortest Noncrossing Paths in Plane Graphs.

Jun-ya Takahashi, Hitoshi Suzuki, Takao Nishizeki

Algorithmica, 1996

1995

Finding a Shortest Pair of Paths on the Plane with Obstacles and Crossing Areas.

Yoshiyuki Kusakari, Hitoshi Suzuki, Takao Nishizeki

Proceedings of the Algorithms and Computation, 6th International Symposium, 1995

1994

On Distance-Regular Graphs with <i>k</i>_<i>i</i> = <i>k</i>_<i>j</i>.

Hitoshi Suzuki

J. Comb. Theory B, 1994

1993

Finding Shortest Non-Crossing Rectilinear Paths in Plane Regions.

Jun-ya Takahashi, Hitoshi Suzuki, Takao Nishizeki

Proceedings of the Algorithms and Computation, 4th International Symposium, 1993

Sequential and parallel algorithms for edge-coloring series-parallel multigraphs.

Xiao Zhou, Hitoshi Suzuki, Takao Nishizeki

Proceedings of the 3rd Integer Programming and Combinatorial Optimization Conference, Erice, Italy, April 29, 1993

1992

Variable-Priority Queue and Doughnut Routing.

Hitoshi Suzuki, Akira Ishiguro, Takao Nishizeki

J. Algorithms, 1992

Algorithms for Routing around a Rectangle.

András Frank, Takao Nishizeki, Nobuji Saito, Hitoshi Suzuki, Éva Tardos

Discret. Appl. Math., 1992

An Efficient Algorithm for Edge-Coloring Series-Parallel Multigraphs.

Xiao Zhou, Shin-Ichi Nakano, Hitoshi Suzuki, Takao Nishizeki

Proceedings of the LATIN '92, 1992

Algorithms for Finding Non-Crossing Paths with Minimum Total Length in Plane Graphs.

Jun-ya Takahashi, Hitoshi Suzuki, Takao Nishizeki

Proceedings of the Algorithms and Computation, Third International Symposium, 1992

1990

A Linear Algorithm for Bipartition of Biconnected Graphs.

Hitoshi Suzuki, Naomi Takahashi, Takao Nishizeki

Inf. Process. Lett., 1990

Edge-disjoint paths in a grid bounded by two nested rectangles.

Hitoshi Suzuki, Akira Ishiguro, Takao Nishizeki

Discret. Appl. Math., 1990

Finding Steiner Forests in Planar Graphs.

Hitoshi Suzuki, Takehiro Akama, Takao Nishizeki

Proceedings of the First Annual ACM-SIAM Symposium on Discrete Algorithms, 1990

Parallel Algorithms for Finding Steiner Forests in Planar Graphs.

Hitoshi Suzuki, Chiseko Yamanaka, Takao Nishizeki

Proceedings of the Algorithms, 1990

1989

Compound decision theory and adaptive classification for multispectral image data.

Takashi Watanabe, Hitoshi Suzuki

Syst. Comput. Jpn., 1989

Algorithms for Multicommodity Flows in Planar Graphs.

Hitoshi Suzuki, Takao Nishizeki, Nobuji Saito

Algorithmica, 1989

1988

An Experimental Evaluation of Classifiers Using Spatial Context for Multispectral Images.

Takashi Watanabe, Hitoshi Suzuki

Syst. Comput. Jpn., 1988

1985

Multicommodity Flows in Planar Undirected Graphs and Shortest Paths

Hitoshi Suzuki, Takao Nishizeki, Nobuji Saito

Proceedings of the 17th Annual ACM Symposium on Theory of Computing, 1985