List of Papers in 2001

Papers

1. T. Nishizeki, J. Vygen and X. Zhou,
   "The edge-disjoint paths problem is NP-complete for series-parallel graphs,"
   Discrete Applied Math., 155, pp.177-186, 2001.
2. Y. Kusakari, D. Masubuchi and T. Nishizeki,
   "Finding a noncrossing Steiner forest in plane graphs under a 2-face condition,"
   Journal of Combinatorial Optimization, 5, pp.249-266, 2001.
3. K. Miura, S. Nakano and T. Nishizeki,
   "Grid Drawings of 4-Connected Plane Graphs,"
   Discrete Comput Geom, 26, pp.73-87, 2001.

International Conferences

1. X. Zhou and T. Nishizeki,
   "Efficient Algorithms for Weighted Colorings of Series-Parallel Graphs,"
   Proc. of ISAAC 2001, Lect. Notes in Comp. Sci., Springer-verlag, 2223, pp.514-524, 2001.
2. T. Mizuki and T. Nishizeki,
   "Necessary and Sufficient Numbers of Cards for Sharing Secret Keys on Hierarchical Groups,"
   Proc. of ISAAC 2001, Lect. Notes in Comp. Sci., Springer-verlag, 2223, pp.196-207, 2001.
3. X. Zhou and T. Nishizeki,
   "Algorithm for the cost edge-coloring of trees,"
   Proc. of COCOON 2001, Lect. Notes in Comp. Sci., Springer-verlag, 2108, pp.228-297, 2001.
4. S. Isobe, X. Zhou and T. Nishizeki,
   "Total colorings of degenerated graphs,"
   Proc. of ICALP 2001, Lect. Notes in Comp. Sci., Springer-verlag, 2076, pp.506-517, 2001.
5. S. Nakano, T. Nishizeki, T. Tokuyama and S. Watanabe,
   "Labeling Points with Rectangles or various shapes,"
   Proc. of GD 2000, Lect. Notes in Comp. Sci., Springer-verlag, 1984, pp.91-102, 2001.
6. K. Miura and T. Nishizeki,
   "Drawings of Four-Connected Plane Graphs,"
   Proc. of 2nd Japanese-Hungarian Symposium on Discrete Mathematics and Its Applications, pp.191-201, 2001.