Takehiro Ito

200 papers A* 5A 8B 48C 10Misc 13Journal 108Unranked 8
YearRankTypeTitle / Venue / Authors
2026 J jnl
Computational Complexity of Swish.
CoRR
Takashi Horiyama, Takehiro Ito, Jun Kawahara, Shin-ichi Minato, Akira Suzuki, Ryuhei Uehara, Yutaro Yamaguchi
2026 J jnl
Hardness of Finding Combinatorial Shortest Paths on Graph Associahedra.
SIAM J. Discret. Math.
Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto
2026 J jnl
Independent Set Reconfiguration on Directed Graphs.
SIAM J. Discret. Math.
Takehiro Ito, Yuni Iwamasa, Yasuaki Kobayashi, Yu Nakahata, Yota Otachi, Masahiro Takahashi, Kunihiro Wasa
2026 J jnl
Independent set reconfiguration under bounded-hop token jumping.
Theor. Comput. Sci.
Hiroki Hatano, Naoki Kitamura, Taisuke Izumi, Takehiro Ito, Toshimitsu Masuzawa
2026 B conf
Parameterized Complexity of Reconfiguring Vertex-Disjoint Shortest Paths.
WALCOM
Rin Saito, Takehiro Ito
2026 J jnl
Reconfiguration of Time-Respecting Arborescences.
Algorithmica
Takehiro Ito, Yuni Iwamasa, Naoyuki Kamiyama, Yasuaki Kobayashi, Yusuke Kobayashi, Shun-ichi Maezawa, Akira Suzuki
2025 J jnl
Algorithmic Theory of Qubit Routing in the Linear Nearest Neighbor Architectures.
ACM Trans. Quantum Comput.
Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto
2025 B conf
Independent Set Reconfiguration Under Bounded-Hop Token Jumping.
WALCOM
Hiroki Hatano, Naoki Kitamura, Taisuke Izumi, Takehiro Ito, Toshimitsu Masuzawa
2025 B conf
Minimum Sum Coloring with Bundles in Trees and Bipartite Graphs.
ISAAC
Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto
2025 J jnl
Minimum Sum Coloring with Bundles in Trees and Bipartite Graphs.
CoRR
Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto
2025 A conf
Multi-Objective Combinatorial Reconfiguration Considering Cost and Length by Answer Set Programming: Algorithms, Encodings, and Empirical Analysis.
ECAI
Kazuki Takada, Mutsunori Banbara, Takehiro Ito, Jun Kawahara, Shin-ichi Minato, Torsten Schaub, Ryuhei Uehara
2025 J jnl
Reconfiguration of colorings in triangulations of the sphere.
J. Comput. Geom.
Takehiro Ito, Yuni Iwamasa, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
2025 J jnl
Reforming an Envy-Free Matching.
Algorithmica
Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
2025 J jnl
Rerouting Planar Curves and Disjoint Paths.
ACM Trans. Algorithms
Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
2024 J jnl
Algorithmic Meta-Theorems for Combinatorial Reconfiguration Revisited.
Algorithmica
Tatsuya Gima, Takehiro Ito, Yasuaki Kobayashi, Yota Otachi
2024 B conf
CoRe Challenge 2022/2023: Empirical Evaluations for Independent Set Reconfiguration Problems (Extended Abstract).
SOCS
Takehide Soh, Tomoya Tanjo, Yoshio Okamoto, Takehiro Ito
2024 J jnl
Independent Set Reconfiguration Under Bounded-Hop Token.
CoRR
Hiroki Hatano, Naoki Kitamura, Taisuke Izumi, Takehiro Ito, Toshimitsu Masuzawa
2024 J jnl
Loss Minimization for Electrical Flows over Spanning Trees on Grids.
CoRR
Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto
2024 J jnl
Reconfiguration of vertex-disjoint shortest paths on graphs.
J. Graph Algorithms Appl.
Rin Saito, Hiroshi Eto, Takehiro Ito, Ryuhei Uehara
2024 B conf
Scalable Hard Instances for Independent Set Reconfiguration.
SEA
Takehide Soh, Takumu Watanabe, Jun Kawahara, Akira Suzuki, Takehiro Ito
2023 B conf
Algorithmic Theory of Qubit Routing.
WADS
Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto
2023 J jnl
Algorithmic Theory of Qubit Routing.
CoRR
Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto
2023 J jnl
Core Challenge 2023: Solver and Graph Descriptions.
CoRR
Takehide Soh, Tomoya Tanjo, Yoshio Okamoto, Takehiro Ito
2023 J jnl
Fixed-parameter algorithms for graph constraint logic.
Theor. Comput. Sci.
Tatsuhiko Hatanaka, Felix Hommelsheim, Takehiro Ito, Yusuke Kobayashi, Moritz Mühlenthaler, Akira Suzuki
2023 J jnl
Happy Set Problem on Subclasses of Co-comparability Graphs.
Algorithmica
Hiroshi Eto, Takehiro Ito, Eiji Miyano, Akira Suzuki, Yuma Tamura
2023 A* conf
Hardness of Finding Combinatorial Shortest Paths on Graph Associahedra.
ICALP
Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto
2023 J jnl
Hardness of Finding Combinatorial Shortest Paths on Graph Associahedra.
CoRR
Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto
2023 J jnl
Monotone Edge Flips to an Orientation of Maximum Edge-Connectivity à la Nash-Williams.
ACM Trans. Algorithms
Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
2023 J jnl
On reachable assignments under dichotomous preferences.
Theor. Comput. Sci.
Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
2023 A* conf
Reconfiguration of Colorings in Triangulations of the Sphere.
SoCG
Takehiro Ito, Yuni Iwamasa, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
2023 J jnl
Reconfiguration of Spanning Trees with Degree Constraints or Diameter Constraints.
Algorithmica
Nicolas Bousquet, Takehiro Ito, Yusuke Kobayashi, Haruka Mizuta, Paul Ouvrard, Akira Suzuki, Kunihiro Wasa
2023 B conf
Reconfiguration of Time-Respecting Arborescences.
WADS
Takehiro Ito, Yuni Iwamasa, Naoyuki Kamiyama, Yasuaki Kobayashi, Yusuke Kobayashi, Shun-ichi Maezawa, Akira Suzuki
2023 J jnl
Reconfiguration of Time-Respecting Arborescences.
CoRR
Takehiro Ito, Yuni Iwamasa, Naoyuki Kamiyama, Yasuaki Kobayashi, Yusuke Kobayashi, Shun-ichi Maezawa, Akira Suzuki
2023 B conf
Reconfiguration of Vertex-Disjoint Shortest Paths on Graphs.
WALCOM
Rin Saito, Hiroshi Eto, Takehiro Ito, Ryuhei Uehara
2023 J jnl
Reconfiguration of cliques in a graph.
Discret. Appl. Math.
Takehiro Ito, Hirotaka Ono, Yota Otachi
2023 J jnl
Reconfiguring (non-spanning) arborescences.
Theor. Comput. Sci.
Takehiro Ito, Yuni Iwamasa, Yasuaki Kobayashi, Yu Nakahata, Yota Otachi, Kunihiro Wasa
2023 A* conf
Rerouting Planar Curves and Disjoint Paths.
ICALP
Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
2023 B conf
Solving Reconfiguration Problems of First-Order Expressible Properties of Graph Vertices with Boolean Satisfiability.
ICTAI
Takahisa Toda, Takehiro Ito, Jun Kawahara, Takehide Soh, Akira Suzuki, Junichi Teruyama
2023 J jnl
Sorting balls and water: Equivalence and computational complexity.
Theor. Comput. Sci.
Takehiro Ito, Jun Kawahara, Shin-ichi Minato, Yota Otachi, Toshiki Saitoh, Akira Suzuki, Ryuhei Uehara, Takeaki Uno, Katsuhisa Yamanaka, Ryo Yoshinaka
2023 B conf
ZDD-Based Algorithmic Framework for Solving Shortest Reconfiguration Problems.
CPAIOR
Takehiro Ito, Jun Kawahara, Yu Nakahata, Takehide Soh, Akira Suzuki, Junichi Teruyama, Takahisa Toda
2022 J jnl
A parameterized view to the robust recoverable base problem of matroids under structural uncertainty.
Oper. Res. Lett.
Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto
2022 A conf
Algorithmic Meta-Theorems for Combinatorial Reconfiguration Revisited.
ESA
Tatsuya Gima, Takehiro Ito, Yasuaki Kobayashi, Yota Otachi
2022 J jnl
Algorithmic Meta-Theorems for Combinatorial Reconfiguration Revisited.
CoRR
Tatsuya Gima, Takehiro Ito, Yasuaki Kobayashi, Yota Otachi
2022 J jnl
Approximability of the Distance Independent Set Problem on Regular Graphs and Planar Graphs.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci.
Hiroshi Eto, Takehiro Ito, Zhilong Liu, Eiji Miyano
2022 J jnl
Core Challenge 2022: Solver and Graph Descriptions.
CoRR
Takehide Soh, Yoshio Okamoto, Takehiro Ito
2022 B conf
Happy Set Problem on Subclasses of Co-comparability Graphs.
WALCOM
Hiroshi Eto, Takehiro Ito, Eiji Miyano, Akira Suzuki, Yuma Tamura
2022 J jnl
Incremental optimization of independent sets under the reconfiguration framework.
J. Comb. Optim.
Takehiro Ito, Haruka Mizuta, Naomi Nishimura, Akira Suzuki
2022 B conf
Independent Set Reconfiguration on Directed Graphs.
MFCS
Takehiro Ito, Yuni Iwamasa, Yasuaki Kobayashi, Yu Nakahata, Yota Otachi, Masahiro Takahashi, Kunihiro Wasa
2022 J jnl
Independent set reconfiguration on directed graphs.
CoRR
Takehiro Ito, Yuni Iwamasa, Yasuaki Kobayashi, Yu Nakahata, Yota Otachi, Masahiro Takahashi, Kunihiro Wasa
2022 B conf
Invitation to Combinatorial Reconfiguration (Invited Talk).
CPM
Takehiro Ito
2022 B conf
Invitation to Combinatorial Reconfiguration.
WALCOM
Takehiro Ito
2022 A* conf
Monotone edge flips to an orientation of maximum edge-connectivity à la Nash-Williams.
SODA
Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
2022 B conf
On Reachable Assignments Under Dichotomous Preferences.
PRIMA
Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
2022 J jnl
On Reachable Assignments under Dichotomous Preferences.
CoRR
Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
2022 B conf
Reconfiguration of Regular Induced Subgraphs.
WALCOM
Hiroshi Eto, Takehiro Ito, Yasuaki Kobayashi, Yota Otachi, Kunihiro Wasa
2022 A conf
Reconfiguration of Spanning Trees with Degree Constraint or Diameter Constraint.
STACS
Nicolas Bousquet, Takehiro Ito, Yusuke Kobayashi, Haruka Mizuta, Paul Ouvrard, Akira Suzuki, Kunihiro Wasa
2022 J jnl
Reconfiguration of Spanning Trees with Degree Constraint or Diameter Constraint.
CoRR
Nicolas Bousquet, Takehiro Ito, Yusuke Kobayashi, Haruka Mizuta, Paul Ouvrard, Akira Suzuki, Kunihiro Wasa
2022 J jnl
Reconfiguration of colorings in triangulations of the sphere.
CoRR
Takehiro Ito, Yuni Iwamasa, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
2022 A* conf
Reforming an Envy-Free Matching.
AAAI
Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
2022 J jnl
Reforming an Envy-Free Matching.
CoRR
Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
2022 J jnl
Rerouting Planar Curves and Disjoint Paths.
CoRR
Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
2022 J jnl
Shortest Reconfiguration of Perfect Matchings via Alternating Cycles.
SIAM J. Discret. Math.
Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto
2022 Misc conf
Sorting Balls and Water: Equivalence and Computational Complexity.
FUN
Takehiro Ito, Jun Kawahara, Shin-ichi Minato, Yota Otachi, Toshiki Saitoh, Akira Suzuki, Ryuhei Uehara, Takeaki Uno, Katsuhisa Yamanaka, Ryo Yoshinaka
2022 J jnl
Sorting Balls and Water: Equivalence and Computational Complexity.
CoRR
Takehiro Ito, Jun Kawahara, Shin-ichi Minato, Yota Otachi, Toshiki Saitoh, Akira Suzuki, Ryuhei Uehara, Takeaki Uno, Katsuhisa Yamanaka, Ryo Yoshinaka
2022 J jnl
ZDD-Based Algorithmic Framework for Solving Shortest Reconfiguration Problems.
CoRR
Takehiro Ito, Jun Kawahara, Yu Nakahata, Takehide Soh, Akira Suzuki, Junichi Teruyama, Takahisa Toda
2021 J jnl
Algorithms for gerrymandering over graphs.
Theor. Comput. Sci.
Takehiro Ito, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto
2021 J jnl
Approximability of the independent feedback vertex set problem for bipartite graphs.
Theor. Comput. Sci.
Yuma Tamura, Takehiro Ito, Xiao Zhou
2021 J jnl
Monotone edge flips to an orientation of maximum edge-connectivity à la Nash-Williams.
CoRR
Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
2021 J jnl
Reconfiguration of Regular Induced Subgraphs.
CoRR
Hiroshi Eto, Takehiro Ito, Yasuaki Kobayashi, Yota Otachi, Kunihiro Wasa
2021 Misc conf
Reconfiguring Directed Trees in a Digraph.
COCOON
Takehiro Ito, Yuni Iwamasa, Yasuaki Kobayashi, Yu Nakahata, Yota Otachi, Kunihiro Wasa
2021 J jnl
Reconfiguring Directed Trees in a Digraph.
CoRR
Takehiro Ito, Yuni Iwamasa, Yasuaki Kobayashi, Yu Nakahata, Yota Otachi, Kunihiro Wasa
2020 B conf
Approximability of the Independent Feedback Vertex Set Problem for Bipartite Graphs.
WALCOM
Yuma Tamura, Takehiro Ito, Xiao Zhou
2020 J jnl
Complexity of the multi-service center problem.
Theor. Comput. Sci.
Takehiro Ito, Naonori Kakimura, Yusuke Kobayashi
2020 J jnl
Diameter of colorings under Kempe changes.
Theor. Comput. Sci.
Marthe Bonamy, Marc Heinrich, Takehiro Ito, Yusuke Kobayashi, Haruka Mizuta, Moritz Mühlenthaler, Akira Suzuki, Kunihiro Wasa
2020 B conf
Fixed-Parameter Algorithms for Graph Constraint Logic.
IPEC
Tatsuhiko Hatanaka, Felix Hommelsheim, Takehiro Ito, Yusuke Kobayashi, Moritz Mühlenthaler, Akira Suzuki
2020 J jnl
Fixed-Parameter Algorithms for Graph Constraint Logic.
CoRR
Tatsuhiko Hatanaka, Felix Hommelsheim, Takehiro Ito, Yusuke Kobayashi, Moritz Mühlenthaler, Akira Suzuki
2020 B conf
Minimization and Parameterized Variants of Vertex Partition Problems on Graphs.
ISAAC
Yuma Tamura, Takehiro Ito, Xiao Zhou
2020 J jnl
Parameterized complexity of independent set reconfiguration problems.
Discret. Appl. Math.
Takehiro Ito, Marcin Jakub Kaminski, Hirotaka Ono, Akira Suzuki, Ryuhei Uehara, Katsuhisa Yamanaka
2020 A conf
Reconfiguration of Spanning Trees with Many or Few Leaves.
ESA
Nicolas Bousquet, Takehiro Ito, Yusuke Kobayashi, Haruka Mizuta, Paul Ouvrard, Akira Suzuki, Kunihiro Wasa
2020 J jnl
Reconfiguration of Spanning Trees with Many or Few Leaves.
CoRR
Nicolas Bousquet, Takehiro Ito, Yusuke Kobayashi, Haruka Mizuta, Paul Ouvrard, Akira Suzuki, Kunihiro Wasa
2020 J jnl
Reconfiguring spanning and induced subgraphs.
Theor. Comput. Sci.
Tesshu Hanaka, Takehiro Ito, Haruka Mizuta, Benjamin R. Moore, Naomi Nishimura, Vijay Subramanya, Akira Suzuki, Krishna Vaidyanathan
2020 A conf
Shortest Reconfiguration of Colorings Under Kempe Changes.
STACS
Marthe Bonamy, Marc Heinrich, Takehiro Ito, Yusuke Kobayashi, Haruka Mizuta, Moritz Mühlenthaler, Akira Suzuki, Kunihiro Wasa
2019 A conf
Algorithms for Gerrymandering over Graphs.
AAMAS
Takehiro Ito, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto
2019 Misc conf
Diameter of Colorings Under Kempe Changes.
COCOON
Marthe Bonamy, Marc Heinrich, Takehiro Ito, Yusuke Kobayashi, Haruka Mizuta, Moritz Mühlenthaler, Akira Suzuki, Kunihiro Wasa
2019 Misc conf
Incremental Optimization of Independent Sets Under the Reconfiguration Framework.
COCOON
Takehiro Ito, Haruka Mizuta, Naomi Nishimura, Akira Suzuki
2019 J jnl
Minimum-Cost b-Edge Dominating Sets on Trees.
Algorithmica
Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto
2019 B conf
Reconfiguration of Minimum Steiner Trees via Vertex Exchanges.
MFCS
Haruka Mizuta, Tatsuhiko Hatanaka, Takehiro Ito, Xiao Zhou
2019 J jnl
Reconfiguration of colorable sets in classes of perfect graphs.
Theor. Comput. Sci.
Takehiro Ito, Yota Otachi
2019 J jnl
Reconfiguration of maximum-weight b-matchings in a graph.
J. Comb. Optim.
Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto
2019 B conf
Shortest Reconfiguration of Matchings.
WG
Nicolas Bousquet, Tatsuhiko Hatanaka, Takehiro Ito, Moritz Mühlenthaler
2019 A conf
Shortest Reconfiguration of Perfect Matchings via Alternating Cycles.
ESA
Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto
2019 J jnl
Shortest Reconfiguration of Perfect Matchings via Alternating Cycles.
CoRR
Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto
2019 J jnl
The Coloring Reconfiguration Problem on Specific Graph Classes.
IEICE Trans. Inf. Syst.
Tatsuhiko Hatanaka, Takehiro Ito, Xiao Zhou
2019 B conf
The Perfect Matching Reconfiguration Problem.
MFCS
Marthe Bonamy, Nicolas Bousquet, Marc Heinrich, Takehiro Ito, Yusuke Kobayashi, Arnaud Mary, Moritz Mühlenthaler, Kunihiro Wasa
2019 J jnl
The Perfect Matching Reconfiguration Problem.
CoRR
Marthe Bonamy, Nicolas Bousquet, Marc Heinrich, Takehiro Ito, Yusuke Kobayashi, Arnaud Mary, Moritz Mühlenthaler, Kunihiro Wasa
2018 B conf
Algorithms for Coloring Reconfiguration Under Recolorability Constraints.
ISAAC
Hiroki Osawa, Akira Suzuki, Takehiro Ito, Xiao Zhou
2018 J jnl
Complexity of Reconfiguration Problems for Constraint Satisfaction.
CoRR
Tatsuhiko Hatanaka, Takehiro Ito, Xiao Zhou
2018 J jnl
Incremental Optimization of Independent Sets under Reachability Constraints.
CoRR
Takehiro Ito, Haruka Mizuta, Naomi Nishimura, Akira Suzuki
2018 J jnl
Parameterized complexity of the list coloring reconfiguration problem with graph parameters.
Theor. Comput. Sci.
Tatsuhiko Hatanaka, Takehiro Ito, Xiao Zhou
2018 — conf
Reconfiguration of Colorable Sets in Classes of Perfect Graphs.
SWAT
Takehiro Ito, Yota Otachi
2018 J jnl
Reconfiguration of Colorable Sets in Classes of Perfect Graphs.
CoRR
Takehiro Ito, Yota Otachi
2018 Misc conf
Reconfiguring Spanning and Induced Subgraphs.
COCOON
Tesshu Hanaka, Takehiro Ito, Haruka Mizuta, Benjamin R. Moore, Naomi Nishimura, Vijay Subramanya, Akira Suzuki, Krishna Vaidyanathan
2018 J jnl
Reconfiguring spanning and induced subgraphs.
CoRR
Tesshu Hanaka, Takehiro Ito, Haruka Mizuta, Benjamin R. Moore, Naomi Nishimura, Vijay Subramanya, Akira Suzuki, Krishna Vaidyanathan
2018 J jnl
Shortest Reconfiguration of Matchings.
CoRR
Nicolas Bousquet, Tatsuhiko Hatanaka, Takehiro Ito, Moritz Mühlenthaler
2018 J jnl
The Complexity of (List) Edge-Coloring Reconfiguration Problem.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci.
Hiroki Osawa, Akira Suzuki, Takehiro Ito, Xiao Zhou
2017 B conf
Approximation Algorithm for the Distance-3 Independent Set Problem on Cubic Graphs.
WALCOM
Hiroshi Eto, Takehiro Ito, Zhilong Liu, Eiji Miyano
2017 B conf
Complexity of Coloring Reconfiguration under Recolorability Constraints.
ISAAC
Hiroki Osawa, Akira Suzuki, Takehiro Ito, Xiao Zhou
2017 J jnl
Complexity of Tiling a Polygon with Trominoes or Bars.
Discret. Comput. Geom.
Takashi Horiyama, Takehiro Ito, Keita Nakatsuka, Akira Suzuki, Ryuhei Uehara
2017 B conf
Complexity of the Multi-Service Center Problem.
ISAAC
Takehiro Ito, Naonori Kakimura, Yusuke Kobayashi
2017 J jnl
Efficient stabilization of cooperative matching games.
Theor. Comput. Sci.
Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto
2017 B conf
Parameterized Complexity of the List Coloring Reconfiguration Problem with Graph Parameters.
MFCS
Tatsuhiko Hatanaka, Takehiro Ito, Xiao Zhou
2017 J jnl
Parameterized Complexity of the List Coloring Reconfiguration Problem with Graph Parameters.
CoRR
Tatsuhiko Hatanaka, Takehiro Ito, Xiao Zhou
2017 Misc conf
Reconfiguration of Maximum-Weight b-Matchings in a Graph.
COCOON
Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto
2017 J jnl
Reconfiguration of Steiner Trees in an Unweighted Graph.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci.
Haruka Mizuta, Takehiro Ito, Xiao Zhou
2017 — conf
The Coloring Reconfiguration Problem on Specific Graph Classes.
COCOA (1)
Tatsuhiko Hatanaka, Takehiro Ito, Xiao Zhou
2017 B conf
The Complexity of (List) Edge-Coloring Reconfiguration Problem.
WALCOM
Hiroki Osawa, Akira Suzuki, Takehiro Ito, Xiao Zhou
2017 — conf
Tight Approximability of the Server Allocation Problem for Real-Time Applications.
ALGOCLOUD
Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto, Taichi Shiitada
2016 J jnl
A polynomial-time approximation scheme for the geometric unique coverage problem on unit squares.
Comput. Geom.
Takehiro Ito, Shin-Ichi Nakano, Yoshio Okamoto, Yota Otachi, Ryuhei Uehara, Takeaki Uno, Yushi Uno
2016 C conf
Approximability of the Distance Independent Set Problem on Regular Graphs and Planar Graphs.
COCOA
Hiroshi Eto, Takehiro Ito, Zhilong Liu, Eiji Miyano
2016 A conf
Efficient Stabilization of Cooperative Matching Games.
AAMAS
Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto
2016 C conf
Reconfiguration of Steiner Trees in an Unweighted Graph.
IWOCA
Haruka Mizuta, Takehiro Ito, Xiao Zhou
2016 J jnl
Reconfiguration of Vertex Covers in a Graph.
IEICE Trans. Inf. Syst.
Takehiro Ito, Hiroyuki Nooka, Xiao Zhou
2016 J jnl
The Complexity of (List) Edge-Coloring Reconfiguration Problem.
CoRR
Hiroki Osawa, Akira Suzuki, Takehiro Ito, Xiao Zhou
2016 J jnl
The complexity of dominating set reconfiguration.
Theor. Comput. Sci.
Arash Haddadan, Takehiro Ito, Amer E. Mouawad, Naomi Nishimura, Hirotaka Ono, Akira Suzuki, Youcef Tebbal
2016 J jnl
The minimum vulnerability problem on specific graph classes.
J. Comb. Optim.
Yusuke Aoki, Bjarni V. Halldórsson, Magnús M. Halldórsson, Takehiro Ito, Christian Konrad, Xiao Zhou
2015 J jnl
Algorithms for the Independent Feedback Vertex Set Problem.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci.
Yuma Tamura, Takehiro Ito, Xiao Zhou
2015 B conf
Competitive Diffusion on Weighted Graphs.
WADS
Takehiro Ito, Yota Otachi, Toshiki Saitoh, Hisayuki Satoh, Akira Suzuki, Kei Uchizawa, Ryuhei Uehara, Katsuhisa Yamanaka, Xiao Zhou
2015 J jnl
Linear-time algorithm for sliding tokens on trees.
Theor. Comput. Sci.
Erik D. Demaine, Martin L. Demaine, Eli Fox-Epstein, Duc A. Hoang, Takehiro Ito, Hirotaka Ono, Yota Otachi, Ryuhei Uehara, Takeshi Yamada
2015 C conf
Reconfiguration of Cliques in a Graph.
TAMC
Takehiro Ito, Hirotaka Ono, Yota Otachi
2015 J jnl
Swapping labeled tokens on graphs.
Theor. Comput. Sci.
Katsuhisa Yamanaka, Erik D. Demaine, Takehiro Ito, Jun Kawahara, Masashi Kiyomi, Yoshio Okamoto, Toshiki Saitoh, Akira Suzuki, Kei Uchizawa, Takeaki Uno
2015 B conf
The Complexity of Dominating Set Reconfiguration.
WADS
Arash Haddadan, Takehiro Ito, Amer E. Mouawad, Naomi Nishimura, Hirotaka Ono, Akira Suzuki, Youcef Tebbal
2015 J jnl
The List Coloring Reconfiguration Problem for Bounded Pathwidth Graphs.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci.
Tatsuhiko Hatanaka, Takehiro Ito, Xiao Zhou
2015 J jnl
The complexity of dominating set reconfiguration.
CoRR
Arash Haddadan, Takehiro Ito, Amer E. Mouawad, Naomi Nishimura, Hirotaka Ono, Akira Suzuki, Youcef Tebbal
2014 J jnl
A 4.31-approximation for the geometric unique coverage problem on unit disks.
Theor. Comput. Sci.
Takehiro Ito, Shin-Ichi Nakano, Yoshio Okamoto, Yota Otachi, Ryuhei Uehara, Takeaki Uno, Yushi Uno
2014 J jnl
Approximability of the subset sum reconfiguration problem.
J. Comb. Optim.
Takehiro Ito, Erik D. Demaine
2014 J jnl
Base-object location problems for base-monotone regions.
Theor. Comput. Sci.
Jinhee Chun, Takashi Horiyama, Takehiro Ito, Natsuda Kaothanthong, Hirotaka Ono, Yota Otachi, Takeshi Tokuyama, Ryuhei Uehara, Takeaki Uno
2014 J jnl
Complexity of finding maximum regular induced subgraphs with prescribed degree.
Theor. Comput. Sci.
Yuichi Asahiro, Hiroshi Eto, Takehiro Ito, Eiji Miyano
2014 J jnl
Computational Complexity of Competitive Diffusion on (Un)weighted Graphs.
CoRR
Takehiro Ito, Yota Otachi, Toshiki Saitoh, Hisayuki Satoh, Akira Suzuki, Kei Uchizawa, Ryuhei Uehara, Katsuhisa Yamanaka, Xiao Zhou
2014 C conf
Deterministic Algorithms for the Independent Feedback Vertex Set Problem.
IWOCA
Yuma Tamura, Takehiro Ito, Xiao Zhou
2014 B conf
Fixed-Parameter Tractability of Token Jumping on Planar Graphs.
ISAAC
Takehiro Ito, Marcin Jakub Kaminski, Hirotaka Ono
2014 J jnl
Fixed-Parameter Tractability of Token Jumping on Planar Graphs.
CoRR
Takehiro Ito, Marcin Kaminski, Hirotaka Ono
2014 J jnl
Generalized rainbow connectivity of graphs.
Theor. Comput. Sci.
Kei Uchizawa, Takanori Aoki, Takehiro Ito, Xiao Zhou
2014 B conf
Minimum-Cost b -Edge Dominating Sets on Trees.
ISAAC
Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto
2014 J jnl
On the Minimum Caterpillar Problem in Digraphs.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci.
Taku Okada, Akira Suzuki, Takehiro Ito, Xiao Zhou
2014 C conf
On the Parameterized Complexity for Token Jumping on Graphs.
TAMC
Takehiro Ito, Marcin Kaminski, Hirotaka Ono, Akira Suzuki, Ryuhei Uehara, Katsuhisa Yamanaka
2014 B conf
Polynomial-Time Algorithm for Sliding Tokens on Trees.
ISAAC
Erik D. Demaine, Martin L. Demaine, Eli Fox-Epstein, Duc A. Hoang, Takehiro Ito, Hirotaka Ono, Yota Otachi, Ryuhei Uehara, Takeshi Yamada
2014 J jnl
Polynomial-Time Algorithm for Sliding Tokens on Trees.
CoRR
Erik D. Demaine, Martin L. Demaine, Eli Fox-Epstein, Duc A. Hoang, Takehiro Ito, Hirotaka Ono, Yota Otachi, Ryuhei Uehara, Takeshi Yamada
2014 J jnl
Reconfiguration of Cliques in a Graph.
CoRR
Takehiro Ito, Hirotaka Ono, Yota Otachi
2014 C conf
Reconfiguration of Vertex Covers in a Graph.
IWOCA
Takehiro Ito, Hiroyuki Nooka, Xiao Zhou
2014 J jnl
Reconfiguration of list L(2,1)-labelings in a graph.
Theor. Comput. Sci.
Takehiro Ito, Kazuto Kawamura, Hirotaka Ono, Xiao Zhou
2014 Misc conf
Swapping Labeled Tokens on Graphs.
FUN
Katsuhisa Yamanaka, Erik D. Demaine, Takehiro Ito, Jun Kawahara, Masashi Kiyomi, Yoshio Okamoto, Toshiki Saitoh, Akira Suzuki, Kei Uchizawa, Takeaki Uno
2014 C conf
The List Coloring Reconfiguration Problem for Bounded Pathwidth Graphs.
COCOA
Tatsuhiko Hatanaka, Takehiro Ito, Xiao Zhou
2014 J jnl
The List Coloring Reconfiguration Problem for Bounded Pathwidth Graphs.
CoRR
Tatsuhiko Hatanaka, Takehiro Ito, Xiao Zhou
2014 C conf
The Minimum Vulnerability Problem on Graphs.
COCOA
Yusuke Aoki, Bjarni V. Halldórsson, Magnús M. Halldórsson, Takehiro Ito, Christian Konrad, Xiao Zhou
2013 B conf
Base Location Problems for Base-Monotone Regions.
WALCOM
Jinhee Chun, Takashi Horiyama, Takehiro Ito, Natsuda Kaothanthong, Hirotaka Ono, Yota Otachi, Takeshi Tokuyama, Ryuhei Uehara, Takeaki Uno
2013 B conf
Complexity of Finding Maximum Regular Induced Subgraphs with Prescribed Degree.
FCT
Yuichi Asahiro, Hiroshi Eto, Takehiro Ito, Eiji Miyano
2013 B conf
Generalized Rainbow Connectivity of Graphs.
WALCOM
Kei Uchizawa, Takanori Aoki, Takehiro Ito, Xiao Zhou
2013 Misc conf
On the Minimum Caterpillar Problem in Digraphs.
COCOON
Taku Okada, Akira Suzuki, Takehiro Ito, Xiao Zhou
2013 J jnl
On the Rainbow Connectivity of Graphs: Complexity and FPT Algorithms.
Algorithmica
Kei Uchizawa, Takanori Aoki, Takehiro Ito, Akira Suzuki, Xiao Zhou
2013 J jnl
Route-Enabling Graph Orientation Problems.
Algorithmica
Takehiro Ito, Yuichiro Miyamoto, Hirotaka Ono, Hisao Tamaki, Ryuhei Uehara
2012 B conf
A 4.31-Approximation for the Geometric Unique Coverage Problem on Unit Disks.
ISAAC
Takehiro Ito, Shin-Ichi Nakano, Yoshio Okamoto, Yota Otachi, Ryuhei Uehara, Takeaki Uno, Yushi Uno
2012 — conf
A Polynomial-Time Approximation Scheme for the Geometric Unique Coverage Problem on Unit Squares.
SWAT
Takehiro Ito, Shin-Ichi Nakano, Yoshio Okamoto, Yota Otachi, Ryuhei Uehara, Takeaki Uno, Yushi Uno
2012 J jnl
An Improved Sufficient Condition for Reconfiguration of List Edge-Colorings in a Tree.
IEICE Trans. Inf. Syst.
Takehiro Ito, Kazuto Kawamura, Xiao Zhou
2012 J jnl
Minimum Cost Partitions of Trees with Supply and Demand.
Algorithmica
Takehiro Ito, Takuya Hara, Xiao Zhou, Takao Nishizeki
2012 — conf
Packing Trominoes is NP-Complete, #P-Complete and ASP-Complete.
CCCG
Takashi Horiyama, Takehiro Ito, Keita Nakatsuka, Akira Suzuki, Ryuhei Uehara
2012 J jnl
Partitioning a Weighted Tree into Subtrees with Weights in a Given Range.
Algorithmica
Takehiro Ito, Takao Nishizeki, Michael Schröder, Takeaki Uno, Xiao Zhou
2012 B conf
Reconfiguration of List L(2, 1)-Labelings in a Graph.
ISAAC
Takehiro Ito, Kazuto Kawamura, Hirotaka Ono, Xiao Zhou
2012 J jnl
Reconfiguration of list edge-colorings in a graph.
Discret. Appl. Math.
Takehiro Ito, Marcin Kaminski, Erik D. Demaine
2011 C conf
An Improved Sufficient Condition for Reconfiguration of List Edge-Colorings in a Tree.
TAMC
Takehiro Ito, Kazuto Kawamura, Xiao Zhou
2011 C conf
Approximability of the Subset Sum Reconfiguration Problem.
TAMC
Takehiro Ito, Erik D. Demaine
2011 J jnl
Laser Interferometric Measuring Method of Involute Artifact and Stabilization of Measurement.
Int. J. Autom. Technol.
Masaharu Komori, Fumi Takeoka, Aizoh Kubo, Hiroshige Fujio, Takehiro Ito, Sonko Osawa, Osamu Sato, Toshiyuki Takatsuji
2011 J jnl
Minimum Cost Edge-Colorings of Trees Can Be Reduced to Matchings.
IEICE Trans. Inf. Syst.
Takehiro Ito, Naoki Sakamoto, Xiao Zhou, Takao Nishizeki
2011 J jnl
On disconnected cuts and separators.
Discret. Appl. Math.
Takehiro Ito, Marcin Kaminski, Daniël Paulusma, Dimitrios M. Thilikos
2011 Misc conf
On the Rainbow Connectivity of Graphs: Complexity and FPT Algorithms.
COCOON
Kei Uchizawa, Takanori Aoki, Takehiro Ito, Akira Suzuki, Xiao Zhou
2011 J jnl
On the complexity of reconfiguration problems.
Theor. Comput. Sci.
Takehiro Ito, Erik D. Demaine, Nicholas J. A. Harvey, Christos H. Papadimitriou, Martha Sideri, Ryuhei Uehara, Yushi Uno
2011 J jnl
Parameterizing cut sets in a graph by the number of their components.
Theor. Comput. Sci.
Takehiro Ito, Marcin Kaminski, Daniël Paulusma, Dimitrios M. Thilikos
2010 Misc conf
Minimum Cost Edge-Colorings of Trees Can Be Reduced to Matchings.
FAW
Takehiro Ito, Naoki Sakamoto, Xiao Zhou, Takao Nishizeki
2010 — conf
Minimum Cost Partitions of Trees with Supply and Demand.
ISAAC (2)
Takehiro Ito, Takuya Hara, Xiao Zhou, Takao Nishizeki
2009 J jnl
A Characterization of Graphs with Fractional Total Chromatic Number Equal to Delta+2.
Electron. Notes Discret. Math.
Takehiro Ito, W. Sean Kennedy, Bruce A. Reed
2009 B conf
Parameterizing Cut Sets in a Graph by the Number of Their Components.
ISAAC
Takehiro Ito, Marcin Kaminski, Daniël Paulusma, Dimitrios M. Thilikos
2009 J jnl
Partitioning graphs of supply and demand.
Discret. Appl. Math.
Takehiro Ito, Xiao Zhou, Takao Nishizeki
2009 B conf
Reconfiguration of List Edge-Colorings in a Graph.
WADS
Takehiro Ito, Marcin Kaminski, Erik D. Demaine
2009 B conf
Route-Enabling Graph Orientation Problems.
ISAAC
Takehiro Ito, Yuichiro Miyamoto, Hirotaka Ono, Hisao Tamaki, Ryuhei Uehara
2008 J jnl
Approximability of partitioning graphs with supply and demand.
J. Discrete Algorithms
Takehiro Ito, Erik D. Demaine, Xiao Zhou, Takao Nishizeki
2008 B conf
On the Complexity of Reconfiguration Problems.
ISAAC
Takehiro Ito, Erik D. Demaine, Nicholas J. A. Harvey, Christos H. Papadimitriou, Martha Sideri, Ryuhei Uehara, Yushi Uno
2008 B conf
Partitioning a Weighted Tree to Subtrees of Almost Uniform Size.
ISAAC
Takehiro Ito, Takeaki Uno, Xiao Zhou, Takao Nishizeki
2007 J jnl
Algorithms for finding distance-edge-colorings of graphs.
J. Discrete Algorithms
Takehiro Ito, Akira Kato, Xiao Zhou, Takao Nishizeki
2007 B conf
Partitioning Graphs of Supply and Demand.
WALCOM
Takehiro Ito
2007 J jnl
Partitioning a Multi-Weighted Graph to Connected Subgraphs of Almost Uniform Size.
IEICE Trans. Inf. Syst.
Takehiro Ito, Kazuya Goto, Xiao Zhou, Takao Nishizeki
2006 B conf
Approximability of Partitioning Graphs with Supply and Demand.
ISAAC
Takehiro Ito, Erik D. Demaine, Xiao Zhou, Takao Nishizeki
2006 Misc conf
Partitioning a Multi-weighted Graph to Connected Subgraphs of Almost Uniform Size.
COCOON
Takehiro Ito, Kazuya Goto, Xiao Zhou, Takao Nishizeki
2006 J jnl
Partitioning a graph of bounded tree-width to connected subgraphs of almost uniform size.
J. Discrete Algorithms
Takehiro Ito, Xiao Zhou, Takao Nishizeki
2005 Misc conf
Algorithms for Finding Distance-Edge-Colorings of Graphs.
COCOON
Takehiro Ito, Akira Kato, Xiao Zhou, Takao Nishizeki
2005 — conf
Partitioning graphs of supply and demand.
ISCAS (1)
Takehiro Ito, Xiao Zhou, Takao Nishizeki
2005 J jnl
Partitioning trees of supply and demand.
Int. J. Found. Comput. Sci.
Takehiro Ito, Xiao Zhou, Takao Nishizeki
2004 B conf
Implementation of the Extended Euclidean Algorithm for the Tate Pairing on FPGA.
FPL
Takehiro Ito, Yuichiro Shibata, Kiyoshi Oguri
2004 B conf
Partitioning a Weighted Graph to Connected Subgraphs of Almost Uniform Size.
WG
Takehiro Ito, Xiao Zhou, Takao Nishizeki
2002 Misc conf
Algorithms for the Multicolorings of Partial k-Trees.
COCOON
Takehiro Ito, Takao Nishizeki, Xiao Zhou
2002 B conf
Partitioning Trees of Supply and Demand.
ISAAC
Takehiro Ito, Xiao Zhou, Takao Nishizeki
1997 — conf
On fault injection approaches for fault tolerance of feedforward neural networks.
Asian Test Symposium
Takehiro Ito, Itsuo Takanami