The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Hitoshi Suzuki: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. 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]
  2. 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]
  3. 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]
  4. 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]
  5. 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]
  6. 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]
  7. Hitoshi Suzuki, Takehiro Akama, Takao Nishizeki
    Finding Steiner Forests in Planar Graphs. [Citation Graph (0, 0)][DBLP]
    SODA, 1990, pp:444-453 [Conf]
  8. 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]
  9. 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]
  10. 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]
  11. 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]
  12. 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]
  13. 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]
  14. 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]
  15. 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]
  16. 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]
  17. 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]
  18. 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]
  19. Hitoshi Suzuki
    On Distance-Regular Graphs with ki = kj. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1994, v:61, n:1, pp:103-110 [Journal]

  20. Edge-disjoint paths in a grid bounded by two nested rectangles. [Citation Graph (, )][DBLP]


Search in 0.208secs, Finished in 0.208secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002