顔写真

イトウ タケヒロ
伊藤 健洋
Takehiro Ito
所属
大学院情報科学研究科 システム情報科学専攻 生体システム情報学講座(情報システム評価学分野)
職名
教授
学位
  • 博士(情報科学)(東北大学)

  • 修士(情報科学)(東北大学)

e-Rad 研究者番号
40431548

経歴 8

  • 2020年5月 ~ 継続中
    東北大学 大学院情報科学研究科 教授

  • 2012年1月 ~ 2020年4月
    東北大学 大学院情報科学研究科 准教授

  • 2007年4月 ~ 2011年12月
    東北大学 大学院情報科学研究科 助教

  • 2008年10月 ~ 2009年3月
    ブリュッセル自由大学 客員研究員

  • 2008年3月 ~ 2008年6月
    マギル大学 客員研究員

  • 2006年4月 ~ 2007年3月
    東北大学 大学院情報科学研究科 助手

  • 2003年4月 ~ 2006年3月
    日本学術振興会 特別研究員(DC1)

  • 2005年6月 ~ 2005年10月
    マサチューセッツ工科大学 訪問学生

︎全件表示 ︎最初の5件までを表示

学歴 3

  • 東北大学 大学院情報科学研究科 システム情報科学専攻

    2003年4月 ~ 2006年3月

  • 東北大学 大学院情報科学研究科 システム情報科学専攻

    2001年10月 ~ 2003年3月

  • 東北大学 工学部 情報工学科

    1998年4月 ~ 2001年9月

委員歴 7

  • European Association for Theoretical Computer Science, Japan Chapter 副会長

    2019年2月 ~ 継続中

  • 文部科学省 科学技術・学術政策研究所 科学技術予測センター 専門調査員

    2016年4月 ~ 継続中

  • 情報処理学会アルゴリズム研究運営委員会 運営委員

    2018年4月 ~ 2022年4月

  • European Association for Theoretical Computer Science, Japan Chapter 幹事

    2014年1月 ~ 2019年1月

  • 電子情報通信学会 コンピュテーション研究専門委員会 専門委員

    2012年6月 ~ 2018年5月

  • 文部科学省 科学技術・学術政策研究所 科学技術動向研究センター 専門調査員

    2014年4月 ~ 2016年3月

  • 電子情報通信学会 コンピュテーション研究専門委員会 幹事

    2010年5月 ~ 2012年5月

︎全件表示 ︎最初の5件までを表示

所属学協会 2

  • 電子情報通信学会

  • 情報処理学会

研究キーワード 2

  • 組合せ遷移

  • グラフアルゴリズム

研究分野 1

  • 情報通信 / 情報学基礎論 /

受賞 16

  1. FIT2020船井ベストペーパー賞

    2021年8月 公益財団法人 船井情報科学振興財団

  2. 山下記念研究賞

    2020年3月 情報処理学会

  3. 研究奨励賞

    2018年11月 石田實記念財団

  4. 第17回(平成29年度)船井学術賞

    2018年4月 船井情報科学振興財団

  5. 平成30年度科学技術分野の文部科学大臣表彰 若手科学者賞

    2018年4月 文部科学省

  6. 平成25年度(第3回) RIEC Award 東北大学研究者賞

    2013年11月21日 電気通信工学振興会

  7. 第8回船井情報科学奨励賞

    2009年4月18日 船井情報科学振興財団

  8. Best Paper Award of ISAAC 2008

    2008年12月16日 The 19th International Symposium on Algorithms and Computation

  9. McGill-Japan Visiting Scholar Awards 2008

    2007年11月 McGill University

  10. 第2回野口研究奨励賞

    2007年5月9日 情報処理学会東北支部

  11. 情報科学研究科長賞

    2006年3月 東北大学大学院情報科学研究科

  12. 総長賞

    2006年3月 東北大学

  13. 青葉工学振興会 第11回研究奨励賞

    2005年12月14日 青葉工学振興会

  14. 2003年度 C&C若手優秀論文賞

    2004年1月28日 C&C振興財団

  15. 第18回テレコムシステム技術学生賞

    2003年3月 電気通信普及財団

  16. 2001年度 LA発表論文賞

    2002年2月 LAシンポジウム

︎全件表示 ︎最初の5件までを表示

