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

年別の研究成果

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

検索結果

  • Chapter

    Fixed-parameter tractability of token jumping on planar graphs

    Ito, T., Kamiński, M. & Ono, H., 2014, Algorithms and Computation - 25th International Symposium, ISAAC 2014, Proceedings. Ahn, H-K. & Shin, C-S. (eds.). Springer Verlag, p. 208-219 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 8889).

    研究成果: Chapter

    17 被引用数 (Scopus)
  • Minimum-cost b-Edge dominating sets on trees

    Ito, T., Kakimura, N., Kamiyama, N., Kobayashi, Y. & Okamoto, Y., 2014, Algorithms and Computation - 25th International Symposium, ISAAC 2014, Proceedings. Ahn, H-K. & Shin, C-S. (eds.). Springer Verlag, p. 195-207 13 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 8889).

    研究成果: Chapter

    1 被引用数 (Scopus)
  • Polynomial-time algorithm for sliding tokens on trees

    Demaine, E. D., Demaine, M. L., Fox-Epstein, E., Hoang, D. A., Ito, T., Ono, H., Otachi, Y., Uehara, R. & Yamada, T., 2014, Algorithms and Computation - 25th International Symposium, ISAAC 2014, Proceedings. Ahn, H-K. & Shin, C-S. (eds.). Springer Verlag, p. 389-400 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 8889).

    研究成果: Chapter

    12 被引用数 (Scopus)