The SCEAS System
| |||||||

## Search the dblp DataBase
Hitoshi Suzuki:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Xiao Zhou, Hitoshi Suzuki, Takao Nishizeki
**Sequential and parallel algorithms for edge-coloring series-parallel multigraphs.**[Citation Graph (0, 0)][DBLP] IPCO, 1993, pp:129-145 [Conf] - Yoshiyuki Kusakari, Hitoshi Suzuki, Takao Nishizeki
**Finding a Shortest Pair of Paths on the Plane with Obstacles and Crossing Areas.**[Citation Graph (0, 0)][DBLP] ISAAC, 1995, pp:42-51 [Conf] - Jun-ya Takahashi, Hitoshi Suzuki, Takao Nishizeki
**Algorithms for Finding Non-Crossing Paths with Minimum Total Length in Plane Graphs.**[Citation Graph (0, 0)][DBLP] ISAAC, 1992, pp:400-409 [Conf] - Jun-ya Takahashi, Hitoshi Suzuki, Takao Nishizeki
**Finding Shortest Non-Crossing Rectilinear Paths in Plane Regions.**[Citation Graph (0, 0)][DBLP] ISAAC, 1993, pp:98-107 [Conf] - Xiao Zhou, Shin-Ichi Nakano, Hitoshi Suzuki, Takao Nishizeki
**An Efficient Algorithm for Edge-Coloring Series-Parallel Multigraphs.**[Citation Graph (0, 0)][DBLP] LATIN, 1992, pp:516-529 [Conf] - Hitoshi Suzuki, Chiseko Yamanaka, Takao Nishizeki
**Parallel Algorithms for Finding Steiner Forests in Planar Graphs.**[Citation Graph (0, 0)][DBLP] SIGAL International Symposium on Algorithms, 1990, pp:458-467 [Conf] - Hitoshi Suzuki, Takehiro Akama, Takao Nishizeki
**Finding Steiner Forests in Planar Graphs.**[Citation Graph (0, 0)][DBLP] SODA, 1990, pp:444-453 [Conf] - Hitoshi Suzuki, Takao Nishizeki, Nobuji Saito
**Multicommodity Flows in Planar Undirected Graphs and Shortest Paths**[Citation Graph (0, 0)][DBLP] STOC, 1985, pp:195-204 [Conf] - Hitoshi Suzuki, Takao Nishizeki, Nobuji Saito
**Algorithms for Multicommodity Flows in Planar Graphs.**[Citation Graph (0, 0)][DBLP] Algorithmica, 1989, v:4, n:4, pp:471-501 [Journal] - Jun-ya Takahashi, Hitoshi Suzuki, Takao Nishizeki
**Shortest Noncrossing Paths in Plane Graphs.**[Citation Graph (0, 0)][DBLP] Algorithmica, 1996, v:16, n:3, pp:339-357 [Journal] - András Frank, Takao Nishizeki, Nobuji Saito, Hitoshi Suzuki
**Algorithms for Routing around a Rectangle.**[Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 1992, v:40, n:4, pp:363-378 [Journal] - Yoshiyuki Kusakari, Hitoshi Suzuki, Takao Nishizeki
**A Shortest Pair of Paths on the Plane with Obstacles and Crossing Areas.**[Citation Graph (0, 0)][DBLP] Int. J. Comput. Geometry Appl., 1999, v:9, n:2, pp:151-170 [Journal] - Jun-ya Takahashi, Hitoshi Suzuki, Takao Nishizeki
**Shortest Non-Crossing Rectilinear Paths in Plane Regions.**[Citation Graph (0, 0)][DBLP] Int. J. Comput. Geometry Appl., 1997, v:7, n:5, pp:419-436 [Journal] - Yu-Feng Lan, Yue-Li Wang, Hitoshi Suzuki
**A Linear-Time Algorithm for Solving the Center Problem on Weighted Cactus Graphs.**[Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1999, v:71, n:5-6, pp:205-212 [Journal] - Hitoshi Suzuki, Naomi Takahashi, Takao Nishizeki
**A Linear Algorithm for Bipartition of Biconnected Graphs.**[Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1990, v:33, n:5, pp:227-231 [Journal] - Hitoshi Suzuki, Akira Ishiguro, Takao Nishizeki
**Variable-Priority Queue and Doughnut Routing.**[Citation Graph (0, 0)][DBLP] J. Algorithms, 1992, v:13, n:4, pp:606-635 [Journal] - Xiao Zhou, Hitoshi Suzuki, Takao Nishizeki
**A Linear Algorithm for Edge-Coloring Series-Parallel Multigraphs.**[Citation Graph (0, 0)][DBLP] J. Algorithms, 1996, v:20, n:1, pp:174-201 [Journal] - Xiao Zhou, Hitoshi Suzuki, Takao Nishizeki
**An NC Parallel Algorithm for Edge-Coloring Series-Parallel Multigraphs.**[Citation Graph (0, 0)][DBLP] J. Algorithms, 1997, v:23, n:2, pp:359-374 [Journal] - Hitoshi Suzuki
**On Distance-Regular Graphs with**[Citation Graph (0, 0)][DBLP]*k*_{i}=*k*_{j}. J. Comb. Theory, Ser. B, 1994, v:61, n:1, pp:103-110 [Journal] **Edge-disjoint paths in a grid bounded by two nested rectangles.**[Citation Graph (, )][DBLP]
Search in 0.208secs, Finished in 0.208secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |