List of Papers in 1995

Papers

1. X. Zhou and T. Nishizeki,
   "Optimal parallel algorithm for edge-coloring partial k-trees with bounded degrees,"
   IEICE Trans. on Fundamentals of Electronics, Comunication and Computer Science, E78-A, pp. 463-469, 1995.
2. X. Zhou and T. Nishizeki,
   "Finding optimal edge-rankings of trees,"
   In Proc. of the Sixth Annual ACM/SIAM Symposium on Discrete Algorithm, pp.122-131, 1995.
3. X. Zhou and T. Nishizeki,
   "Simple reduction of f-colorings to edge-colorings,"
   In Proc. of the First Annual International Conference on Computing and Combinatorics, Lect. Notes in Computer Science, Springer, 959, pp.223-228, 1995.
4. X. Zhou and T. Nishizeki,
   "A linear algorithm for f-coloring partial k-trees,"
   In Proc. of the ISAAC'95, Lect. Notes in Computer Science 1004, Springer, pp.332-341, 1995.
5. S. Nakano, X. Zhou and T. Nishizeki,
   "Edge-Coloring Algorithms,"
   Lect. Notes in Comp. Sci., Special issue Vol.1000, Springer, pp.172-183, 1995.
6. 中野眞一, 鈴木康弘, 西関隆夫,
   "グラフの均等辺彩色アルゴリズム,"
   信学論(D), J78-D-I, 5, pp.437-444, 1995.
7. M. Chrobak and S. Nakano,
   "Minimum-width grid drawings of plane graphs,"
   Proc. of Graph Drawing '94, Lect. Notes in Comp. Sci., 894, Springer, pp.104-110, 1995.
8. E. Chida, H. Shizuya and T. Nishizeki,
   "One Way Functions over Finite Near-Rings,"
   IEICE TRANS. FUNDAMENTALS, E78-A, 1, pp.4-10, 1995.
9. Y. Kusakari, H. Suzuki and T. Nishizeki,
   "Finding a Shortest Pair of Paths on the Plane with Obstacles and Crossing Areas,"
   Proc. of the ISAAC'95, Lect. Notes in Comp. Sci., 1004, Springer, pp.42-51, 1995.
10. 草苅良至, 鈴木均, 西関隆夫,
    "障害物と交差領域のある平面上での最短な2本の道,"
    日本応用数理学会論文誌, Vol.5, pp.381-398, 1995.
11. 高橋淳也, 鈴木均, 西関隆夫,
    "平面領域で長さの総和最小な非交差道を求めるアルゴリズム,"
    信学論(A),J78-A, 3, pp.391-400, 1995.