Takehiro Ito

Professor

  • Source: Scopus
  • Calculated based on no. of publications stored in Pure and citations from Scopus
20022021

Research activity per year

If you made any changes in Pure these will be visible here soon.
Filter
Conference contribution

Search results

  • 2020

    Approximability of the independent feedback vertex set problem for bipartite graphs

    Tamura, Y., Ito, T. & Zhou, X., 2020, WALCOM: Algorithms and Computation - 14th International Conference, WALCOM 2020, Proceedings. Rahman, M. S., Sadakane, K. & Sung, W-K. (eds.). Springer, p. 286-295 10 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 12049 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    2 Citations (Scopus)
  • Fixed-parameter algorithms for graph constraint logic

    Hatanaka, T., Hommelsheim, F., Ito, T., Kobayashi, Y., Mühlenthaler, M. & Suzuki, A., 2020 Dec, 15th International Symposium on Parameterized and Exact Computation, IPEC 2020. Cao, Y. & Pilipczuk, M. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 15. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 180).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

  • Minimization and parameterized variants of vertex partition problems on graphs

    Tamura, Y., Ito, T. & Zhou, X., 2020 Dec, 31st International Symposium on Algorithms and Computation, ISAAC 2020. Cao, Y., Cheng, S-W. & Li, M. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, p. 401-4013 3613 p. 40. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 181).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

  • Reconfiguration of spanning trees with many or few leaves

    Bousquet, N., Ito, T., Kobayashi, Y., Mizuta, H., Ouvrard, P., Suzuki, A. & Wasa, K., 2020 Aug 1, 28th Annual European Symposium on Algorithms, ESA 2020. Grandoni, F., Herman, G. & Sanders, P. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 24. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 173).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

  • 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 Mar, 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).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

  • 2019

    Algorithms for gerrymandering over graphs

    Ito, T., Kamiyama, N., Kobayashi, Y. & Okamot, Y., 2019 Jan 1, 18th International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2019. International Foundation for Autonomous Agents and Multiagent Systems (IFAAMAS), p. 1413-1421 9 p. (Proceedings of the International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS; vol. 3).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    3 Citations (Scopus)
  • Diameter of Colorings Under Kempe Changes

    Bonamy, M., Heinrich, M., Ito, T., Kobayashi, Y., Mizuta, H., Mühlenthaler, M., Suzuki, A. & Wasa, K., 2019, Computing and Combinatorics - 25th International Conference, COCOON 2019, Proceedings. Du, D-Z., Duan, Z. & Tian, C. (eds.). Springer Verlag, p. 52-64 13 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 11653 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    3 Citations (Scopus)
  • Incremental Optimization of Independent Sets Under the Reconfiguration Framework

    Ito, T., Mizuta, H., Nishimura, N. & Suzuki, A., 2019, Computing and Combinatorics - 25th International Conference, COCOON 2019, Proceedings. Du, D-Z., Duan, Z. & Tian, C. (eds.). Springer Verlag, p. 313-324 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 11653 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    4 Citations (Scopus)
  • Reconfiguration of minimum steiner trees via vertex exchanges

    Mizuta, H., Hatanaka, T., Ito, T. & Zhou, X., 2019 Aug, 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, 79. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 138).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    1 Citation (Scopus)
  • 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).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    2 Citations (Scopus)
  • Shortest reconfiguration of perfect matchings via alternating cycles

    Ito, T., Kakimura, N., Kamiyama, N., Kobayashi, Y. & Okamoto, Y., 2019 Sep, 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).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    1 Citation (Scopus)
  • The perfect matching reconfiguration problem

    Bonamy, M., Bousquet, N., Heinrich, M., Ito, T., Kobayashi, Y., Mary, A., Mühlenthaler, M. & Wasa, K., 2019 Aug, 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).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    1 Citation (Scopus)
  • 2018

    Algorithms for coloring reconfiguration under recolorability constraints

    Osawa, H., Suzuki, A., Ito, T. & Zhou, X., 2018 Dec 1, 29th International Symposium on Algorithms and Computation, ISAAC 2018. Hsu, W-L., Lee, D-T. & Liao, C-S. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, p. 37:1-37:13 (Leibniz International Proceedings in Informatics, LIPIcs; vol. 123).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

  • Reconfiguration of colorable sets in classes of perfect graphs

    Ito, T. & Otachi, Y., 2018 Jun 1, 16th Scandinavian Symposium and Workshops on Algorithm Theory, SWAT 2018. Eppstein, D. (ed.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, p. 271-2713 2443 p. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 101).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    1 Citation (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).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    4 Citations (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).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    5 Citations (Scopus)
  • 2017

    Approximation algorithm for the distance-3 independent set problem on cubic graphs

    Eto, H., Ito, T., Liu, Z. & Miyano, E., 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. 228-240 13 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 10167 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    5 Citations (Scopus)
  • Complexity of coloring reconfiguration under recolorability constraints

    Osawa, H., Suzuki, A., Ito, T. & Zhou, X., 2017 Dec 1, 28th International Symposium on Algorithms and Computation, ISAAC 2017. Tokuyama, T. & Okamoto, Y. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, (Leibniz International Proceedings in Informatics, LIPIcs; vol. 92).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    1 Citation (Scopus)
  • Complexity of the multi-service center problem

    Ito, T., Kakimura, N. & Kobayashi, Y., 2017 Dec 1, 28th International Symposium on Algorithms and Computation, ISAAC 2017. Tokuyama, T. & Okamoto, Y. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, (Leibniz International Proceedings in Informatics, LIPIcs; vol. 92).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    2 Citations (Scopus)
  • Parameterized complexity of the list coloring reconfiguration problem with graph parameters

    Hatanaka, T., Ito, T. & Zhou, X., 2017 Nov 1, 42nd International Symposium on Mathematical Foundations of Computer Science, MFCS 2017. Larsen, K. G., Raskin, J-F. & Bodlaender, H. L. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, (Leibniz International Proceedings in Informatics, LIPIcs; vol. 83).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    2 Citations (Scopus)
  • Reconfiguration of maximum-weight b-matchings in a graph

    Ito, T., Kakimura, N., Kamiyama, N., Kobayashi, Y. & Okamoto, Y., 2017, Computing and Combinatorics - 23rd International Conference, COCOON 2017, Proceedings. Cao, Y. & Chen, J. (eds.). Springer Verlag, p. 287-296 10 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 10392 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    3 Citations (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).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    3 Citations (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).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    2 Citations (Scopus)
  • 2016

    Approximability of the distance independent set problem on regular graphs and planar graphs

    Eto, H., Ito, T., Liu, Z. & Miyano, E., 2016, Combinatorial Optimization and Applications - 10th International Conference, COCOA 2016, Proceedings. Li, M., Wang, L. & Chan, T-H. H. (eds.). Springer Verlag, p. 270-284 15 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 10043 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    9 Citations (Scopus)
  • Efficient stabilization of cooperative matching games

    Ito, T., Kakimura, N., Kamiyama, N., Kobayashi, Y. & Okamoto, Y., 2016, AAMAS 2016 - Proceedings of the 2016 International Conference on Autonomous Agents and Multiagent Systems. International Foundation for Autonomous Agents and Multiagent Systems (IFAAMAS), p. 41-49 9 p. (Proceedings of the International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    3 Citations (Scopus)
  • 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).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    5 Citations (Scopus)
  • 2015

    Competitive diffusion on weighted graphs

    Ito, T., Otachi, Y., Saitoh, T., Satoh, H., Suzuki, A., Uchizawa, K., Uehara, R., Yamanaka, K. & Zhou, X., 2015, Algorithms and Data Structures - 14th International Symposium, WADS 2015, Proceedings. Dehne, F., Sack, J-R. & Stege, U. (eds.). Springer Verlag, p. 422-433 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 9214).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    3 Citations (Scopus)
  • Deterministic algorithms for the independent feedback vertex set problem

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

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    1 Citation (Scopus)
  • Reconfiguration of cliques in a graph

    Ito, T., Ono, H. & Otachi, Y., 2015, Theory and Applications of Models of Computation - 12th Annual Conference, TAMC 2015, Proceedings. Jain, R., Jain, S. & Stephan, F. (eds.). Springer Verlag, p. 212-223 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 9076).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    13 Citations (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).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    4 Citations (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).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    7 Citations (Scopus)
  • 2014

    On the parameterized complexity for token jumping on graphs

    Ito, T., Kamiński, M., Ono, H., Suzuki, A., Uehara, R. & Yamanaka, K., 2014, Theory and Applications of Models of Computation - 11th Annual Conference, TAMC 2014, Proceedings. Springer Verlag, p. 341-351 11 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 8402 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    25 Citations (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).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    16 Citations (Scopus)
  • 2013

    Base location problems for base-monotone regions

    Chun, J., Horiyama, T., Ito, T., Kaothanthong, N., Ono, H., Otachi, Y., Tokuyama, T., Uehara, R. & Uno, T., 2013, WALCOM: Algorithms and Computation - 7th International Workshop, WALCOM 2013, Proceedings. p. 53-64 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 7748 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    1 Citation (Scopus)
  • Complexity of finding maximum regular induced subgraphs with prescribed degree

    Asahiro, Y., Eto, H., Ito, T. & Miyano, E., 2013, Fundamentals of Computation Theory - 19th International Symposium, FCT 2013, Proceedings. p. 28-39 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 8070 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    1 Citation (Scopus)
  • Generalized rainbow connectivity of graphs

    Uchizawa, K., Aoki, T., Ito, T. & Zhou, X., 2013, WALCOM: Algorithms and Computation - 7th International Workshop, WALCOM 2013, Proceedings. p. 233-244 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 7748 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    1 Citation (Scopus)
  • On the minimum caterpillar problem in digraphs

    Okada, T., Suzuki, A., Ito, T. & Zhou, X., 2013, Computing and Combinatorics - 19th International Conference, COCOON 2013, Proceedings. p. 729-736 8 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 7936 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    1 Citation (Scopus)
  • 2012

    A 4.31-approximation for the geometric unique coverage problem on unit disks

    Ito, T., Nakano, S. I., Okamoto, Y., Otachi, Y., Uehara, R., Uno, T. & Uno, Y., 2012, Algorithms and Computation - 23rd International Symposium, ISAAC 2012, Proceedings. Springer Verlag, p. 372-381 10 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 7676 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    2 Citations (Scopus)
  • A polynomial-time approximation scheme for the geometric unique coverage problem on unit squares

    Ito, T., Nakano, S. I., Okamoto, Y., Otachi, Y., Uehara, R., Uno, T. & Uno, Y., 2012, Algorithm Theory, SWAT 2012 - 13th Scandinavian Symposium and Workshops, Proceedings. p. 24-35 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 7357 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    8 Citations (Scopus)
  • Reconfiguration of list L(2, 1)-labelings in a graph

    Ito, T., Kawamura, K., Ono, H. & Zhou, X., 2012, Algorithms and Computation - 23rd International Symposium, ISAAC 2012, Proceedings. Springer Verlag, p. 34-43 10 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 7676 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    9 Citations (Scopus)
  • 2011

    An improved sufficient condition for reconfiguration of list edge-colorings in a tree

    Ito, T., Kawamura, K. & Zhou, X., 2011 May 13, Theory and Applications of Models of Computation - 8th Annual Conference, TAMC 2011, Proceedings. p. 94-105 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 6648 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    3 Citations (Scopus)
  • Approximability of the subset sum reconfiguration problem

    Ito, T. & Demaine, E. D., 2011, Theory and Applications of Models of Computation - 8th Annual Conference, TAMC 2011, Proceedings. p. 58-69 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 6648 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    11 Citations (Scopus)
  • On the rainbow connectivity of graphs: Complexity and FPT algorithms

    Uchizawa, K., Aoki, T., Ito, T., Suzuki, A. & Zhou, X., 2011, Computing and Combinatorics - 17th Annual International Conference, COCOON 2011, Proceedings. p. 86-97 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 6842 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    5 Citations (Scopus)
  • 2010

    Minimum cost edge-colorings of trees can be reduced to matchings

    Ito, T., Sakamoto, N., Zhou, X. & Nishizeki, T., 2010, Frontiers in Algorithmics - 4th International Workshop, FAW 2010, Proceedings. p. 274-284 11 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 6213 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

  • Minimum cost partitions of trees with supply and demand

    Ito, T., Hara, T., Zhou, X. & Nishizeki, T., 2010, Algorithms and Computation - 21st International Symposium, ISAAC 2010, Proceedings. PART 2 ed. p. 351-362 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 6507 LNCS, no. PART 2).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    1 Citation (Scopus)
  • 2009

    Parameterizing cut sets in a graph by the number of their components

    Ito, T., Kamiński, M., Paulusma, D. & Thilikos, D. M., 2009, Algorithms and Computation - 20th International Symposium, ISAAC 2009, Proceedings. p. 605-615 11 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 5878 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    4 Citations (Scopus)
  • Reconfiguration of list edge-colorings in a graph

    Ito, T., Kamiński, M. & Demaine, E. D., 2009, Algorithms and Data Structures - 11th International Symposium, WADS 2009, Proceedings. p. 375-386 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 5664 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    18 Citations (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).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    5 Citations (Scopus)
  • 2008

    On the complexity of reconfiguration problems

    Ito, T., Demaine, E. D., Harvey, N. J. A., Papadimitriou, C. H., Sideri, M., Uehara, R. & Uno, Y., 2008, Algorithms and Computation - 19th International Symposium, ISAAC 2008, Proceedings. p. 28-39 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 5369 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    10 Citations (Scopus)
  • Partitioning a weighted tree to subtrees of almost uniform size

    Ito, T., Uno, T., Zhou, X. & Nishizeki, T., 2008, Algorithms and Computation - 19th International Symposium, ISAAC 2008, Proceedings. p. 196-207 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 5369 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    8 Citations (Scopus)