• Search Research Projects
  • Search Researchers
  • How to Use
  1. Back to previous page

Ito Takehiro  伊藤 健洋

ORCIDConnect your ORCID iD *help
… Alternative Names

ITO Takehiro  伊藤 健洋

Less
Researcher Number 40431548
Other IDs
Affiliation (Current) 2025: 東北大学, 情報科学研究科, 教授
Affiliation (based on the past Project Information) *help 2020 – 2024: 東北大学, 情報科学研究科, 教授
2012 – 2019: 東北大学, 情報科学研究科, 准教授
2013: 東北大学, 大学院情報科学研究科, 准教授
2010 – 2012: 東北大学, 大学院・情報科学研究科, 准教授
2007 – 2009: Tohoku University, 大学院・情報科学研究科, 助教
2006: Tohoku University, Graduate School of Information Sciences, Research Associate, 大学院情報科学研究科, 助手
Review Section/Research Field
Principal Investigator
Fundamental theory of informatics / Transformative Research Areas, Section (IV) / Theory of informatics / Science and Engineering / Medium-sized Section 60:Information science, computer engineering, and related fields / Basic Section 60010:Theory of informatics-related
Except Principal Investigator
Fundamental theory of informatics / Medium-sized Section 60:Information science, computer engineering, and related fields / Science and Engineering
Keywords
Principal Investigator
アルゴリズム / グラフ / 組合せ遷移 / グラフアルゴリズム / 情報基礎 / グラフ理論 / 固定パラメータ容易性 / 近似困難性 / アルゴリズム理論 / 近似アルゴリズム … More / 分割問題 / 部分k木 / 分散アルゴリズム / 列挙アルゴリズム / 計算複雑性 / 離散数学 / 数学 / 配電制御 / ソルバー / 社会システム工学 / マッチング / 近似不可能性 / 運搬経路問題 / 近似 / 解空間の連結性 / 遷移問題 / 点彩色 / 独立点集合 / リスト辺彩色 / グラフ分割問題 / 部分集合和問題 / ナップザック問題 / L(2,1)ラベリング / 遷移可能性問題 / 木 / 完全近似スキーム / 部分k-木 / 直並列グラフ … More
Except Principal Investigator
アルゴリズム / 離散構造 / グラフ描画 / 組合せ遷移 / 部分k木 / VLSI設計 / 設計自動化 / アルゴリズム理論 / 実用的アルゴリズム / SATソルバ / 二分決定図 / 計算困難・計算不能な問題 / 列挙アルゴリズム / BDD / 遷移問題 / 計算幾何 / 離散数学 / 二部決定ダイアグラム / グラフアルゴリズム / 組合せ遷移問題 / 高速アルゴリズム / グラフ理論 / 計算折り紙 / 計算複雑性 / 計算量 / 計算幾何学 / 二部決定図(BDD) / データ構造 / 計算量の理論 / Orthogonal Drawir / List Total Coloring / Edge-Colorings / Partial k-Trees / Structured Graphs / Algorithms / 直交描画 / リスト全彩色 / 辺彩色 / 構造的グラフ / 3連結成分分解木 / 内部3連結グラフ / 格子凸描画 / グラフ彩色 / グラフ分割 / 擬多項式時間 / 辺容量 / 公平連結分割 / 直並列グラフ / 全域配送林 / 描画 / 彩色 / 分割 / グラフ / インターネット高度化 / 情報基礎 / 可視化 / インターネット高速化 Less
  • Research Projects

    (18 results)
  • Research Products

    (374 results)
  • Co-Researchers

    (30 People)
  •  解空間の形状に着目した組合せ遷移の理論:計算量解析の高精細化とソルバー新技法Principal Investigator

    • Principal Investigator
      伊藤 健洋
    • Project Period (FY)
      2024 – 2027
    • Research Category
      Grant-in-Aid for Scientific Research (A)
    • Review Section
      Medium-sized Section 60:Information science, computer engineering, and related fields
    • Research Institution
      Tohoku University
  •  Research on solvable regions of theoretically uncomputable/difficult classes

    • Principal Investigator
      上原 隆平
    • Project Period (FY)
      2024 – 2028
    • Research Category
      Grant-in-Aid for Scientific Research (A)
    • Review Section
      Medium-sized Section 60:Information science, computer engineering, and related fields
    • Research Institution
      Japan Advanced Institute of Science and Technology
  •  Fusion of Computer Science, Engineering and Mathematics Approaches for Expanding Combinatorial ReconfigurationArea Organizer

    • Area Organizer
      伊藤 健洋
    • Project Period (FY)
      2020 – 2022
    • Research Category
      Grant-in-Aid for Transformative Research Areas (B)
  •  Fusion of Computer Science, Engineering and Mathematics Approaches for Expanding Combinatorial ReconfigurationPrincipal Investigator

    • Principal Investigator
      ITO Takehiro
    • Project Period (FY)
      2020 – 2022
    • Research Category
      Grant-in-Aid for Transformative Research Areas (B)
    • Review Section
      Transformative Research Areas, Section (IV)
    • Research Institution
      Tohoku University
  •  Computer Science Approach for Expanding Combinatorial Reconfiguration: Toward Automatic Generation of AlgorithmsPrincipal Investigator

    • Principal Investigator
      ITO Takehiro
    • Project Period (FY)
      2020 – 2022
    • Research Category
      Grant-in-Aid for Transformative Research Areas (B)
    • Review Section
      Transformative Research Areas, Section (IV)
    • Research Institution
      Tohoku University
  •  迂回の特性を捉えた最短遷移アルゴリズムに関する研究Principal Investigator

    • Principal Investigator
      伊藤 健洋
    • Project Period (FY)
      2019 – 2024
    • Research Category
      Grant-in-Aid for Scientific Research (C)
    • Review Section
      Basic Section 60010:Theory of informatics-related
    • Research Institution
      Tohoku University
  •  Research on algorithms and data structures for solving theoretically hard problems in practical time

    • Principal Investigator
      Uehara Ryuhei
    • Project Period (FY)
      2018 – 2022
    • Research Category
      Grant-in-Aid for Scientific Research (A)
    • Review Section
      Medium-sized Section 60:Information science, computer engineering, and related fields
    • Research Institution
      Japan Advanced Institute of Science and Technology
  •  Algorithms and their generalizations for vehicle routing problems of minimizing regretsPrincipal Investigator

    • Principal Investigator
      ITO Takehiro
    • Project Period (FY)
      2016 – 2018
    • Research Category
      Grant-in-Aid for Scientific Research (C)
    • Research Field
      Theory of informatics
    • Research Institution
      Tohoku University
  •  解空間のパラメータ化解析による計算困難性と容易性の解明Principal Investigator

    • Principal Investigator
      伊藤 健洋
    • Project Period (FY)
      2015 – 2016
    • Research Category
      Grant-in-Aid for Scientific Research on Innovative Areas (Research in a proposed research area)
    • Review Section
      Science and Engineering
    • Research Institution
      Tohoku University
  •  解空間の直径に基づく計算限界解析アプローチの構築Principal Investigator

    • Principal Investigator
      伊藤 健洋
    • Project Period (FY)
      2013 – 2014
    • Research Category
      Grant-in-Aid for Scientific Research on Innovative Areas (Research in a proposed research area)
    • Review Section
      Science and Engineering
    • Research Institution
      Tohoku University
  •  Development of algorithms for the server-assignment problem to maximize available capacity of networksPrincipal Investigator

    • Principal Investigator
      ITO TAKEHIRO
    • Project Period (FY)
      2013 – 2015
    • Research Category
      Grant-in-Aid for Scientific Research (C)
    • Research Field
      Theory of informatics
    • Research Institution
      Tohoku University
  •  A Study of Reconfiguration Problems to Develop Dynamic SystemsPrincipal Investigator

    • Principal Investigator
      ITO Takehiro
    • Project Period (FY)
      2010 – 2012
    • Research Category
      Grant-in-Aid for Young Scientists (B)
    • Research Field
      Fundamental theory of informatics
    • Research Institution
      Tohoku University
  •  Efficient Algorithms for Partitionings, Colorings and Drawings of Graphs and their Applications

    • Principal Investigator
      NISHIZEKI Takao
    • Project Period (FY)
      2009 – 2013
    • Research Category
      Grant-in-Aid for Scientific Research (C)
    • Research Field
      Fundamental theory of informatics
    • Research Institution
      Kwansei Gakuin University
      Tohoku University
  •  Heuristic algorithms with reasonable running timePrincipal Investigator

    • Principal Investigator
      ITO Takehiro
    • Project Period (FY)
      2008 – 2009
    • Research Category
      Grant-in-Aid for Young Scientists (B)
    • Research Field
      Fundamental theory of informatics
    • Research Institution
      Tohoku University
  •  Graph Drawing Algorithms and Applications to VLSI Designs

    • Principal Investigator
      NISHIZEKI Takao
    • Project Period (FY)
      2007 – 2008
    • Research Category
      Grant-in-Aid for Scientific Research (C)
    • Research Field
      Fundamental theory of informatics
    • Research Institution
      Tohoku University
  •  グラフ分割アルゴリズムの新しい設計手法に関する研究Principal Investigator

    • Principal Investigator
      伊藤 健洋
    • Project Period (FY)
      2006 – 2007
    • Research Category
      Grant-in-Aid for Young Scientists (Start-up)
    • Research Field
      Fundamental theory of informatics
    • Research Institution
      Tohoku University
  •  Unified Methodology for Designing Efficient Algorithms

    • Principal Investigator
      NISHIZEKI Takao
    • Project Period (FY)
      2005 – 2006
    • Research Category
      Grant-in-Aid for Scientific Research (C)
    • Research Field
      Fundamental theory of informatics
    • Research Institution
      Tohoku University
  •  グラフ描画アルゴリズムとそのWeb情報検索への応用

    • Principal Investigator
      NISHIZEKI Takao
    • Project Period (FY)
      2004 – 2007
    • Research Category
      Grant-in-Aid for Scientific Research on Priority Areas
    • Review Section
      Science and Engineering
    • Research Institution
      Tohoku University

All 2024 2023 2022 2021 2020 2019 2018 2017 2016 2015 2014 2013 2012 2011 2010 2009 2008 2007 2006 2005 Other

