• 出典: Scopus
  • Pureの文献数とScopusの被引用数に基づいて算出されます
20022021

年別の研究成果

Pureに変更を加えた場合、すぐここに表示されます。
フィルター
Conference contribution

検索結果

  • 2006

    Approximability of partitioning graphs with supply and demand

    Ito, T., Demaine, E. D., Zhou, X. & Nishizeki, T., 2006 12 1, Algorithms and Computation - 17th International Symposium, ISAAC 2006, Proceedings. p. 121-130 10 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 4288 LNCS).

    研究成果: Conference contribution

    3 被引用数 (Scopus)
  • Partitioning a multi-weighted graph to connected subgraphs of almost uniform size

    Ito, T., Goto, K., Zhou, X. & Nishizeki, T., 2006, Computing and Combinatorics - 12th Annual International Conference, COCOON 2006, Proceedings. Springer Verlag, p. 63-72 10 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 4112 LNCS).

    研究成果: Conference contribution

  • 2002

    Algorithms for the multicolorings of partial k-trees

    Ito, T., Nishizeki, T. & Shu, G., 2002 1 1, Computing and Combinatorics - 8th Annual International Conference, COCOON 2002, Proceedings. Ibarra, O. H. & Zhang, L. (eds.). Springer-Verlag, p. 430-439 10 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 2387).

    研究成果: Conference contribution

    1 被引用数 (Scopus)
  • Partitioning trees of supply and demand

    Ito, T., Zhou, X. & Nishizeki, T., 2002, Algorithms and Computation - 13th International Symposium, ISAAC 2002, Proceedings. p. 612-623 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 2518 LNCS).

    研究成果: Conference contribution

    7 被引用数 (Scopus)