論文 131

  1. Algorithmic theory of qubit routing 査読有り

    Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto

    Proceedings of the 18th Algorithms and Data Structures Symposium (WADS 2023) 14079 533-546 2023年7月

    DOI: 10.1007/978-3-031-38906-1_35  

  2. Reconfiguration of time-respecting arborescences 査読有り

    Takehiro Ito, Yuni Iwamasa, Naoyuki Kamiyama, Yasuaki Kobayashi, Yusuke Kobayashi, Shun-ichi Maezawa, Akira Suzuki

    Proceedings of the 18th Algorithms and Data Structures Symposium (WADS 2023) 14079 521-532 2023年7月

    DOI: 10.1007/978-3-031-38906-1_34  

  3. Hardness of finding combinatorial shortest paths on graph associahedra 査読有り

    Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto

    Proceedings of the 50th EATCS International Colloquium on Automata, Languages and Programming (ICALP 2023) 261 82:1-82:17 2023年7月

    DOI: 10.4230/LIPIcs.ICALP.2023.82  

  4. Rerouting planar curves and disjoint paths 査読有り

    Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki

    Proceedings of the 50th EATCS International Colloquium on Automata, Languages and Programming (ICALP 2023) 81:1-81:19 2023年7月

    DOI: 10.4230/LIPIcs.ICALP.2023.81  

  5. Reconfiguration of cliques in a graph 査読有り

    Takehiro Ito, Hirotaka Ono, Yota Otachi

    Discrete Applied Mathematics 333 43-58 2023年7月

    DOI: 10.1016/j.dam.2023.01.026  

  6. Reconfiguration of colorings in triangulations of the sphere 査読有り

    Takehiro Ito, Yuni Iwamasa, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki

    Proceedings of the 39th International Symposium on Computational Geometry (SoCG 2023) 258 43:1-43:16 2023年6月

    DOI: 10.4230/LIPIcs.SoCG.2023.43  

  7. ZDD-based algorithmic framework for solving shortest reconfiguration problems 査読有り

    Takehiro Ito, Jun Kawahara, Yu Nakahata, Takehide Soh, Akira Suzuki, Junichi Teruyama, Takahisa Toda

    Proceedings of the 20th International Conference on the Integration of Constraint Programming, Artificial Intelligence, and Operations Research (CPAIOR 2023) 13884 167-183 2023年5月

    DOI: 10.1007/978-3-031-33271-5_12  

  8. Fixed-parameter algorithms for graph constraint logic 査読有り

    Tatsuhiko Hatanaka, Felix Hommelsheim, Takehiro Ito, Yusuke Kobayashi, Moritz Mühlenthaler, Akira Suzuki

    Theoretical Computer Science 959 113863 2023年5月

    DOI: 10.1016/j.tcs.2023.113863  

  9. Reconfiguration of vertex-disjoint shortest paths on graphs 査読有り

    Rin Saito, Hiroshi Eto, Takehiro Ito, Ryuhei Uehara

    Proceedings of the 17th International Conference and Workshops on Algorithms and Computation (WALCOM 2023) 13973 191-201 2023年3月

    DOI: 10.1007/978-3-031-27051-2_17  

  10. Reconfiguring (non-spanning) arborescences 査読有り

    Takehiro Ito, Yuni Iwamasa, Yasuaki Kobayashi, Yu Nakahata, Yota Otachi, Kunihiro Wasa

    Theoretical Computer Science 943 131-141 2023年1月

    DOI: 10.1016/j.tcs.2022.12.007  

  11. Monotone edge flips to an orientation of maximum edge-connectivity à la Nash-Williams 査読有り

    Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki

    ACM Transactions on Algorithms 19 (1) 6 2023年1月

    DOI: 10.1145/3561302  

  12. Approximability of the distance independent set problem on regular graphs and planar graphs 査読有り

    Hiroshi Eto, Takehiro Ito, Zhilong Liu, Eiji Miyano

    IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences 105-A (9) 1211-1222 2022年9月

    DOI: 10.1587/transfun.2021dmp0017  

  13. Happy set problem on subclasses of co-comparability graphs 査読有り

    Hiroshi Eto, Takehiro Ito, Eiji Miyano, Akira Suzuki, Yuma Tamura

    WALCOM: Algorithms and Computation - 16th International Conference and Workshops (WALCOM) 149-160 2022年

    出版者・発行元:Springer

    DOI: 10.1007/978-3-030-96731-4_13  

  14. Reconfiguration of regular induced subgraphs 査読有り

    Hiroshi Eto, Takehiro Ito, Yasuaki Kobayashi, Yota Otachi, Kunihiro Wasa

    WALCOM: Algorithms and Computation - 16th International Conference and Workshops (WALCOM) 35-46 2022年

    出版者・発行元:Springer

    DOI: 10.1007/978-3-030-96731-4_4  

  15. Invitation to combinatorial reconfiguration 招待有り

    Takehiro Ito

    WALCOM: Algorithms and Computation - 16th International Conference and Workshops (WALCOM) 26-31 2022年

    出版者・発行元:Springer

    DOI: 10.1007/978-3-030-96731-4_3  

  16. Reconfiguration of spanning trees with degree constraint or diameter constraint 査読有り

    Nicolas Bousquet, Takehiro Ito, Yusuke Kobayashi, Haruka Mizuta, Paul Ouvrard, Akira Suzuki, Kunihiro Wasa

    39th International Symposium on Theoretical Aspects of Computer Science (STACS) 15:1-15:21 2022年

    出版者・発行元:Schloss Dagstuhl - Leibniz-Zentrum für Informatik

    DOI: 10.4230/LIPIcs.STACS.2022.15  

  17. Monotone edge flips to an orientation of maximum edge-connectivity à la Nash-Williams 査読有り

    Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki

    Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms (SODA) 1342-1355 2022年

    出版者・発行元:SIAM

    DOI: 10.1137/1.9781611977073.56  

  18. Sorting balls and water: Equivalence and computational complexity 査読有り

    Takehiro Ito, Jun Kawahara, Shin-ichi Minato, Yota Otachi, Toshiki Saitoh, Akira Suzuki, Ryuhei Uehara, Takeaki Uno, Katsuhisa Yamanaka, Ryo Yoshinaka

    11th International Conference on Fun with Algorithms (FUN) 16:1-16:17 2022年

    出版者・発行元:Schloss Dagstuhl - Leibniz-Zentrum für Informatik

    DOI: 10.4230/LIPIcs.FUN.2022.16  

  19. Invitation to combinatorial reconfiguration (Invited Talk) 招待有り

    Takehiro Ito

    CPM 1-1 2022年

    DOI: 10.4230/LIPIcs.CPM.2022.1  

  20. Reforming an envy-free matching 査読有り

    Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki

    AAAI 5084-5091 2022年

    DOI: 10.1609/aaai.v36i5.20441  

  21. Shortest reconfiguration of perfect matchings via alternating cycles 査読有り

    Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto

    SIAM Journal on Discrete Mathematics 36 (2) 1102-1123 2022年

    DOI: 10.1137/20m1364370  

  22. A parameterized view to the robust recoverable base problem of matroids under structural uncertainty 査読有り

    Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto

    Operations Research Letters 50 (3) 370-375 2022年

    DOI: 10.1016/j.orl.2022.05.001  

  23. Incremental optimization of independent sets under the reconfiguration framework 査読有り

    Takehiro Ito, Haruka Mizuta, Naomi Nishimura, Akira Suzuki

    Journal of Combinatorial Optimization 43 (5) 1264-1279 2022年

    DOI: 10.1007/s10878-020-00630-z  

  24. Reconfiguring directed trees in a digraph 査読有り

    Takehiro Ito, Yuni Iwamasa, Yasuaki Kobayashi, Yu Nakahata, Yota Otachi, Kunihiro Wasa

    Computing and Combinatorics - 27th International Conference (COCOON) 343-354 2021年

    出版者・発行元:Springer

    DOI: 10.1007/978-3-030-89543-3_29  

  25. Algorithms for gerrymandering over graphs 査読有り

    Takehiro Ito, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto

    Theoretical Computer Science 868 30-45 2021年

    DOI: 10.1016/j.tcs.2021.03.037  

  26. Approximability of the independent feedback vertex set problem for bipartite graphs 査読有り

    Yuma Tamura, Takehiro Ito, Xiao Zhou

    Theoretical Computer Science 849 227-236 2021年

    DOI: 10.1016/j.tcs.2020.10.026  

  27. Parameterized complexity of independent set reconfiguration problems 査読有り

    Takehiro Ito, Marcin Kamiński, Hirotaka Ono, Akira Suzuki, Ryuhei Uehara, Katsuhisa Yamanaka

    Discrete Applied Mathematics 283 336-345 2020年9月

    出版者・発行元:None

    DOI: 10.1016/j.dam.2020.01.022  

    ISSN:0166-218X

  28. Reconfiguring spanning and induced subgraphs 査読有り

    Tesshu Hanaka, Takehiro Ito, Haruka Mizuta, Benjamin Moore, Naomi Nishimura, Vijay Subramanya, Akira Suzuki, Krishna Vaidyanathan

    Theoretical Computer Science 806 553-566 2020年2月

    DOI: 10.1016/j.tcs.2019.09.018  

  29. Approximability of the independent feedback vertex set problem for bipartite graphs 査読有り

    Yuma Tamura, Takehiro Ito, Xiao Zhou

    Proceedings of the 14th International Conference and Workshop on Algorithms and Computation (WALCOM 2020), Lecture Notes in Computer Science 12049 286-295 2020年

    DOI: 10.1007/978-3-030-39881-1_24  

  30. Shortest reconfiguration of colorings under Kempe changes 査読有り

    Marthe Bonamy, Marc Heinrich, Takehiro Ito, Yusuke Kobayashi, Haruka Mizuta, Moritz Mühlenthaler, Akira Suzuki, Kunihiro Wasa

    Proceedings of the 37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020), Leibniz International Proceedings in Informatics 154 35:1-35:14 2020年

    DOI: 10.4230/LIPIcs.STACS.2020.35  

  31. Reconfiguration of colorable sets in classes of perfect graphs 査読有り

    Takehiro Ito, Yota Otachi

    Theoretical Computer Science 772 111-122 2019年6月

    DOI: 10.1016/j.tcs.2018.11.024  

  32. The coloring reconfiguration problem on specific graph classes 査読有り

    Tatsuhiko Hatanaka, Takehiro Ito, Xiao Zhou

    IEICE Trans. on Information and Systems 102-D (3) 423-429 2019年3月

    DOI: 10.1587/transinf.2018FCP0005  

  33. Reconfiguration of maximum-weight b-matchings in a graph 査読有り

    Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto

    Journal of Combinatorial Optimization 37 (2) 454-464 2019年2月

    DOI: 10.1007/s10878-018-0289-3  

  34. Shortest reconfiguration of matchings 査読有り

    Nicolas Bousquet, Tatsuhiko Hatanaka, Takehiro Ito, Moritz Mühlenthaler

    Proceedings of the 45th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2019) 11789 162-174 2019年

    DOI: 10.1007/978-3-030-30786-8_13  

  35. The perfect matching reconfiguration problem 査読有り

    Marthe Bonamy, Nicolas Bousquet, Marc Heinrich, Takehiro Ito, Yusuke Kobayashi, Arnaud Mary, Moritz Mühlenthaler, Kunihiro Wasa

    Proceedings of the 44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019) 138 80:1-80:14 2019年

    DOI: 10.4230/LIPIcs.MFCS.2019.80  

  36. Reconfiguration of minimum Steiner trees via vertex exchanges 査読有り

    Haruka Mizuta, Tatsuhiko Hatanaka, Takehiro Ito, Xiao Zhou

    Proceedings of the 44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019) 138 79:1-79:11 2019年

    DOI: 10.4230/LIPIcs.MFCS.2019.79  

  37. Shortest reconfiguration of perfect matchings via alternating cycles 査読有り

    Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto

    Proceedings of the 27th Annual European Symposium on Algorithms (ESA 2019), Leibniz International Proceedings in Informatics 144 61:1-61:15 2019年

    DOI: 10.4230/LIPIcs.ESA.2019.61  

  38. Incremental optimization of independent sets under the reconfiguration framework 査読有り

    Takehiro Ito, Haruka Mizuta, Naomi Nishimura, Akira Suzuki

    Proceedings of the 25th International Computing and Combinatorics Conference (COCOON 2019) 11653 313-324 2019年

    DOI: 10.1007/978-3-030-26176-4_26  

  39. Diameter of colorings under Kempe changes 査読有り

    Marthe Bonamy, Marc Heinrich, Takehiro Ito, Yusuke Kobayashi, Haruka Mizuta, Moritz Mühlenthaler, Akira Suzuki, Kunihiro Wasa

    Proceedings of the 25th International Computing and Combinatorics Conference (COCOON 2019) 11653 52-64 2019年

    DOI: 10.1007/978-3-030-26176-4_5  

  40. Algorithms for gerrymandering over graphs 査読有り

    Takehiro Ito, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto

    Proceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems (AAMAS 2019) 1413-1421 2019年

  41. Minimum-cost b-edge dominating sets on trees 査読有り

    Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto

    Algorithmica 81 (1) 343-366 2019年1月

    DOI: 10.1007/s00453-018-0448-z  

  42. Reconfiguration of colorable sets in classes of perfect graphs 査読有り

    Takehiro Ito, Yota Otachi

    Proceedings of the 16th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2018) 101 27:1-27:13 2018年

  43. Algorithms for coloring reconfiguration under recolorability constraints. 査読有り

    Hiroki Osawa, Akira Suzuki, Takehiro Ito, Xiao Zhou

    Proceedings of the 29th International Symposium on Algorithms and Computation (ISAAC 2018) 123 37:1-37:13 2018年

    DOI: 10.4230/LIPIcs.ISAAC.2018.37  

  44. The complexity of (list) edge-coloring reconfiguration problem 査読有り

    Hiroki Osawa, Akira Suzuki, Takehiro Ito, Xiao Zhou

    IEICE Transactions 101-A (1) 232-238 2018年

    DOI: 10.1587/transfun.E101.A.232  

  45. Parameterized complexity of the list coloring reconfiguration problem with graph parameters 査読有り

    Tatsuhiko Hatanaka, Takehiro Ito, Xiao Zhou

    Theoretical Computer Science 739 65-79 2018年

    DOI: 10.1016/j.tcs.2018.05.005  

  46. Reconfiguring spanning and induced subgraphs 査読有り

    Tesshu Hanaka, Takehiro Ito, Haruka Mizuta, Benjamin Moore, Naomi Nishimura, Vijay Subramanya, Akira Suzuki, Krishna Vaidyanathan

    Computing and Combinatorics - 24th International Conference, COCOON 2018, Qing Dao, China, July 2-4, 2018, Proceedings 428-440 2018年

    DOI: 10.1007/978-3-319-94776-1_36  

  47. Complexity of tiling a polygon with trominoes or bars 査読有り

    Takashi Horiyama, Takehiro Ito, Keita Nakatsuka, Akira Suzuki, Ryuhei Uehara

    Discrete & Computational Geometry 58 (3) 686-704 2017年

    DOI: 10.1007/s00454-017-9884-9  

  48. Reconfiguration of Steiner trees in an unweighted graph 査読有り

    Haruka Mizuta, Takehiro Ito, Xiao Zhou

    IEICE Transactions 100-A (7) 1532-1540 2017年

    DOI: 10.1587/transfun.E100.A.1532  

  49. Efficient stabilization of cooperative matching games 査読有り

    Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto

    Theoretical Computer Science 677 69-82 2017年

    DOI: 10.1016/j.tcs.2017.03.020  

  50. Tight approximability of the server allocation problem for real-time applications 査読有り

    Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto, Taichi Shiitada

    Algorithmic Aspects of Cloud Computing - Third International Workshop, ALGOCLOUD 2017, Vienna, Austria, September 5, 2017, Revised Selected Papers 41-55 2017年

    DOI: 10.1007/978-3-319-74875-7_4  

  51. The coloring reconfiguration problem on specific graph classes 査読有り

    Tatsuhiko Hatanaka, Takehiro Ito, Xiao Zhou

    Combinatorial Optimization and Applications - 11th International Conference, COCOA 2017, Shanghai, China, December 16-18, 2017, Proceedings, Part I 152-162 2017年

    DOI: 10.1007/978-3-319-71150-8_15  

  52. Reconfiguration of maximum-weight b-matchings in a graph 査読有り

    Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto

    Computing and Combinatorics - 23rd International Conference, COCOON 2017, Hong Kong, China, August 3-5, 2017, Proceedings 287-296 2017年

    DOI: 10.1007/978-3-319-62389-4_24  

  53. Complexity of the multi-service center problem 査読有り

    Takehiro Ito, Naonori Kakimura, Yusuke Kobayashi

    28th International Symposium on Algorithms and Computation, ISAAC 2017, December 9-12, 2017, Phuket, Thailand 48:1-48:12 2017年

    DOI: 10.4230/LIPIcs.ISAAC.2017.48  

  54. Complexity of coloring reconfiguration under recolorability constraints 査読有り

    Hiroki Osawa, Akira Suzuki, Takehiro Ito, Xiao Zhou

    28th International Symposium on Algorithms and Computation, ISAAC 2017, December 9-12, 2017, Phuket, Thailand 62:1-62:12 2017年

    DOI: 10.4230/LIPIcs.ISAAC.2017.62  

  55. Parameterized complexity of the list coloring reconfiguration problem with graph parameters 査読有り

    Tatsuhiko Hatanaka, Takehiro Ito, Xiao Zhou

    42nd International Symposium on Mathematical Foundations of Computer Science, MFCS 2017, August 21-25, 2017 - Aalborg, Denmark 51:1-51:13 2017年

    DOI: 10.4230/LIPIcs.MFCS.2017.51  

  56. Approximation algorithm for the distance-3 independent set problem on cubic graphs 査読有り

    Hiroshi Eto, Takehiro Ito, Zhilong Liu, Eiji Miyano

    WALCOM: Algorithms and Computation, 11th International Conference and Workshops, WALCOM 2017, Hsinchu, Taiwan, March 29-31, 2017, Proceedings. 228-240 2017年

    DOI: 10.1007/978-3-319-53925-6_18  

  57. The complexity of (list) edge-coloring reconfiguration problem 査読有り

    Hiroki Osawa, Akira Suzuki, Takehiro Ito, Xiao Zhou

    WALCOM: Algorithms and Computation, 11th International Conference and Workshops, WALCOM 2017, Hsinchu, Taiwan, March 29-31, 2017, Proceedings. 347-358 2017年

    DOI: 10.1007/978-3-319-53925-6_27  

  58. A polynomial-time approximation scheme for the geometric unique coverage problem on unit squares 査読有り

    Takehiro Ito, Shin-Ichi Nakano, Yoshio Okamoto, Yota Otachi, Ryuhei Uehara, Takeaki Uno, Yushi Uno

    Computational Geometry: Theory and Applications 51 25-39 2016年

    DOI: 10.1016/j.comgeo.2015.10.004  

  59. Reconfiguration of vertex covers in a graph 査読有り

    Takehiro Ito, Hiroyuki Nooka, Xiao Zhou

    IEICE Transactions 99-D (3) 598-606 2016年

    DOI: 10.1587/transinf.2015FCP0010  

  60. The minimum vulnerability problem on specific graph classes 査読有り

    Yusuke Aoki, Bjarni V. Halldórsson, Magnús M. Halldórsson, Takehiro Ito, Christian Konrad, Xiao Zhou

    Journal of Combinatorial Optimization 32 (4) 1288-1304 2016年

    DOI: 10.1007/s10878-015-9950-2  

  61. The complexity of dominating set reconfiguration 査読有り

    Arash Haddadan, Takehiro Ito, Amer E. Mouawad, Naomi Nishimura, Hirotaka Ono, Akira Suzuki, Youcef Tebbal

    Theoretical Computer Science 651 37-49 2016年

    DOI: 10.1016/j.tcs.2016.08.016  

  62. Efficient stabilization of cooperative matching games 査読有り

    Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto

    Proceedings of the 2016 International Conference on Autonomous Agents & Multiagent Systems, Singapore, May 9-13, 2016 41-49 2016年

  63. Approximability of the distance independent set problem on regular graphs and planar graphs 査読有り

    Hiroshi Eto, Takehiro Ito, Zhilong Liu, Eiji Miyano

    Combinatorial Optimization and Applications - 10th International Conference, COCOA 2016, Hong Kong, China, December 16-18, 2016, Proceedings 270-284 2016年

    DOI: 10.1007/978-3-319-48749-6_20  

  64. Reconfiguration of Steiner trees in an unweighted graph 査読有り

    Haruka Mizuta, Takehiro Ito, Xiao Zhou

    Combinatorial Algorithms - 27th International Workshop, IWOCA 2016, Helsinki, Finland, August 17-19, 2016, Proceedings 163-175 2016年

    DOI: 10.1007/978-3-319-44543-4_13  

  65. Experimental evaluations of dynamic algorithm for maintaining shortest-paths trees on real-world networks 査読有り

    Takashi Hasegawa, Takehiro Ito, Akira Suzuki, Xiao Zhou

    Interdisciplinary Information Sciences 21 (1) 25-35 2015年

    DOI: 10.4036/iis.2015.25  

  66. The list coloring reconfiguration problem for bounded pathwidth graphs 査読有り

    Tatsuhiko Hatanaka, Takehiro Ito, Xiao Zhou

    IEICE Transactions 98-A (6) 1168-1178 2015年

    DOI: 10.1587/transfun.E98.A.1168  

  67. Algorithms for the independent feedback vertex set problem 査読有り

    Yuma Tamura, Takehiro Ito, Xiao Zhou

    IEICE Transactions 98-A (6) 1179-1188 2015年

    DOI: 10.1587/transfun.E98.A.1179  

  68. Swapping labeled tokens on graphs 査読有り

    Katsuhisa Yamanaka, Erik D. Demaine, Takehiro Ito, Jun Kawahara, Masashi Kiyomi, Yoshio Okamoto, Toshiki Saitoh, Akira Suzuki, Kei Uchizawa, Takeaki Uno

    Theoretical Computer Science 586 81-94 2015年

    DOI: 10.1016/j.tcs.2015.01.052  

  69. Linear-time algorithm for sliding tokens on trees 査読有り

    Erik D. Demaine, Martin L. Demaine, Eli Fox-Epstein, Duc A. Hoang, Takehiro Ito, Hirotaka Ono, Yota Otachi, Ryuhei Uehara, Takeshi Yamada

    Theoretical Computer Science 600 132-142 2015年

    DOI: 10.1016/j.tcs.2015.07.037  

  70. Reconfiguration of cliques in a graph 査読有り

    Takehiro Ito, Hirotaka Ono, Yota Otachi

    Theory and Applications of Models of Computation - 12th Annual Conference, TAMC 2015, Singapore, May 18-20, 2015, Proceedings 212-223 2015年

    DOI: 10.1007/978-3-319-17142-5_19  

  71. The complexity of dominating set reconfiguration 査読有り

    Arash Haddadan, Takehiro Ito, Amer E. Mouawad, Naomi Nishimura, Hirotaka Ono, Akira Suzuki, Youcef Tebbal

    Algorithms and Data Structures - 14th International Symposium, WADS 2015, Victoria, BC, Canada, August 5-7, 2015. Proceedings 398-409 2015年

    DOI: 10.1007/978-3-319-21840-3_33  

  72. Competitive diffusion on weighted graphs 査読有り

    Takehiro Ito, Yota Otachi, Toshiki Saitoh, Hisayuki Satoh, Akira Suzuki, Kei Uchizawa, Ryuhei Uehara, Katsuhisa Yamanaka, Xiao Zhou

    Algorithms and Data Structures - 14th International Symposium, WADS 2015, Victoria, BC, Canada, August 5-7, 2015. Proceedings 422-433 2015年

    DOI: 10.1007/978-3-319-21840-3_35  

  73. On the minimum caterpillar problem in digraphs 査読有り

    Taku Okada, Akira Suzuki, Takehiro Ito, Xiao Zhou

    IEICE Transactions 97-A (3) 848-857 2014年

    DOI: 10.1587/transfun.E97.A.848  

  74. Approximability of the subset sum reconfiguration problem 査読有り

    Takehiro Ito, Erik D. Demaine

    Journal of Combinatorial Optimization 28 (3) 639-654 2014年

    DOI: 10.1007/s10878-012-9562-z  

  75. A 4.31-approximation for the geometric unique coverage problem on unit disks 査読有り

    Takehiro Ito, Shin-Ichi Nakano, Yoshio Okamoto, Yota Otachi, Ryuhei Uehara, Takeaki Uno, Yushi Uno

    Theoretical Computer Science 544 14-31 2014年

    DOI: 10.1016/j.tcs.2014.04.014  

  76. Reconfiguration of list L(2,1)-labelings in a graph 査読有り

    Takehiro Ito, Kazuto Kawamura, Hirotaka Ono, Xiao Zhou

    Theoretical Computer Science 544 84-97 2014年

    DOI: 10.1016/j.tcs.2014.04.011  

  77. Complexity of finding maximum regular induced subgraphs with prescribed degree 査読有り

    Yuichi Asahiro, Hiroshi Eto, Takehiro Ito, Eiji Miyano

    Theoretical Computer Science 550 21-35 2014年

    DOI: 10.1016/j.tcs.2014.07.008  

  78. Generalized rainbow connectivity of graphs 査読有り

    Kei Uchizawa, Takanori Aoki, Takehiro Ito, Xiao Zhou

    Theoretical Computer Science 555 35-42 2014年

    DOI: 10.1016/j.tcs.2014.01.007  

  79. Base-object location problems for base-monotone regions 査読有り

    Jinhee Chun, Takashi Horiyama, Takehiro Ito, Natsuda Kaothanthong, Hirotaka Ono, Yota Otachi, Takeshi Tokuyama, Ryuhei Uehara, Takeaki Uno

    Theoretical Computer Science 555 71-84 2014年

    DOI: 10.1016/j.tcs.2013.11.030  

  80. The minimum vulnerability problem on graphs 査読有り

    Yusuke Aoki, Bjarni V. Halldórsson, Magnús M. Halldórsson, Takehiro Ito, Christian Konrad, Xiao Zhou

    Combinatorial Optimization and Applications - 8th International Conference, COCOA 2014, Wailea, Maui, HI, USA, December 19-21, 2014, Proceedings 299-313 2014年

    DOI: 10.1007/978-3-319-12691-3_23  

  81. The list coloring reconfiguration problem for bounded pathwidth graphs 査読有り

    Tatsuhiko Hatanaka, Takehiro Ito, Xiao Zhou

    Combinatorial Optimization and Applications - 8th International Conference, COCOA 2014, Wailea, Maui, HI, USA, December 19-21, 2014, Proceedings 314-328 2014年

    DOI: 10.1007/978-3-319-12691-3_24  

  82. Swapping labeled tokens on graphs 査読有り

    Katsuhisa Yamanaka, Erik D. Demaine, Takehiro Ito, Jun Kawahara, Masashi Kiyomi, Yoshio Okamoto, Toshiki Saitoh, Akira Suzuki, Kei Uchizawa, Takeaki Uno

    Fun with Algorithms - 7th International Conference, FUN 2014, Lipari Island, Sicily, Italy, July 1-3, 2014. Proceedings 364-375 2014年

    DOI: 10.1007/978-3-319-07890-8_31  

  83. Minimum-cost b-edge dominating sets on trees 査読有り

    Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto

    Algorithms and Computation - 25th International Symposium, ISAAC 2014, Jeonju, Korea, December 15-17, 2014, Proceedings 195-207 2014年

    DOI: 10.1007/978-3-319-13075-0_16  

  84. Fixed-parameter tractability of token jumping on planar graphs 査読有り

    Takehiro Ito, Marcin Kamiński, Hirotaka Ono

    Algorithms and Computation - 25th International Symposium, ISAAC 2014, Jeonju, Korea, December 15-17, 2014, Proceedings 208-219 2014年

    DOI: 10.1007/978-3-319-13075-0_17  

  85. Polynomial-time algorithm for sliding tokens on trees 査読有り

    Erik D. Demaine, Martin L. Demaine, Eli Fox-Epstein, Duc A. Hoang, Takehiro Ito, Hirotaka Ono, Yota Otachi, Ryuhei Uehara, Takeshi Yamada

    Algorithms and Computation - 25th International Symposium, ISAAC 2014, Jeonju, Korea, December 15-17, 2014, Proceedings 389-400 2014年

    DOI: 10.1007/978-3-319-13075-0_31  

  86. Reconfiguration of vertex covers in a graph 査読有り

    Takehiro Ito, Hiroyuki Nooka, Xiao Zhou

    Combinatorial Algorithms - 25th International Workshop, IWOCA 2014, Duluth, MN, USA, October 15-17, 2014, Revised Selected Papers 164-175 2014年

    DOI: 10.1007/978-3-319-19315-1_15  

  87. Deterministic algorithms for the independent feedback vertex set problem 査読有り

    Yuma Tamura, Takehiro Ito, Xiao Zhou

    Combinatorial Algorithms - 25th International Workshop, IWOCA 2014, Duluth, MN, USA, October 15-17, 2014, Revised Selected Papers 351-363 2014年

    DOI: 10.1007/978-3-319-19315-1_31  

  88. On the parameterized complexity for token jumping on graphs 査読有り

    Takehiro Ito, Marcin Kamiński, Hirotaka Ono, Akira Suzuki, Ryuhei Uehara, Katsuhisa Yamanaka

    Theory and Applications of Models of Computation - 11th Annual Conference, TAMC 2014, Chennai, India, April 11-13, 2014. Proceedings 341-351 2014年

    DOI: 10.1007/978-3-319-06089-7_24  

  89. Route-enabling graph orientation problems 査読有り

    Takehiro Ito, Yuichiro Miyamoto, Hirotaka Ono, Hisao Tamaki, Ryuhei Uehara

    Algorithmica 65 (2) 317-338 2013年

    DOI: 10.1007/s00453-011-9589-z  

  90. On the rainbow connectivity of graphs: Complexity and FPT algorithms 査読有り

    Kei Uchizawa, Takanori Aoki, Takehiro Ito, Akira Suzuki, Xiao Zhou

    Algorithmica 67 (2) 161-179 2013年

    DOI: 10.1007/s00453-012-9689-4  

  91. On the minimum caterpillar problem in digraphs 査読有り

    Taku Okada, Akira Suzuki, Takehiro Ito, Xiao Zhou

    Computing and Combinatorics, 19th International Conference, COCOON 2013, Hangzhou, China, June 21-23, 2013. Proceedings 729-736 2013年

    DOI: 10.1007/978-3-642-38768-5_66  

  92. Complexity of finding maximum regular induced subgraphs with prescribed degree 査読有り

    Yuichi Asahiro, Hiroshi Eto, Takehiro Ito, Eiji Miyano

    Fundamentals of Computation Theory - 19th International Symposium, FCT 2013, Liverpool, UK, August 19-21, 2013. Proceedings 28-39 2013年

    DOI: 10.1007/978-3-642-40164-0_6  

  93. Base location problems for base-monotone regions 査読有り

    Jinhee Chun, Takashi Horiyama, Takehiro Ito, Natsuda Kaothanthong, Hirotaka Ono, Yota Otachi, Takeshi Tokuyama, Ryuhei Uehara, Takeaki Uno

    WALCOM: Algorithms and Computation, 7th International Workshop, WALCOM 2013, Kharagpur, India, February 14-16, 2013. Proceedings 53-64 2013年

    DOI: 10.1007/978-3-642-36065-7_7  

  94. Generalized rainbow connectivity of graphs 査読有り

    Kei Uchizawa, Takanori Aoki, Takehiro Ito, Xiao Zhou

    WALCOM: Algorithms and Computation, 7th International Workshop, WALCOM 2013, Kharagpur, India, February 14-16, 2013. Proceedings 233-244 2013年

    DOI: 10.1007/978-3-642-36065-7_22  

  95. Partitioning a weighted tree into subtrees with weights in a given range 査読有り

    Takehiro Ito, Takao Nishizeki, Michael Schröder, Takeaki Uno, Xiao Zhou

    Algorithmica 62 (3月4日) 823-841 2012年

    DOI: 10.1007/s00453-010-9485-y  

  96. Minimum cost partitions of trees with supply and demand 査読有り

    Takehiro Ito, Takuya Hara, Xiao Zhou, Takao Nishizeki

    Algorithmica 64 (3) 400-415 2012年

    DOI: 10.1007/s00453-011-9573-7  

  97. Reconfiguration of list edge-colorings in a graph 査読有り

    Takehiro Ito, Marcin Kamiński, Erik D. Demaine

    Discrete Applied Mathematics 160 (15) 2199-2207 2012年

    DOI: 10.1016/j.dam.2012.05.014  

  98. An improved sufficient condition for reconfiguration of list edge-colorings in a tree 査読有り

    Takehiro Ito, Kazuto Kawamura, Xiao Zhou

    IEICE Transactions 95-D (3) 737-745 2012年

    DOI: 10.1587/transinf.E95.D.737  

  99. Packing trominoes is NP-complete, #P-complete and ASP-complete 査読有り

    Takashi Horiyama, Takehiro Ito, Keita Nakatsuka, Akira Suzuki, Ryuhei Uehara

    Proceedings of the 24th Canadian Conference on Computational Geometry, CCCG 2012, Charlottetown, Prince Edward Island, Canada, August 8-10, 2012 211-216 2012年

  100. Reconfiguration of list L(2, 1)-labelings in a graph 査読有り

    Takehiro Ito, Kazuto Kawamura, Hirotaka Ono, Xiao Zhou

    Algorithms and Computation - 23rd International Symposium, ISAAC 2012, Taipei, Taiwan, December 19-21, 2012. Proceedings 34-43 2012年

    DOI: 10.1007/978-3-642-35261-4_7  

  101. A 4.31-approximation for the geometric unique coverage problem on unit disks 査読有り

    Takehiro Ito, Shin-Ichi Nakano, Yoshio Okamoto, Yota Otachi, Ryuhei Uehara, Takeaki Uno, Yushi Uno

    Algorithms and Computation - 23rd International Symposium, ISAAC 2012, Taipei, Taiwan, December 19-21, 2012. Proceedings 372-381 2012年

    DOI: 10.1007/978-3-642-35261-4_40  

  102. A polynomial-time approximation scheme for the geometric unique coverage problem on unit squares 査読有り

    Takehiro Ito, Shin-Ichi Nakano, Yoshio Okamoto, Yota Otachi, Ryuhei Uehara, Takeaki Uno, Yushi Uno

    Algorithm Theory - SWAT 2012 - 13th Scandinavian Symposium and Workshops, Helsinki, Finland, July 4-6, 2012. Proceedings 24-35 2012年

    DOI: 10.1007/978-3-642-31155-0_3  

  103. On disconnected cuts and separators 査読有り

    Takehiro Ito, Marcin Kamiński, Daniël Paulusma, Dimitrios M. Thilikos

    Discrete Applied Mathematics 159 (13) 1345-1351 2011年

    DOI: 10.1016/j.dam.2011.04.027  

  104. Minimum cost edge-colorings of trees can be reduced to matchings 査読有り

    Takehiro Ito, Naoki Sakamoto, Xiao Zhou, Takao Nishizeki

    IEICE Transactions 94-D (2) 190-195 2011年

    DOI: 10.1587/transinf.E94.D.190  

  105. On the complexity of reconfiguration problems 査読有り

    Takehiro Ito, Erik D. Demaine, Nicholas J, A. Harvey, Christos H. Papadimitriou, Martha Sideri, Ryuhei Uehara, Yushi Uno

    Theoretical Computer Science 412 (12-14) 1054-1065 2011年

    DOI: 10.1016/j.tcs.2010.12.005  

  106. Parameterizing cut sets in a graph by the number of their components 査読有り

    Takehiro Ito, Marcin Kamiński, Daniël Paulusma, Dimitrios M. Thilikos

    Theoretical Computer Science 412 (45) 6340-6350 2011年

    DOI: 10.1016/j.tcs.2011.07.005  

  107. On the rainbow connectivity of graphs: Complexity and FPT algorithms 査読有り

    Kei Uchizawa, Takanori Aoki, Takehiro Ito, Akira Suzuki, Xiao Zhou

    Computing and Combinatorics - 17th Annual International Conference, COCOON 2011, Dallas, TX, USA, August 14-16, 2011. Proceedings 86-97 2011年

    DOI: 10.1007/978-3-642-22685-4_8  

  108. Approximability of the subset sum reconfiguration problem 査読有り

    Takehiro Ito, Erik D. Demaine

    Theory and Applications of Models of Computation - 8th Annual Conference, TAMC 2011, Tokyo, Japan, May 23-25, 2011. Proceedings 58-69 2011年

    DOI: 10.1007/978-3-642-20877-5_7  

  109. An improved sufficient condition for reconfiguration of list edge-colorings in a tree 査読有り

    Takehiro Ito, Kazuto Kawamura, Xiao Zhou

    Theory and Applications of Models of Computation - 8th Annual Conference, TAMC 2011, Tokyo, Japan, May 23-25, 2011. Proceedings 94-105 2011年

    DOI: 10.1007/978-3-642-20877-5_10  

  110. Minimum cost edge-colorings of trees can be reduced to matchings 査読有り

    Takehiro Ito, Naoki Sakamoto, Xiao Zhou, Takao Nishizeki

    Frontiers in Algorithmics, 4th International Workshop, FAW 2010, Wuhan, China, August 11-13, 2010. Proceedings 274-284 2010年

    DOI: 10.1007/978-3-642-14553-7_26  

  111. Minimum cost partitions of trees with supply and demand 査読有り

    Takehiro Ito, Takuya Hara, Xiao Zhou, Takao Nishizeki

    Algorithms and Computation - 21st International Symposium, ISAAC 2010, Jeju Island, Korea, December 15-17, 2010, Proceedings, Part II 351-362 2010年

    DOI: 10.1007/978-3-642-17514-5_30  

  112. Partitioning graphs of supply and demand 査読有り

    Takehiro Ito, Xiao Zhou, Takao Nishizeki

    Discrete Applied Mathematics 157 (12) 2620-2633 2009年

    DOI: 10.1016/j.dam.2008.08.012  

  113. A characterization of graphs with fractional total chromatic number equal to Delta+2 査読有り

    Takehiro Ito, W. Sean Kennedy, Bruce A. Reed

    Electronic Notes in Discrete Mathematics 35 235-240 2009年

    DOI: 10.1016/j.endm.2009.11.039  

  114. Route-enabling graph orientation problems 査読有り

    Takehiro Ito, Yuichiro Miyamoto, Hirotaka Ono, Hisao Tamaki, Ryuhei Uehara

    Algorithms and Computation, 20th International Symposium, ISAAC 2009, Honolulu, Hawaii, USA, December 16-18, 2009. Proceedings 403-412 2009年

    DOI: 10.1007/978-3-642-10631-6_42  

  115. Parameterizing cut sets in a graph by the number of their components 査読有り

    Takehiro Ito, Marcin Kamiński, Daniël Paulusma, Dimitrios M. Thilikos

    Algorithms and Computation, 20th International Symposium, ISAAC 2009, Honolulu, Hawaii, USA, December 16-18, 2009. Proceedings 605-615 2009年

    DOI: 10.1007/978-3-642-10631-6_62  

  116. Reconfiguration of list edge-colorings in a graph 査読有り

    Takehiro Ito, Marcin Kamiński, Erik D. Demaine

    Algorithms and Data Structures, 11th International Symposium, WADS 2009, Banff, Canada, August 21-23, 2009. Proceedings 375-386 2009年

    DOI: 10.1007/978-3-642-03367-4_33  

  117. Approximability of partitioning graphs with supply and demand 査読有り

    Takehiro Ito, Erik D. Demaine, Xiao Zhou, Takao Nishizeki

    Journal of Discrete Algorithms 6 (4) 627-650 2008年

    DOI: 10.1016/j.jda.2008.03.002  

  118. On the complexity of reconfiguration problems 査読有り

    Takehiro Ito, Erik D. Demaine, Nicholas J, A. Harvey, Christos H. Papadimitriou, Martha Sideri, Ryuhei Uehara, Yushi Uno

    Algorithms and Computation, 19th International Symposium, ISAAC 2008, Gold Coast, Australia, December 15-17, 2008. Proceedings 28-39 2008年

    DOI: 10.1007/978-3-540-92182-0_6  

  119. Partitioning a weighted tree to subtrees of almost uniform size 査読有り

    Takehiro Ito, Takeaki Uno, Xiao Zhou, Takao Nishizeki

    Algorithms and Computation, 19th International Symposium, ISAAC 2008, Gold Coast, Australia, December 15-17, 2008. Proceedings 196-207 2008年

    DOI: 10.1007/978-3-540-92182-0_20  

  120. Partitioning a multi-weighted graph to connected subgraphs of almost uniform size 査読有り

    Takehiro Ito, Kazuya Goto, Xiao Zhou, Takao Nishizeki

    IEICE Transactions 90-D (2) 449-456 2007年

    DOI: 10.1093/ietisy/e90-d.2.449  

  121. Algorithms for finding distance-edge-colorings of graphs 査読有り

    Takehiro Ito, Akira Kato, Xiao Zhou, Takao Nishizeki

    Journal of Discrete Algorithms 5 (2) 304-322 2007年

    DOI: 10.1016/j.jda.2006.03.020  

  122. Partitioning a graph of bounded tree-width to connected subgraphs of almost uniform size 査読有り

    Takehiro Ito, Xiao Zhou, Takao Nishizeki

    Journal of Discrete Algorithms 4 (1) 142-154 2006年

    DOI: 10.1016/j.jda.2005.01.005  

  123. Partitioning a multi-weighted graph to connected subgraphs of almost uniform size 査読有り

    Takehiro Ito, Kazuya Goto, Xiao Zhou, Takao Nishizeki

    Computing and Combinatorics, 12th Annual International Conference, COCOON 2006, Taipei, Taiwan, August 15-18, 2006, Proceedings 63-72 2006年

    DOI: 10.1007/11809678_9  

  124. Approximability of partitioning graphs with supply and demand 査読有り

    Takehiro Ito, Erik D. Demaine, Xiao Zhou, Takao Nishizeki

    Algorithms and Computation, 17th International Symposium, ISAAC 2006, Kolkata, India, December 18-20, 2006, Proceedings 121-130 2006年

    DOI: 10.1007/11940128_14  

  125. Partitioning trees of supply and demand 査読有り

    Takehiro Ito, Xiao Zhou, Takao Nishizeki

    International Journal of Foundations of Computer Science 16 (4) 803-827 2005年

    DOI: 10.1142/S0129054105003303  

  126. Algorithms for finding distance-edge-colorings of graphs 査読有り

    Takehiro Ito, Akira Kato, Xiao Zhou, Takao Nishizeki

    Computing and Combinatorics, 11th Annual International Conference, COCOON 2005, Kunming, China, August 16-29, 2005, Proceedings 798-807 2005年

    DOI: 10.1007/11533719_81  

  127. Partitioning graphs of supply and demand 査読有り

    Takehiro Ito, Xiao Zhou, Takao Nishizeki

    International Symposium on Circuits and Systems (ISCAS 2005), 23-26 May 2005, Kobe, Japan 160-163 2005年

    DOI: 10.1109/ISCAS.2005.1464549  

  128. Partitioning a weighted graph to connected subgraphs of almost uniform size 査読有り

    Takehiro Ito, Xiao Zhou, Takao Nishizeki

    Graph-Theoretic Concepts in Computer Science, 30th International Workshop, WG 2004, Bad Honnef, Germany, June 21-23, 2004, Revised Papers 365-376 2004年

    DOI: 10.1007/978-3-540-30559-0_31  

  129. Algorithms for multicolorings of partial k-trees 査読有り

    Takehiro Ito, Takao Nishizeki, Xiao Zhou

    IEICE Transactions E86-D (2) 191-200 2003年

  130. Algorithms for the multicolorings of partial k-trees 査読有り

    Takehiro Ito, Takao Nishizeki, Xiao Zhou

    Computing and Combinatorics, 8th Annual International Conference, COCOON 2002, Singapore, August 15-17, 2002, Proceedings 430-439 2002年

    DOI: 10.1007/3-540-45655-4_46  

  131. Partitioning trees of supply and demand 査読有り

    Takehiro Ito, Xiao Zhou, Takao Nishizeki

    Algorithms and Computation, 13th International Symposium, ISAAC 2002 Vancouver, BC, Canada, November 21-23, 2002, Proceedings 612-623 2002年

    DOI: 10.1007/3-540-36136-7_53  

︎全件表示 ︎最初の5件までを表示

産業財産権 4

  1. 配電系統制御装置

    杉村 修平, 田邊 隆之, 周 暁, 伊藤 健洋, 鈴木 顕

    特許第7336359号

    産業財産権の種類: 特許権

  2. 配電系統制御装置

    杉村 修平, 田邊 隆之, 周 暁, 伊藤 健洋, 鈴木 顕, 畠山 航

    特許第7303500号

    産業財産権の種類: 特許権

  3. 配電系統制御装置

    杉村 修平, 田邊 隆之, 周 暁, 伊藤 健洋, 鈴木 顕, 千葉 詩音

    特許第7145109号

    産業財産権の種類: 特許権

  4. 配電自動化システムの電力融通方法

    西関 隆夫, 周 暁, 伊藤 健洋, 南部 淳, 伊藤 孝充, 田中 哲司

    特許第4622968号

    産業財産権の種類: 特許権