List of Papers in 1990

Papers

1. T. Nishizeki,
   "Planar Graph Problems,"
   Computing, suppl., 7, pp.53-68, 1990.
2. S. Nakano, T. Nishizeki and N. Saito,
   "On the fg-Coloring of Graphs,"
   Combinatorica,10, pp.67-80, 1990.
3. M. Chrobak and T. Nishizeki,
   "Improved Edge-Coloring Algorithms for Planar Graphs,"
   J.Algorithms, 11, pp.102-116, 1990.
4. H. Suzuki, T. Akama and T. Nishizeki,
   "Finding Steiner Forests in Planar Graphs,"
   Proc. First Ann. ACM-SIAM Symposium on Discrete Algorithms, San Francisco, Ca., pp.443-453, 1990.
5. T. Nishizeki and K. Kashiwagi,
   "On the 1.1 Edge-Coloring of Multigraphs,"
   SIAM J. Disc. Math., 3, pp.391-410, 1990.
6. H. Suzuki, N. Takahashi and T. Nishizeki,
   "A Linear Algorithm for Bipartition of Biconnected Graphs,"
   Information Processing Letters, 33, pp.227-231, 1990.
7. H. Suzuki, A. Ishiguro and T. Nishizeki,
   "Edge-Disjoint Paths in a Grid Bounded by Two Nested Rectangles,"
   Discrete Appl. Math., 27, pp.157-178, 1990.
8. 鈴木 均, 高橋奈穂美, 西関隆夫, 宮野浩, 上野修一
   "3-連結グラフの3分割アルゴリズム,"
   情報処理, 31, pp.584-592, 1990.
9. H. Suzuki, C. Yamanaka and T. Nishizeki,
   "Parallel Algorithms for Finding Steiner Forests in Planar Graphs,"
   Lect. Notes in Compt. Sci., 140, pp.458-467, 1990.
10. M. Ito, A. Saito and T. Nishizeki,
    "Secret Sharing Scheme Realizing General Access Structure,"
    ECIJ, Vol.72, pp.56-64, 1990.