All Journal Article Presentation Patent

  • [Journal Article] CoRe Challenge 2022/2023: Empirical evaluations for independent set reconfiguration problems (Extended Abstract)2024

    • Author(s)
      Takehide Soh, Tomoya Tanjo, Yoshio Okamoto, Takehiro Ito
    • Journal Title

      Proc. of 17th International Symposium on Combinatorial Search (SoCS 2024)

      Volume: -

    • Peer Reviewed
    • Data Source
      KAKENHI-PLANNED-20H05793
  • [Journal Article] On the Complexity of List $$\mathcal H$$-Packing for Sparse Graph Classes2024

    • Author(s)
      Gima Tatsuya、Hanaka Tesshu、Kobayashi Yasuaki、Otachi Yota、Shirai Tomohito、Suzuki Akira、Tamura Yuma、Zhou Xiao
    • Journal Title

      Proceedings of the 18th International Conference and Workshop on Algorithms and Computation (WALCOM 2024)

      Volume: 14549 Pages: 421-435

    • DOI

      10.1007/978-981-97-0566-5_30

    • ISBN
      9789819705658, 9789819705665
    • Peer Reviewed / Open Access
    • Data Source
      KAKENHI-PROJECT-21K17707, KAKENHI-PROJECT-23KJ1066, KAKENHI-PROJECT-21K11752, KAKENHI-PROJECT-20K11666, KAKENHI-PROJECT-21K21278, KAKENHI-PLANNED-20H05793, KAKENHI-PLANNED-20H05794, KAKENHI-PROJECT-23K28034
  • [Journal Article] Scalable hard instances for independent set reconfiguration2024

    • Author(s)
      Takehide Soh, Takumu Watanabe, Jun Kawahara, Akira Suzuki, Takehiro Ito
    • Journal Title

      Proc. of 22nd Symposium on Experimental Algorithms (SEA 2024), Leibniz International Proceedings in Informatics

      Volume: 301

    • Peer Reviewed / Open Access
    • Data Source
      KAKENHI-PLANNED-20H05793
  • [Journal Article] Sorting balls and water: Equivalence and computational complexity2023

    • Author(s)
      Takehiro Ito, Jun Kawahara, Shin-ichi Minato, Yota Otachi, Toshiki Saitoh, Akira Suzuki, Ryuhei Uehara, Takeaki Uno, Katsuhisa Yamanaka, Ryo Yoshinaka
    • Journal Title

      Theoretical Computer Science

      Volume: 927 Pages: 114158-114158

    • DOI

      10.1016/j.tcs.2023.114158

    • Peer Reviewed / Open Access
    • Data Source
      KAKENHI-PROJECT-18K11150, KAKENHI-PROJECT-19K11814, KAKENHI-PROJECT-21K11752, KAKENHI-PROJECT-19K12098, KAKENHI-PROJECT-20K11666, KAKENHI-PLANNED-20H05962, KAKENHI-PLANNED-20H05793, KAKENHI-PLANNED-20H05794, KAKENHI-PROJECT-18H04091, KAKENHI-PLANNED-20H05964
  • [Journal Article] On reachable assignments under dichotomous preferences2023

    • Author(s)
      Ito Takehiro、Kakimura Naonori、Kamiyama Naoyuki、Kobayashi Yusuke、Nozaki Yuta、Okamoto Yoshio、Ozeki Kenta
    • Journal Title

      Theoretical Computer Science

      Volume: 979 Pages: 114196-114196

    • DOI

      10.1016/j.tcs.2023.114196

    • Peer Reviewed / Open Access
    • Data Source
      KAKENHI-PROJECT-20K14317, KAKENHI-PROJECT-19K11814, KAKENHI-PROJECT-20K11692, KAKENHI-PROJECT-23K10982, KAKENHI-PROJECT-20K11670, KAKENHI-PLANNED-20H05793, KAKENHI-PLANNED-20H05795, KAKENHI-PROJECT-18H04091, KAKENHI-PROJECT-23K21646
  • [Journal Article] Fixed-parameter algorithms for graph constraint logic2023

    • Author(s)
      Tatsuhiko Hatanaka, Felix Hommelsheim, Takehiro Ito, Yusuke Kobayashi, Moritz Muhlenthaler, Akira Suzuki
    • Journal Title

      Theoretical Computer Science

      Volume: 959 Pages: 113863-113863

    • DOI

      10.1016/j.tcs.2023.113863

    • Peer Reviewed / Open Access / Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-19K11814, KAKENHI-PROJECT-20K11692, KAKENHI-PROJECT-20K11666, KAKENHI-PLANNED-20H05793, KAKENHI-PLANNED-20H05794, KAKENHI-PLANNED-20H05795, KAKENHI-PROJECT-18H04091
  • [Journal Article] Reconfiguration of spanning trees with degree constraints or diameter constraints2023

    • Author(s)
      Nicolas Bousquet, Takehiro Ito, Yusuke Kobayashi, Haruka Mizuta, Paul Ouvrard, Akira Suzuki and Kunihiro Wasa
    • Journal Title

      Algorithmica

      Volume: - Issue: 9 Pages: 2779-2816

    • DOI

      10.1007/s00453-023-01117-z

    • Peer Reviewed / Open Access / Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-20K11666, KAKENHI-PROJECT-22K17849, KAKENHI-PROJECT-19K11814, KAKENHI-PROJECT-20K11692, KAKENHI-PLANNED-20H05793, KAKENHI-PLANNED-20H05794, KAKENHI-PLANNED-20H05795, KAKENHI-PROJECT-18H04091
  • [Journal Article] Path cover problems with length cost2023

    • Author(s)
      Kenya Kobayashi, Guohui Lin, Eiji Miyano, Toshiki Saitoh, Akira Suzuki, Tadatoshi Utashima and Tsuyoshi Yagita
    • Journal Title

      Algorithmica

      Volume: - Issue: 11 Pages: 3348-3375

    • DOI

      10.1007/s00453-023-01106-2

    • Peer Reviewed / Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-20K11666, KAKENHI-PROJECT-21K11755, KAKENHI-PROJECT-19K12098, KAKENHI-PLANNED-20H05794, KAKENHI-PROJECT-18H04091
  • [Journal Article] ZDD-based algorithmic framework for solving shortest reconfiguration problems2023

    • Author(s)
      Takehiro Ito, Jun Kawahara, Yu Nakahata, Takehide Soh, Akira Suzuki, Junichi Teruyama and Takahisa Toda
    • Journal Title

      Proceedings of the 20th International Conference on the Integration of Constraint Programming, Artificial Intelligence, and Operations Research (CPAIOR 2023), Lecture Notes in Computer Science (LNCS)

      Volume: 13884 Pages: 1-17

    • DOI

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

    • ISBN
      9783031332708, 9783031332715
    • Peer Reviewed / Open Access
    • Data Source
      KAKENHI-PROJECT-20K11666, KAKENHI-PROJECT-19K11814, KAKENHI-PROJECT-22K11910, KAKENHI-PROJECT-22K11973, KAKENHI-PROJECT-23K11047, KAKENHI-PROJECT-18K18003, KAKENHI-PLANNED-20H05793, KAKENHI-PLANNED-20H05794
  • [Journal Article] Solving reconfiguration problems of first-order expressible properties of graph vertices with Boolean satisfiability2023

    • Author(s)
      Takahisa Toda, Takehiro Ito, Jun Kawahara, Takehide Soh, Akira Suzuki, Junichi Teruyama
    • Journal Title

      Proc. of 35th IEEE International Conference on Tools with Artificial Intelligence (ICTAI 2023)

      Volume: - Pages: 294-302

    • DOI

      10.1109/ictai59109.2023.00050

    • Peer Reviewed / Open Access
    • Data Source
      KAKENHI-PROJECT-19K11814, KAKENHI-PROJECT-22K11910, KAKENHI-PROJECT-22K11973, KAKENHI-PROJECT-23K11047, KAKENHI-PROJECT-20K11666, KAKENHI-PROJECT-18K18003, KAKENHI-PLANNED-20H05793, KAKENHI-PLANNED-20H05794
  • [Journal Article] Hardness of finding combinatorial shortest paths on graph associahedra2023

    • Author(s)
      Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto
    • Journal Title

      Proc. of 50th EATCS International Colloquium on Automata, Languages and Programming (ICALP 2023), Leibniz International Proceedings in Informatics

      Volume: 261

    • Peer Reviewed / Open Access
    • Data Source
      KAKENHI-PLANNED-20H05793
  • [Journal Article] Reconfiguration of colorings in triangulations of the sphere2023

    • Author(s)
      Takehiro Ito, Yuni Iwamasa, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
    • Journal Title

      Proc. of 39th International Symposium on Computational Geometry (SoCG 2023), Leibniz International Proceedings in Informatics

      Volume: 258

    • Peer Reviewed / Open Access
    • Data Source
      KAKENHI-PLANNED-20H05793
  • [Journal Article] Algorithmic study for power restoration in electrical distribution networks2023

    • Author(s)
      Jun Kawahara, Chuta Yamaoka, Takehiro Ito, Akira Suzuki, Daisuke Iioka, Shuhei Sugimura, Seiya Goto, Takayuki Tanabe
    • Journal Title

      Proc. of 4th Asia Pacific Conference of the Prognostics and Health Management (PHMAP 2023)

      Volume: 4 Pages: 1-3

    • Data Source
      KAKENHI-PLANNED-20H05793
  • [Journal Article] Reconfiguration of cliques in a graph2023

    • Author(s)
      Ito Takehiro、Ono Hirotaka、Otachi Yota
    • Journal Title

      Discrete Applied Mathematics

      Volume: 333 Pages: 43-58

    • DOI

      10.1016/j.dam.2023.01.026

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-21K19765, KAKENHI-PROJECT-19K11814, KAKENHI-PROJECT-21K11752, KAKENHI-PLANNED-20H05793, KAKENHI-PROJECT-18H04091
  • [Journal Article] Reconfiguring (non-spanning) arborescences2023

    • Author(s)
      Takehiro Ito, Yuni Iwamasa, Yasuaki Kobayashi, Yu Nakahata, Yota Otachi, Kunihiro Wasa
    • Journal Title

      Theoretical Computer Science

      Volume: 943 Pages: 131-141

    • DOI

      10.1016/j.tcs.2022.12.007

    • Peer Reviewed / Open Access
    • Data Source
      KAKENHI-PROJECT-19K11814, KAKENHI-PROJECT-21K11752, KAKENHI-PROJECT-22K17851, KAKENHI-PROJECT-20K23323, KAKENHI-PROJECT-20K19742, KAKENHI-PLANNED-20H05793, KAKENHI-PLANNED-20H05794, KAKENHI-PLANNED-20H05795, KAKENHI-PROJECT-18H04091, KAKENHI-PROJECT-22H00513
  • [Journal Article] Reconfiguration of vertex-disjoint shortest paths on graphs2023

    • Author(s)
      Rin Saito, Hiroshi Eto, Takehiro Ito, Ryuhei Uehara
    • Journal Title

      Proc. of 17th International Conference and Workshops on Algorithms and Computation (WALCOM 2023), Lecture Notes in Computer Science

      Volume: 13973 Pages: 191-201

    • DOI

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

    • ISBN
      9783031270505, 9783031270512
    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-19K11814, KAKENHI-PLANNED-20H05793
  • [Journal Article] Algorithmic theory of qubit routing2023

    • Author(s)
      Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto
    • Journal Title

      Proc. of 18th Algorithms and Data Structures Symposium (WADS 2023), Lecture Notes in Computer Science

      Volume: 14079 Pages: 533-546

    • DOI

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

    • ISBN
      9783031389054, 9783031389061
    • Peer Reviewed / Open Access
    • Data Source
      KAKENHI-PROJECT-19K11814, KAKENHI-PROJECT-20K11692, KAKENHI-PROJECT-23K10982, KAKENHI-PROJECT-20K11670, KAKENHI-PLANNED-20H05793, KAKENHI-PLANNED-20H05795, KAKENHI-PROJECT-23K21646, KAKENHI-PROJECT-22H05001
  • [Journal Article] Reconfiguration of colorings in triangulations of the sphere2023

    • Author(s)
      Takehiro Ito, Yuni Iwamasa, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
    • Journal Title

      Proc. of 39th International Symposium on Computational Geometry (SoCG 2023), Leibniz International Proceedings in Informatics

      Volume: 258

    • Peer Reviewed / Open Access
    • Data Source
      KAKENHI-PROJECT-19K11814
  • [Journal Article] Reconfiguration of Time-Respecting Arborescences2023

    • Author(s)
      Ito Takehiro、Iwamasa Yuni、Kamiyama Naoyuki、Kobayashi Yasuaki、Kobayashi Yusuke、Maezawa Shun-ichi、Suzuki Akira
    • Journal Title

      Algorithms and Data Structures (WADS 2023)

      Volume: 14079 Pages: 521-532

    • DOI

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

    • ISBN
      9783031389054, 9783031389061
    • Peer Reviewed / Open Access
    • Data Source
      KAKENHI-PROJECT-22K13956, KAKENHI-PROJECT-22K17854, KAKENHI-PROJECT-19K11814, KAKENHI-PROJECT-20K11692, KAKENHI-PLANNED-20H05793, KAKENHI-PLANNED-20H05794, KAKENHI-PLANNED-20H05795, KAKENHI-PROJECT-23K28034
  • [Journal Article] Monotone edge flips to an orientation of maximum edge-connectivity a la Nash-Williams2023

    • Author(s)
      Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
    • Journal Title

      ACM Transactions on Algorithms

      Volume: 19 Issue: 1 Pages: 6-6

    • DOI

      10.1145/3561302

    • Peer Reviewed / Open Access
    • Data Source
      KAKENHI-PROJECT-19K11814, KAKENHI-PROJECT-20K11692, KAKENHI-PROJECT-22K13956, KAKENHI-PROJECT-20K23323, KAKENHI-PROJECT-17K00028, KAKENHI-PROJECT-18K03391, KAKENHI-PLANNED-20H05793, KAKENHI-PLANNED-20H05795, KAKENHI-PROJECT-18H04091, KAKENHI-PROJECT-23K21646
  • [Journal Article] Rerouting planar curves and disjoint paths2023

    • Author(s)
      Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
    • Journal Title

      Proc. of 50th EATCS International Colloquium on Automata, Languages and Programming (ICALP 2023), Leibniz International Proceedings in Informatics

      Volume: 261

    • Peer Reviewed / Open Access
    • Data Source
      KAKENHI-PLANNED-20H05793
  • [Journal Article] Rerouting planar curves and disjoint paths2023

    • Author(s)
      Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
    • Journal Title

      Proc. of 50th EATCS International Colloquium on Automata, Languages and Programming (ICALP 2023), Leibniz International Proceedings in Informatics

      Volume: 261

    • Peer Reviewed / Open Access
    • Data Source
      KAKENHI-PROJECT-19K11814
  • [Journal Article] Hardness of finding combinatorial shortest paths on graph associahedra2023

    • Author(s)
      Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto
    • Journal Title

      Proc. of 50th EATCS International Colloquium on Automata, Languages and Programming (ICALP 2023), Leibniz International Proceedings in Informatics

      Volume: 261

    • Peer Reviewed / Open Access
    • Data Source
      KAKENHI-PROJECT-19K11814
  • [Journal Article] Reconfiguration of spanning trees with degree constraint or diameter constraint2022

    • Author(s)
      Nicolas Bousquet, Takehiro Ito, Yusuke Kobayashi, Haruka Mizuta, Paul Ouvrard, Akira Suzuki, Kunihiro Wasa
    • Journal Title

      Proc. of 39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022), Leibniz International Proceedings in Informatics

      Volume: 219

    • Peer Reviewed / Open Access / Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-19K11814
  • [Journal Article] Reconfiguration of spanning trees with degree constraint or diameter constraint2022

    • Author(s)
      Nicolas Bousquet, Takehiro Ito, Yusuke Kobayashi, Haruka Mizuta, Paul Ouvrard, Akira Suzuki, Kunihiro Wasa
    • Journal Title

      arXiv

      Volume: --

    • Open Access / Int'l Joint Research
    • Data Source
      KAKENHI-PLANNED-20H05793
  • [Journal Article] Reconfiguration of spanning trees with degree constraint or diameter constraint2022

    • Author(s)
      Nicolas Bousquet, Takehiro Ito, Yusuke Kobayashi, Haruka Mizuta, Paul Ouvrard, Akira Suzuki, Kunihiro Wasa
    • Journal Title

      Proc. of 39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022), Leibniz International Proceedings in Informatics

      Volume: 219

    • Peer Reviewed / Open Access / Int'l Joint Research
    • Data Source
      KAKENHI-PLANNED-20H05793
  • [Journal Article] Algorithmic meta-theorems for combinatorial reconfiguration revisited2022

    • Author(s)
      Tatsuya Gima, Takehiro Ito, Yasuaki Kobayashi, Yota Otachi
    • Journal Title

      Proc. of 30th Annual European Symposium on Algorithms (ESA 2022), Leibniz International Proceedings in Informatics

      Volume: 244

    • Peer Reviewed / Open Access
    • Data Source
      KAKENHI-PLANNED-20H05793
  • [Journal Article] Approximability of the Distance Independent Set Problem on Regular Graphs and Planar Graphs2022

    • Author(s)
      Hiroshi Eto, Takehiro Ito, Zhilong Liu, Eiji Miyano
    • Journal Title

      IEICE Trans. Fundamentals

      Volume: E105.A Issue: 9 Pages: 1211-1222

    • DOI

      10.1587/transfun.2021DMP0017

    • ISSN
      0916-8508, 1745-1337
    • Year and Date
      2022-09-01
    • Language
      English
    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-19K11814, KAKENHI-PROJECT-21K11755, KAKENHI-PLANNED-20H05793, KAKENHI-PROJECT-18H04091
  • [Journal Article] Reforming an envy-free matching2022

    • Author(s)
      Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
    • Journal Title

      Proc. of 36th AAAI Conference on Artificial Intelligence (AAAI 2022)

      Volume: 36 Issue: 5 Pages: 5084-5091

    • DOI

      10.1609/aaai.v36i5.20441

    • Peer Reviewed / Open Access
    • Data Source
      KAKENHI-PLANNED-20H05793, KAKENHI-PLANNED-20H05795
  • [Journal Article] A parameterized view to the robust recoverable base problem of matroids under structural uncertainty2022

    • Author(s)
      Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto
    • Journal Title

      Operations Research Letters

      Volume: 50 Issue: 3 Pages: 370-375

    • DOI

      10.1016/j.orl.2022.05.001

    • Peer Reviewed / Open Access
    • Data Source
      KAKENHI-PROJECT-19K11814, KAKENHI-PROJECT-20K11670, KAKENHI-PROJECT-20K11692, KAKENHI-PROJECT-17K00028, KAKENHI-PROJECT-20K20417, KAKENHI-PLANNED-20H05793, KAKENHI-PLANNED-20H05795, KAKENHI-PROJECT-18H04091, KAKENHI-PROJECT-23K21646
  • [Journal Article] Reforming an envy-free matching2022

    • Author(s)
      Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
    • Journal Title

      arXiv

      Volume: --

    • Open Access
    • Data Source
      KAKENHI-PLANNED-20H05793
  • [Journal Article] Sorting balls and water: equivalence and computational complexity2022

    • Author(s)
      Takehiro Ito, Jun Kawahara, Shin-ichi Minato, Yota Otachi, Toshiki Saitoh, Akira Suzuki, Ryuhei Uehara, Takeaki Uno, Katsuhisa Yamanaka, Ryo Yoshinaka
    • Journal Title

      arXiv

      Volume: --

    • Open Access
    • Data Source
      KAKENHI-PLANNED-20H05793
  • [Journal Article] Reconfiguration of Regular Induced Subgraphs2022

    • Author(s)
      Eto Hiroshi、Ito Takehiro、Kobayashi Yasuaki、Otachi Yota、Wasa Kunihiro
    • Journal Title

      Lecture Notes in Computer Science

      Volume: 13174 Pages: 35-46

    • DOI

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

    • ISBN
      9783030967307, 9783030967314
    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-18K11168, KAKENHI-PROJECT-18K11169, KAKENHI-PROJECT-19K11814, KAKENHI-PROJECT-21K11752, KAKENHI-PROJECT-19K20350, KAKENHI-PROJECT-20K19742, KAKENHI-PLANNED-20H05793
  • [Journal Article] Reconfiguration of colorings in triangulations of the sphere2022

    • Author(s)
      Takehiro Ito, Yuni Iwamasa, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
    • Journal Title

      arXiv

      Volume: -

    • Open Access
    • Data Source
      KAKENHI-PLANNED-20H05793
  • [Journal Article] Happy set problem on subclasses of co-comparability graphs2022

    • Author(s)
      Hiroshi Eto, Takehiro Ito, Eiji Miyano, Akira Suzuki and Yuma Tamura
    • Journal Title

      Algorithmica

      Volume: - Issue: 11 Pages: 1-21

    • DOI

      10.1007/s00453-022-01081-0

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-20K11666, KAKENHI-PROJECT-21K21278, KAKENHI-PROJECT-19K11814, KAKENHI-PROJECT-21K11755, KAKENHI-PLANNED-20H05793, KAKENHI-PLANNED-20H05794, KAKENHI-PROJECT-18H04091
  • [Journal Article] Happy set problem on subclasses of co-comparability graphs2022

    • Author(s)
      Hiroshi Eto, Takehiro Ito, Eiji Miyano, Akira Suzuki, Yuma Tamura
    • Journal Title

      Proc. of 16th International Conference and Workshops on Algorithms and Computation (WALCOM 2022), Lecture Notes in Computer Science

      Volume: 13174 Pages: 149-160

    • DOI

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

    • ISBN
      9783030967307, 9783030967314
    • Peer Reviewed / Open Access
    • Data Source
      KAKENHI-PROJECT-19K11814, KAKENHI-PROJECT-20K11666, KAKENHI-PROJECT-21K11755, KAKENHI-PLANNED-20H05793, KAKENHI-PLANNED-20H05794
  • [Journal Article] Shortest reconfiguration of perfect matchings via alternating cycles2022

    • Author(s)
      Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto
    • Journal Title

      SIAM Journal on Discrete Mathematics

      Volume: 36 Issue: 2 Pages: 1102-1123

    • DOI

      10.1137/20m1364370

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-19K11814, KAKENHI-PROJECT-20K11670, KAKENHI-PROJECT-17K00028, KAKENHI-PLANNED-20H05793, KAKENHI-PLANNED-20H05795, KAKENHI-PROJECT-23K21646, KAKENHI-PROJECT-18H04091
  • [Journal Article] On reachable assignments under dichotomous preferences2022

    • Author(s)
      Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
    • Journal Title

      Proc. of 24th International Conference on Principles and Practice of Multi-Agent Systems (PRIMA 2022), Lecture Notes in Computer Science

      Volume: 13753 Pages: 650-658

    • DOI

      10.1007/978-3-031-21203-1_43

    • ISBN
      9783031212024, 9783031212031
    • Peer Reviewed / Open Access
    • Data Source
      KAKENHI-PROJECT-19K11814, KAKENHI-PROJECT-20K11670, KAKENHI-PROJECT-20K14317, KAKENHI-PROJECT-20K20417, KAKENHI-PLANNED-20H05793, KAKENHI-PLANNED-20H05795
  • [Journal Article] Rerouting planar curves and disjoint paths2022

    • Author(s)
      Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
    • Journal Title

      arXiv

      Volume: -

    • Open Access
    • Data Source
      KAKENHI-PLANNED-20H05793
  • [Journal Article] Sorting balls and water: equivalence and computational complexity2022

    • Author(s)
      Takehiro Ito, Jun Kawahara, Shin-ichi Minato, Yota Otachi, Toshiki Saitoh, Akira Suzuki, Ryuhei Uehara, Takeaki Uno, Katsuhisa Yamanaka, Ryo Yoshinaka
    • Journal Title

      Proc. of 11th International Conference on Fun with Algorithms (FUN 2022), Leibniz International Proceedings in Informatics

      Volume: 226

    • Peer Reviewed / Open Access
    • Data Source
      KAKENHI-PROJECT-19K11814
  • [Journal Article] Invitation to combinatorial reconfiguration2022

    • Author(s)
      Takehiro Ito
    • Journal Title

      Proc. of 16th International Conference and Workshops on Algorithms and Computation (WALCOM 2022), Lecture Notes in Computer Science

      Volume: 13174 Pages: 26-31

    • DOI

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

    • NAID

      40021497349

    • ISBN
      9783030967307, 9783030967314
    • Data Source
      KAKENHI-PROJECT-19K11814, KAKENHI-PLANNED-20H05793
  • [Journal Article] Sorting balls and water: Equivalence and computational complexity2022

    • Author(s)
      Takehiro Ito, Jun Kawahara, Shin-ichi Minato, Yota Otachi, Toshiki Saitoh, Akira Suzuki, Ryuhei Uehara, Takeaki Uno, Katsuhisa Yamanaka, Ryo Yoshinaka
    • Journal Title

      Proc. of 11th International Conference on Fun with Algorithms (FUN 2022), Leibniz International Proceedings in Informatics

      Volume: 226

    • Peer Reviewed / Open Access
    • Data Source
      KAKENHI-PLANNED-20H05793
  • [Journal Article] Algorithmic meta-theorems for combinatorial reconfiguration revisited2022

    • Author(s)
      Tatsuya Gima, Takehiro Ito, Yasuaki Kobayashi, Yota Otachi
    • Journal Title

      Proc. of 30th Annual European Symposium on Algorithms (ESA 2022), Leibniz International Proceedings in Informatics

      Volume: 244

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-19K11814
  • [Journal Article] Monotone edge flips to an orientation of maximum edge-connectivity ? la Nash-Williams2022

    • Author(s)
      Ito Takehiro、Iwamasa Yuni、Kakimura Naonori、Kamiyama Naoyuki、Kobayashi Yusuke、Maezawa Shun-ichi、Nozaki Yuta、Okamoto Yoshio、Ozeki Kenta
    • Journal Title

      Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)

      Volume: なし Pages: 1342-1355

    • DOI

      10.1137/1.9781611977073.56

    • ISBN
      9781611977073
    • Peer Reviewed / Open Access
    • Data Source
      KAKENHI-PROJECT-18K03391, KAKENHI-PROJECT-19K11814, KAKENHI-PROJECT-20K11670, KAKENHI-PROJECT-20K11692, KAKENHI-PLANNED-20H05793, KAKENHI-PLANNED-20H05795
  • [Journal Article] Parameterized DAWGs: Efficient constructions and bidirectional pattern searches2022

    • Author(s)
      Katsuhito Nakashima, Noriki Fujisato, Diptarama Hendrian, Yuto Nakashima, Ryo Yoshinaka, Shunsuke Inenaga, Hideo Bannai, Ayumi Shinohara, Masayuki Takeda
    • Journal Title

      Theoretical Computer Science

      Volume: 933 Pages: 21-42

    • DOI

      10.1016/j.tcs.2022.09.008

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-18K11150, KAKENHI-PROJECT-21K11745, KAKENHI-PROJECT-21K17705, KAKENHI-PLANNED-20H05964, KAKENHI-PROJECT-20H04141, KAKENHI-PROJECT-19K20208, KAKENHI-PROJECT-18H04091, KAKENHI-PROJECT-18H04098
  • [Journal Article] ZDD-based algorithmic framework for solving shortest reconfiguration problems2022

    • Author(s)
      Takehiro Ito, Jun Kawahara, Yu Nakahata, Takehide Soh, Akira Suzuki, Junichi Teruyama, Takahisa Toda
    • Journal Title

      arXiv

      Volume: -

    • Open Access
    • Data Source
      KAKENHI-PLANNED-20H05793
  • [Journal Article] Independent set reconfiguration on directed graphs2022

    • Author(s)
      Takehiro Ito, Yuni Iwamasa, Yasuaki Kobayashi, Yu Nakahata, Yota Otachi, Masahiro Takahashi, Kunihiro Wasa
    • Journal Title

      Proc. of 47th International Symposium on Mathematical Foundations of Computer Science, Leibniz International Proceedings in Informatics

      Volume: 241

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-19K11814
  • [Journal Article] Independent set reconfiguration on directed graphs2022

    • Author(s)
      Takehiro Ito, Yuni Iwamasa, Yasuaki Kobayashi, Yu Nakahata, Yota Otachi, Masahiro Takahashi, Kunihiro Wasa
    • Journal Title

      Proc. of 47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022), Leibniz International Proceedings in Informatics

      Volume: 241

    • Peer Reviewed / Open Access
    • Data Source
      KAKENHI-PLANNED-20H05793
  • [Journal Article] Independent set reconfiguration on directed graphs2022

    • Author(s)
      Takehiro Ito, Yuni Iwamasa, Yasuaki Kobayashi, Yu Nakahata, Yota Otachi, Masahiro Takahashi, Kunihiro Wasa
    • Journal Title

      arXiv

      Volume: --

    • Open Access
    • Data Source
      KAKENHI-PLANNED-20H05793
  • [Journal Article] Algorithms for gerrymandering over graphs2021

    • Author(s)
      Ito Takehiro、Kamiyama Naoyuki、Kobayashi Yusuke、Okamoto Yoshio
    • Journal Title

      Theoretical Computer Science

      Volume: 868 Pages: 30-45

    • DOI

      10.1016/j.tcs.2021.03.037

    • Peer Reviewed / Open Access
    • Data Source
      KAKENHI-PROJECT-20K11670, KAKENHI-PROJECT-19K11814, KAKENHI-PROJECT-20K11692, KAKENHI-PLANNED-20H05793, KAKENHI-PLANNED-20H05795, KAKENHI-PROJECT-18H04091
  • [Journal Article] Monotone edge flips to an orientation of maximum edge-connectivity a la Nash-Williams2021

    • Author(s)
      Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
    • Journal Title

      arXiv

      Volume: --

    • Open Access
    • Data Source
      KAKENHI-PLANNED-20H05793
  • [Journal Article] Reconfiguration of regular induced subgraphs2021

    • Author(s)
      Hiroshi Eto, Takehiro Ito, Yasuaki Kobayashi, Yota Otachi, Kunihiro Wasa
    • Journal Title

      arXiv

      Volume: --

    • Open Access
    • Data Source
      KAKENHI-PLANNED-20H05793
  • [Journal Article] Approximability of the Independent Feedback Vertex Set Problem for Bipartite Graphs2021

    • Author(s)
      Yuma Tamura, Takehiro Ito and Xiao Zhou
    • Journal Title

      Theoretical Computer Science

      Volume: 849 Pages: 227-236

    • DOI

      10.1016/j.tcs.2020.10.026

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-19K11813, KAKENHI-PROJECT-19K11814, KAKENHI-PROJECT-20J11259, KAKENHI-PLANNED-20H05793, KAKENHI-PROJECT-18H04091
  • [Journal Article] Max-Min 3-Dispersion Problems2021

    • Author(s)
      Takashi Horiyama, Shin-ichi Nakano, Toshiki Saitoh, Koki Suetsugu, Akira Suzuki, Ryuhei Uehara, Takeaki Uno, and Kunihiro Wasa
    • Journal Title

      IEICE Trans. Fundamentals

      Volume: E104.A Issue: 9 Pages: 1101-1107

    • DOI

      10.1587/transfun.2020DMP0003

    • NAID

      130008081864

    • ISSN
      0916-8508, 1745-1337
    • Year and Date
      2021-09-01
    • Language
      English
    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-20K20311, KAKENHI-PROJECT-20K11666, KAKENHI-PLANNED-20H05964, KAKENHI-PLANNED-20H05793, KAKENHI-PLANNED-20H05794, KAKENHI-PROJECT-18H04091
  • [Journal Article] Reconfiguring Directed Trees in a Digraph2021

    • Author(s)
      Ito Takehiro、Iwamasa Yuni、Kobayashi Yasuaki、Nakahata Yu、Otachi Yota、Wasa Kunihiro
    • Journal Title

      Lecture Notes in Computer Science

      Volume: 13025 Pages: 343-354

    • DOI

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

    • ISBN
      9783030895426, 9783030895433
    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-18K11168, KAKENHI-PROJECT-18K11169, KAKENHI-PROJECT-19K11814, KAKENHI-PROJECT-21K11752, KAKENHI-PROJECT-19K20350, KAKENHI-PROJECT-20K19742, KAKENHI-PLANNED-20H05793, KAKENHI-PLANNED-20H05795
  • [Journal Article] Reconfiguring spanning and induced subgraphs2020

    • Author(s)
      Hanaka Tesshu、Ito Takehiro、Mizuta Haruka、Moore Benjamin、Nishimura Naomi、Subramanya Vijay、Suzuki Akira、Vaidyanathan Krishna
    • Journal Title

      Theoretical Computer Science

      Volume: 806 Pages: 553-566

    • DOI

      10.1016/j.tcs.2019.09.018

    • Peer Reviewed / Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-19K11814, KAKENHI-PROJECT-19K21537, KAKENHI-PROJECT-18H04091, KAKENHI-PROJECT-17K12636
  • [Journal Article] Reconfiguration of spanning trees with many or few leaves2020

    • Author(s)
      Bousquet Nicolas、Ito Takehiro、Kobayashi Yusuke、Mizuta Haruka、Ouvrard Paul、Suzuki Akira、Wasa Kunihiro
    • Journal Title

      Proc. of ESA 2020, Leibniz International Proceedings in Informatics

      Volume: 173

    • Peer Reviewed / Open Access / Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-19K11814
  • [Journal Article] Parameterized complexity of independent set reconfiguration problems2020

    • Author(s)
      Ito Takehiro、Kaminski Marcin、Ono Hirotaka、Suzuki Akira、Uehara Ryuhei、Yamanaka Katsuhisa
    • Journal Title

      Discrete Applied Mathematics

      Volume: - Pages: 336-345

    • DOI

      10.1016/j.dam.2020.01.022

    • Peer Reviewed / Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-17K12636, KAKENHI-PROJECT-19K11812, KAKENHI-PROJECT-20K11666, KAKENHI-PROJECT-20K20311, KAKENHI-PROJECT-18H04091, KAKENHI-PROJECT-17H01698
  • [Journal Article] Approximability of the independent feedback vertex set problem for bipartite graphs2020

    • Author(s)
      Tamura Yuma、Ito Takehiro、Zhou Xiao
    • Journal Title

      Proc. of WALCOM 2020, Lecture Notes in Computer Science

      Volume: 12049 Pages: 286-295

    • DOI

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

    • ISBN
      9783030398804, 9783030398811
    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-19K11814
  • [Journal Article] Diameter of colorings under Kempe changes2020

    • Author(s)
      Bonamy Marthe、Heinrich Marc、Ito Takehiro、Kobayashi Yusuke、Mizuta Haruka、Muehlenthaler Moritz、Suzuki Akira、Wasa Kunihiro
    • Journal Title

      Theoretical Computer Science

      Volume: 838 Pages: 45-57

    • DOI

      10.1016/j.tcs.2020.05.033

    • Peer Reviewed / Open Access / Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-19K11814, KAKENHI-PROJECT-20K11666, KAKENHI-PROJECT-19K20350, KAKENHI-PROJECT-18H04091
  • [Journal Article] Complexity of the Maximum <i>k</i>-Path Vertex Cover Problem2020

    • Author(s)
      MIYANO Eiji、SAITOH Toshiki、UEHARA Ryuhei、YAGITA Tsuyoshi、ZANDEN Tom C. van der
    • Journal Title

      IEICE Trans. Fundamentals

      Volume: E103.A Issue: 10 Pages: 1193-1201

    • DOI

      10.1587/transfun.2019DMP0014

    • NAID

      130007920231

    • ISSN
      0916-8508, 1745-1337
    • Year and Date
      2020-10-01
    • Language
      English
    • Peer Reviewed / Open Access / Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-19K12098, KAKENHI-PROJECT-20K20311, KAKENHI-PROJECT-17K00016, KAKENHI-PROJECT-18H04091
  • [Journal Article] Enumeration of nonisomorphic interval graphs and nonisomorphic permutation graphs2020

    • Author(s)
      Yamazaki Kazuaki、Saitoh Toshiki、Kiyomi Masashi、Uehara Ryuhei
    • Journal Title

      Theoretical Computer Science

      Volume: 806 Pages: 310-322

    • DOI

      10.1016/j.tcs.2019.04.017

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-19K12098, KAKENHI-PROJECT-18H04091, KAKENHI-PROJECT-18K11169, KAKENHI-PROJECT-20K20311
  • [Journal Article] Complexity of the Multi-Service Center Problem2020

    • Author(s)
      Takehiro Ito, Naonori Kakimura, and Yusuke Kobayashi
    • Journal Title

      Theoretical Computer Science

      Volume: 842 Pages: 18-27

    • DOI

      10.1016/j.tcs.2020.07.021

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-17K00028, KAKENHI-PROJECT-19K11814, KAKENHI-PROJECT-20K20417, KAKENHI-PROJECT-18H04091, KAKENHI-PROJECT-18H05291
  • [Journal Article] Minimization and parameterized variants of vertex partition problems on graphs2020

    • Author(s)
      Tamura Yuma、Ito Takehiro、Zhou Xiao
    • Journal Title

      Proc. of ISAAC 2020, Leibniz International Proceedings in Informatics

      Volume: 181

    • Peer Reviewed / Open Access
    • Data Source
      KAKENHI-PROJECT-19K11814
  • [Journal Article] Shortest reconfiguration of colorings under Kempe changes2020

    • Author(s)
      Bonamy Marthe、Heinrich Marc、Ito Takehiro、Kobayashi Yusuke、Mizuta Haruka、Muehlenthaler Moritz、Suzuki Akira、Wasa Kunihiro
    • Journal Title

      Proc. of STACS 2020, Leibniz International Proceedings in Informatics

      Volume: 154

    • Peer Reviewed / Open Access / Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-19K11814
  • [Journal Article] Fixed-parameter algorithms for graph constraint logic2020

    • Author(s)
      Hatanaka Tatsuhiko、Hommelsheim Felix、Ito Takehiro、Kobayashi Yusuke、Muehlenthaler Moritz、Suzuki Akira
    • Journal Title

      Proc. of IPEC 2020, Leibniz International Proceedings in Informatics

      Volume: 180

    • Peer Reviewed / Open Access / Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-19K11814
  • [Journal Article] <i>K</i><sub>3</sub> Edge Cover Problem in a Wide Sense2020

    • Author(s)
      Chiba Kyohei、Belmonte Remy、Ito Hiro、Lampis Michael、Nagao Atsuki、Otachi Yota
    • Journal Title

      Journal of Information Processing

      Volume: 28 Issue: 0 Pages: 849-858

    • DOI

      10.2197/ipsjjip.28.849

    • NAID

      130007956350

    • ISSN
      1882-6652
    • Language
      English
    • Peer Reviewed / Open Access / Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-18K11168, KAKENHI-PROJECT-18K11169, KAKENHI-PROJECT-20K11671, KAKENHI-PROJECT-18K11157, KAKENHI-PROJECT-18H04091
  • [Journal Article] Fixed-parameter algorithms for graph constraint logic2020

    • Author(s)
      Tatsuhiko Hatanaka, Felix Hommelsheim, Takehiro Ito, Yusuke Kobayashi, Moritz Muhlenthaler, Akira Suzuki
    • Journal Title

      arXiv

      Volume: --

    • Open Access / Int'l Joint Research
    • Data Source
      KAKENHI-PLANNED-20H05793
  • [Journal Article] Shortest reconfiguration of perfect matchings via alternating cycles2019

    • Author(s)
      Ito Takehiro、Kakimura Naonori、Kamiyama Naoyuki、Kobayashi Yusuke、Okamoto Yoshio
    • Journal Title

      Proc. of ESA 2019, Leibniz International Proceedings in Informatics

      Volume: 144

    • Peer Reviewed / Open Access
    • Data Source
      KAKENHI-PROJECT-19K11814
  • [Journal Article] Incremental optimization of independent sets under the reconfiguration framework2019

    • Author(s)
      Ito Takehiro、Mizuta Haruka、Nishimura Naomi、Suzuki Akira
    • Journal Title

      Proc. of COCOON 2019, Lecture Notes in Computer Science

      Volume: 11653 Pages: 313-324

    • DOI

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

    • ISBN
      9783030261757, 9783030261764
    • Peer Reviewed / Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-19K11814
  • [Journal Article] The Time Complexity of Permutation Routing via Matching, Token Swapping and a Variant2019

    • Author(s)
      Kawahara Jun、Saitoh Toshiki、Yoshinaka Ryo
    • Journal Title

      Journal of Graph Algorithms and Applications

      Volume: 23 Issue: 1 Pages: 29-70

    • DOI

      10.7155/jgaa.00483

    • Peer Reviewed / Open Access
    • Data Source
      KAKENHI-PROJECT-18H04091, KAKENHI-PROJECT-16K16006
  • [Journal Article] Shortest reconfiguration of matchings2019

    • Author(s)
      Bousquet Nicolas、Hatanaka Tatsuhiko、Ito Takehiro、Muehlenthaler Moritz
    • Journal Title

      Proc. of WG 2019, Lecture Notes in Computer Science

      Volume: 11789 Pages: 162-174

    • DOI

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

    • ISBN
      9783030307851, 9783030307868
    • Peer Reviewed / Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-19K11814
  • [Journal Article] The Coloring Reconfiguration Problem on Specific Graph Classes2019

    • Author(s)
      HATANAKA Tatsuhiko、ITO Takehiro、ZHOU Xiao
    • Journal Title

      IEICE Trans. Inf. & Syst.

      Volume: E102.D Issue: 3 Pages: 423-429

    • DOI

      10.1587/transinf.2018FCP0005

    • NAID

      130007606879

    • ISSN
      0916-8532, 1745-1361
    • Year and Date
      2019-03-01
    • Language
      English
    • Peer Reviewed / Open Access / Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-18H04091, KAKENHI-PROJECT-16J02175, KAKENHI-PROJECT-16K00003, KAKENHI-PROJECT-16K00004, KAKENHI-PROJECT-19K11813
  • [Journal Article] Sequentially Swapping Colored Tokens on Graphs2019

    • Author(s)
      Katsuhisa Yamanaka, Erik D. Demaine, Takashi Horiyama, Akitoshi Kawamura, Shin-Ichi Nakano, Yoshio Okamoto, Toshiki Saitoh, Akira Suzuki, Ryuhei Uehara, and Takeaki Uno
    • Journal Title

      Journal of Graph Algorithms and Applications

      Volume: 23 Issue: 1 Pages: 3-27

    • DOI

      10.7155/jgaa.00482

    • NAID

      120006779053

    • Peer Reviewed / Open Access / Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-17K00003, KAKENHI-PROJECT-17K12636, KAKENHI-PROJECT-18H04091, KAKENHI-PROJECT-16K00002, KAKENHI-PROJECT-16K16006, KAKENHI-PROJECT-18K11153, KAKENHI-PROJECT-15H05711, KAKENHI-PROJECT-20K20311
  • [Journal Article] Diameter of colorings under Kempe changes2019

    • Author(s)
      Bonamy Marthe、Heinrich Marc、Ito Takehiro、Kobayashi Yusuke、Mizuta Haruka、Muehlenthaler Moritz、Suzuki Akira、Wasa Kunihiro
    • Journal Title

      Proc. of COCOON 2019, Lecture Notes in Computer Science

      Volume: 11653 Pages: 52-64

    • DOI

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

    • ISBN
      9783030261757, 9783030261764
    • Peer Reviewed / Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-19K11814, KAKENHI-PROJECT-18H05291, KAKENHI-PROJECT-16K16010
  • [Journal Article] The perfect matching reconfiguration problem2019

    • Author(s)
      Bonamy Marthe、Bousquet Nicolas、Heinrich Marc、Ito Takehiro、Kobayashi Yusuke、Mary Arnaud、Muehlenthaler Moritz、Wasa Kunihiro
    • Journal Title

      Proc. of MFCS 2019, Leibniz International Proceedings in Informatics

      Volume: 138

    • Peer Reviewed / Open Access / Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-19K11814
  • [Journal Article] Reconfiguration of minimum Steiner trees via vertex exchanges2019

    • Author(s)
      Mizuta Haruka、Hatanaka Tatsuhiko、Ito Takehiro、Zhou Xiao
    • Journal Title

      Proc. of MFCS 2019, Leibniz International Proceedings in Informatics

      Volume: 138

    • Peer Reviewed / Open Access
    • Data Source
      KAKENHI-PROJECT-19K11814
  • [Journal Article] A lower bound on opaque sets2019

    • Author(s)
      Kawamura Akitoshi、Moriyama Sonoko、Otachi Yota、Pach J?nos
    • Journal Title

      Computational Geometry

      Volume: 80 Pages: 13-22

    • DOI

      10.1016/j.comgeo.2019.01.002

    • Peer Reviewed / Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-18K11168, KAKENHI-PROJECT-18K11169, KAKENHI-PROJECT-18H04091
  • [Journal Article] Reconfiguration of colorable sets in classes of perfect graphs2019

    • Author(s)
      Ito Takehiro、Otachi Yota
    • Journal Title

      Theoretical Computer Science

      Volume: 772 Pages: 111-122

    • DOI

      10.1016/j.tcs.2018.11.024

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-18K11168, KAKENHI-PROJECT-18K11169, KAKENHI-PROJECT-16K00004, KAKENHI-PROJECT-18H04091
  • [Journal Article] Reconfiguration of colorable sets in classes of perfect graphs2018

    • Author(s)
      Takehiro Ito, Yota Otachi
    • Journal Title

      Leibniz International Proceedings in Informatics

      Volume: 101

    • DOI

      10.4230/LIPIcs.SWAT.2018.27

    • Peer Reviewed / Open Access
    • Data Source
      KAKENHI-PROJECT-18K11168, KAKENHI-PROJECT-18K11169, KAKENHI-PROJECT-16K00004
  • [Journal Article] Swapping colored token on graphs2018

    • Author(s)
      K. Yamanaka, T. Horiyama, J. M. Keil, D. G. Kirkpatrick, Y. Otachi, T. Saitoh, R. Uehara and Y. Uno
    • Journal Title

      Theoretical Computer Science

      Volume: 729 Pages: 1-10

    • DOI

      10.1016/j.tcs.2018.03.016

    • NAID

      120005850327

    • Peer Reviewed / Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-17K00017, KAKENHI-PROJECT-18H04091, KAKENHI-PROJECT-16K00002, KAKENHI-PROJECT-16K16006, KAKENHI-PROJECT-20K20311
  • [Journal Article] Reconfiguration of maximum-weight b-matchings in a graph2018

    • Author(s)
      Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, and Yoshio Okamoto
    • Journal Title

      Journal of Combinatorial Optimization

      Volume: 37 Issue: 2 Pages: 454-464

    • DOI

      10.1007/s10878-018-0289-3

    • NAID

      120006960832

    • Peer Reviewed / Open Access
    • Data Source
      KAKENHI-PROJECT-17K00028, KAKENHI-PROJECT-16K16010, KAKENHI-PROJECT-16H03118, KAKENHI-PROJECT-16K00004
  • [Journal Article] Parameterized complexity of the list coloring reconfiguration problem with graph parameters2018

    • Author(s)
      Hatanaka Tatsuhiko、Ito Takehiro、Zhou Xiao
    • Journal Title

      Theoretical Computer Science

      Volume: 739 Pages: 65-79

    • DOI

      10.1016/j.tcs.2018.05.005

    • Peer Reviewed / Open Access / Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-18H04091, KAKENHI-PROJECT-16J02175, KAKENHI-PROJECT-16K00003, KAKENHI-PROJECT-16K00004
  • [Journal Article] Algorithms for Coloring Reconfiguration under Recolorability Constraints2018

    • Author(s)
      Hiroki Osawa, Akira Suzuki, Takehiro Ito, and Xiao Zhou
    • Journal Title

      Proceedings of the 29th International Symposium on Algorithms and Computation (ISAAC 2018), Leibniz International Proceedings in Informatics

      Volume: 123

    • DOI

      10.4230/LIPICS.ISAAC.2018.37

    • Peer Reviewed / Open Access
    • Data Source
      KAKENHI-PROJECT-16K00003, KAKENHI-PROJECT-16K00004
  • [Journal Article] Reconfiguring spanning and induced subgraphs2018

    • Author(s)
      Hanaka Tesshu、Ito Takehiro、Mizuta Haruka、Moore Benjamin、Nishimura Naomi、Subramanya Vijay、Suzuki Akira、Vaidyanathan Krishna
    • Journal Title

      Lecture Notes in Computer Science

      Volume: 10976 Pages: 428-440

    • DOI

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

    • ISBN
      9783319947754, 9783319947761
    • Peer Reviewed / Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-16K00004
  • [Journal Article] Minimum-Cost b-Edge Dominating Sets on Trees2018

    • Author(s)
      Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, and Yoshio Okamoto
    • Journal Title

      Algorithmica

      Volume: 81 Issue: 1 Pages: 343-366

    • DOI

      10.1007/s00453-018-0448-z

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-17K00028, KAKENHI-PROJECT-16K00004
  • [Journal Article] The Complexity of (List) Edge-Coloring Reconfiguration Problem2018

    • Author(s)
      Osawa Hiroki、Suzuki Akira、Ito Takehiro、Zhou Xiao
    • Journal Title

      IEICE Trans. Fundamentals

      Volume: E101.A Issue: 1 Pages: 232-238

    • DOI

      10.1587/transfun.E101.A.232

    • NAID

      130006300867

    • ISSN
      0916-8508, 1745-1337
    • Language
      English
    • Peer Reviewed / Open Access
    • Data Source
      KAKENHI-PROJECT-16K00004, KAKENHI-PROJECT-17K12636, KAKENHI-PROJECT-16K00003
  • [Journal Article] Bumpy pyramid folding2018

    • Author(s)
      Abel Zachary R.、Demaine Erik D.、Demaine Martin L.、Ito Hiro、Snoeyink Jack、Uehara Ryuhei
    • Journal Title

      Computational Geometry

      Volume: 75 Pages: 22-31

    • DOI

      10.1016/j.comgeo.2018.06.007

    • NAID

      120006676394

    • Peer Reviewed / Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-18H04091, KAKENHI-PROJECT-15K11985, KAKENHI-PROJECT-20K20311
  • [Journal Article] Tight approximability of the server allocation problem for real-time applications2018

    • Author(s)
      Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto, and Taichi Shiitada
    • Journal Title

      Proceedings of 3rd International Workshop on Algorithmic Aspects of Cloud Computing (ALGOCLOUD 2017)

      Volume: --- Pages: 41-55

    • DOI

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

    • NAID

      120006998850

    • ISBN
      9783319748740, 9783319748757
    • Peer Reviewed / Open Access
    • Data Source
      KAKENHI-PROJECT-15K00009, KAKENHI-PROJECT-16K00004, KAKENHI-PROJECT-17K00028, KAKENHI-PROJECT-16K16010, KAKENHI-PROJECT-16H03118
  • [Journal Article] Complexity of Coloring Reconfiguration under Recolorability Constraints2017

    • Author(s)
      Osawa Hiroki、Suzuki Akira、Ito Takehiro、Zhou Xiao
    • Journal Title

      Leibniz International Proceedings in Informatics

      Volume: 92

    • DOI

      10.4230/LIPIcs.ISAAC.2017.62

    • Peer Reviewed / Open Access
    • Data Source
      KAKENHI-PROJECT-16K00004, KAKENHI-PROJECT-17K12636
  • [Journal Article] Approximation Algorithm for the Distance-3 Independent Set Problem on Cubic Graphs2017

    • Author(s)
      Hiroshi Eto, Takehiro Ito, Zhilong Liu, Eiji Miyano
    • Journal Title

      Lecture Notes in Computer Science

      Volume: 10167 Pages: 228-240

    • DOI

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

    • ISBN
      9783319539249, 9783319539256
    • Peer Reviewed / Acknowledgement Compliant
    • Data Source
      KAKENHI-PUBLICLY-15H00849, KAKENHI-PROJECT-26330017, KAKENHI-PROJECT-16K00004
  • [Journal Article] Complexity of Tiling a Polygon with Trominoes or Bars2017

    • Author(s)
      Takashi Horiyama, Takehiro Ito, Keita Nakatsuka, Akira Suzuki, Ryuhei Uehara
    • Journal Title

      Discrete & Computational Geometry

      Volume: 印刷中 Issue: 3 Pages: 686-704

    • DOI

      10.1007/s00454-017-9884-9

    • NAID

      120006457371

    • Peer Reviewed / Acknowledgement Compliant
    • Data Source
      KAKENHI-PUBLICLY-15H00849, KAKENHI-PROJECT-16K00004, KAKENHI-PROJECT-15K00008, KAKENHI-PROJECT-20K20311
  • [Journal Article] Efficient Stabilization of Cooperative Matching Games2017

    • Author(s)
      Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto
    • Journal Title

      Theoretical Computer Science

      Volume: 印刷中 Pages: 69-82

    • DOI

      10.1016/j.tcs.2017.03.020

    • Peer Reviewed / Acknowledgement Compliant
    • Data Source
      KAKENHI-PUBLICLY-15H00849, KAKENHI-PROJECT-16K00004, KAKENHI-PLANNED-24106002
  • [Journal Article] Reconfiguration of Maximum-Weight b-Matchings in a Graph2017

    • Author(s)
      Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, and Yoshio Okamoto
    • Journal Title

      Proceedings of 23rd Annual International Computing and Combinatorics Conference (COCOON 2017)

      Volume: --- Pages: 287-296

    • DOI

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

    • NAID

      120006960832

    • ISBN
      9783319623887, 9783319623894
    • Peer Reviewed / Open Access
    • Data Source
      KAKENHI-PROJECT-15K00009, KAKENHI-PROJECT-16K00004, KAKENHI-PROJECT-17K00028, KAKENHI-PROJECT-16K16010, KAKENHI-PROJECT-16H03118
  • [Journal Article] Parameterized Complexity of the List Coloring Reconfiguration Problem with Graph Parameters2017

    • Author(s)
      Hatanaka Tatsuhiko、Ito Takehiro、Zhou Xiao
    • Journal Title

      Leibniz International Proceedings in Informatics

      Volume: 83

    • DOI

      10.4230/LIPIcs.MFCS.2017.51

    • Peer Reviewed / Open Access
    • Data Source
      KAKENHI-PROJECT-16K00004
  • [Journal Article] The Complexity of (List) Edge-Coloring Reconfiguration Problem2017

    • Author(s)
      Hiroki Osawa, Akira Suzuki, Takehiro Ito, Xiao Zhou
    • Journal Title

      Lecture Notes in Computer Science

      Volume: 10167 Pages: 347-358

    • DOI

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

    • NAID

      130006300867

    • ISBN
      9783319539249, 9783319539256
    • Peer Reviewed / Acknowledgement Compliant
    • Data Source
      KAKENHI-PUBLICLY-15H00849, KAKENHI-PROJECT-16K00004
  • [Journal Article] Complexity of the Multi-Service Center Problem2017

    • Author(s)
      Ito Takehiro、Kakimura Naonori、Kobayashi Yusuke
    • Journal Title

      Leibniz International Proceedings in Informatics

      Volume: 92

    • DOI

      10.4230/LIPIcs.ISAAC.2017.48

    • Peer Reviewed / Open Access
    • Data Source
      KAKENHI-PROJECT-16K00004, KAKENHI-PROJECT-17K00028, KAKENHI-PROJECT-16K16010, KAKENHI-PROJECT-16H03118
  • [Journal Article] The Coloring Reconfiguration Problem on Specific Graph Classes2017

    • Author(s)
      Hatanaka Tatsuhiko、Ito Takehiro、Zhou Xiao
    • Journal Title

      Lecture Notes in Computer Science

      Volume: 10627 Pages: 152-162

    • DOI

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

    • NAID

      130007606879

    • ISBN
      9783319711492, 9783319711508
    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-16K00004
  • [Journal Article] Reconfiguration of Steiner Trees in an Unweighted Graph2017

    • Author(s)
      Haruka Mizuta, Takehiro Ito and Xiao Zhou
    • Journal Title

      IEICE Trans. Fundamentals

      Volume: E100.A Issue: 7 Pages: 1532-1540

    • DOI

      10.1587/transfun.E100.A.1532

    • NAID

      130007311770

    • ISSN
      0916-8508, 1745-1337
    • Language
      English
    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-16K00003, KAKENHI-PROJECT-16K00004
  • [Journal Article] Efficient Stabilization of Cooperative Matching Games2016

    • Author(s)
      Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto
    • Journal Title

      Proc. of AAMAS 2016

      Volume: 印刷中

    • Peer Reviewed / Acknowledgement Compliant
    • Data Source
      KAKENHI-PUBLICLY-15H00849
  • [Journal Article] Efficient Stabilization of Cooperative Matching Games2016

    • Author(s)
      Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto
    • Journal Title

      Proc. of AAMAS 2016

      Volume: 印刷中

    • Peer Reviewed / Acknowledgement Compliant
    • Data Source
      KAKENHI-PROJECT-25330003
  • [Journal Article] A Polynomial-Time Approximation Scheme for the Geometric Unique Coverage Problem on Unit Squares2016

    • Author(s)
      Takehiro Ito, Shin-ichi Nakano, Yoshio Okamoto, Yota Otachi, Ryuhei Uehara, Takeaki Uno, Yushi Uno,
    • Journal Title

      Computational Geometry: Theory and Applications

      Volume: 51 Pages: 25-39

    • DOI

      10.1016/j.comgeo.2015.10.004

    • NAID

      120005954496

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-26330004, KAKENHI-PROJECT-26330009, KAKENHI-PLANNED-24106004, KAKENHI-PLANNED-24106005, KAKENHI-PROJECT-24220003, KAKENHI-PROJECT-25330003, KAKENHI-PROJECT-24700008, KAKENHI-PROJECT-25730003
  • [Journal Article] The Complexity of Dominating Set Reconfiguration2016

    • Author(s)
      Arash Haddadan, Takehiro Ito, Amer E. Mouawad, Naomi Nishimura, Hirotaka Ono, Akira Suzuki, Youcef Tebbal
    • Journal Title

      Theoretical Computer Science

      Volume: 651 Pages: 37-49

    • DOI

      10.1016/j.tcs.2016.08.016

    • Peer Reviewed / Acknowledgement Compliant / Int'l Joint Research
    • Data Source
      KAKENHI-PUBLICLY-15H00849, KAKENHI-PROJECT-26730001, KAKENHI-PROJECT-16K00004, KAKENHI-PROJECT-26540005
  • [Journal Article] Approximability of the Distance Independent Set Problem on Regular Graphs and Planar Graphs2016

    • Author(s)
      Hiroshi Eto, Takehiro Ito, Zhilong Liu, Eiji Miyano
    • Journal Title

      Lecture Notes in Computer Science

      Volume: 10043 Pages: 270-284

    • DOI

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

    • ISBN
      9783319487489, 9783319487496
    • Peer Reviewed / Acknowledgement Compliant
    • Data Source
      KAKENHI-PUBLICLY-15H00849, KAKENHI-PROJECT-26330017, KAKENHI-PROJECT-16K00004
  • [Journal Article] The Minimum Vulnerability Problem on Specific Graph Classes2016

    • Author(s)
      Yusuke Aoki, Bjarni V. Halldorsson, Magnus M. Halldorsson, Takehiro Ito, Christian Konrad, Xiao Zhou
    • Journal Title

      Journal of Combinatorial Optimization

      Volume: 印刷中 Issue: 4 Pages: 1288-1304

    • DOI

      10.1007/s10878-015-9950-2

    • Peer Reviewed / Acknowledgement Compliant / Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-25330003
  • [Journal Article] Reconfiguration of Steiner Trees in an Unweighted Graph2016

    • Author(s)
      Haruka Mizuta, Takehiro Ito, Xiao Zhou
    • Journal Title

      Lecture Notes in Computer Science

      Volume: 9843 Pages: 163-175

    • DOI

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

    • NAID

      130007311770

    • ISBN
      9783319445427, 9783319445434
    • Peer Reviewed / Acknowledgement Compliant
    • Data Source
      KAKENHI-PUBLICLY-15H00849, KAKENHI-PROJECT-16K00004
  • [Journal Article] Reconfiguration of Vertex Covers in a Graph2016

    • Author(s)
      Takehiro Ito, Hiroyuki Nooka, Xiao Zhou
    • Journal Title

      IEICE Trans. Inf. & Syst.

      Volume: E99.D Issue: 3 Pages: 598-606

    • DOI

      10.1587/transinf.2015FCP0010

    • NAID

      130005131815

    • ISSN
      0916-8532, 1745-1361
    • Language
      English
    • Peer Reviewed / Acknowledgement Compliant
    • Data Source
      KAKENHI-PUBLICLY-15H00849, KAKENHI-PROJECT-25330003
  • [Journal Article] Reconfiguration of Vertex Covers in a Graph2015

    • Author(s)
      Takehiro Ito, Hiroyuki Nooka, Xiao Zhou
    • Journal Title

      Lecture Notes in Computer Science

      Volume: 印刷中

    • NAID

      130005131815

    • Peer Reviewed / Acknowledgement Compliant
    • Data Source
      KAKENHI-PUBLICLY-25106504
  • [Journal Article] Deterministic Algorithms for the Independent Feedback Vertex Set Problem2015

    • Author(s)
      Yuma Tamura, Takehiro Ito, Xiao Zhou
    • Journal Title

      Lecture Notes in Computer Science

      Volume: 印刷中

    • Peer Reviewed / Acknowledgement Compliant
    • Data Source
      KAKENHI-PROJECT-25330003
  • [Journal Article] The Complexity of Dominating Set Reconfiguration2015

    • Author(s)
      Arash Haddadan, Takehiro Ito, Amer E. Mouawad, Naomi Nishimura, Hirotaka Ono, Akira Suzuki, Youcef Tebbal
    • Journal Title

      Lecture Notes in Computer Science

      Volume: 9214 Pages: 398-409

    • DOI

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

    • ISBN
      9783319218397, 9783319218403
    • Peer Reviewed / Acknowledgement Compliant / Int'l Joint Research
    • Data Source
      KAKENHI-PUBLICLY-15H00849, KAKENHI-PROJECT-25330003
  • [Journal Article] Linear-Time Algorithm for Sliding Tokens on Trees2015

    • Author(s)
      Erik D Demaine, Martin L Demaine, Eli Fox-Epstein, Duc A Hoang, Takehiro Ito, Hirotaka Ono, Yota Otachi, Ryuhei Uehara, and Takeshi Yamada
    • Journal Title

      Theoretical Computer Science

      Volume: 600 Pages: 132-142

    • DOI

      10.1016/j.tcs.2015.07.037

    • NAID

      120006355793

    • Peer Reviewed / Acknowledgement Compliant / Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-26330009, KAKENHI-PROJECT-26540005, KAKENHI-PUBLICLY-15H00849, KAKENHI-PLANNED-24106004, KAKENHI-PROJECT-25330003, KAKENHI-PROJECT-25730003
  • [Journal Article] The List Coloring Reconfiguration Problem for Bounded Pathwidth Graphs2015

    • Author(s)
      Tatsuhiko Hatanaka, Takehiro Ito, Xiao Zhou
    • Journal Title

      IEICE Trans. on Fundamentals of Electronics, Communications and Computer Sciences

      Volume: 印刷中

    • NAID

      130005071828

    • Peer Reviewed / Acknowledgement Compliant
    • Data Source
      KAKENHI-PUBLICLY-25106504
  • [Journal Article] Competitive Diffusion on Weighted Graphs2015

    • Author(s)
      Takehiro Ito, Yota Otachi, Toshiki Saitoh, Hisayuki Satoh, Akira Suzuki, Kei Uchizawa, Ryuhei Uehara, Katsuhisa Yamanaka, Xiao Zhou
    • Journal Title

      Proc. 14th International Symposium on Algorithms and Data Structures (WADS 2015), Lecture Notes in Computer Science

      Volume: 9214 Pages: 422-433

    • DOI

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

    • NAID

      120005850317

    • ISBN
      9783319218397, 9783319218403
    • Peer Reviewed / Acknowledgement Compliant
    • Data Source
      KAKENHI-PLANNED-24106010, KAKENHI-PROJECT-25330003, KAKENHI-PROJECT-25330005
  • [Journal Article] Reconfiguration of Vertex Covers in a Graph2015

    • Author(s)
      Takehiro Ito, Hiroyuki Nooka, Xiao Zhou
    • Journal Title

      Lecture Notes in Computer Science

      Volume: 印刷中

    • NAID

      130005131815

    • Peer Reviewed / Acknowledgement Compliant
    • Data Source
      KAKENHI-PROJECT-25330003
  • [Journal Article] The List Coloring Reconfiguration Problem for Bounded Pathwidth Graphs2015

    • Author(s)
      Tatsuhiko Hatanaka, Takehiro Ito, Xiao Zhou
    • Journal Title

      IEICE Trans. on Fundamentals of Electronics, Communications and Computer Sciences

      Volume: 印刷中

    • NAID

      130005071828

    • Peer Reviewed / Acknowledgement Compliant
    • Data Source
      KAKENHI-PROJECT-25330003
  • [Journal Article] Deterministic Algorithms for the Independent Feedback Vertex Set Problem2015

    • Author(s)
      Yuma Tamura, Takehiro Ito, Xiao Zhou
    • Journal Title

      Lecture Notes in Computer Science

      Volume: 印刷中

    • Peer Reviewed / Acknowledgement Compliant
    • Data Source
      KAKENHI-PUBLICLY-25106504
  • [Journal Article] Algorithms for the Independent Feedback Vertex Set Problem2015

    • Author(s)
      Yuma Tamura, Takehiro Ito, Xiao Zhou
    • Journal Title

      IEICE Trans. on Fundamentals of Electronics, Communications and Computer Sciences

      Volume: 印刷中

    • NAID

      130005071827

    • Peer Reviewed / Acknowledgement Compliant
    • Data Source
      KAKENHI-PUBLICLY-25106504
  • [Journal Article] Algorithms for the Independent Feedback Vertex Set Problem2015

    • Author(s)
      Yuma Tamura, Takehiro Ito, Xiao Zhou
    • Journal Title

      IEICE Trans. on Fundamentals of Electronics, Communications and Computer Sciences

      Volume: 印刷中

    • NAID

      130005071827

    • Peer Reviewed / Acknowledgement Compliant
    • Data Source
      KAKENHI-PROJECT-25330003
  • [Journal Article] Experimental Evaluations of Dynamic Algorithm for Maintaining Shortest-Paths Trees on Real-World Networks2015

    • Author(s)
      Takashi Hasegawa, Takehiro Ito, Akira Suzuki, Xiao Zhou
    • Journal Title

      IIS

      Volume: 21 Issue: 1 Pages: 25-35

    • DOI

      10.4036/iis.2015.25

    • NAID

      110009890454

    • ISSN
      1340-9050, 1347-6157
    • Language
      English
    • Peer Reviewed / Acknowledgement Compliant / Open Access
    • Data Source
      KAKENHI-PUBLICLY-25106504, KAKENHI-PROJECT-25330003, KAKENHI-PROJECT-26730001
  • [Journal Article] Reconfiguration of Cliques in a Graph2015

    • Author(s)
      Takehiro Ito, Hirotaka Ono, Yota Otachi
    • Journal Title

      Lecture Notes in Computer Science

      Volume: 印刷中

    • Peer Reviewed / Acknowledgement Compliant
    • Data Source
      KAKENHI-PUBLICLY-25106504
  • [Journal Article] Reconfiguration of Cliques in a Graph2015

    • Author(s)
      Takehiro Ito, Hirotaka Ono, Yota Otachi
    • Journal Title

      Lecture Notes in Computer Science

      Volume: 印刷中

    • Peer Reviewed / Acknowledgement Compliant
    • Data Source
      KAKENHI-PROJECT-25330003
  • [Journal Article] Swapping Labeled Tokens on Graphs2015

    • Author(s)
      Katsuhisa Yamanaka, Erik D. Demaine, Takehiro Ito, Jun Kawahara, Masashi Kiyomi, Yoshio Okamoto, Toshiki Saitoh, Akira Suzuki, Kei Uchizawa, Takeaki Uno
    • Journal Title

      Theoretical Computer Science

      Volume: 印刷中 Pages: 81-94

    • DOI

      10.1016/j.tcs.2015.01.052

    • Peer Reviewed / Acknowledgement Compliant / Open Access
    • Data Source
      KAKENHI-PUBLICLY-25106504, KAKENHI-PROJECT-25330003, KAKENHI-PROJECT-26730001, KAKENHI-PLANNED-24106005, KAKENHI-PLANNED-24106010, KAKENHI-PROJECT-24220003, KAKENHI-PROJECT-25330005, KAKENHI-PROJECT-24700008, KAKENHI-PROJECT-24700130, KAKENHI-PROJECT-15H03389
  • [Journal Article] The List Coloring Reconfiguration Problem for Bounded Pathwidth Graphs2014

    • Author(s)
      Tatsuhiko Hatanaka, Takehiro Ito, Xiao Zhou
    • Journal Title

      Lecture Notes in Computer Science

      Volume: 8881 Pages: 314-328

    • DOI

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

    • NAID

      130005071828

    • ISBN
      9783319126906, 9783319126913
    • Peer Reviewed / Acknowledgement Compliant
    • Data Source
      KAKENHI-PUBLICLY-25106504, KAKENHI-PROJECT-25330003
  • [Journal Article] Reconfigure on list L(2, 1)-labelings in a graph2014

    • Author(s)
      Takehiro Ito, Kazuto Kawamura, Hitotaka Ono and Xiao Zhou
    • Journal Title

      Theoretical Computer Science (TCS)

      Volume: 544 Pages: 84-97

    • DOI

      10.1016/j.tcs.2014.04.011

    • NAID

      110009670153

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-23500001, KAKENHI-PLANNED-24106004, KAKENHI-PROJECT-24220003, KAKENHI-PUBLICLY-25106504, KAKENHI-PROJECT-25330003
  • [Journal Article] The Minimum Vulnerability Problem on Graphs2014

    • Author(s)
      Yusuke Aoki, Bjarni V. Halldorsson, Magnus M. Halldorsson, Takehiro Ito, Christian Konrad, Xiao Zhou
    • Journal Title

      Lecture Notes in Computer Science

      Volume: 8881 Pages: 299-313

    • DOI

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

    • ISBN
      9783319126906, 9783319126913
    • Peer Reviewed / Acknowledgement Compliant
    • Data Source
      KAKENHI-PUBLICLY-25106504, KAKENHI-PROJECT-25330003
  • [Journal Article] Generalized rainbow connectivity of graphs2014

    • Author(s)
      Kei Uchizawa, Takanori Aoki, Takehiro Ito and Xiao Zhou
    • Journal Title

      Theoretical Computer Science (TCS)

      Volume: 555 Pages: 35-42

    • DOI

      10.1016/j.tcs.2014.01.007

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-23500001, KAKENHI-PLANNED-24106010, KAKENHI-PUBLICLY-25106504, KAKENHI-PROJECT-25330003, KAKENHI-PROJECT-25330005
  • [Journal Article] Swapping Labeled Tokens on Graphs2014

    • Author(s)
      Katsuhisa Yamanaka, Erik D. Demaine, Takehiro Ito, Jun Kawahara, Masashi Kiyomi, Yoshio Okamoto, Toshiki Saitoh, Akira Suzuki, Kei Uchizawa, Takeaki Uno
    • Journal Title

      Lecture Notes in Computer Science

      Volume: 印刷中

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-25330003
  • [Journal Article] On the Minimum Caterpillar Problem in Digraphs2014

    • Author(s)
      Taku Okada, Akira Suzuki, Takehiro Ito and Xiao Zhou
    • Journal Title

      IEICE Trans. Fundamentals

      Volume: E97.A Issue: 3 Pages: 848-857

    • DOI

      10.1587/transfun.E97.A.848

    • NAID

      130003394790

    • ISSN
      0916-8508, 1745-1337
    • Language
      English
    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-23500001, KAKENHI-PUBLICLY-25106504, KAKENHI-PROJECT-25330003
  • [Journal Article] On the Parameterized Complexity for Token Jumping on Graphs2014

    • Author(s)
      Takehiro Ito, Marcin Kaminski, Hirotaka Ono, Akira Suzuki, Ryuhei Uehara, Katsuhisa Yamanaka
    • Journal Title

      Theory and Applications of Models of Computation, Lecture Notes in Computer Science

      Volume: 8402 Pages: 341-351

    • DOI

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

    • NAID

      120005850323

    • ISBN
      9783319060880, 9783319060897
    • Peer Reviewed / Acknowledgement Compliant
    • Data Source
      KAKENHI-PUBLICLY-25104521, KAKENHI-PUBLICLY-25106504, KAKENHI-PROJECT-26540005
  • [Journal Article] Polynomial-Time Algorithm for Sliding Tokens on Trees2014

    • Author(s)
      Erik D. Demaine, Martin L. Demaine, Eli Fox-Epstein, Duc A. Hoang, Takehiro Ito, Hirotaka Ono, Yota Otachi, Ryuhei Uehara, Takeshi Yamada
    • Journal Title

      Lecture Notes in Computer Science

      Volume: 8889 Pages: 389-400

    • DOI

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

    • NAID

      120005850324

    • ISBN
      9783319130743, 9783319130750
    • Peer Reviewed / Acknowledgement Compliant
    • Data Source
      KAKENHI-PUBLICLY-25106504, KAKENHI-PROJECT-25330003, KAKENHI-PROJECT-26540005
  • [Journal Article] Complexity of Finding Maximum Regular Induced Subgraphs with Prescribed Degree2014

    • Author(s)
      Yuichi Asahiro, Hiroshi Eto, Takehiro Ito, Eiji Miyano
    • Journal Title

      Theoretical Computer Science

      Volume: 550 Pages: 21-35

    • DOI

      10.1016/j.tcs.2014.07.008

    • Peer Reviewed / Acknowledgement Compliant
    • Data Source
      KAKENHI-PUBLICLY-25106504, KAKENHI-PROJECT-25330003, KAKENHI-PROJECT-25330018, KAKENHI-PROJECT-26330017
  • [Journal Article] A 4.31-Approximation for the Geometric Unique Coverage Problem on Unit Disks2014

    • Author(s)
      Takehiro Ito, Shin-ichi Nakano, Yoshio Okamoto, Yota Otachi, Ryuhei Uehara, Takeaki Uno, Yushi Uno
    • Journal Title

      Theoretical Computer Science

      Volume: 544 Pages: 14-31

    • DOI

      10.1016/j.tcs.2014.04.014

    • NAID

      120005893622

    • Peer Reviewed
    • Data Source
      KAKENHI-PLANNED-24106004, KAKENHI-PLANNED-24106005, KAKENHI-PROJECT-24220003, KAKENHI-PROJECT-24700008, KAKENHI-PUBLICLY-25106504, KAKENHI-PROJECT-25330003, KAKENHI-PROJECT-25730003, KAKENHI-PROJECT-26330009
  • [Journal Article] Swapping Labeled Tokens on Graphs2014

    • Author(s)
      Katsuhisa Yamanaka, Erik D. Demaine, Takehiro Ito, Jun Kawahara, Masashi Kiyomi, Yoshio Okamoto, Toshiki Saitoh, Akira Suzuki, Kei Uchizawa, Takeaki Uno
    • Journal Title

      Lecture Notes in Computer Science

      Volume: 印刷中

    • Peer Reviewed
    • Data Source
      KAKENHI-PUBLICLY-25106504
  • [Journal Article] Base-Object Location Problems for Base-Monotone Regions2014

    • Author(s)
      Jinhee Chun, Takashi Horiyama, Takehiro Ito, Natsuda Kaothanthong, Hirotaka Ono, Yota Otachi, Takeshi Tokuyama, Ryuhei Uehara, Takeaki Uno
    • Journal Title

      Theoretical Computer Science

      Volume: 印刷中

    • NAID

      120005851303

    • Peer Reviewed
    • Data Source
      KAKENHI-PUBLICLY-25106504
  • [Journal Article] Fixed-Parameter Tractability of Token Jumping on Planar Graphs2014

    • Author(s)
      Takehiro Ito, Marcin Kaminski, Hirotaka Ono
    • Journal Title

      Lecture Notes in Computer Science

      Volume: 8889 Pages: 208-219

    • DOI

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

    • ISBN
      9783319130743, 9783319130750
    • Peer Reviewed / Acknowledgement Compliant
    • Data Source
      KAKENHI-PUBLICLY-25106504, KAKENHI-PROJECT-25330003, KAKENHI-PROJECT-26540005
  • [Journal Article] Minimum-Cost b-Edge Dominating Sets on Trees2014

    • Author(s)
      Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, and Yoshio Okamoto
    • Journal Title

      Lecture Notes in Computer Science

      Volume: 8889 Pages: 195-207

    • DOI

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

    • ISBN
      9783319130743, 9783319130750
    • Peer Reviewed / Acknowledgement Compliant
    • Data Source
      KAKENHI-PLANNED-24106005, KAKENHI-PROJECT-24700004, KAKENHI-PROJECT-24700008, KAKENHI-PUBLICLY-25106504, KAKENHI-PROJECT-25330003, KAKENHI-PROJECT-25730001, KAKENHI-PLANNED-24106002
  • [Journal Article] Complexity of Finding Maximum Regular Induced Subgraphs with Prescribed Degree2013

    • Author(s)
      Yuichi Asahiro, Hiroshi Eto, Takehiro Ito, Eiji Miyano
    • Journal Title

      Proceedings of the 19th International Symposium on Fundamentals of Computation Theory (FCT2013)

      Volume: 8070 Pages: 28-39

    • DOI

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

    • ISBN
      9783642401633, 9783642401640
    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-23500020, KAKENHI-PUBLICLY-25106504, KAKENHI-PROJECT-25330003, KAKENHI-PROJECT-25330018
  • [Journal Article] Minimum cost partitions of trees with supply and demand2012

    • Author(s)
      T. Nishizeki, T. Ito
    • Journal Title

      Algorithmica

      Volume: 64 Issue: 3 Pages: 400-415

    • DOI

      10.1007/s00453-011-9573-7

    • NAID

      110008676163

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-21500001, KAKENHI-PROJECT-22700001, KAKENHI-PROJECT-23500001
  • [Journal Article] Partitioning a weighted tree into subtrees with weights in a given range2012

    • Author(s)
      T. Ito, T. Nishizeki, M. Schroder, T. Uno, X. Zhou
    • Journal Title

      Algorithmica

      Volume: 62-3 Issue: 3-4 Pages: 823-841

    • DOI

      10.1007/s00453-010-9485-y

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-21500001, KAKENHI-PROJECT-22700001, KAKENHI-PROJECT-23500001, KAKENHI-PLANNED-24106007
  • [Journal Article] An Improved Sufficient Condition for Reconfiguration of List Edge-Colorings in a Tree2012

    • Author(s)
      Takehiro Ito, Kazuto Kawamura and Xiao Zhou
    • Journal Title

      IEICE Trans. Inf. & Syst.

      Volume: E95-D Issue: 3 Pages: 737-745

    • DOI

      10.1587/transinf.E95.D.737

    • NAID

      10030611536

    • ISSN
      0916-8532, 1745-1361
    • Language
      English
    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-22700001, KAKENHI-PROJECT-23500001
  • [Journal Article] Approximability of the Subset Sum Reconfiguration Problem2012

    • Author(s)
      Takehiro Ito and Erik D. Demaine
    • Journal Title

      Journal ofCombinatorial Optimization

      Volume: 28 Issue: 3 Pages: 639-654

    • DOI

      10.1007/s10878-012-9562-z

    • Year and Date
      2012-12-07
    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-22700001
  • [Journal Article] Reconfiguration of List Edge-Colorings in a Graph2012

    • Author(s)
      Takehiro Ito, Marcin Kaminski and Erik D. Demaine
    • Journal Title

      Discrete Applied Mathematics

      Volume: Vol. 160 Issue: 15 Pages: 2199-2207

    • DOI

      10.1016/j.dam.2012.05.014

    • NAID

      110007338427

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-22700001
  • [Journal Article] On Disconnected Cuts and Separators2011

    • Author(s)
      Takehiro Ito, Marcin Kaminski, Daniel Paulusma and Dimitrios M. Thilikos
    • Journal Title

      Discrete Applied Mathematics

      Volume: Vol. 159 Issue: 13 Pages: 1345-1351

    • DOI

      10.1016/j.dam.2011.04.027

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-22700001
  • [Journal Article] Minimum cost edge-colorings of trees can be reduced to matchings2011

    • Author(s)
      T.Ito
    • Journal Title

      IEICE Trans.

      Volume: 94-D Pages: 190-195

    • NAID

      130000453878

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-21500001
  • [Journal Article] On the Complexity of Reconfiguration Problems2011

    • Author(s)
      Takehiro Ito, Erik D. Demaine, Nicholas J. A. Harvey, Christos H. Papadimitriou, Martha Sideri, Ryuhei Uehara and Yushi Uno
    • Journal Title

      Theoretical Computer Science

      Volume: Vol. 412 Issue: 12-14 Pages: 1054-1065

    • DOI

      10.1016/j.tcs.2010.12.005

    • NAID

      120003184349

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-22700001
  • [Journal Article] An Improved Sufficient Condition for Reconfiguration of List Edge-Colorings in a Tree2011

    • Author(s)
      Takehiro Ito, 他2名
    • Journal Title

      Lecture Notes in Computer Science

      Volume: 6648 Pages: 94-105

    • NAID

      10030611536

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-22700001
  • [Journal Article] Parameterizing Cut Sets in a Graph by the Number of Their Components2011

    • Author(s)
      Takehiro Ito, Marcin Kaminski, Daniel Paulusma and Dimitrios M. Thilikos
    • Journal Title

      Theoretical Computer Science

      Volume: Vol.412 Issue: 45 Pages: 6340-6350

    • DOI

      10.1016/j.tcs.2011.07.005

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-22700001
  • [Journal Article] On the Complexity of Eeconfiguration Problems2011

    • Author(s)
      Takehiro Ito, 他6名
    • Journal Title

      Theoretical Computer Science

      Volume: 412 Pages: 1054-1065

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-22700001
  • [Journal Article] Minimum Cost Edge-Colorings of Trees Can Be Reduced to Matchings2011

    • Author(s)
      T. Ito, N. Sakamoto, X. Zhou, T. Nishizeki
    • Journal Title

      IEICE Trans. Inf. & Syst.

      Volume: E94-D Issue: 2 Pages: 190-195

    • DOI

      10.1587/transinf.E94.D.190

    • NAID

      130000453878

    • ISSN
      0916-8532, 1745-1361
    • Language
      English
    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-21500001
  • [Journal Article] Approximability of the Subset Sum Reconfiguration Problem2011

    • Author(s)
      Takehiro Ito, 他1名
    • Journal Title

      Lecture Notes in Computer Science

      Volume: 6648 Pages: 58-69

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-22700001
  • [Journal Article] Route-Enabling Graph Orientation Problems2009

    • Author(s)
      Takehiro Ito, Yuichiro Miyamoto, Hirotaka Ono, Hisao Tamaki, Ryuhei Uehara
    • Journal Title

      Lecture Notes in Computer Science Vol.5878

      Pages: 403-412

    • NAID

      120005850325

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-20700003
  • [Journal Article] A Characterization of Graphs with Fractional Total Chromatic Number Equal toΔ+22009

    • Author(s)
      Takehiro Ito, William S. Kennedy, Bruce A. Reed
    • Journal Title

      Electronic Notes in Discrete Mathematics Vol.35

      Pages: 235-240

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-20700003
  • [Journal Article] Parameterizing Cut Sets in a Graph by the Number of Their Components2009

    • Author(s)
      Takehiro Ito, Marcin Kaminski, Daniel Paulusma, Dimitrios M. Thilikos
    • Journal Title

      Lecture Notes in Computer Science Vol.5878

      Pages: 605-615

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-20700003
  • [Journal Article] Partitioning graphs of supply and demand2009

    • Author(s)
      Takehiro Ito(, 他2名)
    • Journal Title

      Discrete Applied Mathematics 157

      Pages: 2620-2633

    • NAID

      110003206419

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-20700003
  • [Journal Article] Route-enabling graph orientation problems2009

    • Author(s)
      Takehiro Ito(, 他4名)
    • Journal Title

      Lecture Notes in Computer Science 5878

      Pages: 403-412

    • NAID

      120005850325

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-20700003
  • [Journal Article] Reconfiguration of List Edge-Colorings in a Graph2009

    • Author(s)
      Takehiro Ito, Marcin Kaminski, Erik D. Demaine
    • Journal Title

      Lecture Notes in Computer Science Vol.5664

      Pages: 375-386

    • NAID

      110007338427

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-20700003
  • [Journal Article] Parameterizing cut sets in a graph by the number of their components2009

    • Author(s)
      Takehiro Ito(, 他3名)
    • Journal Title

      Lecture Notes in Computer Science 5878

      Pages: 605-615

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-20700003
  • [Journal Article] Partitioning graphs of supply and demand2009

    • Author(s)
      T.Ito, X.Zhou, T.Nishizeki
    • Journal Title

      Discrete Applied Mathematics Vol.157, Issue 12

      Pages: 2620-2633

    • NAID

      110003206419

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-21500001
  • [Journal Article] Partitioning Graphs of Supply and Demand2009

    • Author(s)
      Takehiro Ito, Xiao Zhou, Takao Nishizeki
    • Journal Title

      Discrete Applied Mathematics Vol.157

      Pages: 2620-2633

    • NAID

      110003206419

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-20700003
  • [Journal Article] Partitioning a Weighted Tree to Subtrees of Almost Uniform Size2008

    • Author(s)
      Takehiro Ito, Takeaki Uno, Xiao Zhou, Takao Nishizeki
    • Journal Title

      Lecture Notes in Computer Science Vol.5369

      Pages: 196-207

    • NAID

      110007081794

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-20700003
  • [Journal Article] On the complexity of reconfiguration problems2008

    • Author(s)
      Takehiro Ito, (他6名)
    • Journal Title

      Lecture Notes in Computer Science 5369

      Pages: 28-39

    • NAID

      120003184349

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-20700003
  • [Journal Article] Partitioning a weighted tree to subtrees of almost uniform size2008

    • Author(s)
      Takehiro Ito, (他3名)
    • Journal Title

      Lecture Notes in Computer Science 5369

      Pages: 196-207

    • NAID

      110007081794

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-20700003
  • [Journal Article] Approximability of partitioning graphs with supply and demand2008

    • Author(s)
      T. Ito, E.D. Demaine, X. Zhou and T. Nishizeki
    • Journal Title

      Journal of Discrete Algorithms Vol.6

      Pages: 627-650

    • NAID

      110004851550

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-19500002
  • [Journal Article] On the Complexity of Reconfiguration Problems2008

    • Author(s)
      Takehiro Ito, Erik D. Demaine, Nicholas J.A. Harvey, Christos H. Papadimitriou, Martha Sideri, Ryuhei Uehara, Yushi Uno
    • Journal Title

      Lecture Notes in Computer Science Vol.5369

      Pages: 28-39

    • NAID

      120003184349

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-20700003
  • [Journal Article] Approximability of partitioning graphs with supply and demand2008

    • Author(s)
      Takehiro Ito, (他3名)
    • Journal Title

      Journal of Discrete Algorithms 6

      Pages: 627-650

    • NAID

      110004851550

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-20700003
  • [Journal Article] Approximability of Partitioning Graphs with Supply and Demand2008

    • Author(s)
      Takehiro Ito, Erik D. Demaine, Xiao Zhou, Takao Nishizeki
    • Journal Title

      Journal of Discrete Algorithms Vol.6,No.4

      Pages: 627-650

    • NAID

      110004851550

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-20700003
  • [Journal Article] Approximability of partitioning graphs with supply and demand2008

    • Author(s)
      T. Ito, E. D. Demaine, X. Zhou and T. Nishizeki
    • Journal Title

      Journal of Discrete Algorithms Vol.6

      Pages: 627-650

    • NAID

      110004851550

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-19500002
  • [Journal Article] Algorithms for finding distance-edge-colorings of graphs2007

    • Author(s)
      T.Ito, A. Kato, X. Zhou and T. Nishizeki
    • Journal Title

      Journal of Discrete Algorithms Vol.5,No.2

      Pages: 304-322

    • NAID

      10015530666

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-19500002
  • [Journal Article] Algorithms for finding distance-edge-colorings of graphs2007

    • Author(s)
      T. Ito, A. Kato, X. Zhou and T. Nishizeki
    • Journal Title

      Journal of Discrete Algorithms Vol. 5, No. 2

      Pages: 304-322

    • NAID

      10015530666

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-16092203
  • [Journal Article] Partitioning a multi-weighted graph to connected subgraphs of almost uniform size2007

    • Author(s)
      Takehiro Ito (他3名)
    • Journal Title

      IEICE Trans. on Information and Systems E90-D

      Pages: 449-456

    • NAID

      130005444301

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-18800003
  • [Journal Article] Algorithms for finding distance-edge-colorings of graphs2007

    • Author(s)
      T. Ito, A. Kato, X. Zhou and T. Nishizeki
    • Journal Title

      Journal of Discrete Algorithms Vol.5, No.2

      Pages: 304-322

    • NAID

      10015530666

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-19500002
  • [Journal Article] Partitioning a multi-weighted graph to connected subgraphs of almost uniform size2007

    • Author(s)
      T.Ito, K.Goto, X.Zhou, T.Nishizeki
    • Journal Title

      IEICE Trans. on Information and Systems Vol.E90-D, No.2

      Pages: 449-456

    • NAID

      130005444301

    • Description
      「研究成果報告書概要(欧文)」より
    • Data Source
      KAKENHI-PROJECT-17500002
  • [Journal Article] Partitioning a multi-weighted graph to connected subgraphs of almost uniform size2007

    • Author(s)
      T.Ito, K.Goto, X.Zhou, T.Nishizeki
    • Journal Title

      IEICE Trans. INF. & SYST Vol.E90-D No.2

      Pages: 449-456

    • NAID

      130005444301

    • Description
      「研究成果報告書概要(和文)」より
    • Data Source
      KAKENHI-PROJECT-17500002
  • [Journal Article] Algorithms for finding distance-edge-colorings of graphs2007

    • Author(s)
      Takehiro Ito (他3名)
    • Journal Title

      Journal of Discrete Algorithms 5

      Pages: 304-322

    • NAID

      10015530666

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-18800003
  • [Journal Article] Partitioning a Multi-Weighted Graph to Connected Subgraphs of Almost Uniform Size2007

    • Author(s)
      T.Ito, K.Goto, X.Zhou, Takao Nishizeki
    • Journal Title

      IEICE Trans. on Information and Systems Vol. E90-D・No.2

      Pages: 449-456

    • NAID

      130005444301

    • Data Source
      KAKENHI-PROJECT-17500002
  • [Journal Article] Approximability of Partitioning Graphs with Supply and Demand2006

    • Author(s)
      Takehiro Ito
    • Journal Title

      Lecture Notes in Computer Science 4288

      Pages: 121-130

    • NAID

      110004851550

    • Data Source
      KAKENHI-PROJECT-18800003
  • [Journal Article] Partitioning a graph of bounded tree-width to connected subgraphs of almost uniform size2006

    • Author(s)
      T.Ito, X.Zhou, T.Nishizeki
    • Journal Title

      Journal of Discrete Algorithms Vol.4, No.1

      Pages: 142-154

    • Description
      「研究成果報告書概要(欧文)」より
    • Data Source
      KAKENHI-PROJECT-17500002
  • [Journal Article] Approximability of partitioning graphs with supply and demand2006

    • Author(s)
      T.Ito, E.D.Demaine, X.Zhou, T.Nishizeki
    • Journal Title

      Proc. of ISAAC2006, LNCS 4288

      Pages: 121-130

    • NAID

      110004851550

    • Data Source
      KAKENHI-PROJECT-17500002
  • [Journal Article] Partitioning a graph of bounded tree-width to connected subgraphs of almost uniform size2006

    • Author(s)
      T.Ito, X.Zhou, T.Nishizeki
    • Journal Title

      Journal of Discrete Algorithms Vol. 4・No. 1

      Pages: 142-154

    • Data Source
      KAKENHI-PROJECT-17500002
  • [Journal Article] Partitioning a multi-weighted graph to connected subgraphs of almost uniform size2006

    • Author(s)
      T.Ito, K.Goto, X.Zhou, T.Nishizeki
    • Journal Title

      Proc. of COCOON2006, LNCS 4112

      Pages: 63-72

    • NAID

      130005444301

    • Data Source
      KAKENHI-PROJECT-17500002
  • [Journal Article] Partitioning a graph of bounded tree-width to connected subgraphs of almost uniform size2006

    • Author(s)
      T.Ito, X.Zhou, T.Nishizeki
    • Journal Title

      Journal of Discrete Algorithms Vol. 4, No. 1

      Pages: 142-154

    • Description
      「研究成果報告書概要(和文)」より
    • Data Source
      KAKENHI-PROJECT-17500002
  • [Journal Article] Partitioning trees of supply and demand2005

    • Author(s)
      T.Ito, X.Zhou, T.Nishizeki
    • Journal Title

      International Journal of Foundations of Computer Science Vol.16・No.4

      Pages: 803-827

    • NAID

      110003178704

    • Data Source
      KAKENHI-PROJECT-17500002
  • [Journal Article] Partitioning trees of supply and demand2005

    • Author(s)
      T.Ito, X.Zhou, T.Nishizeki
    • Journal Title

      International Journal of Foundations of Computer Science Vol.16 No.4

      Pages: 803-827

    • NAID

      110003178704

    • Description
      「研究成果報告書概要(和文)」より
    • Data Source
      KAKENHI-PROJECT-17500002
  • [Journal Article] Partitioning trees of supply and demand2005

    • Author(s)
      T.Ito, X.Zhou, T.Nishizeki
    • Journal Title

      International Journal of Foundations of Computer Science Vol.16・No.4

      Pages: 803-827

    • NAID

      110003178704

    • Data Source
      KAKENHI-PROJECT-16092203
  • [Journal Article] Partitioning trees of supply and demand2005

    • Author(s)
      T.Ito, X.Zhou, T.Nishizeki
    • Journal Title

      International Journal of Foundations of Computer Science Vol.16, No.4

      Pages: 803-827

    • NAID

      110003178704

    • Description
      「研究成果報告書概要(欧文)」より
    • Data Source
      KAKENHI-PROJECT-17500002
  • [Journal Article] On the Rainbow Connectivity of Graphs: Complexity and FPT Algorithms

    • Author(s)
      Kei Uchizawa, Takanori Aoki, Takehiro Ito, Akira Suzuki and Xiao Zhou
    • Journal Title

      Algorithmica

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-22700001
  • [Patent] 電力融通システム、電力融通方法、電力融通プログラム2022

    • Inventor(s)
      伊藤健洋,鈴木顕,飯岡大輔,川原純,他4名
    • Industrial Property Rights Holder
      東北大学,中部大学,京都大学,明電舎
    • Industrial Property Rights Type
      特許
    • Industrial Property Number
      2022-130841
    • Filing Date
      2022
    • Data Source
      KAKENHI-PLANNED-20H05793
  • [Presentation] On the complexity of list H-packing for sparse graph classes2024

    • Author(s)
      Tatsuya Gima, Tesshu Hanaka, Yasuaki Kobayashi, Yota Otachi, Tomohito Shirai, Akira Suzuki, Yuma Tamura, Xiao Zhou
    • Organizer
      18th International Conference and Workshops on Algorithms and Computation (WALCOM 2024)
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-18H04091
  • [Presentation] List variants of packing problems on sparse graphs2024

    • Author(s)
      Tatsuya Gima, Tesshu Hanaka, Yasuaki Kobayashi, Yota Otachi, Tomohito Shirai, Akira Suzuki, Yuma Tamura, Xiao Zhou
    • Organizer
      第196回アルゴリズム研究発表会
    • Data Source
      KAKENHI-PLANNED-20H05793
  • [Presentation] On the complexity of list H-packing for sparse graph classes2024

    • Author(s)
      Tatsuya Gima, Tesshu Hanaka, Yasuaki Kobayashi, Yota Otachi, Tomohito Shirai, Akira Suzuki, Yuma Tamura, Xiao Zhou
    • Organizer
      18th International Conference and Workshops on Algorithms and Computation (WALCOM 2024)
    • Int'l Joint Research
    • Data Source
      KAKENHI-PLANNED-20H05793
  • [Presentation] Query learning of minimal deterministic symbolic finite automata separating regular languages2024

    • Author(s)
      Yoshito Kawasaki, Diptarama Hendrian, Ryo Yoshinaka, Ayumi Shinohara
    • Organizer
      49th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2024)
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-18H04091
  • [Presentation] Scalable hard instances for independent set reconfiguration2024

    • Author(s)
      Takehide Soh, Takumu Watanabe, Jun Kawahara, Akira Suzuki, Takehiro Ito
    • Organizer
      22nd Symposium on Experimental Algorithms (SEA 2024)
    • Int'l Joint Research
    • Data Source
      KAKENHI-PLANNED-20H05793
  • [Presentation] CoRe Challenge 2022/2023: Empirical evaluations for independent set reconfiguration problems (Extended Abstract)2024

    • Author(s)
      Takehide Soh, Tomoya Tanjo, Yoshio Okamoto, Takehiro Ito
    • Organizer
      17th International Symposium on Combinatorial Search (SoCS 2024)
    • Int'l Joint Research
    • Data Source
      KAKENHI-PLANNED-20H05793
  • [Presentation] 事故復旧を考慮した配電系統構成の最適化に関する検討2023

    • Author(s)
      杉村 修平, 金子 曜久, 林 泰弘, 野崎 哲平, 鈴木 顕, 伊藤 健洋, 田邊隆之
    • Organizer
      電力技術/電力系統技術合同研究会
    • Data Source
      KAKENHI-PLANNED-20H05793
  • [Presentation] ZDD-based algorithmic framework for solving shortest reconfiguration problems2023

    • Author(s)
      Takehiro Ito, Jun Kawahara, Yu Nakahata, Takehide Soh, Akira Suzuki, Junichi Teruyama, Takahisa Toda
    • Organizer
      20th International Conference on the Integration of Constraint Programming, Artificial Intelligence, and Operations Research (CPAIOR 2023)
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-18H04091
  • [Presentation] Rerouting planar curves and disjoint paths2023

    • Author(s)
      Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
    • Organizer
      50th EATCS International Colloquium on Automata, Languages and Programming (ICALP 2023)
    • Int'l Joint Research
    • Data Source
      KAKENHI-PLANNED-20H05793
  • [Presentation] Reconfiguration of time-respecting arborescences2023

    • Author(s)
      Takehiro Ito, Yuni Iwamasa, Naoyuki Kamiyama, Yasuaki Kobayashi, Yusuke Kobayashi, Shun-ichi Maezawa, Akira Suzuki
    • Organizer
      18th Algorithms and Data Structures Symposium (WADS 2023)
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-18H04091
  • [Presentation] Invitation to combinatorial reconfiguration2023

    • Author(s)
      Takehiro Ito
    • Organizer
      Minisymposium on Combinatorial Reconfiguration in ICIAM 2023
    • Int'l Joint Research
    • Data Source
      KAKENHI-PLANNED-20H05793
  • [Presentation] Algorithmic theory of qubit routing2023

    • Author(s)
      Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto
    • Organizer
      18th Algorithms and Data Structures Symposium (WADS 2023)
    • Int'l Joint Research
    • Data Source
      KAKENHI-PLANNED-20H05793
  • [Presentation] Reconfiguration of colorings in triangulations of the sphere2023

    • Author(s)
      Takehiro Ito, Yuni Iwamasa, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
    • Organizer
      39th International Symposium on Computational Geometry (SoCG 2023)
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-18H04091
  • [Presentation] Solving reconfiguration problems of first-order expressible properties of graph vertices with Boolean satisfiability2023

    • Author(s)
      Takahisa Toda, Takehiro Ito, Jun Kawahara, Takehide Soh, Akira Suzuki, Junichi Teruyama
    • Organizer
      35th IEEE International Conference on Tools with Artificial Intelligence (ICTAI 2023)
    • Int'l Joint Research
    • Data Source
      KAKENHI-PLANNED-20H05793
  • [Presentation] ZDD-based algorithmic framework for solving shortest reconfiguration problems2023

    • Author(s)
      Takehiro Ito, Jun Kawahara, Yu Nakahata, Takehide Soh, Akira Suzuki, Junichi Teruyama, Takahisa Toda
    • Organizer
      20th International Conference on the Integration of Constraint Programming, Artificial Intelligence, and Operations Research (CPAIOR 2023)
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-19K11814
  • [Presentation] Efficient non-isomorphic graph enumeration algorithms for subclasses of perfect graphs2023

    • Author(s)
      Jun Kawahara, Toshiki Saitoh, Hirokazu Takeda, Ryo Yoshinaka, Yui Yoshioka
    • Organizer
      17th International Conference and Workshops on Algorithms and Computation (WALCOM 2023)
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-18H04091
  • [Presentation] Reconfiguration of colorings in triangulations of the sphere2023

    • Author(s)
      Takehiro Ito, Yuni Iwamasa, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
    • Organizer
      39th International Symposium on Computational Geometry (SoCG 2023)
    • Int'l Joint Research
    • Data Source
      KAKENHI-PLANNED-20H05793
  • [Presentation] Reconfiguration of time-respecting arborescences2023

    • Author(s)
      Takehiro Ito, Yuni Iwamasa, Naoyuki Kamiyama, Yasuaki Kobayashi, Yusuke Kobayashi, Shun-ichi Maezawa, Akira Suzuki
    • Organizer
      18th Algorithms and Data Structures Symposium (WADS 2023)
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-19K11814
  • [Presentation] Three open problems on combinatorial reconfiguration2023

    • Author(s)
      Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
    • Organizer
      3rd Workshop on Combinatorial Reconfiguration, affiliated with ICALP 2023
    • Int'l Joint Research
    • Data Source
      KAKENHI-PLANNED-20H05793
  • [Presentation] Hardness of finding combinatorial shortest paths on graph associahedra2023

    • Author(s)
      Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto
    • Organizer
      50th EATCS International Colloquium on Automata, Languages and Programming (ICALP 2023)
    • Int'l Joint Research
    • Data Source
      KAKENHI-PLANNED-20H05793
  • [Presentation] Overlapping edge unfoldings for archimedean solids and (anti)prisms2023

    • Author(s)
      Takumi Shiota, Toshiki Saitoh
    • Organizer
      17th International Conference and Workshops on Algorithms and Computation (WALCOM 2023)
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-18H04091
  • [Presentation] Hardness of finding combinatorial shortest paths on graph associahedra2023

    • Author(s)
      Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto
    • Organizer
      50th EATCS International Colloquium on Automata, Languages and Programming (ICALP 2023)
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-18H04091
  • [Presentation] Algorithmic theory of qubit routing2023

    • Author(s)
      Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto
    • Organizer
      3rd Workshop on Combinatorial Reconfiguration, affiliated with ICALP 2023
    • Int'l Joint Research
    • Data Source
      KAKENHI-PLANNED-20H05793
  • [Presentation] Solving reconfiguration problems of first-order expressible properties of graph vertices with Boolean satisfiability2023

    • Author(s)
      Takahisa Toda, Takehiro Ito, Jun Kawahara, Takehide Soh, Akira Suzuki, Junichi Teruyama
    • Organizer
      35th IEEE International Conference on Tools with Artificial Intelligence (ICTAI 2023)
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-18H04091
  • [Presentation] Algorithmic study for power restoration in electrical distribution networks2023

    • Author(s)
      Jun Kawahara, Chuta Yamaoka, Takehiro Ito, Akira Suzuki, Daisuke Iioka, Shuhei Sugimura, Seiya Goto, Takayuki Tanabe
    • Organizer
      Asia-Pacific Conference of the Prognostics and Health Management (PHM) Society 2023
    • Int'l Joint Research
    • Data Source
      KAKENHI-PLANNED-20H05793
  • [Presentation] Reconfiguration of colorings in triangulations of the sphere2023

    • Author(s)
      Takehiro Ito, Yuni Iwamasa, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
    • Organizer
      39th International Symposium on Computational Geometry (SoCG 2023)
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-19K11814
  • [Presentation] Algorithmic theory of qubit routing2023

    • Author(s)
      Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto
    • Organizer
      18th Algorithms and Data Structures Symposium (WADS 2023)
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-19K11814
  • [Presentation] Reconfiguration of vertex-disjoint shortest paths on graphs2023

    • Author(s)
      Rin Saito, Hiroshi Eto, Takehiro Ito, Ryuhei Uehara
    • Organizer
      17th International Conference and Workshops on Algorithms and Computation (WALCOM 2023)
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-19K11814
  • [Presentation] Rerouting planar curves and disjoint paths2023

    • Author(s)
      Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
    • Organizer
      50th EATCS International Colloquium on Automata, Languages and Programming (ICALP 2023)
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-19K11814
  • [Presentation] Reconfiguration of time-respecting arborescences2023

    • Author(s)
      Takehiro Ito, Yuni Iwamasa, Naoyuki Kamiyama, Yasuaki Kobayashi, Yusuke Kobayashi, Shun-ichi Maezawa, Akira Suzuki
    • Organizer
      18th Algorithms and Data Structures Symposium (WADS 2023)
    • Int'l Joint Research
    • Data Source
      KAKENHI-PLANNED-20H05793
  • [Presentation] Rerouting planar curves and disjoint paths2023

    • Author(s)
      Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
    • Organizer
      50th EATCS International Colloquium on Automata, Languages and Programming (ICALP 2023)
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-18H04091
  • [Presentation] ZDD-based algorithmic framework for solving shortest reconfiguration problems2023

    • Author(s)
      Takehiro Ito, Jun Kawahara, Yu Nakahata, Takehide Soh, Akira Suzuki, Junichi Teruyama, Takahisa Toda
    • Organizer
      20th International Conference on the Integration of Constraint Programming, Artificial Intelligence, and Operations Research (CPAIOR 2023)
    • Int'l Joint Research
    • Data Source
      KAKENHI-PLANNED-20H05793
  • [Presentation] 時間制約付き有向木の遷移2023

    • Author(s)
      伊藤 健洋, 岩政 勇仁, 神山 直之, 小林 靖明, 小林 佑輔, 前澤 俊一, 鈴木 顕
    • Organizer
      2023年度夏のLAシンポジウム
    • Data Source
      KAKENHI-PLANNED-20H05793
  • [Presentation] Solving reconfiguration problems of first-order expressible properties of graph vertices with Boolean satisfiability2023

    • Author(s)
      Takahisa Toda, Takehiro Ito, Jun Kawahara, Takehide Soh, Akira Suzuki, Junichi Teruyama
    • Organizer
      35th IEEE International Conference on Tools with Artificial Intelligence (ICTAI 2023)
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-19K11814
  • [Presentation] Reconfiguration of vertex-disjoint shortest paths on graphs2023

    • Author(s)
      Rin Saito, Hiroshi Eto, Takehiro Ito, Ryuhei Uehara
    • Organizer
      17th International Conference and Workshops on Algorithms and Computation (WALCOM 2023)
    • Int'l Joint Research
    • Data Source
      KAKENHI-PLANNED-20H05793
  • [Presentation] Hardness of finding combinatorial shortest paths on graph associahedra2023

    • Author(s)
      Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto
    • Organizer
      50th EATCS International Colloquium on Automata, Languages and Programming (ICALP 2023)
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-19K11814
  • [Presentation] Independent set reconfiguration on directed graphs2022

    • Author(s)
      Takehiro Ito, Yuni Iwamasa, Yasuaki Kobayashi, Yu Nakahata, Yota Otachi, Masahiro Takahashi, Kunihiro Wasa
    • Organizer
      47th International Symposium on Mathematical Foundations of Computer Science (MFCS2022)
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-19K11814
  • [Presentation] Computational complexity of ball/water sort puzzles2022

    • Author(s)
      伊藤 健洋, 川原 純, 湊 真一, 大舘 陽太, 斎藤 寿樹, 鈴木 顕, 上原 隆平, 宇野 毅明, 山中 克久, 吉仲 亮
    • Organizer
      第16回組合せゲーム・パズル研究集会
    • Data Source
      KAKENHI-PLANNED-20H05793
  • [Presentation] ZDDを用いた組合せ遷移ソルバー2022

    • Author(s)
      伊藤 健洋, 川原 純, 中畑 裕, 宋 剛秀, 鈴木 顕, 照山 順一, 戸田 貴久
    • Organizer
      日本オペレーションズ・リサーチ学会 2022年秋季研究発表会
    • Data Source
      KAKENHI-PLANNED-20H05793
  • [Presentation] Computational complexity of ball/water sort puzzles2022

    • Author(s)
      Takehiro Ito, Jun Kawahara, Shin-ichi Minato, Yota Otachi, Toshiki Saitoh, Akira Suzuki, Ryuhei Uehara, Takeaki Uno, Katsuhisa Yamanaka, Ryo Yoshinaka
    • Organizer
      Japanese Conference on Combinatorics and its Applications 2022 離散数学とその応用研究集会2022
    • Data Source
      KAKENHI-PLANNED-20H05793
  • [Presentation] Invitation to combinatorial reconfiguration2022

    • Author(s)
      Takehiro Ito
    • Organizer
      16th International Conference and Workshops on Algorithms and Computation (WALCOM 2022)
    • Invited / Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-19K11814
  • [Presentation] Happy set problem on subclasses of co-comparability graphs2022

    • Author(s)
      Hiroshi Eto, Takehiro Ito, Eiji Miyano, Akira Suzuki, Yuma Tamura
    • Organizer
      16th International Conference and Workshops on Algorithms and Computation (WALCOM 2022)
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-19K11814
  • [Presentation] Sorting balls and water: Equivalence and computational complexity2022

    • Author(s)
      Takehiro Ito, Jun Kawahara, Shin-ichi Minato, Yota Otachi, Toshiki Saitoh, Akira Suzuki, Ryuhei Uehara, Takeaki Uno, Katsuhisa Yamanaka, Ryo Yoshinaka
    • Organizer
      11th International Conference on Fun with Algorithms (FUN 2022)
    • Int'l Joint Research
    • Data Source
      KAKENHI-PLANNED-20H05793
  • [Presentation] 配電損失最小化問題に対する組合せ遷移的アプローチ2022

    • Author(s)
      畠山 航, 鈴木 顕, 伊藤 健洋, 周 暁, 杉村 修平, 田邊 隆之
    • Organizer
      日本オペレーションズ・リサーチ学会 2022年秋季研究発表会
    • Data Source
      KAKENHI-PLANNED-20H05793
  • [Presentation] Monotone edge flips to an orientation of maximum edge-connectivity a la Nash-Williams2022

    • Author(s)
      Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
    • Organizer
      2022 ACM-SIAM Symposium on Discrete Algorithms (SODA 2022)
    • Int'l Joint Research
    • Data Source
      KAKENHI-PLANNED-20H05793
  • [Presentation] 球面の三角形分割の彩色遷移2022

    • Author(s)
      伊藤 健洋,岩政 勇仁,小林 佑輔,前澤 俊一,野崎 雄太,岡本 吉央,小関 健太
    • Organizer
      2022年度応用数学合同研究集会
    • Data Source
      KAKENHI-PLANNED-20H05793
  • [Presentation] Algorithms for happy set problem on interval graphs and permutation graphs2022

    • Author(s)
      Hiroshi Eto, Takehiro Ito, Eiji Miyano, Akira Suzuki, Yuma Tamura
    • Organizer
      第186回アルゴリズム研究発表会
    • Data Source
      KAKENHI-PLANNED-20H05793
  • [Presentation] Invitation to combinatorial reconfiguration2022

    • Author(s)
      Takehiro Ito
    • Organizer
      4th International Workshop on Combinatorial Reconfiguration (CoRe 2022)
    • Int'l Joint Research
    • Data Source
      KAKENHI-PLANNED-20H05793
  • [Presentation] On reachable assignments under dichotomous preferences2022

    • Author(s)
      Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
    • Organizer
      24th International Conference on Principles and Practice of Multi-Agent Systems (PRIMA 2022)
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-18H04091
  • [Presentation] Algorithmic meta-theorems for combinatorial reconfiguration revisited2022

    • Author(s)
      Tatsuya Gima, Takehiro Ito, Yasuaki Kobayashi, Yota Otachi
    • Organizer
      30th Annual European Symposium on Algorithms (ESA 2022)
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-19K11814
  • [Presentation] Reconfiguration of regular induced subgraphs2022

    • Author(s)
      Hiroshi Eto, Takehiro Ito, Yasuaki Kobayashi, Yota Otachi, Kunihiro Wasa
    • Organizer
      16th International Conference and Workshops on Algorithms and Computation (WALCOM 2022)
    • Int'l Joint Research
    • Data Source
      KAKENHI-PLANNED-20H05793
  • [Presentation] Reconfiguration of Spanning Trees with Degree Constraint or Diameter Constraint2022

    • Author(s)
      Nicolas Bousquet, Takehiro Ito, Yusuke Kobayashi, Haruka Mizuta, Paul Ouvrard, Akira Suzuki and Kunihiro Wasa
    • Organizer
      The 39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022)
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-18H04091
  • [Presentation] Invitation to combinatorial reconfiguration2022

    • Author(s)
      Takehiro Ito
    • Organizer
      33rd Annual Symposium on Combinatorial Pattern Matching (CPM 2022)
    • Invited / Int'l Joint Research
    • Data Source
      KAKENHI-PLANNED-20H05793
  • [Presentation] Independent set reconfiguration on directed graphs2022

    • Author(s)
      Takehiro Ito, Yuni Iwamasa, Yasuaki Kobayashi, Yu Nakahata, Yota Otachi, Masahiro Takahashi, Kunihiro Wasa
    • Organizer
      47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022)
    • Int'l Joint Research
    • Data Source
      KAKENHI-PLANNED-20H05793
  • [Presentation] Reconfiguration of spanning trees with degree constraint or diameter constraint2022

    • Author(s)
      Nicolas Bousquet, Takehiro Ito, Yusuke Kobayashi, Haruka Mizuta, Paul Ouvrard, Akira Suzuki, Kunihiro Wasa
    • Organizer
      39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022)
    • Int'l Joint Research
    • Data Source
      KAKENHI-PLANNED-20H05793
  • [Presentation] Happy set problem on subclasses of co-comparability graphs2022

    • Author(s)
      Hiroshi Eto, Takehiro Ito, Eiji Miyano, Akira Suzuki, Yuma Tamura
    • Organizer
      16th International Conference and Workshops on Algorithms and Computation (WALCOM 2022)
    • Int'l Joint Research
    • Data Source
      KAKENHI-PLANNED-20H05793
  • [Presentation] Algorithmic meta-theorems for combinatorial reconfiguration revisited2022

    • Author(s)
      Tatsuya Gima, Takehiro Ito, Yasuaki Kobayashi, Yota Otachi
    • Organizer
      30th Annual European Symposium on Algorithms (ESA 2022)
    • Int'l Joint Research
    • Data Source
      KAKENHI-PLANNED-20H05793
  • [Presentation] Monotone Edge Flips to an Orientation of Maximum Edge-Connectivity a la Nash-Williams2022

    • Author(s)
      Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto and Kenta Ozeki
    • Organizer
      The ACM-SIAM Symposium on Discrete Algorithms (SODA 2022)
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-18H04091
  • [Presentation] On reachable assignments under dichotomous preferences2022

    • Author(s)
      Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yuta Nozaki, Yoshio Okamoto, and Kenta Ozeki
    • Organizer
      24th International Conference on Principles and Practice of Multi-Agent Systems (PRIMA 2022)
    • Int'l Joint Research
    • Data Source
      KAKENHI-PLANNED-20H05793
  • [Presentation] Reconfiguration of regular induced subgraphs2022

    • Author(s)
      Hiroshi Eto, Takehiro Ito, Yasuaki Kobayashi, Yota Otachi, Kunihiro Wasa
    • Organizer
      16th International Conference and Workshops on Algorithms and Computation (WALCOM 2022)
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-19K11814
  • [Presentation] Sorting balls and water: equivalence and computational complexity2022

    • Author(s)
      Takehiro Ito, Jun Kawahara, Shin-ichi Minato, Yota Otachi, Toshiki Saitoh, Akira Suzuki, Ryuhei Uehara, Takeaki Uno, Katsuhisa Yamanaka, Ryo Yoshinaka
    • Organizer
      11th International Conference on Fun with Algorithms (FUN 2022)
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-19K11814
  • [Presentation] 有界モデル検査による独立集合遷移問題の解法に関する考察(On solving independent set reconfiguration problems with bounded model checking)2022

    • Author(s)
      戸田 貴久, 伊藤 健洋, 川原 純, 宋 剛秀, 鈴木 顕, 照山 順一
    • Organizer
      第186回アルゴリズム研究発表会
    • Data Source
      KAKENHI-PLANNED-20H05793
  • [Presentation] Invitation to combinatorial reconfiguration2022

    • Author(s)
      Takehiro Ito
    • Organizer
      16th International Conference and Workshops on Algorithms and Computation (WALCOM 2022)
    • Invited / Int'l Joint Research
    • Data Source
      KAKENHI-PLANNED-20H05793
  • [Presentation] Path cover problems with length cost2022

    • Author(s)
      Kenya Kobayashi, Guohui Lin, Eiji Miyano, Toshiki Saitoh, Akira Suzuki, Tadatoshi Utashima and Tsuyoshi Yagita
    • Organizer
      The 16th International Conference and Workshops on Algorithms and Computation (WALCOM 2022)
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-18H04091
  • [Presentation] On reachable assignments under dichotomous preferences2022

    • Author(s)
      Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
    • Organizer
      24th International Conference on Principles and Practice of Multi-Agent Systems (PRIMA 2022)
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-19K11814
  • [Presentation] ZDDを用いた組合せ遷移ソルバーについての考察2022

    • Author(s)
      伊藤 健洋, 川原 純, 宋 剛秀, 鈴木 顕, 照山 順一, 戸田 貴久
    • Organizer
      2021年度冬のLAシンポジウム, 京都大学数理解析研究所RIMS共同研究(公開型), 情報社会を支える計算機科学の基礎理論
    • Data Source
      KAKENHI-PLANNED-20H05793
  • [Presentation] Happy Set Problem on Subclasses of Co-comparability Graphs2022

    • Author(s)
      Hiroshi Eto, Takehiro Ito, Eiji Miyano, Akira Suzuki and Yuma Tamura
    • Organizer
      The 16th International Conference and Workshops on Algorithms and Computation (WALCOM 2022)
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-18H04091
  • [Presentation] Reconfiguration of spanning trees with degree constraint or diameter constraint2022

    • Author(s)
      Nicolas Bousquet, Takehiro Ito, Yusuke Kobayashi, Haruka Mizuta, Paul Ouvrard, Akira Suzuki, Kunihiro Wasa
    • Organizer
      39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022)
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-19K11814
  • [Presentation] 球面の三角形分割の彩色遷移2022

    • Author(s)
      伊藤 健洋,岩政 勇仁,小林 佑輔,前澤 俊一,野崎 雄太,岡本 吉央,小関 健太
    • Organizer
      日本オペレーションズ・リサーチ学会 2022年秋季研究発表会
    • Data Source
      KAKENHI-PLANNED-20H05793
  • [Presentation] Monotone edge flips to an orientation of maximum edge-connectivity a la Nash-Williams2022

    • Author(s)
      Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
    • Organizer
      Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2022)
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-19K11814
  • [Presentation] Sorting balls and water: Equivalence and computational complexity2022

    • Author(s)
      Takehiro Ito, Jun Kawahara, Shin-ichi Minato, Yota Otachi, Toshiki Saitoh, Akira Suzuki, Ryuhei Uehara, Takeaki Uno, Katsuhisa Yamanaka, Ryo Yoshinaka
    • Organizer
      11th International Conference on Fun with Algorithms (FUN 2022)
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-18H04091
  • [Presentation] Monotone edge flips to an orientation of maximum edge-connectivity a la Nash-Williams2022

    • Author(s)
      Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
    • Organizer
      電子情報通信学会コンピュテーション研究会
    • Invited
    • Data Source
      KAKENHI-PLANNED-20H05793
  • [Presentation] Reconfiguration of Regular Induced Subgraphs2022

    • Author(s)
      Hiroshi Eto, Takehiro Ito, Yasuaki Kobayashi, Yota Otachi and Kunihiro Wasa
    • Organizer
      The 16th International Conference and Workshops on Algorithms and Computation (WALCOM 2022)
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-18H04091
  • [Presentation] 組合せ遷移への招待2021

    • Author(s)
      伊藤 健洋
    • Organizer
      離散数学とその応用研究集会2021
    • Data Source
      KAKENHI-PLANNED-20H05793
  • [Presentation] Reconfiguring directed trees in a digraph2021

    • Author(s)
      Takehiro Ito, Yuni Iwamasa, Yasuaki Kobayashi, Yu Nakahata, Yota Otachi, Kunihiro Wasa
    • Organizer
      Workshop on Combinatorial Reconfiguration, affiliated with ICALP 2021
    • Int'l Joint Research
    • Data Source
      KAKENHI-PLANNED-20H05793
  • [Presentation] 区間グラフに対するハミルトン閉路遷移問題2021

    • Author(s)
      佐藤 颯介, 鈴木 顕, 伊藤 健洋, 周 暁
    • Organizer
      電子情報通信学会 2021年 総合大会 COMP 学生シンポジウム
    • Data Source
      KAKENHI-PLANNED-20H05793
  • [Presentation] Query Learning Algorithm for Symbolic Weighted Finite Automata2021

    • Author(s)
      Kaito Suzuki, Diptarama Hendrian, Ryo Yoshinaka, Ayumi Shinohara
    • Organizer
      International Conference on Grammatical Inference (ICGI 2021)
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-18H04091
  • [Presentation] Reconfiguring Directed Trees in a Digraph2021

    • Author(s)
      Takehiro Ito, Yuni Iwamasa, Yasuaki Kobayashi, Yu Nakahata, Yota Otachi and Kunihiro Wasa
    • Organizer
      The 27th International Computing and Combinatorics Conference (COCOON 2021)
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-18H04091
  • [Presentation] Fixed-Treewidth-Efficient Algorithms for Edge-Deletion to Interval Graph Classes2021

    • Author(s)
      Toshiki Saitoh, Ryo Yoshinaka, Hans L. Bodlaender
    • Organizer
      WALCOM 2021
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-18H04091
  • [Presentation] Multilayer tiles2021

    • Author(s)
      Kota Chida, Erik Demaine, Martin Demaine, David Eppstein, Adam Hesterberg, Takashi Horiyama, John Iacono, Hiro Ito, Stefan Langerman, and Ryuhei Uehara
    • Organizer
      The 23rd Thailand-Japan Conference on Discrete and Computational Geometry, Graphs, and Games (TJCDCG3 2020+1)
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-18H04091
  • [Presentation] Reconfiguring directed trees in a digraph2021

    • Author(s)
      Takehiro Ito, Yuni Iwamasa, Yasuaki Kobayashi, Yu Nakahata, Yota Otachi, Kunihiro Wasa
    • Organizer
      27th International Computing and Combinatorics Conference (COCOON 2021)
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-19K11814
  • [Presentation] Complexity of reconfiguration of regular induced subgraphs2021

    • Author(s)
      Hiroshi Eto, Takehiro Ito, Yasuaki Kobayashi, Yota Otachi, Kunihiro Wasa
    • Organizer
      電子情報通信学会コンピュテーション研究会
    • Data Source
      KAKENHI-PLANNED-20H05793
  • [Presentation] Token sliding on directed graphs2021

    • Author(s)
      Takehiro Ito, Yuni Iwamasa, Yasuaki Kobayashi, Yu Nakahata, Masahiro Takahashi, Yota Otachi, Kunihiro Wasa
    • Organizer
      電子情報通信学会コンピュテーション研究会
    • Data Source
      KAKENHI-PLANNED-20H05793
  • [Presentation] Reconfiguring directed trees in a digraph2021

    • Author(s)
      Takehiro Ito, Yuni Iwamasa, Yasuaki Kobayashi, Yu Nakahata, Yota Otachi, Kunihiro Wasa
    • Organizer
      27th International Computing and Combinatorics Conference (COCOON 2021)
    • Int'l Joint Research
    • Data Source
      KAKENHI-PLANNED-20H05793
  • [Presentation] Reconfiguration of envy-free item allocations2021

    • Author(s)
      Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
    • Organizer
      Workshop on Combinatorial Reconfiguration, affiliated with ICALP 2021
    • Int'l Joint Research
    • Data Source
      KAKENHI-PLANNED-20H05793
  • [Presentation] Reformist envy-free item allocations: algorithms and complexity2021

    • Author(s)
      Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
    • Organizer
      第183回情報処理学会アルゴリズム研究会
    • Data Source
      KAKENHI-PLANNED-20H05793
  • [Presentation] Approximability of the independent feedback vertex set problem for bipartite graphs2020

    • Author(s)
      Tamura Yuma、Ito Takehiro、Zhou Xiao
    • Organizer
      14th International Conference and Workshop on Algorithms and Computation (WALCOM 2020)
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-19K11814
  • [Presentation] Reconfiguration of spanning trees with many or few leaves2020

    • Author(s)
      Bousquet Nicolas、Ito Takehiro、Kobayashi Yusuke、Mizuta Haruka、Ouvrard Paul、Suzuki Akira、Wasa Kunihiro
    • Organizer
      28th Annual European Symposium on Algorithms (ESA 2020)
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-19K11814
  • [Presentation] Fixed-Parameter Algorithms for Graph Constraint Logic2020

    • Author(s)
      Tatsuhiko Hatanaka, Felix Hommelsheim, Takehiro Ito, Yusuke Kobayashi, Moritz Muhlenthaler, Akira Suzuki
    • Organizer
      IPEC 2020
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-18H04091
  • [Presentation] Shortest Reconfiguration of Colorings Under Kempe Changes2020

    • Author(s)
      Marthe Bonamy, Marc Heinrich, Takehiro Ito, Yusuke Kobayashi, Haruka Mizuta, Moritz Muhlenthaler, Akira Suzuki, Kunihiro Wasa
    • Organizer
      STACS 2020
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-18H04091
  • [Presentation] Fixed-parameter algorithms for graph constraint logic2020

    • Author(s)
      Hatanaka Tatsuhiko、Hommelsheim Felix、Ito Takehiro、Kobayashi Yusuke、Muehlenthaler Moritz、Suzuki Akira
    • Organizer
      15th International Symposium on Parameterized and Exact Computation (IPEC 2020)
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-19K11814
  • [Presentation] Fixed-parameter algorithms for graph constraint logic2020

    • Author(s)
      Tatsuhiko Hatanaka, Felix Hommelsheim, Takehiro Ito, Yusuke Kobayashi, Moritz M?hlenthaler, Akira Suzuki
    • Organizer
      15th International Symposium on Parameterized and Exact Computation (IPEC 2020)
    • Int'l Joint Research
    • Data Source
      KAKENHI-PLANNED-20H05793
  • [Presentation] An Extension of Linear-size Suffix Tries for Parameterized Strings2020

    • Author(s)
      Katsuhito Nakashima, Diptarama Hendrian, Ryo Yoshinaka, Ayumi Shinohara
    • Organizer
      SOFSEM 2020
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-18H04091
  • [Presentation] Reconfiguration of Spanning Trees with Many or Few Leaves2020

    • Author(s)
      Nicolas Bousquet, Takehiro Ito, Yusuke Kobayashi, Haruka Mizuta, Paul Ouvrard, Akira Suzuki, Kunihiro Wasa
    • Organizer
      ESA 2020
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-18H04091
  • [Presentation] Shortest reconfiguration of colorings under Kempe changes2020

    • Author(s)
      Bonamy Marthe、Heinrich Marc、Ito Takehiro、Kobayashi Yusuke、Mizuta Haruka、Muehlenthaler Moritz、Suzuki Akira、Wasa Kunihiro
    • Organizer
      37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020)
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-19K11814
  • [Presentation] Minimization and parameterized variants of vertex partition problems on graphs2020

    • Author(s)
      Tamura Yuma、Ito Takehiro、Zhou Xiao
    • Organizer
      31st International Symposium on Algorithms and Computation (ISAAC 2020)
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-19K11814
  • [Presentation] DAWGs for Parameterized Matching: Online Construction and Related Indexing Structures2020

    • Author(s)
      Katsuhito Nakashima, Noriki Fujisato, Diptarama Hendrian, Yuto Nakashima, Ryo Yoshinaka, Shunsuke Inenaga, Hideo Bannai, Ayumi Shinohara, Masayuki Takeda
    • Organizer
      CPM 2020
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-18H04091
  • [Presentation] Approximability of the Independent Feedback Vertex Set Problem for Bipartite Graphs2020

    • Author(s)
      Yuma Tamura, Takehiro Ito, Xiao Zhou
    • Organizer
      WALCOM 2020
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-18H04091
  • [Presentation] Minimization and Parameterized Variants of Vertex Partition Problems on Graphs2020

    • Author(s)
      Yuma Tamura, Takehiro Ito, Xiao Zhou
    • Organizer
      ISAAC 2020
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-18H04091
  • [Presentation] Incremental Optimization of Independent Sets Under the Reconfiguration Framework2019

    • Author(s)
      Takehiro Ito, Haruka Mizuta, Naomi Nishimura, Akira Suzuki
    • Organizer
      COCOON 2019
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-18H04091
  • [Presentation] The perfect matching reconfiguration problem2019

    • Author(s)
      Bonamy Marthe、Bousquet Nicolas、Heinrich Marc、Ito Takehiro、Kobayashi Yusuke、Mary Arnaud、Muehlenthaler Moritz、Wasa Kunihiro
    • Organizer
      44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019)
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-19K11814
  • [Presentation] Shortest reconfiguration of perfect matchings via alternating cycles2019

    • Author(s)
      Ito Takehiro、Kakimura Naonori、Kamiyama Naoyuki、Kobayashi Yusuke、Okamoto Yoshio
    • Organizer
      27th Annual European Symposium on Algorithms (ESA 2019)
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-19K11814
  • [Presentation] Reconfiguration of minimum Steiner trees via vertex exchanges2019

    • Author(s)
      Mizuta Haruka、Hatanaka Tatsuhiko、Ito Takehiro、Zhou Xiao
    • Organizer
      44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019)
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-19K11814
  • [Presentation] Diameter of colorings under Kempe changes2019

    • Author(s)
      Bonamy Marthe、Heinrich Marc、Ito Takehiro、Kobayashi Yusuke、Mizuta Haruka、Muehlenthaler Moritz、Suzuki Akira、Wasa Kunihiro
    • Organizer
      25th International Computing and Combinatorics Conference (COCOON 2019)
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-19K11814
  • [Presentation] Reconfiguration of Minimum Steiner Trees via Vertex Exchanges2019

    • Author(s)
      Haruka Mizuta, Tatsuhiko Hatanaka, Takehiro Ito, Xiao Zhou
    • Organizer
      MFCS 2019
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-18H04091
  • [Presentation] Diameter of Colorings Under Kempe Changes2019

    • Author(s)
      Marthe Bonamy, Marc Heinrich, Takehiro Ito, Yusuke Kobayashi, Haruka Mizuta, Moritz Muhlenthaler, Akira Suzuki, Kunihiro Wasa
    • Organizer
      COCOON 2019
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-18H04091
  • [Presentation] Shortest reconfiguration of matchings2019

    • Author(s)
      Bousquet Nicolas、Hatanaka Tatsuhiko、Ito Takehiro、Muehlenthaler Moritz
    • Organizer
      45th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2019)
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-19K11814
  • [Presentation] Shortest Reconfiguration of Perfect Matchings via Alternating Cycles2019

    • Author(s)
      Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto
    • Organizer
      ESA 2019
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-18H04091
  • [Presentation] Shortest Reconfiguration of Matchings2019

    • Author(s)
      Nicolas Bousquet, Tatsuhiko Hatanaka, Takehiro Ito, Moritz Muhlenthaler
    • Organizer
      WG 2019
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-18H04091
  • [Presentation] Colorful Frontier-based Search: Implicit Enumeration of Chordal and Interval Subgraphs2019

    • Author(s)
      Jun Kawahara, Toshiki Saitoh, Hirofumi Suzuki, and Ryo Yoshinaka
    • Organizer
      Special Event on Analysis of Experimental Algorithms (SEA^2 2019), to appear
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-18H04091
  • [Presentation] Max-Min 3-dispersion Problems2019

    • Author(s)
      Takashi Horiyama, Shin-ichi Nakano, Toshiki Saitoh, Koki Suetsugu, Akira Suzuki, Ryuhei Uehara, Takeaki Uno, Kunihiro Wasa
    • Organizer
      COCOON 2019
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-18H04091
  • [Presentation] Algorithms for Gerrymandering over Graphs2019

    • Author(s)
      Takehiro Ito, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto
    • Organizer
      AAMAS 2019
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-18H04091
  • [Presentation] Incremental optimization of independent sets under the reconfiguration framework2019

    • Author(s)
      Ito Takehiro、Mizuta Haruka、Nishimura Naomi、Suzuki Akira
    • Organizer
      25th International Computing and Combinatorics Conference (COCOON 2019)
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-19K11814
  • [Presentation] The Perfect Matching Reconfiguration Problem2019

    • Author(s)
      Marthe Bonamy, Nicolas Bousquet, Marc Heinrich, Takehiro Ito, Yusuke Kobayashi, Arnaud Mary, Moritz Muhlenthaler, Kunihiro Wasa
    • Organizer
      MFCS 2019
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-18H04091
  • [Presentation] Reconfiguring spanning and induced subgraphs2018

    • Author(s)
      Hanaka Tesshu、Ito Takehiro、Mizuta Haruka、Moore Benjamin、Nishimura Naomi、Subramanya Vijay、Suzuki Akira、Vaidyanathan Krishna
    • Organizer
      24th Annual International Computing and Combinatorics Conference (COCOON 2018)
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-16K00004
  • [Presentation] Reconfiguration of Colorable Sets in Classes of Perfect Graphs2018

    • Author(s)
      Takehiro Ito, Yota Otachi
    • Organizer
      SWAT 2018, pp. 27:1-27:13
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-18H04091
  • [Presentation] Computational Complexity of Robot Arm Simulation Problems2018

    • Author(s)
      Tianfeng Feng, Takashi Horiyama, Yoshio Okamoto, Yota Otachi, Toshiki Saitoh, Takeaki Uno, Ryuhei Uehara
    • Organizer
      IWOCA 2018, pp. 177-188
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-18H04091
  • [Presentation] Exact Algorithms for the Max-Min Dispersion Problem2018

    • Author(s)
      Toshihiro Akagi, Tetsuya Araki, Takashi Horiyama, Shin-Ichi Nakano, Yoshio Okamoto, Yota Otachi, Toshiki Saitoh, Ryuhei Uehara, Takeaki Uno, Kunihiro Wasa
    • Organizer
      FAW 2018, pp. 263-272
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-18H04091
  • [Presentation] Algorithms for coloring reconfiguration under recolorability constraints2018

    • Author(s)
      Osawa Hiroki、Suzuki Akira、Ito Takehiro、Zhou Xiao
    • Organizer
      29th International Symposium on Algorithms and Computation (ISAAC 2018)
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-16K00004
  • [Presentation] Algorithms for Coloring Reconfiguration Under Recolorability Constraints2018

    • Author(s)
      Hiroki Osawa, Akira Suzuki, Takehiro Ito, Xiao Zhou
    • Organizer
      ISAAC 2018, pp. 37:1-37:13
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-18H04091
  • [Presentation] Reconfiguring Spanning and Induced Subgraphs2018

    • Author(s)
      Tesshu Hanaka, Takehiro Ito, Haruka Mizuta, Benjamin Moore, Naomi Nishimura, Vijay Subramanya, Akira Suzuki, Krishna Vaidyanathan
    • Organizer
      COCOON 2018, pp. 428-440
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-18H04091
  • [Presentation] Reconfiguration of colorable sets in classes of perfect graphs2018

    • Author(s)
      Ito Takehiro、Otachi Yota
    • Organizer
      16th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2018)
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-16K00004
  • [Presentation] Approximation Algorithm for the Distance-3 Independent Set Problem on Cubic Graphs2017

    • Author(s)
      Hiroshi Eto, Takehiro Ito, Zhilong Liu, Eiji Miyano
    • Organizer
      The 11th International Conference and Workshops on Algorithms and Computation (WALCOM 2017)
    • Place of Presentation
      Hsinchu, Taiwan
    • Year and Date
      2017-03-30
    • Int'l Joint Research
    • Data Source
      KAKENHI-PUBLICLY-15H00849
  • [Presentation] The Complexity of (List) Edge-Coloring Reconfiguration Problem2017

    • Author(s)
      Hiroki Osawa, Akira Suzuki, Takehiro Ito, Xiao Zhou
    • Organizer
      The 11th International Conference and Workshops on Algorithms and Computation (WALCOM 2017)
    • Place of Presentation
      Hsinchu, Taiwan
    • Year and Date
      2017-03-30
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-16K00004
  • [Presentation] Complexity of Coloring Reconfiguration under Recolorability Constraints2017

    • Author(s)
      Osawa Hiroki、Suzuki Akira、Ito Takehiro、Zhou Xiao
    • Organizer
      28th International Symposium on Algorithms and Computation (ISAAC 2017)
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-16K00004
  • [Presentation] The Complexity of (List) Edge-Coloring Reconfiguration Problem2017

    • Author(s)
      Hiroki Osawa, Akira Suzuki, Takehiro Ito, Xiao Zhou
    • Organizer
      The 11th International Conference and Workshops on Algorithms and Computation (WALCOM 2017)
    • Place of Presentation
      Hsinchu, Taiwan
    • Year and Date
      2017-03-30
    • Int'l Joint Research
    • Data Source
      KAKENHI-PUBLICLY-15H00849
  • [Presentation] Tight Approximability of the Server Allocation Problem for Real-Time Applications2017

    • Author(s)
      Ito Takehiro、Kakimura Naonori、Kamiyama Naoyuki、Kobayashi Yusuke、Okamoto Yoshio、Shiitada Taichi
    • Organizer
      3rd International Workshop on Algorithmic Aspects of Cloud Computing (ALGOCLOUD 2017)
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-16K00004
  • [Presentation] The Coloring Reconfiguration Problem on Specific Graph Classes2017

    • Author(s)
      Hatanaka Tatsuhiko、Ito Takehiro、Zhou Xiao
    • Organizer
      11th Annual International Conference on Combinatorial Optimization and Applications (COCOA 2017)
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-16K00004
  • [Presentation] Reconfiguration of Maximum-Weight b-Matchings in a Graph2017

    • Author(s)
      Ito Takehiro、Kakimura Naonori、Kamiyama Naoyuki、Kobayashi Yusuke、Okamoto Yoshio
    • Organizer
      23rd Annual International Computing and Combinatorics Conference (COCOON 2017)
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-16K00004
  • [Presentation] Complexity of the Multi-Service Center Problem2017

    • Author(s)
      Ito Takehiro、Kakimura Naonori、Kobayashi Yusuke
    • Organizer
      28th International Symposium on Algorithms and Computation (ISAAC 2017)
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-16K00004
  • [Presentation] Approximation Algorithm for the Distance-3 Independent Set Problem on Cubic Graphs2017

    • Author(s)
      Hiroshi Eto, Takehiro Ito, Zhilong Liu, Eiji Miyano
    • Organizer
      The 11th International Conference and Workshops on Algorithms and Computation (WALCOM 2017)
    • Place of Presentation
      Hsinchu, Taiwan
    • Year and Date
      2017-03-30
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-16K00004
  • [Presentation] Parameterized Complexity of the List Coloring Reconfiguration Problem with Graph Parameters2017

    • Author(s)
      Hatanaka Tatsuhiko、Ito Takehiro、Zhou Xiao
    • Organizer
      42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017)
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-16K00004
  • [Presentation] Reconfiguration of Steiner Trees in an Unweighted Graph2016

    • Author(s)
      Haruka Mizuta, Takehiro Ito, Xiao Zhou
    • Organizer
      The 27th International Workshop on Combinatorial Algorithms (IWOCA 2016)
    • Place of Presentation
      Helsinki, Finland
    • Year and Date
      2016-08-17
    • Int'l Joint Research
    • Data Source
      KAKENHI-PUBLICLY-15H00849
  • [Presentation] The Multi-Service Center Decision Problem is NP-Complete for Split Graphs2016

    • Author(s)
      Toshimitsu Anzai, Takehiro Ito, Akira Suzuki, Xiao Zhou
    • Organizer
      The 6th World Congress on Engineering and Technology (CET 2016)
    • Place of Presentation
      Shanghai, China
    • Year and Date
      2016-10-23
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-16K00004
  • [Presentation] Efficient Stabilization of Cooperative Matching Games2016

    • Author(s)
      Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto
    • Organizer
      15th International Conference on Autonomous Agents and Multi-Agent Systems (AAMAS 2016)
    • Place of Presentation
      シンガポール (シンガポール共和国)
    • Year and Date
      2016-05-11
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-25330003
  • [Presentation] Approximability of the Distance Independent Set Problem on Regular Graphs and Planar Graphs2016

    • Author(s)
      Hiroshi Eto, Takehiro Ito, Zhilong Liu, Eiji Miyano
    • Organizer
      The 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA 2016)
    • Place of Presentation
      Hong Kong, China
    • Year and Date
      2016-12-17
    • Int'l Joint Research
    • Data Source
      KAKENHI-PUBLICLY-15H00849
  • [Presentation] Efficient Stabilization of Cooperative Matching Games2016

    • Author(s)
      Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto
    • Organizer
      15th International Conference on Autonomous Agents and Multi-Agent Systems (AAMAS 2016)
    • Place of Presentation
      シンガポール (シンガポール共和国)
    • Year and Date
      2016-05-11
    • Int'l Joint Research
    • Data Source
      KAKENHI-PUBLICLY-15H00849
  • [Presentation] Reconfiguration of Steiner Trees in an Unweighted Graph2016

    • Author(s)
      Haruka Mizuta, Takehiro Ito, Xiao Zhou
    • Organizer
      The 27th International Workshop on Combinatorial Algorithms (IWOCA 2016)
    • Place of Presentation
      Helsinki, Finland
    • Year and Date
      2016-08-17
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-16K00004
  • [Presentation] Approximability of the Distance Independent Set Problem on Regular Graphs and Planar Graphs2016

    • Author(s)
      Hiroshi Eto, Takehiro Ito, Zhilong Liu, Eiji Miyano
    • Organizer
      The 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA 2016)
    • Place of Presentation
      Hong Kong, China
    • Year and Date
      2016-12-17
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-16K00004
  • [Presentation] Competitive Diffusion on Weighted Graphs2015

    • Author(s)
      Takehiro Ito, Yota Otachi, Toshiki Saitoh, Hisayuki Satoh, Akira Suzuki, Kei Uchizawa, Ryuhei Uehara, Katsuhisa Yamanaka, Xiao Zhou
    • Organizer
      14th Algorithms and Data Structures Symposium (WADS 2015)
    • Place of Presentation
      ビクトリア (カナダ)
    • Year and Date
      2015-08-06
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-25330003
  • [Presentation] Reconfiguration of Cliques in a Graph2015

    • Author(s)
      Takehiro Ito, Hirotaka Ono, Yota Otachi
    • Organizer
      12th Annual Conference on Theory and Applications of Models of Computation
    • Place of Presentation
      シンガポール
    • Year and Date
      2015-05-19
    • Data Source
      KAKENHI-PUBLICLY-25106504
  • [Presentation] The Complexity of Dominating Set Reconfiguration2015

    • Author(s)
      Arash Haddadan, Takehiro Ito, Amer E. Mouawad, Naomi Nishimura, Hirotaka Ono, Akira Suzuki, Youcef Tebbal
    • Organizer
      14th Algorithms and Data Structures Symposium (WADS 2015)
    • Place of Presentation
      ビクトリア (カナダ)
    • Year and Date
      2015-08-05
    • Int'l Joint Research
    • Data Source
      KAKENHI-PUBLICLY-15H00849
  • [Presentation] The Complexity of Dominating Set Reconfiguration2015

    • Author(s)
      Arash Haddadan, Takehiro Ito, Amer E. Mouawad, Naomi Nishimura, Hirotaka Ono, Akira Suzuki, Youcef Tebbal
    • Organizer
      14th Algorithms and Data Structures Symposium (WADS 2015)
    • Place of Presentation
      ビクトリア (カナダ)
    • Year and Date
      2015-08-05
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-25330003
  • [Presentation] Reconfiguration of Cliques in a Graph2015

    • Author(s)
      Takehiro Ito, Hirotaka Ono, Yota Otachi
    • Organizer
      12th Annual Conference on Theory and Applications of Models of Computation
    • Place of Presentation
      シンガポール
    • Year and Date
      2015-05-19
    • Data Source
      KAKENHI-PROJECT-25330003
  • [Presentation] Deterministic Algorithms for the Independent Feedback Vertex Set Problem2014

    • Author(s)
      Yuma Tamura, Takehiro Ito, Xiao Zhou
    • Organizer
      25th International Workshop on Combinatorial Algorithms
    • Place of Presentation
      ダルース(アメリカ)
    • Year and Date
      2014-10-17
    • Data Source
      KAKENHI-PUBLICLY-25106504
  • [Presentation] Minimum-Cost b-Edge Dominating Sets on Trees2014

    • Author(s)
      Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto
    • Organizer
      25th Annual International Symposium on Algorithms and Computation
    • Place of Presentation
      全州(韓国)
    • Year and Date
      2014-12-15
    • Data Source
      KAKENHI-PUBLICLY-25106504
  • [Presentation] The Minimum Vulnerability Problem on Graphs2014

    • Author(s)
      Yusuke Aoki, Bjarni V. Halldorsson, Magnus M. Halldorsson, Takehiro Ito, Christian Konrad, Xiao Zhou
    • Organizer
      8th Annual International Conference on Combinatorial Optimization and Applications
    • Place of Presentation
      ハワイ(アメリカ)
    • Year and Date
      2014-12-20
    • Data Source
      KAKENHI-PROJECT-25330003
  • [Presentation] Polynomial-Time Algorithm for Sliding Tokens on Trees2014

    • Author(s)
      Erik D. Demaine, Martin L. Demaine, Eli Fox-Epstein, Duc A. Hoang, Takehiro Ito, Hirotaka Ono, Yota Otachi, Ryuhei Uehara, Takeshi Yamada
    • Organizer
      25th Annual International Symposium on Algorithms and Computation
    • Place of Presentation
      全州(韓国)
    • Year and Date
      2014-12-16
    • Data Source
      KAKENHI-PUBLICLY-25106504
  • [Presentation] Deterministic Algorithms for the Independent Feedback Vertex Set Problem2014

    • Author(s)
      Yuma Tamura, Takehiro Ito, Xiao Zhou
    • Organizer
      25th International Workshop on Combinatorial Algorithms
    • Place of Presentation
      ダルース(アメリカ)
    • Year and Date
      2014-10-17
    • Data Source
      KAKENHI-PROJECT-25330003
  • [Presentation] The Minimum Vulnerability Problem on Graphs2014

    • Author(s)
      Yusuke Aoki, Bjarni V. Halldorsson, Magnus M. Halldorsson, Takehiro Ito, Christian Konrad, Xiao Zhou
    • Organizer
      8th Annual International Conference on Combinatorial Optimization and Applications
    • Place of Presentation
      ハワイ(アメリカ)
    • Year and Date
      2014-12-20
    • Data Source
      KAKENHI-PUBLICLY-25106504
  • [Presentation] Fixed-Parameter Tractability of Token Jumping on Planar Graphs2014

    • Author(s)
      Takehiro Ito, Marcin Kaminski, Hirotaka Ono
    • Organizer
      25th Annual International Symposium on Algorithms and Computation
    • Place of Presentation
      全州(韓国)
    • Year and Date
      2014-12-15
    • Data Source
      KAKENHI-PUBLICLY-25106504
  • [Presentation] Reconfiguration of Vertex Covers in a Graph2014

    • Author(s)
      Takehiro Ito, Hiroyuki Nooka, Xiao Zhou
    • Organizer
      25th International Workshop on Combinatorial Algorithms
    • Place of Presentation
      ダルース(アメリカ)
    • Year and Date
      2014-10-15
    • Data Source
      KAKENHI-PROJECT-25330003
  • [Presentation] The List Coloring Reconfiguration Problem for Bounded Pathwidth Graphs2014

    • Author(s)
      Tatsuhiko Hatanaka, Takehiro Ito, Xiao Zhou
    • Organizer
      8th Annual International Conference on Combinatorial Optimization and Applications
    • Place of Presentation
      ハワイ(アメリカ)
    • Year and Date
      2014-12-20
    • Data Source
      KAKENHI-PROJECT-25330003
  • [Presentation] Fixed-Parameter Tractability of Token Jumping on Planar Graphs2014

    • Author(s)
      Takehiro Ito, Marcin Kaminski, Hirotaka Ono
    • Organizer
      25th Annual International Symposium on Algorithms and Computation
    • Place of Presentation
      全州(韓国)
    • Year and Date
      2014-12-15
    • Data Source
      KAKENHI-PROJECT-25330003
  • [Presentation] Reconfiguration of Vertex Covers in a Graph2014

    • Author(s)
      Takehiro Ito, Hiroyuki Nooka, Xiao Zhou
    • Organizer
      25th International Workshop on Combinatorial Algorithms
    • Place of Presentation
      ダルース(アメリカ)
    • Year and Date
      2014-10-15
    • Data Source
      KAKENHI-PUBLICLY-25106504
  • [Presentation] Polynomial-Time Algorithm for Sliding Tokens on Trees2014

    • Author(s)
      Erik D. Demaine, Martin L. Demaine, Eli Fox-Epstein, Duc A. Hoang, Takehiro Ito, Hirotaka Ono, Yota Otachi, Ryuhei Uehara, Takeshi Yamada
    • Organizer
      25th Annual International Symposium on Algorithms and Computation
    • Place of Presentation
      全州(韓国)
    • Year and Date
      2014-12-16
    • Data Source
      KAKENHI-PROJECT-25330003
  • [Presentation] Minimum-Cost b-Edge Dominating Sets on Trees2014

    • Author(s)
      Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto
    • Organizer
      25th Annual International Symposium on Algorithms and Computation
    • Place of Presentation
      全州(韓国)
    • Year and Date
      2014-12-15
    • Data Source
      KAKENHI-PROJECT-25330003
  • [Presentation] The List Coloring Reconfiguration Problem for Bounded Pathwidth Graphs2014

    • Author(s)
      Tatsuhiko Hatanaka, Takehiro Ito, Xiao Zhou
    • Organizer
      8th Annual International Conference on Combinatorial Optimization and Applications
    • Place of Presentation
      ハワイ(アメリカ)
    • Year and Date
      2014-12-20
    • Data Source
      KAKENHI-PUBLICLY-25106504
  • [Presentation] Generalized Rainbow Connectivity of Graphs2013

    • Author(s)
      Kei Uchizawa, Takanori Aoki, Takehiro Ito and Xiao Zhou
    • Organizer
      The 7th International Workshop onAlgorithms and Computation (WALCOM2013)
    • Place of Presentation
      インド・Kharagpur
    • Year and Date
      2013-02-15
    • Data Source
      KAKENHI-PROJECT-22700001
  • [Presentation] Generalized Rainbow Connectivity of Graphs2013

    • Author(s)
      Kei Uchizawa, Takanori Aoki, Takehiro Ito, Xiao Zhou
    • Organizer
      7th International Workshop on Algorithms and Computation (WALCOM 2013)
    • Place of Presentation
      Kharagpur, India
    • Data Source
      KAKENHI-PROJECT-22700001
  • [Presentation] Reconfiguration of List L(2,1)-Labelings in a Graph2012

    • Author(s)
      Takehiro Ito, Kazuto Kawamura, Hirotaka Ono and Xiao Zhou
    • Organizer
      The 23rd Annual International Symposiumon Algorithms and Computation (ISAAC2012)
    • Place of Presentation
      台湾・台北
    • Year and Date
      2012-12-19
    • Data Source
      KAKENHI-PROJECT-22700001
  • [Presentation] Reconfiguration of List L(2,1)-Labelings in a Graph2012

    • Author(s)
      Takehiro Ito, Kazuto Kawamura, Hirotaka Ono, Xiao Zhou
    • Organizer
      23rd Annual International Symposium on Algorithms and Computation (ISAAC 2012)
    • Place of Presentation
      Taipei, Taiwan
    • Data Source
      KAKENHI-PROJECT-22700001
  • [Presentation] On the Rainbow Connectivity of Graphs: Complexity and FPT Algorithms2011

    • Author(s)
      Kei Uchizawa, Takanori Aoki, Takehiro Ito, Akira Suzuki and Xiao Zhou
    • Organizer
      The17th Annual International Computing and Combinatorics Conference (COCOON2011)
    • Place of Presentation
      アメリカ・ダ ラス
    • Year and Date
      2011-08-14
    • Data Source
      KAKENHI-PROJECT-22700001
  • [Presentation] Approximability of the Subset Sum Reconfiguration Problem2011

    • Author(s)
      Takehiro Ito, Erik D.Demaine
    • Organizer
      8th Annual Conference on Theory and Applications of Models of Computation (TAMC 2011)
    • Place of Presentation
      東京
    • Year and Date
      2011-05-23
    • Data Source
      KAKENHI-PROJECT-22700001
  • [Presentation] An Improved Sufficient Condition for Reconfiguration of List Edge-Colorings in a Tree2011

    • Author(s)
      Takehiro Ito, 他2名
    • Organizer
      8th Annual Conference on Theory and Applications of Models of Computation (TAMC 2011)
    • Place of Presentation
      東京
    • Year and Date
      2011-05-23
    • Data Source
      KAKENHI-PROJECT-22700001
  • [Presentation] Approximability of the Subset Sum Reconfiguration Problem2011

    • Author(s)
      Takehiro Ito and Erik D. Demaine
    • Organizer
      The 8th Annual Conference on Theory and Applications of Models of Computation (TAMC 2011)
    • Place of Presentation
      東京
    • Year and Date
      2011-05-23
    • Data Source
      KAKENHI-PROJECT-22700001
  • [Presentation] An Improved Sufficient Condition for Reconfiguration of List Edge-Colorings in a Tree2011

    • Author(s)
      Takehiro Ito, Kazuto Kawamura and Xiao Zhou
    • Organizer
      The 8th Annual Conference on Theory and Applications of Models of Computation (TAMC 2011)
    • Place of Presentation
      東京
    • Year and Date
      2011-05-23
    • Data Source
      KAKENHI-PROJECT-22700001
  • [Presentation] Minimum cost edge-colorings of trees can be reduced to matchings2010

    • Author(s)
      T.Ito
    • Organizer
      FAW 2010
    • Place of Presentation
      中国 武漢
    • Year and Date
      2010-08-13
    • Data Source
      KAKENHI-PROJECT-21500001
  • [Presentation] Minimum Cost Partitions of Trees with Supply and Demand2010

    • Author(s)
      Takehiro Ito, Takuya Hara, Xiao Zhou and Takao Nishizeki
    • Organizer
      The 21st Annual International Symposium on Algorithms and Computation (ISAAC 2010)
    • Place of Presentation
      韓国・済州島
    • Year and Date
      2010-12-17
    • Data Source
      KAKENHI-PROJECT-22700001
  • [Presentation] Minimum Cost Partitions of Trees with Supply and Demand2010

    • Author(s)
      Takehiro Ito, 他2名
    • Organizer
      21st Annual International Symposium on Algorithms and Computation (ISAAC 2010)
    • Place of Presentation
      韓国・済州島
    • Year and Date
      2010-12-17
    • Data Source
      KAKENHI-PROJECT-22700001
  • [Presentation] Minimum cost partitions of trees with supply and demand2010

    • Author(s)
      T.Ito
    • Organizer
      ISAAC 2010
    • Place of Presentation
      韓国 済州島
    • Year and Date
      2010-12-17
    • Data Source
      KAKENHI-PROJECT-21500001
  • [Presentation] A Characterization of Graphs with Fractional Total Chromatic Number Equal toΔ+22009

    • Author(s)
      Takehiro Ito, William S. Kennedy, Bruce A. Reed
    • Organizer
      5th Latin-American Algorithms, Graphs and Optimization Symposium
    • Place of Presentation
      ブラジル・リオグランデドスル
    • Year and Date
      2009-11-07
    • Data Source
      KAKENHI-PROJECT-20700003
  • [Presentation] Parameterizing Cut Sets in a Graph by the Number of Their Components2009

    • Author(s)
      Takehiro Ito, Marcin Kaminski, Daniel Paulusma, Dimitrios M. Thilikos
    • Organizer
      20th Annual International Symposium on Algorithms and Computation
    • Place of Presentation
      アメリカ合衆国・ハワイ
    • Year and Date
      2009-12-16
    • Data Source
      KAKENHI-PROJECT-20700003
  • [Presentation] Reconfiguration of list edge-colorings in a graph2009

    • Author(s)
      Takehiro Ito(, 他2名)
    • Organizer
      11th Algorithms and Data Structures Symposium(WADS 2009)
    • Place of Presentation
      カナダ・バンフ
    • Year and Date
      2009-08-21
    • Data Source
      KAKENHI-PROJECT-20700003
  • [Presentation] Route-Enabling Graph Orientation Problems2009

    • Author(s)
      Takehiro Ito, Yuichiro Miyamoto, Hirotaka Ono, Hisao Tamaki, Ryuhei Uehara
    • Organizer
      20th Annual International Symposium on Algorithms and Computation
    • Place of Presentation
      アメリカ合衆国・ハワイ
    • Year and Date
      2009-12-16
    • Data Source
      KAKENHI-PROJECT-20700003
  • [Presentation] Reconfiguration of List Edge-Colorings in a Graph2009

    • Author(s)
      Takehiro Ito, Marcin Kaminski, Erik D. Demaine
    • Organizer
      11th Algorithms and Data Structures Symposium
    • Place of Presentation
      カナダ・バンフ
    • Year and Date
      2009-08-21
    • Data Source
      KAKENHI-PROJECT-20700003
  • [Presentation] Partitioning a Weighted Tree to Subtrees of Almost Uniform Size2008

    • Author(s)
      Takehiro Ito, Takeaki Uno, Xiao Zhou, Takao Nishizeki
    • Organizer
      19th Annual International Symposium on Algorithms and Computation
    • Place of Presentation
      オーストラリア・ゴールドコースト
    • Year and Date
      2008-12-15
    • Data Source
      KAKENHI-PROJECT-20700003
  • [Presentation] On the Complexity of Reconfiguration Problems2008

    • Author(s)
      Takehiro Ito, Erik D. Demaine, Nicholas J.A. Harvey, Christos H. Papadimitriou, Martha Sideri, Ryuhei Uehara, Yushi Uno
    • Organizer
      19th Annual International Symposium on Algorithms and Computation
    • Place of Presentation
      オーストラリア・ゴールドコースト
    • Year and Date
      2008-12-15
    • Data Source
      KAKENHI-PROJECT-20700003
  • [Presentation] Partitioning a weighted tree to subtrees of almost uniform size2008

    • Author(s)
      Takehiro Ito, (他3名)
    • Organizer
      19th Annual International Symposium on Algorithms and Computation (ISAAC 2008)
    • Place of Presentation
      オーストラリア・ゴールドコースト
    • Data Source
      KAKENHI-PROJECT-20700003
  • [Presentation] Partitioning a weighted tree to subtrees of almost uniform size2008

    • Author(s)
      T. Ito, T. Uno, X. Zhou and T. Nishizeki
    • Organizer
      Proc. of ISAAC 2008, Lect. Notes in Comp. Sci
    • Place of Presentation
      Springer-verlag(5369, 196-207)
    • Data Source
      KAKENHI-PROJECT-19500002
  • [Presentation] On the complexity of reconfiguration problems2008

    • Author(s)
      Takehiro Ito, (他6名)
    • Organizer
      19th Annual International Symposium on Algorithms and Computation (ISAAC 2008)
    • Place of Presentation
      オーストラリア・ゴールドコースト
    • Data Source
      KAKENHI-PROJECT-20700003
  • [Presentation] Partitioning a weighted tree to subtrees of almost uniform size2008

    • Author(s)
      T. Ito, T. Uno, X. Zhou and T. Nishizeki
    • Organizer
      ISAAC 2008
    • Place of Presentation
      オーストラリア・ゴールドコースト
    • Year and Date
      2008-12-15
    • Data Source
      KAKENHI-PROJECT-19500002
  • [Presentation] Swapping Labeled Tokens on Graphs

    • Author(s)
      Katsuhisa Yamanaka, Erik D. Demaine, Takehiro Ito, Jun Kawahara, Masashi Kiyomi, Yoshio Okamoto, Toshiki Saitoh, Akira Suzuki, Kei Uchizawa, Takeaki Uno
    • Organizer
      7th International Conference on FUN with Algorithms
    • Place of Presentation
      イタリア,シチリア島
    • Data Source
      KAKENHI-PUBLICLY-25106504
  • [Presentation] Swapping Labeled Tokens on Graphs

    • Author(s)
      Katsuhisa Yamanaka, Erik D. Demaine, Takehiro Ito, Jun Kawahara, Masashi Kiyomi, Yoshio Okamoto, Toshiki Saitoh, Akira Suzuki, Kei Uchizawa, Takeaki Uno
    • Organizer
      7th International Conference on FUN with Algorithms
    • Place of Presentation
      イタリア,シチリア島
    • Data Source
      KAKENHI-PROJECT-25330003
  • [Presentation] Complexity of Finding Maximum Regular Induced Subgraphs with Prescribed Degree

    • Author(s)
      Yuichi Asahiro, Hiroshi Eto, Takehiro Ito, Eiji Miyano
    • Organizer
      19th International Symposium on Fundamentals of Computation Theory
    • Place of Presentation
      イギリス,リバプール
    • Data Source
      KAKENHI-PROJECT-25330003
  • [Presentation] On the Parameterized Complexity for Token Jumping on Graphs

    • Author(s)
      Takehiro Ito, Marcin Kaminski, Hirotaka Ono, Akira Suzuki, Ryuhei Uehara, Katsuhisa Yamanaka
    • Organizer
      11th Annual Conference on Theory and Applications of Models of Computation
    • Place of Presentation
      インド,チェンナイ
    • Data Source
      KAKENHI-PUBLICLY-25106504
  • [Presentation] Complexity of Finding Maximum Regular Induced Subgraphs with Prescribed Degree

    • Author(s)
      Yuichi Asahiro, Hiroshi Eto, Takehiro Ito, Eiji Miyano
    • Organizer
      19th International Symposium on Fundamentals of Computation Theory
    • Place of Presentation
      イギリス,リバプール
    • Data Source
      KAKENHI-PUBLICLY-25106504
  • 1.  XIAO Zhou (10272022)
    # of Collaborated Projects: 5 results
    # of Collaborated Products: 25 results
  • 2.  NISHIZEKI Takao (80005545)
    # of Collaborated Projects: 4 results
    # of Collaborated Products: 22 results
  • 3.  川原 純 (20572473)
    # of Collaborated Projects: 3 results
    # of Collaborated Products: 6 results
  • 4.  UCHIZAWA Kei (90510248)
    # of Collaborated Projects: 2 results
    # of Collaborated Products: 1 results
  • 5.  Uehara Ryuhei (00256471)
    # of Collaborated Projects: 2 results
    # of Collaborated Products: 8 results
  • 6.  浅野 泰仁 (20361157)
    # of Collaborated Projects: 2 results
    # of Collaborated Products: 0 results
  • 7.  鈴木 顕 (10723562)
    # of Collaborated Projects: 2 results
    # of Collaborated Products: 23 results
  • 8.  大舘 陽太 (80610196)
    # of Collaborated Projects: 2 results
    # of Collaborated Products: 31 results
  • 9.  小林 靖明 (60735083)
    # of Collaborated Projects: 2 results
    # of Collaborated Products: 41 results
  • 10.  三浦 一之 (80333871)
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 0 results
  • 11.  齋藤 寿樹 (00590390)
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 0 results
  • 12.  山中 克久 (60508836)
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 1 results
  • 13.  吉仲 亮 (80466424)
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 11 results
  • 14.  岡本 吉央 (00402660)
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 4 results
  • 15.  和佐 州洋 (00781337)
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 12 results
  • 16.  山内 由紀子 (10546518)
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 0 results
  • 17.  宋 剛秀 (00625121)
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 0 results
  • 18.  野崎 雄太 (40822648)
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 1 results
  • 19.  湊 真一 (10374612)
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 0 results
  • 20.  番原 睦則 (80290774)
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 0 results
  • 21.  KAKIMURA Naonori
    # of Collaborated Projects: 0 results
    # of Collaborated Products: 3 results
  • 22.  KAMIYAMA Naoyuki
    # of Collaborated Projects: 0 results
    # of Collaborated Products: 1 results
  • 23.  宇野 裕之
    # of Collaborated Projects: 0 results
    # of Collaborated Products: 1 results
  • 24.  斎藤 寿樹
    # of Collaborated Projects: 0 results
    # of Collaborated Products: 11 results
  • 25.  宮野 英次
    # of Collaborated Projects: 0 results
    # of Collaborated Products: 1 results
  • 26.  中野 眞一
    # of Collaborated Projects: 0 results
    # of Collaborated Products: 2 results
  • 27.  小野 廣隆
    # of Collaborated Projects: 0 results
    # of Collaborated Products: 2 results
  • 28.  前澤 俊一
    # of Collaborated Projects: 0 results
    # of Collaborated Products: 1 results
  • 29.  土中 哲秀
    # of Collaborated Projects: 0 results
    # of Collaborated Products: 1 results
  • 30.  小関 健太
    # of Collaborated Projects: 0 results
    # of Collaborated Products: 1 results

URL: 

Are you sure that you want to link your ORCID iD to your KAKEN Researcher profile?
* This action can be performed only by the researcher himself/herself who is listed on the KAKEN Researcher’s page. Are you sure that this KAKEN Researcher’s page is your page?

この研究者とORCID iDの連携を行いますか?
※ この処理は、研究者本人だけが実行できます。

Information User Guide FAQ News Terms of Use Attribution of KAKENHI

Powered by NII kakenhi