Takehiro Ito

ORCID

Publication Activity (10 Years)

Years Active: 1997-2024
Publications (10 Years): 108

Top Venues

Publications

Takehide Soh, Tomoya Tanjo, Yoshio Okamoto, Takehiro Ito
CoRe Challenge 2022/2023: Empirical Evaluations for Independent Set Reconfiguration Problems (Extended Abstract). SOCS (2024)
Hiroki Hatano, Naoki Kitamura, Taisuke Izumi, Takehiro Ito, Toshimitsu Masuzawa
Independent Set Reconfiguration Under Bounded-Hop Token. CoRR (2024)
Takehide Soh, Takumu Watanabe, Jun Kawahara, Akira Suzuki, Takehiro Ito
Scalable Hard Instances for Independent Set Reconfiguration. SEA (2024)
Takehide Soh, Tomoya Tanjo, Yoshio Okamoto, Takehiro Ito
Core Challenge 2023: Solver and Graph Descriptions. CoRR (2023)
Rin Saito, Hiroshi Eto, Takehiro Ito, Ryuhei Uehara
Reconfiguration of Vertex-Disjoint Shortest Paths on Graphs. WALCOM (2023)
Nicolas Bousquet, Takehiro Ito, Yusuke Kobayashi, Haruka Mizuta, Paul Ouvrard, Akira Suzuki, Kunihiro Wasa
Reconfiguration of Spanning Trees with Degree Constraints or Diameter Constraints. Algorithmica 85 (9) (2023)
Takehiro Ito, Yuni Iwamasa, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
Reconfiguration of Colorings in Triangulations of the Sphere. SoCG (2023)
Takehiro Ito, Yuni Iwamasa, Naoyuki Kamiyama, Yasuaki Kobayashi, Yusuke Kobayashi, Shun-ichi Maezawa, Akira Suzuki
Reconfiguration of Time-Respecting Arborescences. CoRR (2023)
Tatsuhiko Hatanaka, Felix Hommelsheim, Takehiro Ito, Yusuke Kobayashi, Moritz Mühlenthaler, Akira Suzuki
Fixed-parameter algorithms for graph constraint logic. Theor. Comput. Sci. 959 (2023)
Takahisa Toda, Takehiro Ito, Jun Kawahara, Takehide Soh, Akira Suzuki, Junichi Teruyama
Solving Reconfiguration Problems of First-Order Expressible Properties of Graph Vertices with Boolean Satisfiability. ICTAI (2023)
Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto
Hardness of Finding Combinatorial Shortest Paths on Graph Associahedra. CoRR (2023)
Takehiro Ito, Jun Kawahara, Shin-ichi Minato, Yota Otachi, Toshiki Saitoh, Akira Suzuki, Ryuhei Uehara, Takeaki Uno, Katsuhisa Yamanaka, Ryo Yoshinaka
Sorting balls and water: Equivalence and computational complexity. Theor. Comput. Sci. 978 (2023)
Takehiro Ito, Yuni Iwamasa, Naoyuki Kamiyama, Yasuaki Kobayashi, Yusuke Kobayashi, Shun-ichi Maezawa, Akira Suzuki
Reconfiguration of Time-Respecting Arborescences. WADS (2023)
Takehiro Ito, Hirotaka Ono, Yota Otachi
Reconfiguration of cliques in a graph. Discret. Appl. Math. 333 (2023)
Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto
Algorithmic Theory of Qubit Routing. WADS (2023)
Hiroshi Eto, Takehiro Ito, Eiji Miyano, Akira Suzuki, Yuma Tamura
Happy Set Problem on Subclasses of Co-comparability Graphs. Algorithmica 85 (11) (2023)
Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto
Hardness of Finding Combinatorial Shortest Paths on Graph Associahedra. ICALP (2023)
Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
On reachable assignments under dichotomous preferences. Theor. Comput. Sci. 979 (2023)
Takehiro Ito, Jun Kawahara, Yu Nakahata, Takehide Soh, Akira Suzuki, Junichi Teruyama, Takahisa Toda
ZDD-Based Algorithmic Framework for Solving Shortest Reconfiguration Problems. CPAIOR (2023)
Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto
Algorithmic Theory of Qubit Routing. CoRR (2023)
Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
Rerouting Planar Curves and Disjoint Paths. ICALP (2023)
Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
Monotone Edge Flips to an Orientation of Maximum Edge-Connectivity à la Nash-Williams. ACM Trans. Algorithms 19 (1) (2023)
Takehiro Ito, Yuni Iwamasa, Yasuaki Kobayashi, Yu Nakahata, Yota Otachi, Kunihiro Wasa
Reconfiguring (non-spanning) arborescences. Theor. Comput. Sci. 943 (2023)
Takehiro Ito, Yuni Iwamasa, Yasuaki Kobayashi, Yu Nakahata, Yota Otachi, Masahiro Takahashi, Kunihiro Wasa
Independent set reconfiguration on directed graphs. CoRR (2022)
Nicolas Bousquet, Takehiro Ito, Yusuke Kobayashi, Haruka Mizuta, Paul Ouvrard, Akira Suzuki, Kunihiro Wasa
Reconfiguration of Spanning Trees with Degree Constraint or Diameter Constraint. CoRR (2022)
Takehiro Ito, Yuni Iwamasa, Yasuaki Kobayashi, Yu Nakahata, Yota Otachi, Masahiro Takahashi, Kunihiro Wasa
Independent Set Reconfiguration on Directed Graphs. MFCS (2022)
Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto
A parameterized view to the robust recoverable base problem of matroids under structural uncertainty. Oper. Res. Lett. 50 (3) (2022)
Takehiro Ito, Jun Kawahara, Shin-ichi Minato, Yota Otachi, Toshiki Saitoh, Akira Suzuki, Ryuhei Uehara, Takeaki Uno, Katsuhisa Yamanaka, Ryo Yoshinaka
Sorting Balls and Water: Equivalence and Computational Complexity. CoRR (2022)
Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
Rerouting Planar Curves and Disjoint Paths. CoRR (2022)
Takehiro Ito, Yuni Iwamasa, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
Reconfiguration of colorings in triangulations of the sphere. CoRR (2022)
Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
Monotone edge flips to an orientation of maximum edge-connectivity à la Nash-Williams. SODA (2022)
Hiroshi Eto, Takehiro Ito, Eiji Miyano, Akira Suzuki, Yuma Tamura
Happy Set Problem on Subclasses of Co-comparability Graphs. WALCOM (2022)
Hiroshi Eto, Takehiro Ito, Zhilong Liu, Eiji Miyano
Approximability of the Distance Independent Set Problem on Regular Graphs and Planar Graphs. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. (9) (2022)
Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto
Shortest Reconfiguration of Perfect Matchings via Alternating Cycles. SIAM J. Discret. Math. 36 (2) (2022)
Nicolas Bousquet, Takehiro Ito, Yusuke Kobayashi, Haruka Mizuta, Paul Ouvrard, Akira Suzuki, Kunihiro Wasa
Reconfiguration of Spanning Trees with Degree Constraint or Diameter Constraint. STACS (2022)
Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
On Reachable Assignments under Dichotomous Preferences. CoRR (2022)
Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
Reforming an Envy-Free Matching. CoRR (2022)
Takehide Soh, Yoshio Okamoto, Takehiro Ito
Core Challenge 2022: Solver and Graph Descriptions. CoRR (2022)
Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
On Reachable Assignments Under Dichotomous Preferences. PRIMA (2022)
Takehiro Ito
Invitation to Combinatorial Reconfiguration. WALCOM (2022)
Takehiro Ito
Invitation to Combinatorial Reconfiguration (Invited Talk). CPM (2022)
Takehiro Ito, Jun Kawahara, Yu Nakahata, Takehide Soh, Akira Suzuki, Junichi Teruyama, Takahisa Toda
ZDD-Based Algorithmic Framework for Solving Shortest Reconfiguration Problems. CoRR (2022)
Tatsuya Gima, Takehiro Ito, Yasuaki Kobayashi, Yota Otachi
Algorithmic Meta-Theorems for Combinatorial Reconfiguration Revisited. ESA (2022)
Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
Reforming an Envy-Free Matching. AAAI (2022)
Hiroshi Eto, Takehiro Ito, Yasuaki Kobayashi, Yota Otachi, Kunihiro Wasa
Reconfiguration of Regular Induced Subgraphs. WALCOM (2022)
Takehiro Ito, Haruka Mizuta, Naomi Nishimura, Akira Suzuki
Incremental optimization of independent sets under the reconfiguration framework. J. Comb. Optim. 43 (5) (2022)
Tatsuya Gima, Takehiro Ito, Yasuaki Kobayashi, Yota Otachi
Algorithmic Meta-Theorems for Combinatorial Reconfiguration Revisited. CoRR (2022)
Takehiro Ito, Jun Kawahara, Shin-ichi Minato, Yota Otachi, Toshiki Saitoh, Akira Suzuki, Ryuhei Uehara, Takeaki Uno, Katsuhisa Yamanaka, Ryo Yoshinaka
Sorting Balls and Water: Equivalence and Computational Complexity. FUN (2022)
Hiroshi Eto, Takehiro Ito, Yasuaki Kobayashi, Yota Otachi, Kunihiro Wasa
Reconfiguration of Regular Induced Subgraphs. CoRR (2021)
Takehiro Ito, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto
Algorithms for gerrymandering over graphs. Theor. Comput. Sci. 868 (2021)
Yuma Tamura, Takehiro Ito, Xiao Zhou
Approximability of the independent feedback vertex set problem for bipartite graphs. Theor. Comput. Sci. 849 (2021)
Takehiro Ito, Yuni Iwamasa, Yasuaki Kobayashi, Yu Nakahata, Yota Otachi, Kunihiro Wasa
Reconfiguring Directed Trees in a Digraph. CoRR (2021)
Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
Monotone edge flips to an orientation of maximum edge-connectivity à la Nash-Williams. CoRR (2021)
Takehiro Ito, Yuni Iwamasa, Yasuaki Kobayashi, Yu Nakahata, Yota Otachi, Kunihiro Wasa
Reconfiguring Directed Trees in a Digraph. COCOON (2021)
Nicolas Bousquet, Takehiro Ito, Yusuke Kobayashi, Haruka Mizuta, Paul Ouvrard, Akira Suzuki, Kunihiro Wasa
Reconfiguration of Spanning Trees with Many or Few Leaves. ESA (2020)
Tatsuhiko Hatanaka, Felix Hommelsheim, Takehiro Ito, Yusuke Kobayashi, Moritz Mühlenthaler, Akira Suzuki
Fixed-Parameter Algorithms for Graph Constraint Logic. IPEC (2020)
Nicolas Bousquet, Takehiro Ito, Yusuke Kobayashi, Haruka Mizuta, Paul Ouvrard, Akira Suzuki, Kunihiro Wasa
Reconfiguration of Spanning Trees with Many or Few Leaves. CoRR (2020)
Takehiro Ito, Naonori Kakimura, Yusuke Kobayashi
Complexity of the multi-service center problem. Theor. Comput. Sci. 842 (2020)
Marthe Bonamy, Marc Heinrich, Takehiro Ito, Yusuke Kobayashi, Haruka Mizuta, Moritz Mühlenthaler, Akira Suzuki, Kunihiro Wasa
Diameter of colorings under Kempe changes. Theor. Comput. Sci. 838 (2020)
Tatsuhiko Hatanaka, Felix Hommelsheim, Takehiro Ito, Yusuke Kobayashi, Moritz Mühlenthaler, Akira Suzuki
Fixed-Parameter Algorithms for Graph Constraint Logic. CoRR (2020)
Marthe Bonamy, Marc Heinrich, Takehiro Ito, Yusuke Kobayashi, Haruka Mizuta, Moritz Mühlenthaler, Akira Suzuki, Kunihiro Wasa
Shortest Reconfiguration of Colorings Under Kempe Changes. STACS (2020)
Tesshu Hanaka, Takehiro Ito, Haruka Mizuta, Benjamin Moore, Naomi Nishimura, Vijay Subramanya, Akira Suzuki, Krishna Vaidyanathan
Reconfiguring spanning and induced subgraphs. Theor. Comput. Sci. 806 (2020)
Yuma Tamura, Takehiro Ito, Xiao Zhou
Approximability of the Independent Feedback Vertex Set Problem for Bipartite Graphs. WALCOM (2020)
Yuma Tamura, Takehiro Ito, Xiao Zhou
Minimization and Parameterized Variants of Vertex Partition Problems on Graphs. ISAAC (2020)
Takehiro Ito, Marcin Jakub Kaminski, Hirotaka Ono, Akira Suzuki, Ryuhei Uehara, Katsuhisa Yamanaka
Parameterized complexity of independent set reconfiguration problems. Discret. Appl. Math. 283 (2020)
Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto
Shortest Reconfiguration of Perfect Matchings via Alternating Cycles. ESA (2019)
Takehiro Ito, Yota Otachi
Reconfiguration of colorable sets in classes of perfect graphs. Theor. Comput. Sci. 772 (2019)
Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto
Minimum-Cost b-Edge Dominating Sets on Trees. Algorithmica 81 (1) (2019)
Marthe Bonamy, Marc Heinrich, Takehiro Ito, Yusuke Kobayashi, Haruka Mizuta, Moritz Mühlenthaler, Akira Suzuki, Kunihiro Wasa
Diameter of Colorings Under Kempe Changes. COCOON (2019)
Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto
Shortest Reconfiguration of Perfect Matchings via Alternating Cycles. CoRR (2019)
Marthe Bonamy, Nicolas Bousquet, Marc Heinrich, Takehiro Ito, Yusuke Kobayashi, Arnaud Mary, Moritz Mühlenthaler, Kunihiro Wasa
The Perfect Matching Reconfiguration Problem. MFCS (2019)
Marthe Bonamy, Nicolas Bousquet, Marc Heinrich, Takehiro Ito, Yusuke Kobayashi, Arnaud Mary, Moritz Mühlenthaler, Kunihiro Wasa
The Perfect Matching Reconfiguration Problem. CoRR (2019)
Nicolas Bousquet, Tatsuhiko Hatanaka, Takehiro Ito, Moritz Mühlenthaler
Shortest Reconfiguration of Matchings. WG (2019)
Haruka Mizuta, Tatsuhiko Hatanaka, Takehiro Ito, Xiao Zhou
Reconfiguration of Minimum Steiner Trees via Vertex Exchanges. MFCS (2019)
Takehiro Ito, Haruka Mizuta, Naomi Nishimura, Akira Suzuki
Incremental Optimization of Independent Sets Under the Reconfiguration Framework. COCOON (2019)
Tatsuhiko Hatanaka, Takehiro Ito, Xiao Zhou
The Coloring Reconfiguration Problem on Specific Graph Classes. IEICE Trans. Inf. Syst. (3) (2019)
Takehiro Ito, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto
Algorithms for Gerrymandering over Graphs. AAMAS (2019)
Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto
Reconfiguration of maximum-weight b-matchings in a graph. J. Comb. Optim. 37 (2) (2019)
Takehiro Ito, Yota Otachi
Reconfiguration of Colorable Sets in Classes of Perfect Graphs. CoRR (2018)
Tatsuhiko Hatanaka, Takehiro Ito, Xiao Zhou
Parameterized complexity of the list coloring reconfiguration problem with graph parameters. Theor. Comput. Sci. 739 (2018)
Hiroki Osawa, Akira Suzuki, Takehiro Ito, Xiao Zhou
Algorithms for Coloring Reconfiguration Under Recolorability Constraints. ISAAC (2018)
Takehiro Ito, Yota Otachi
Reconfiguration of Colorable Sets in Classes of Perfect Graphs. SWAT (2018)
Tatsuhiko Hatanaka, Takehiro Ito, Xiao Zhou
Complexity of Reconfiguration Problems for Constraint Satisfaction. CoRR (2018)
Hiroki Osawa, Akira Suzuki, Takehiro Ito, Xiao Zhou
The Complexity of (List) Edge-Coloring Reconfiguration Problem. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. (1) (2018)
Tesshu Hanaka, Takehiro Ito, Haruka Mizuta, Benjamin Moore, Naomi Nishimura, Vijay Subramanya, Akira Suzuki, Krishna Vaidyanathan
Reconfiguring spanning and induced subgraphs. CoRR (2018)
Takehiro Ito, Haruka Mizuta, Naomi Nishimura, Akira Suzuki
Incremental Optimization of Independent Sets under Reachability Constraints. CoRR (2018)
Nicolas Bousquet, Tatsuhiko Hatanaka, Takehiro Ito, Moritz Mühlenthaler
Shortest Reconfiguration of Matchings. CoRR (2018)
Tesshu Hanaka, Takehiro Ito, Haruka Mizuta, Benjamin Moore, Naomi Nishimura, Vijay Subramanya, Akira Suzuki, Krishna Vaidyanathan
Reconfiguring Spanning and Induced Subgraphs. COCOON (2018)
Tatsuhiko Hatanaka, Takehiro Ito, Xiao Zhou
Parameterized Complexity of the List Coloring Reconfiguration Problem with Graph Parameters. MFCS (2017)
Takashi Horiyama, Takehiro Ito, Keita Nakatsuka, Akira Suzuki, Ryuhei Uehara
Complexity of Tiling a Polygon with Trominoes or Bars. Discret. Comput. Geom. 58 (3) (2017)
Tatsuhiko Hatanaka, Takehiro Ito, Xiao Zhou
Parameterized Complexity of the List Coloring Reconfiguration Problem with Graph Parameters. CoRR (2017)
Hiroki Osawa, Akira Suzuki, Takehiro Ito, Xiao Zhou
Complexity of Coloring Reconfiguration under Recolorability Constraints. ISAAC (2017)
Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto
Reconfiguration of Maximum-Weight b-Matchings in a Graph. COCOON (2017)
Hiroshi Eto, Takehiro Ito, Zhilong Liu, Eiji Miyano
Approximation Algorithm for the Distance-3 Independent Set Problem on Cubic Graphs. WALCOM (2017)
Tatsuhiko Hatanaka, Takehiro Ito, Xiao Zhou
The Coloring Reconfiguration Problem on Specific Graph Classes. COCOA (1) (2017)
Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto
Efficient stabilization of cooperative matching games. Theor. Comput. Sci. 677 (2017)
Takehiro Ito, Naonori Kakimura, Yusuke Kobayashi
Complexity of the Multi-Service Center Problem. ISAAC (2017)
Haruka Mizuta, Takehiro Ito, Xiao Zhou
Reconfiguration of Steiner Trees in an Unweighted Graph. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. (7) (2017)
Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto, Taichi Shiitada
Tight Approximability of the Server Allocation Problem for Real-Time Applications. ALGOCLOUD (2017)
Hiroki Osawa, Akira Suzuki, Takehiro Ito, Xiao Zhou
The Complexity of (List) Edge-Coloring Reconfiguration Problem. WALCOM (2017)

Takehiro Ito.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Takehiro Ito