List of Papers in 2000

Papers

  1. Xiao ZHOU and Takao NISHIZEKI,
    "Graph Coloring Algorithms,"
    IEICE Trans. Inf. & Syst., Vol.E83-D, No.3, pp.407-417, 2000.
  2. Takaaki MIZUKI, Zhi-Bo SUI, Hiroki SHIZUYA, and Takao NISHIZEKI,
    "On the Average Length of Secret Key Exchange Eulerian Circuits,"
    IEICE Trans. Fundamentals, Vol.E83-A, No.4, pp.662--670, 2000.
  3. Xiao Zhou, Kazuki Fuse, and Takao Nishizeki,
    "A Linear Algorithm for Finding [g,f]-Colorings of Partial k-Trees,"
    Algorithmica, Vol.27, pp.227-243, 2000.
  4. 水木 敬明, 静谷 啓樹, 西関 隆夫,
    "カードの配布による鍵集合プロトコルが最適であるための必要十分条件,"
    (A Necessary and Sufficient Condition for a Key Set Protocol Using a Random Deal of Cards to be Optimal)
    電子情報通信学会論文誌Ａ, Vol.J83-A, No.5, pp.545-553, 2000.
  5. Md. Abul Kashem, Xiao Zhou and Takao Nishizeki,
    "Algorithms for generalized vertex-rankings of partial k-trees,"
    Theoretical Computer Science, Vol.240, pp.407-427, 2000.
  6. Xiao Zhou, Yasuaki Kanari and Takao Nishizeki,
    "Generalized vertex-coloring of partial k-trees,"
    IEICE Trans. on Fundamentals of Electronics, Communication and Computer Sciences, Vol.E83-A, No.4, pp.671-678, 2000.

International Conferences

  1. Takaaki Mizuki, Zhi-Bo Sui, Hiroki Shizuya, and Takao Nishizeki,
    "On the Average Length of Secret Key Exchange Eulerian Circuits,"
    Proceedings of the 5th JAPAN-KOREA Joint Workshop on Algorithms and Computation, pp.41-48, 2000.
  2. Md. Saidur Rahman, Shin-ichi Nakano, Takao Nishizeki,
    "Rectangular Drawings of Plane Graphs without Designated Corners,"
    Proceedings of the 5th JAPAN-KOREA Joint Workshop on Algorithms and Computation, pp.130-137, 2000.
  3. Takaaki Mizuki, Hiroki Shizuya, and Takao Nishizeki,
    "Characterization of Optimal Key Set Protocols,"
    Proc. of IFIP TCS 2000, LNCS 1872, pp.273-285, 2000.
  4. Md. Saidur Rahman, Shin-ichi Nakano and Takao Nishizeki,
    "Rectangular Drawings of Plane Graphs without Designated Corners,"
    Proc. of COCOON 2000, LNCS 1858, pp.85-94, 2000.
  5. X. Zhou and T. Nishizeki,
    "Finding Independent Spanning Trees in Partial $k$-trees,"
    Proc. of ISAAC 2000, Lect. Notes in Comp. Sci., Springer-verlag, 1969, pp. 168-179, 2000.
  6. K. Miura, S. Nakano and T. Nishizeki,
    "Convex Grid Drawings of Four-Connected Plane Graphs,"
    Proc. of ISAAC 2000, Lect. Notes in Comp. Sci., Springer-verlag, 1969, pp. 254-265, 2000.