List of Papers in 2003

Papers

1. Md. Saidur Rahman, Takao Nishizeki and Mahmuda Naznin,
   "Orthogonal Drawings of Plane Graphs Without Bends,"
   Journal of Graph Algorithms and Applications, Vol. 7(4), pp.335-362, 2003.
2. T. Mizuki, H. Shizuya and T. Nishizeki,
   "Characterization of optimal key set protocols,"
   Discrete Applied Mathematics, 131, pp.213-236, 2003.
3. Masud Hasan, Md. Saidur Rahman and Takao Nishizeki,
   "A Linear Algorithm for Compact Box-Drawings of Trees,"
   NETWORKS, Vol.42(3), pp.160-164, 2003.
4. S. Orihara, T. Mizuki and T. Nishizeki,
   "New security index for digital fingerprinting and its bounds,"
   IEICE Trans. Fundamentals, vol.E86-A, No.5, pp.1156-1163, 2003.
5. T. Fujino, X. Zhou and T. Nishizeki,
   "List edge-colorings of series-parallel graphs,"
   IEICE Trans. Fundamentals, vol.E86-A, No.5, pp.1034-1045, 2003.
6. 小泉 康一, 水木 敬明, 西関 隆夫,
   "量子カード配布,"
   電子情報通信学会論文誌, Vol.J86-A, No.4, pp.465-473, 2003.
7. Y. Kusakari and T. Nishizeki,
   "Finding a region with the minimum total $L_1$ distance from prescribed terminals,"
   Algorithmica, 35, pp.225-256, 2003.
8. T. Fijino, I. Isobe, X. Zhou and T. Nishizeki,
   "Linear algorithm for finding list edge-colorings of series-parallel graphs,"
   IEICE Trans. Inf. & Syst., vol.E86-D, No.2, pp.186-190, 2003.
9. T. Ito, X. Zhou and T. Nishizeki,
   "Algorithms for multicolorings of partial k-trees,"
   IEICE Trans. Inf. & Syst., vol.E86-D, No.2, pp.191-200, 2003.

International Conferences

1. T. Nishizeki,
   "Drawing plane graphs,"
   Proc. of ISAAC 2003, Lect. Notes in Comp. Sci., Springer-verlag, 2906, pp.2-5, 2003.
2. X. Zhou, Y. Matsuo and T. Nishizeki,
   "List total colorings of series-parallel graphs,"
   Proc. of COCOON 2003, Lect. Notes in Comp. Sci., Springer-verlag, 2697, pp.172-181, 2003.
3. K. Koizumi, T. Mizuki and T. Nishizeki,
   "Necessary and sufficient numbers of cards for the transformation protocol,"
   Proc. 7th Japan-Korea workshop on Algorithms and Computation, pp.124-137, 2003.
4. X. Zhou, Y. Matsuo and T. Nishizeki,
   "Complexity and algorithm of list total colorings of series-parallel graphs,"
   Proc. 7th Japan-Korea workshop on Algorithms and Computation, pp.189-202, 2003.
5. Md. S. Rahman, N. Egi and T. Nishizeki,
   "Algorithm for no-bend orthogonal drawings of subdivisions of planar triconnected cubic graphs,"
   Proc. 7th Japan-Korea workshop on Algorithms and Computation, pp.252-266, 2003.
6. T. Fujino, X. Zhou and T. Nishizeki,
   "List edge-colorings of series-parallel graphs,"
   Proc. of 3rd Hungarian-Japanese Symposium on Discrete Math. and Its Applications, pp.154-163, 2003.