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

年別の研究成果

Pureに変更を加えた場合、すぐここに表示されます。

検索結果

  • Conference contribution

    Reconfiguration of steiner trees in an unweighted graph

    Mizuta, H., Ito, T. & Zhou, X., 2016, Combinatorial Algorithms - 27th International Workshop, IWOCA 2016, Proceedings. Mäkinen, V., Puglisi, S. J. & Salmela, L. (eds.). Springer Verlag, p. 163-175 13 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 9843 LNCS).

    研究成果: Conference contribution

    5 被引用数 (Scopus)
  • Reconfiguration of vertex covers in a graph

    Ito, T., Nooka, H. & Zhou, X., 2015, Combinatorial Algorithms - 25th International Workshop, IWOCA 2014, Revised Selected Papers. Froncek, D., Kratochvíl, J. & Miller, M. (eds.). Springer Verlag, p. 164-175 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 8986).

    研究成果: Conference contribution

    4 被引用数 (Scopus)
  • Reconfiguring spanning and induced subgraphs

    Hanaka, T., Ito, T., Mizuta, H., Moore, B., Nishimura, N., Subramanya, V., Suzuki, A. & Vaidyanathan, K., 2018, Computing and Combinatorics - 24th International Conference, COCOON 2018, Proceedings. Zhu, D. & Wang, L. (eds.). Springer Verlag, p. 428-440 13 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 10976 LNCS).

    研究成果: Conference contribution

    4 被引用数 (Scopus)
  • Route-enabling graph orientation problems

    Ito, T., Miyamoto, Y., Ono, H., Tamaki, H. & Uehara, R., 2009, Algorithms and Computation - 20th International Symposium, ISAAC 2009, Proceedings. p. 403-412 10 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 5878 LNCS).

    研究成果: Conference contribution

    6 被引用数 (Scopus)
  • Shortest reconfiguration of colorings under kempe changes

    Bonamy, M., Ito, T., Mizuta, H., Suzuki, A., Heinrich, M., Kobayashi, Y., Mühlenthaler, M. & Wasa, K., 2020 3, 37th International Symposium on Theoretical Aspects of Computer Science, STACS 2020. Paul, C. & Blaser, M. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, LIPIcs-STACS-2020-35. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 154).

    研究成果: Conference contribution

  • Shortest Reconfiguration of Matchings

    Bousquet, N., Hatanaka, T., Ito, T. & Mühlenthaler, M., 2019, Graph-Theoretic Concepts in Computer Science - 45th International Workshop, WG 2019, Revised Papers. Sau, I. & Thilikos, D. M. (eds.). Springer Verlag, p. 162-174 13 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 11789 LNCS).

    研究成果: Conference contribution

    2 被引用数 (Scopus)
  • Shortest reconfiguration of perfect matchings via alternating cycles

    Ito, T., Kakimura, N., Kamiyama, N., Kobayashi, Y. & Okamoto, Y., 2019 9, 27th Annual European Symposium on Algorithms, ESA 2019. Bender, M. A., Svensson, O. & Herman, G. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 61. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 144).

    研究成果: Conference contribution

    1 被引用数 (Scopus)
  • Swapping labeled tokens on graphs

    Yamanaka, K., Demaine, E. D., Ito, T., Kawahara, J., Kiyomi, M., Okamoto, Y., Saitoh, T., Suzuki, A., Uchizawa, K. & Uno, T., 2014, Fun with Algorithms - 7th International Conference, FUN 2014, Proceedings. Springer Verlag, p. 364-375 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 8496 LNCS).

    研究成果: Conference contribution

    17 被引用数 (Scopus)
  • The coloring reconfiguration problem on specific graph classes

    Hatanaka, T., Ito, T. & Zhou, X., 2017, Combinatorial Optimization and Applications - 11th International Conference, COCOA 2017, Proceedings. Han, M., Du, H. & Gao, X. (eds.). Springer Verlag, p. 152-162 11 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 10627 LNCS).

    研究成果: Conference contribution

    3 被引用数 (Scopus)
  • The complexity of (list) edge-coloring reconfiguration problem

    Osawa, H., Suzuki, A., Ito, T. & Zhou, X., 2017, WALCOM: Algorithms and Computation - 11th International Conference and Workshops, WALCOM 2017, Proceedings. Rahman, M. S., Yen, H-C. & Poon, S-H. (eds.). Springer Verlag, p. 347-358 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 10167 LNCS).

    研究成果: Conference contribution

    2 被引用数 (Scopus)
  • The complexity of dominating set reconfiguration

    Haddadan, A., Ito, T., Mouawad, A. E., Nishimura, N., Ono, H., Suzuki, A. & Tebbal, Y., 2015, Algorithms and Data Structures - 14th International Symposium, WADS 2015, Proceedings. Dehne, F., Sack, J-R. & Stege, U. (eds.). Springer Verlag, p. 398-409 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 9214).

    研究成果: Conference contribution

    7 被引用数 (Scopus)
  • The perfect matching reconfiguration problem

    Bonamy, M., Bousquet, N., Heinrich, M., Ito, T., Kobayashi, Y., Mary, A., Mühlenthaler, M. & Wasa, K., 2019 8, 44th International Symposium on Mathematical Foundations of Computer Science, MFCS 2019. Katoen, J-P., Heggernes, P. & Rossmanith, P. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 80. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 138).

    研究成果: Conference contribution

    1 被引用数 (Scopus)
  • Tight approximability of the server allocation problem for real-time applications

    Ito, T., Kakimura, N., Kamiyama, N., Kobayashi, Y., Okamoto, Y. & Shiitada, T., 2018, Algorithmic Aspects of Cloud Computing - 3rd International Workshop, ALGOCLOUD 2017, Revised Selected Papers. Delis, A., Pallis, G. & Alistarh, D. (eds.). Springer Verlag, p. 41-55 15 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 10739 LNCS).

    研究成果: Conference contribution

    5 被引用数 (Scopus)
  • Editorial

    Special section on discrete mathematics and its applications

    Kawachi, A., Yamauchi, Y., Ito, T., Uchizawa, K., Otachi, Y., Ono, H., Kimura, K., Koga, H., Saitoh, T., Shibuya, T., Takimoto, E., Tanigawa, S. I., Nuida, K., Fukushima, K., Fujiwara, H., Mizuki, T., Moriyama, S. & Sadakane, K., 2019, In: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences. E102A, 9, p. 986 1 p.

    研究成果: Editorial査読

  • Paper

    Packing trominoes is np-complete, #p-complete and asp-complete

    Horiyama, T., Ito, T., Nakatsuka, K., Suzuki, A. & Uehara, R., 2012 12 1, p. 211-216. 6 p.

    研究成果: Paper査読

    3 被引用数 (Scopus)
  • Partitioning graphs of supply and demand

    Ito, T., 2014 1 1, p. 162-179. 18 p.

    研究成果: Paper査読