群馬大学 > 工学部 > 情報工学科 > 情報数理工学講座 > 中野研究室 > 論文リスト



◆ 中野の国際会議論文リスト(1998年まで) ◆


(全リストはここ参照
  1. S.Nakano, T.Nishizeki and N.Saito:
    "On the f-coloring of graphs",
    The First Japan Conference on Graph Theory and Applications, June 1, 1986.
  2. T.Nishizeki, S.Nakano and N.Saito:
    "Scheduling file transfers in networks",
    Proc. GLOBECOM'87, pp.2109-2113 (1987).
  3. S.Nakano and T.Nishizeki:
    "Scheduling file transfers under port and channel constraints",
    Proc. Int. Symp. on Algorithms, Lect. Notes in Comp. Sci., 557, Springer-Verlag pp.43-51 (1991).
  4. X.Zhou, S.Nakano, H.Suzuki and T.Nishizeki:
    "An efficient algorithm for edge-coloring series-parallel multigraphs",
    Proc. LATIN'92, Lect. Notes in Comp. Sci., 583, Springer-Verlag, pp.516-529 (1992).
  5. S.Nakano and T.Nishizeki:
    "Nearly uniform scheduling of file transfers",
    Proc. of the Third Conference on Integer Programming and Combinatorial Optimization, pp.425-431 (1993).
  6. X.Zhou, S.Nakano and T.Nishizeki:
    "A linear algorithm for edge-coloring partial k-trees",
    Proc. of the First Europian Symposium on Algorithms, Lect. Notes in Comp. Sci., 726, Springer-Verlag, pp.409-418 (1993).
  7. X.Zhou, S.Nakano and T.Nishizeki:
    "A parallel algorithm for edge-coloring partial k-trees",
    Proc. of the Fourth Scandinavian Workshop on Algorithm Theory, Lect. Notes in Comp. Sci., 824, Springer-Verlag, pp.359-369 (1994).
  8. M.Chrobak and S.Nakano:
    "Minimum-width grid drawings of plane graphs",
    Proc. of the Graph Drawing '94, Lect. Notes in Comp. Sci., 894, Springer, pp.104-110 (1995).
  9. Md. Saidur Rahman, Shin-ichi Nakano and Takao Nishizeki:
    "Rectangular Grid Drawings of Plane Graphs",
    Second Annual International Computing and Combinatorics Conference (COCOON'96), Hong Kong, Lect. Notes in Comp. Sci., 1090, Springer, pp.92-105 (1996).
  10. Shin-ichi Nakano, Md. Saidur Rahman and Takao Nishizeki:
    "A Linear-Time Algorithm for Four-Partitioning Four-Connected Planar Graphs",
    Graph Drawing 96, Berkeley, Lect. Notes in Comp. Sci., 1190, Springer, pp.334-344 (1997).
    pdf
  11. M. S. Rahman, S. Nakano and T. Nishizeki:
    "A Linear-Time Algorithm of Orthogonal Drawings of Triconnected Cubic Plane Graphs with the Minimum Number of Bends",
    Japan-Korea Workshop on Algorithms and Computation, Kyushu University, pp.24-31 (1997).
  12. Md. Saidur Rahman, Shin-ichi Nakano and Takao Nishizeki:
    "A Linear Algorithm for Optimal Orthogonal Drawings of Triconnected Cubic Plane Graphs",
    Graph Drawing 97, Roma, Lect. Notes in Comp. Sci., 1353, Springer, pp.99-110 (1998).
    pdf
  13. K. Miura, D. Takahashi, S.Nakano, T. Nishizeki:
    "A Linear-Time Algorithm to Find Four Independent Spanning Trees in Four-Connected Planar Graphs",
    WG'98, Lect. Notes in Comp. Sci., 1517, Springer, pp.310-323 (1998).
    pdf
  14. Md. Saidur Rahman, Shin-ichi Nakano and Takao Nishizeki:
    "Box-Rectangular Drawings with Designated Four Corners",
    Proc. of ICCIT98, pp.37-41 (1998).