default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTakehiro Ito
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j62]Tatsuya Gima, Takehiro Ito, Yasuaki Kobayashi, Yota Otachi:
Algorithmic Meta-Theorems for Combinatorial Reconfiguration Revisited. Algorithmica 86(11): 3395-3424 (2024)- [j61]Rin Saito, Hiroshi Eto, Takehiro Ito, Ryuhei Uehara:
Reconfiguration of vertex-disjoint shortest paths on graphs. J. Graph Algorithms Appl. 28(3): 87-101 (2024) - [c88]Takehide Soh, Tomoya Tanjo, Yoshio Okamoto, Takehiro Ito:
CoRe Challenge 2022/2023: Empirical Evaluations for Independent Set Reconfiguration Problems (Extended Abstract). SOCS 2024: 285-286 - [c87]Takehide Soh, Takumu Watanabe, Jun Kawahara, Akira Suzuki, Takehiro Ito:
Scalable Hard Instances for Independent Set Reconfiguration. SEA 2024: 26:1-26:15 - [i35]Hiroki Hatano, Naoki Kitamura, Taisuke Izumi, Takehiro Ito, Toshimitsu Masuzawa:
Independent Set Reconfiguration Under Bounded-Hop Token. CoRR abs/2407.11768 (2024) - 2023
- [j60]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): 2779-2816 (2023) - [j59]Hiroshi Eto, Takehiro Ito, Eiji Miyano, Akira Suzuki, Yuma Tamura:
Happy Set Problem on Subclasses of Co-comparability Graphs. Algorithmica 85(11): 3327-3347 (2023) - [j58]Takehiro Ito, Hirotaka Ono, Yota Otachi:
Reconfiguration of cliques in a graph. Discret. Appl. Math. 333: 43-58 (2023) - [j57]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): 6:1-6:22 (2023) - [j56]Takehiro Ito, Yuni Iwamasa, Yasuaki Kobayashi, Yu Nakahata, Yota Otachi, Kunihiro Wasa:
Reconfiguring (non-spanning) arborescences. Theor. Comput. Sci. 943: 131-141 (2023) - [j55]Tatsuhiko Hatanaka, Felix Hommelsheim, Takehiro Ito, Yusuke Kobayashi, Moritz Mühlenthaler, Akira Suzuki:
Fixed-parameter algorithms for graph constraint logic. Theor. Comput. Sci. 959: 113863 (2023) - [j54]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: 114158 (2023) - [j53]Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki:
On reachable assignments under dichotomous preferences. Theor. Comput. Sci. 979: 114196 (2023) - [c86]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: 43:1-43:16 - [c85]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: 167-183 - [c84]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: 81:1-81:19 - [c83]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: 82:1-82:17 - [c82]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: 294-302 - [c81]Takehiro Ito, Yuni Iwamasa, Naoyuki Kamiyama, Yasuaki Kobayashi, Yusuke Kobayashi, Shun-ichi Maezawa, Akira Suzuki:
Reconfiguration of Time-Respecting Arborescences. WADS 2023: 521-532 - [c80]Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto:
Algorithmic Theory of Qubit Routing. WADS 2023: 533-546 - [c79]Rin Saito, Hiroshi Eto, Takehiro Ito, Ryuhei Uehara:
Reconfiguration of Vertex-Disjoint Shortest Paths on Graphs. WALCOM 2023: 191-201 - [i34]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 abs/2304.14782 (2023) - [i33]Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto:
Algorithmic Theory of Qubit Routing. CoRR abs/2305.02059 (2023) - [i32]Takehiro Ito, Yuni Iwamasa, Naoyuki Kamiyama, Yasuaki Kobayashi, Yusuke Kobayashi, Shun-ichi Maezawa, Akira Suzuki:
Reconfiguration of Time-Respecting Arborescences. CoRR abs/2305.07262 (2023) - [i31]Takehide Soh, Tomoya Tanjo, Yoshio Okamoto, Takehiro Ito:
Core Challenge 2023: Solver and Graph Descriptions. CoRR abs/2310.17136 (2023) - 2022
- [j52]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. 105-A(9): 1211-1222 (2022) - [j51]Takehiro Ito, Haruka Mizuta, Naomi Nishimura, Akira Suzuki:
Incremental optimization of independent sets under the reconfiguration framework. J. Comb. Optim. 43(5): 1264-1279 (2022) - [j50]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): 370-375 (2022) - [j49]Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto:
Shortest Reconfiguration of Perfect Matchings via Alternating Cycles. SIAM J. Discret. Math. 36(2): 1102-1123 (2022) - [c78]Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki:
Reforming an Envy-Free Matching. AAAI 2022: 5084-5091 - [c77]Takehiro Ito:
Invitation to Combinatorial Reconfiguration (Invited Talk). CPM 2022: 1:1-1:1 - [c76]Tatsuya Gima, Takehiro Ito, Yasuaki Kobayashi, Yota Otachi:
Algorithmic Meta-Theorems for Combinatorial Reconfiguration Revisited. ESA 2022: 61:1-61:15 - [c75]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: 16:1-16:17 - [c74]Takehiro Ito, Yuni Iwamasa, Yasuaki Kobayashi, Yu Nakahata, Yota Otachi, Masahiro Takahashi, Kunihiro Wasa:
Independent Set Reconfiguration on Directed Graphs. MFCS 2022: 58:1-58:15 - [c73]Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki:
On Reachable Assignments Under Dichotomous Preferences. PRIMA 2022: 650-658 - [c72]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: 1342-1355 - [c71]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: 15:1-15:21 - [c70]Takehiro Ito:
Invitation to Combinatorial Reconfiguration. WALCOM 2022: 26-31 - [c69]Hiroshi Eto, Takehiro Ito, Yasuaki Kobayashi, Yota Otachi, Kunihiro Wasa:
Reconfiguration of Regular Induced Subgraphs. WALCOM 2022: 35-46 - [c68]Hiroshi Eto, Takehiro Ito, Eiji Miyano, Akira Suzuki, Yuma Tamura:
Happy Set Problem on Subclasses of Co-comparability Graphs. WALCOM 2022: 149-160 - [i30]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 abs/2201.04354 (2022) - [i29]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 abs/2202.09495 (2022) - [i28]Takehiro Ito, Yuni Iwamasa, Yasuaki Kobayashi, Yu Nakahata, Yota Otachi, Masahiro Takahashi, Kunihiro Wasa:
Independent set reconfiguration on directed graphs. CoRR abs/2203.13435 (2022) - [i27]Tatsuya Gima, Takehiro Ito, Yasuaki Kobayashi, Yota Otachi:
Algorithmic Meta-Theorems for Combinatorial Reconfiguration Revisited. CoRR abs/2207.01024 (2022) - [i26]Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki:
Reforming an Envy-Free Matching. CoRR abs/2207.02641 (2022) - [i25]Takehiro Ito, Jun Kawahara, Yu Nakahata, Takehide Soh, Akira Suzuki, Junichi Teruyama, Takahisa Toda:
ZDD-Based Algorithmic Framework for Solving Shortest Reconfiguration Problems. CoRR abs/2207.13959 (2022) - [i24]Takehide Soh, Yoshio Okamoto, Takehiro Ito:
Core Challenge 2022: Solver and Graph Descriptions. CoRR abs/2208.02495 (2022) - [i23]Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki:
On Reachable Assignments under Dichotomous Preferences. CoRR abs/2209.10262 (2022) - [i22]Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki:
Rerouting Planar Curves and Disjoint Paths. CoRR abs/2210.11778 (2022) - [i21]Takehiro Ito, Yuni Iwamasa, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki:
Reconfiguration of colorings in triangulations of the sphere. CoRR abs/2210.17105 (2022) - 2021
- [j48]Yuma Tamura, Takehiro Ito, Xiao Zhou:
Approximability of the independent feedback vertex set problem for bipartite graphs. Theor. Comput. Sci. 849: 227-236 (2021) - [j47]Takehiro Ito, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto:
Algorithms for gerrymandering over graphs. Theor. Comput. Sci. 868: 30-45 (2021) - [c67]Takehiro Ito, Yuni Iwamasa, Yasuaki Kobayashi, Yu Nakahata, Yota Otachi, Kunihiro Wasa:
Reconfiguring Directed Trees in a Digraph. COCOON 2021: 343-354 - [i20]Takehiro Ito, Yuni Iwamasa, Yasuaki Kobayashi, Yu Nakahata, Yota Otachi, Kunihiro Wasa:
Reconfiguring Directed Trees in a Digraph. CoRR abs/2107.03092 (2021) - [i19]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 abs/2110.11585 (2021) - [i18]Hiroshi Eto, Takehiro Ito, Yasuaki Kobayashi, Yota Otachi, Kunihiro Wasa:
Reconfiguration of Regular Induced Subgraphs. CoRR abs/2111.13476 (2021) - 2020
- [j46]Takehiro Ito, Marcin Jakub Kaminski, Hirotaka Ono, Akira Suzuki, Ryuhei Uehara, Katsuhisa Yamanaka:
Parameterized complexity of independent set reconfiguration problems. Discret. Appl. Math. 283: 336-345 (2020) - [j45]Tesshu Hanaka, Takehiro Ito, Haruka Mizuta, Benjamin R. Moore, Naomi Nishimura, Vijay Subramanya, Akira Suzuki, Krishna Vaidyanathan:
Reconfiguring spanning and induced subgraphs. Theor. Comput. Sci. 806: 553-566 (2020) - [j44]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: 45-57 (2020) - [j43]Takehiro Ito, Naonori Kakimura, Yusuke Kobayashi:
Complexity of the multi-service center problem. Theor. Comput. Sci. 842: 18-27 (2020) - [c66]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: 24:1-24:15 - [c65]Yuma Tamura, Takehiro Ito, Xiao Zhou:
Minimization and Parameterized Variants of Vertex Partition Problems on Graphs. ISAAC 2020: 40:1-40:13 - [c64]Tatsuhiko Hatanaka, Felix Hommelsheim, Takehiro Ito, Yusuke Kobayashi, Moritz Mühlenthaler, Akira Suzuki:
Fixed-Parameter Algorithms for Graph Constraint Logic. IPEC 2020: 15:1-15:15 - [c63]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: 35:1-35:14 - [c62]Yuma Tamura, Takehiro Ito, Xiao Zhou:
Approximability of the Independent Feedback Vertex Set Problem for Bipartite Graphs. WALCOM 2020: 286-295 - [i17]Nicolas Bousquet, Takehiro Ito, Yusuke Kobayashi, Haruka Mizuta, Paul Ouvrard, Akira Suzuki, Kunihiro Wasa:
Reconfiguration of Spanning Trees with Many or Few Leaves. CoRR abs/2006.14309 (2020) - [i16]Tatsuhiko Hatanaka, Felix Hommelsheim, Takehiro Ito, Yusuke Kobayashi, Moritz Mühlenthaler, Akira Suzuki:
Fixed-Parameter Algorithms for Graph Constraint Logic. CoRR abs/2011.10385 (2020)
2010 – 2019
- 2019
- [j42]Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto:
Minimum-Cost b-Edge Dominating Sets on Trees. Algorithmica 81(1): 343-366 (2019) - [j41]Tatsuhiko Hatanaka, Takehiro Ito, Xiao Zhou:
The Coloring Reconfiguration Problem on Specific Graph Classes. IEICE Trans. Inf. Syst. 102-D(3): 423-429 (2019) - [j40]Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto:
Reconfiguration of maximum-weight b-matchings in a graph. J. Comb. Optim. 37(2): 454-464 (2019) - [j39]Takehiro Ito, Yota Otachi:
Reconfiguration of colorable sets in classes of perfect graphs. Theor. Comput. Sci. 772: 111-122 (2019) - [c61]Takehiro Ito, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto:
Algorithms for Gerrymandering over Graphs. AAMAS 2019: 1413-1421 - [c60]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: 52-64 - [c59]Takehiro Ito, Haruka Mizuta, Naomi Nishimura, Akira Suzuki:
Incremental Optimization of Independent Sets Under the Reconfiguration Framework. COCOON 2019: 313-324 - [c58]Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto:
Shortest Reconfiguration of Perfect Matchings via Alternating Cycles. ESA 2019: 61:1-61:15 - [c57]Haruka Mizuta, Tatsuhiko Hatanaka, Takehiro Ito, Xiao Zhou:
Reconfiguration of Minimum Steiner Trees via Vertex Exchanges. MFCS 2019: 79:1-79:11 - [c56]Marthe Bonamy, Nicolas Bousquet, Marc Heinrich, Takehiro Ito, Yusuke Kobayashi, Arnaud Mary, Moritz Mühlenthaler, Kunihiro Wasa:
The Perfect Matching Reconfiguration Problem. MFCS 2019: 80:1-80:14 - [c55]Nicolas Bousquet, Tatsuhiko Hatanaka, Takehiro Ito, Moritz Mühlenthaler:
Shortest Reconfiguration of Matchings. WG 2019: 162-174 - [i15]Marthe Bonamy, Nicolas Bousquet, Marc Heinrich, Takehiro Ito, Yusuke Kobayashi, Arnaud Mary, Moritz Mühlenthaler, Kunihiro Wasa:
The Perfect Matching Reconfiguration Problem. CoRR abs/1904.06184 (2019) - [i14]Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto:
Shortest Reconfiguration of Perfect Matchings via Alternating Cycles. CoRR abs/1907.01700 (2019) - 2018
- [j38]Hiroki Osawa, Akira Suzuki, Takehiro Ito, Xiao Zhou:
The Complexity of (List) Edge-Coloring Reconfiguration Problem. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 101-A(1): 232-238 (2018) - [j37]Tatsuhiko Hatanaka, Takehiro Ito, Xiao Zhou:
Parameterized complexity of the list coloring reconfiguration problem with graph parameters. Theor. Comput. Sci. 739: 65-79 (2018) - [c54]Tesshu Hanaka, Takehiro Ito, Haruka Mizuta, Benjamin R. Moore, Naomi Nishimura, Vijay Subramanya, Akira Suzuki, Krishna Vaidyanathan:
Reconfiguring Spanning and Induced Subgraphs. COCOON 2018: 428-440 - [c53]Hiroki Osawa, Akira Suzuki, Takehiro Ito, Xiao Zhou:
Algorithms for Coloring Reconfiguration Under Recolorability Constraints. ISAAC 2018: 37:1-37:13 - [c52]Takehiro Ito, Yota Otachi:
Reconfiguration of Colorable Sets in Classes of Perfect Graphs. SWAT 2018: 27:1-27:13 - [i13]Takehiro Ito, Yota Otachi:
Reconfiguration of Colorable Sets in Classes of Perfect Graphs. CoRR abs/1802.06511 (2018) - [i12]Tesshu Hanaka, Takehiro Ito, Haruka Mizuta, Benjamin R. Moore, Naomi Nishimura, Vijay Subramanya, Akira Suzuki, Krishna Vaidyanathan:
Reconfiguring spanning and induced subgraphs. CoRR abs/1803.06074 (2018) - [i11]Takehiro Ito, Haruka Mizuta, Naomi Nishimura, Akira Suzuki:
Incremental Optimization of Independent Sets under Reachability Constraints. CoRR abs/1804.09422 (2018) - [i10]Nicolas Bousquet, Tatsuhiko Hatanaka, Takehiro Ito, Moritz Mühlenthaler:
Shortest Reconfiguration of Matchings. CoRR abs/1812.05419 (2018) - [i9]Tatsuhiko Hatanaka, Takehiro Ito, Xiao Zhou:
Complexity of Reconfiguration Problems for Constraint Satisfaction. CoRR abs/1812.10629 (2018) - 2017
- [j36]Takashi Horiyama, Takehiro Ito, Keita Nakatsuka, Akira Suzuki, Ryuhei Uehara:
Complexity of Tiling a Polygon with Trominoes or Bars. Discret. Comput. Geom. 58(3): 686-704 (2017) - [j35]Haruka Mizuta, Takehiro Ito, Xiao Zhou:
Reconfiguration of Steiner Trees in an Unweighted Graph. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 100-A(7): 1532-1540 (2017) - [j34]Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto:
Efficient stabilization of cooperative matching games. Theor. Comput. Sci. 677: 69-82 (2017) - [c51]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: 41-55 - [c50]Tatsuhiko Hatanaka, Takehiro Ito, Xiao Zhou:
The Coloring Reconfiguration Problem on Specific Graph Classes. COCOA (1) 2017: 152-162 - [c49]Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto:
Reconfiguration of Maximum-Weight b-Matchings in a Graph. COCOON 2017: 287-296 - [c48]Takehiro Ito, Naonori Kakimura, Yusuke Kobayashi:
Complexity of the Multi-Service Center Problem. ISAAC 2017: 48:1-48:12 - [c47]Hiroki Osawa, Akira Suzuki, Takehiro Ito, Xiao Zhou:
Complexity of Coloring Reconfiguration under Recolorability Constraints. ISAAC 2017: 62:1-62:12 - [c46]Tatsuhiko Hatanaka, Takehiro Ito, Xiao Zhou:
Parameterized Complexity of the List Coloring Reconfiguration Problem with Graph Parameters. MFCS 2017: 51:1-51:13 - [c45]Hiroshi Eto, Takehiro Ito, Zhilong Liu, Eiji Miyano:
Approximation Algorithm for the Distance-3 Independent Set Problem on Cubic Graphs. WALCOM 2017: 228-240 - [c44]Hiroki Osawa, Akira Suzuki, Takehiro Ito, Xiao Zhou:
The Complexity of (List) Edge-Coloring Reconfiguration Problem. WALCOM 2017: 347-358 - [i8]Tatsuhiko Hatanaka, Takehiro Ito, Xiao Zhou:
Parameterized Complexity of the List Coloring Reconfiguration Problem with Graph Parameters. CoRR abs/1705.07551 (2017) - 2016
- [j33]Takehiro Ito, Shin-Ichi Nakano, Yoshio Okamoto, Yota Otachi, Ryuhei Uehara, Takeaki Uno, Yushi Uno:
A polynomial-time approximation scheme for the geometric unique coverage problem on unit squares. Comput. Geom. 51: 25-39 (2016) - [j32]Takehiro Ito, Hiroyuki Nooka, Xiao Zhou:
Reconfiguration of Vertex Covers in a Graph. IEICE Trans. Inf. Syst. 99-D(3): 598-606 (2016) - [j31]Yusuke Aoki, Bjarni V. Halldórsson, Magnús M. Halldórsson, Takehiro Ito, Christian Konrad, Xiao Zhou:
The minimum vulnerability problem on specific graph classes. J. Comb. Optim. 32(4): 1288-1304 (2016) - [j30]Arash Haddadan, Takehiro Ito, Amer E. Mouawad, Naomi Nishimura, Hirotaka Ono, Akira Suzuki, Youcef Tebbal:
The complexity of dominating set reconfiguration. Theor. Comput. Sci. 651: 37-49 (2016) - [c43]Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto:
Efficient Stabilization of Cooperative Matching Games. AAMAS 2016: 41-49 - [c42]Hiroshi Eto, Takehiro Ito, Zhilong Liu, Eiji Miyano:
Approximability of the Distance Independent Set Problem on Regular Graphs and Planar Graphs. COCOA 2016: 270-284 - [c41]Haruka Mizuta, Takehiro Ito, Xiao Zhou:
Reconfiguration of Steiner Trees in an Unweighted Graph. IWOCA 2016: 163-175 - [i7]Hiroki Osawa, Akira Suzuki, Takehiro Ito, Xiao Zhou:
The Complexity of (List) Edge-Coloring Reconfiguration Problem. CoRR abs/1609.00109 (2016) - 2015
- [j29]Tatsuhiko Hatanaka, Takehiro Ito, Xiao Zhou:
The List Coloring Reconfiguration Problem for Bounded Pathwidth Graphs. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 98-A(6): 1168-1178 (2015) - [j28]Yuma Tamura, Takehiro Ito, Xiao Zhou:
Algorithms for the Independent Feedback Vertex Set Problem. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 98-A(6): 1179-1188 (2015) - [j27]Katsuhisa Yamanaka, Erik D. Demaine, Takehiro Ito, Jun Kawahara, Masashi Kiyomi, Yoshio Okamoto, Toshiki Saitoh, Akira Suzuki, Kei Uchizawa, Takeaki Uno:
Swapping labeled tokens on graphs. Theor. Comput. Sci. 586: 81-94 (2015) - [j26]Erik D. Demaine, Martin L. Demaine, Eli Fox-Epstein, Duc A. Hoang, Takehiro Ito, Hirotaka Ono, Yota Otachi, Ryuhei Uehara, Takeshi Yamada:
Linear-time algorithm for sliding tokens on trees. Theor. Comput. Sci. 600: 132-142 (2015) - [c40]Takehiro Ito, Hirotaka Ono, Yota Otachi:
Reconfiguration of Cliques in a Graph. TAMC 2015: 212-223 - [c39]Arash Haddadan, Takehiro Ito, Amer E. Mouawad, Naomi Nishimura, Hirotaka Ono, Akira Suzuki, Youcef Tebbal:
The Complexity of Dominating Set Reconfiguration. WADS 2015: 398-409 - [c38]Takehiro Ito, Yota Otachi, Toshiki Saitoh, Hisayuki Satoh, Akira Suzuki, Kei Uchizawa, Ryuhei Uehara, Katsuhisa Yamanaka, Xiao Zhou:
Competitive Diffusion on Weighted Graphs. WADS 2015: 422-433 - [i6]Arash Haddadan, Takehiro Ito, Amer E. Mouawad, Naomi Nishimura, Hirotaka Ono, Akira Suzuki, Youcef Tebbal:
The complexity of dominating set reconfiguration. CoRR abs/1503.00833 (2015) - 2014
- [j25]Taku Okada, Akira Suzuki, Takehiro Ito, Xiao Zhou:
On the Minimum Caterpillar Problem in Digraphs. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 97-A(3): 848-857 (2014) - [j24]Takehiro Ito, Erik D. Demaine:
Approximability of the subset sum reconfiguration problem. J. Comb. Optim. 28(3): 639-654 (2014) - [j23]Takehiro Ito, Shin-Ichi Nakano, Yoshio Okamoto, Yota Otachi, Ryuhei Uehara, Takeaki Uno, Yushi Uno:
A 4.31-approximation for the geometric unique coverage problem on unit disks. Theor. Comput. Sci. 544: 14-31 (2014) - [j22]Takehiro Ito, Kazuto Kawamura, Hirotaka Ono, Xiao Zhou:
Reconfiguration of list L(2,1)-labelings in a graph. Theor. Comput. Sci. 544: 84-97 (2014) - [j21]Yuichi Asahiro, Hiroshi Eto, Takehiro Ito, Eiji Miyano:
Complexity of finding maximum regular induced subgraphs with prescribed degree. Theor. Comput. Sci. 550: 21-35 (2014) - [j20]Kei Uchizawa, Takanori Aoki, Takehiro Ito, Xiao Zhou:
Generalized rainbow connectivity of graphs. Theor. Comput. Sci. 555: 35-42 (2014) - [j19]Jinhee Chun, Takashi Horiyama, Takehiro Ito, Natsuda Kaothanthong, Hirotaka Ono, Yota Otachi, Takeshi Tokuyama, Ryuhei Uehara, Takeaki Uno:
Base-object location problems for base-monotone regions. Theor. Comput. Sci. 555: 71-84 (2014) - [c37]Yusuke Aoki, Bjarni V. Halldórsson, Magnús M. Halldórsson, Takehiro Ito, Christian Konrad, Xiao Zhou:
The Minimum Vulnerability Problem on Graphs. COCOA 2014: 299-313 - [c36]Tatsuhiko Hatanaka, Takehiro Ito, Xiao Zhou:
The List Coloring Reconfiguration Problem for Bounded Pathwidth Graphs. COCOA 2014: 314-328 - [c35]Katsuhisa Yamanaka, Erik D. Demaine, Takehiro Ito, Jun Kawahara, Masashi Kiyomi, Yoshio Okamoto, Toshiki Saitoh, Akira Suzuki, Kei Uchizawa, Takeaki Uno:
Swapping Labeled Tokens on Graphs. FUN 2014: 364-375 - [c34]Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto:
Minimum-Cost b -Edge Dominating Sets on Trees. ISAAC 2014: 195-207 - [c33]Takehiro Ito, Marcin Jakub Kaminski, Hirotaka Ono:
Fixed-Parameter Tractability of Token Jumping on Planar Graphs. ISAAC 2014: 208-219 - [c32]Erik D. Demaine, Martin L. Demaine, Eli Fox-Epstein, Duc A. Hoang, Takehiro Ito, Hirotaka Ono, Yota Otachi, Ryuhei Uehara, Takeshi Yamada:
Polynomial-Time Algorithm for Sliding Tokens on Trees. ISAAC 2014: 389-400 - [c31]Takehiro Ito, Hiroyuki Nooka, Xiao Zhou:
Reconfiguration of Vertex Covers in a Graph. IWOCA 2014: 164-175 - [c30]Yuma Tamura, Takehiro Ito, Xiao Zhou:
Deterministic Algorithms for the Independent Feedback Vertex Set Problem. IWOCA 2014: 351-363 - [c29]Takehiro Ito, Marcin Kaminski, Hirotaka Ono, Akira Suzuki, Ryuhei Uehara, Katsuhisa Yamanaka:
On the Parameterized Complexity for Token Jumping on Graphs. TAMC 2014: 341-351 - [i5]Takehiro Ito, Marcin Kaminski, Hirotaka Ono:
Fixed-Parameter Tractability of Token Jumping on Planar Graphs. CoRR abs/1406.6567 (2014) - [i4]Erik D. Demaine, Martin L. Demaine, Eli Fox-Epstein, Duc A. Hoang, Takehiro Ito, Hirotaka Ono, Yota Otachi, Ryuhei Uehara, Takeshi Yamada:
Polynomial-Time Algorithm for Sliding Tokens on Trees. CoRR abs/1406.6576 (2014) - [i3]Tatsuhiko Hatanaka, Takehiro Ito, Xiao Zhou:
The List Coloring Reconfiguration Problem for Bounded Pathwidth Graphs. CoRR abs/1407.4235 (2014) - [i2]Takehiro Ito, Yota Otachi, Toshiki Saitoh, Hisayuki Satoh, Akira Suzuki, Kei Uchizawa, Ryuhei Uehara, Katsuhisa Yamanaka, Xiao Zhou:
Computational Complexity of Competitive Diffusion on (Un)weighted Graphs. CoRR abs/1412.3334 (2014) - [i1]Takehiro Ito, Hirotaka Ono, Yota Otachi:
Reconfiguration of Cliques in a Graph. CoRR abs/1412.3976 (2014) - 2013
- [j18]Takehiro Ito, Yuichiro Miyamoto, Hirotaka Ono, Hisao Tamaki, Ryuhei Uehara:
Route-Enabling Graph Orientation Problems. Algorithmica 65(2): 317-338 (2013) - [j17]Kei Uchizawa, Takanori Aoki, Takehiro Ito, Akira Suzuki, Xiao Zhou:
On the Rainbow Connectivity of Graphs: Complexity and FPT Algorithms. Algorithmica 67(2): 161-179 (2013) - [c28]Taku Okada, Akira Suzuki, Takehiro Ito, Xiao Zhou:
On the Minimum Caterpillar Problem in Digraphs. COCOON 2013: 729-736 - [c27]Yuichi Asahiro, Hiroshi Eto, Takehiro Ito, Eiji Miyano:
Complexity of Finding Maximum Regular Induced Subgraphs with Prescribed Degree. FCT 2013: 28-39 - [c26]Jinhee Chun, Takashi Horiyama, Takehiro Ito, Natsuda Kaothanthong, Hirotaka Ono, Yota Otachi, Takeshi Tokuyama, Ryuhei Uehara, Takeaki Uno:
Base Location Problems for Base-Monotone Regions. WALCOM 2013: 53-64 - [c25]Kei Uchizawa, Takanori Aoki, Takehiro Ito, Xiao Zhou:
Generalized Rainbow Connectivity of Graphs. WALCOM 2013: 233-244 - 2012
- [j16]Takehiro Ito, Takao Nishizeki, Michael Schröder, Takeaki Uno, Xiao Zhou:
Partitioning a Weighted Tree into Subtrees with Weights in a Given Range. Algorithmica 62(3-4): 823-841 (2012) - [j15]Takehiro Ito, Takuya Hara, Xiao Zhou, Takao Nishizeki:
Minimum Cost Partitions of Trees with Supply and Demand. Algorithmica 64(3): 400-415 (2012) - [j14]Takehiro Ito, Marcin Kaminski, Erik D. Demaine:
Reconfiguration of list edge-colorings in a graph. Discret. Appl. Math. 160(15): 2199-2207 (2012) - [j13]Takehiro Ito, Kazuto Kawamura, Xiao Zhou:
An Improved Sufficient Condition for Reconfiguration of List Edge-Colorings in a Tree. IEICE Trans. Inf. Syst. 95-D(3): 737-745 (2012) - [c24]Takashi Horiyama, Takehiro Ito, Keita Nakatsuka, Akira Suzuki, Ryuhei Uehara:
Packing Trominoes is NP-Complete, #P-Complete and ASP-Complete. CCCG 2012: 211-216 - [c23]Takehiro Ito, Kazuto Kawamura, Hirotaka Ono, Xiao Zhou:
Reconfiguration of List L(2, 1)-Labelings in a Graph. ISAAC 2012: 34-43 - [c22]Takehiro Ito, Shin-Ichi Nakano, Yoshio Okamoto, Yota Otachi, Ryuhei Uehara, Takeaki Uno, Yushi Uno:
A 4.31-Approximation for the Geometric Unique Coverage Problem on Unit Disks. ISAAC 2012: 372-381 - [c21]Takehiro Ito, Shin-Ichi Nakano, Yoshio Okamoto, Yota Otachi, Ryuhei Uehara, Takeaki Uno, Yushi Uno:
A Polynomial-Time Approximation Scheme for the Geometric Unique Coverage Problem on Unit Squares. SWAT 2012: 24-35 - 2011
- [j12]Takehiro Ito, Marcin Kaminski, Daniël Paulusma, Dimitrios M. Thilikos:
On disconnected cuts and separators. Discret. Appl. Math. 159(13): 1345-1351 (2011) - [j11]Takehiro Ito, Naoki Sakamoto, Xiao Zhou, Takao Nishizeki:
Minimum Cost Edge-Colorings of Trees Can Be Reduced to Matchings. IEICE Trans. Inf. Syst. 94-D(2): 190-195 (2011) - [j10]Masaharu Komori, Fumi Takeoka, Aizoh Kubo, Hiroshige Fujio, Takehiro Ito, Sonko Osawa, Osamu Sato, Toshiyuki Takatsuji:
Laser Interferometric Measuring Method of Involute Artifact and Stabilization of Measurement. Int. J. Autom. Technol. 5(2): 144-149 (2011) - [j9]Takehiro Ito, Erik D. Demaine, Nicholas J. A. Harvey, Christos H. Papadimitriou, Martha Sideri, Ryuhei Uehara, Yushi Uno:
On the complexity of reconfiguration problems. Theor. Comput. Sci. 412(12-14): 1054-1065 (2011) - [j8]Takehiro Ito, Marcin Kaminski, Daniël Paulusma, Dimitrios M. Thilikos:
Parameterizing cut sets in a graph by the number of their components. Theor. Comput. Sci. 412(45): 6340-6350 (2011) - [c20]Kei Uchizawa, Takanori Aoki, Takehiro Ito, Akira Suzuki, Xiao Zhou:
On the Rainbow Connectivity of Graphs: Complexity and FPT Algorithms. COCOON 2011: 86-97 - [c19]Takehiro Ito, Erik D. Demaine:
Approximability of the Subset Sum Reconfiguration Problem. TAMC 2011: 58-69 - [c18]Takehiro Ito, Kazuto Kawamura, Xiao Zhou:
An Improved Sufficient Condition for Reconfiguration of List Edge-Colorings in a Tree. TAMC 2011: 94-105 - 2010
- [c17]Takehiro Ito, Naoki Sakamoto, Xiao Zhou, Takao Nishizeki:
Minimum Cost Edge-Colorings of Trees Can Be Reduced to Matchings. FAW 2010: 274-284 - [c16]Takehiro Ito, Takuya Hara, Xiao Zhou, Takao Nishizeki:
Minimum Cost Partitions of Trees with Supply and Demand. ISAAC (2) 2010: 351-362
2000 – 2009
- 2009
- [j7]Takehiro Ito, Xiao Zhou, Takao Nishizeki:
Partitioning graphs of supply and demand. Discret. Appl. Math. 157(12): 2620-2633 (2009) - [j6]Takehiro Ito, W. Sean Kennedy, Bruce A. Reed:
A Characterization of Graphs with Fractional Total Chromatic Number Equal to Delta+2. Electron. Notes Discret. Math. 35: 235-240 (2009) - [c15]Takehiro Ito, Yuichiro Miyamoto, Hirotaka Ono, Hisao Tamaki, Ryuhei Uehara:
Route-Enabling Graph Orientation Problems. ISAAC 2009: 403-412 - [c14]Takehiro Ito, Marcin Kaminski, Daniël Paulusma, Dimitrios M. Thilikos:
Parameterizing Cut Sets in a Graph by the Number of Their Components. ISAAC 2009: 605-615 - [c13]Takehiro Ito, Marcin Kaminski, Erik D. Demaine:
Reconfiguration of List Edge-Colorings in a Graph. WADS 2009: 375-386 - 2008
- [j5]Takehiro Ito, Erik D. Demaine, Xiao Zhou, Takao Nishizeki:
Approximability of partitioning graphs with supply and demand. J. Discrete Algorithms 6(4): 627-650 (2008) - [c12]Takehiro Ito, Erik D. Demaine, Nicholas J. A. Harvey, Christos H. Papadimitriou, Martha Sideri, Ryuhei Uehara, Yushi Uno:
On the Complexity of Reconfiguration Problems. ISAAC 2008: 28-39 - [c11]Takehiro Ito, Takeaki Uno, Xiao Zhou, Takao Nishizeki:
Partitioning a Weighted Tree to Subtrees of Almost Uniform Size. ISAAC 2008: 196-207 - 2007
- [j4]Takehiro Ito, Kazuya Goto, Xiao Zhou, Takao Nishizeki:
Partitioning a Multi-Weighted Graph to Connected Subgraphs of Almost Uniform Size. IEICE Trans. Inf. Syst. 90-D(2): 449-456 (2007) - [j3]Takehiro Ito, Akira Kato, Xiao Zhou, Takao Nishizeki:
Algorithms for finding distance-edge-colorings of graphs. J. Discrete Algorithms 5(2): 304-322 (2007) - [c10]Takehiro Ito:
Partitioning Graphs of Supply and Demand. WALCOM 2007: 162-179 - 2006
- [j2]Takehiro Ito, Xiao Zhou, Takao Nishizeki:
Partitioning a graph of bounded tree-width to connected subgraphs of almost uniform size. J. Discrete Algorithms 4(1): 142-154 (2006) - [c9]Takehiro Ito, Kazuya Goto, Xiao Zhou, Takao Nishizeki:
Partitioning a Multi-weighted Graph to Connected Subgraphs of Almost Uniform Size. COCOON 2006: 63-72 - [c8]Takehiro Ito, Erik D. Demaine, Xiao Zhou, Takao Nishizeki:
Approximability of Partitioning Graphs with Supply and Demand. ISAAC 2006: 121-130 - 2005
- [j1]Takehiro Ito, Xiao Zhou, Takao Nishizeki:
Partitioning trees of supply and demand. Int. J. Found. Comput. Sci. 16(4): 803-827 (2005) - [c7]Takehiro Ito, Akira Kato, Xiao Zhou, Takao Nishizeki:
Algorithms for Finding Distance-Edge-Colorings of Graphs. COCOON 2005: 798-807 - [c6]Takehiro Ito, Xiao Zhou, Takao Nishizeki:
Partitioning graphs of supply and demand. ISCAS (1) 2005: 160-163 - 2004
- [c5]Takehiro Ito, Yuichiro Shibata, Kiyoshi Oguri:
Implementation of the Extended Euclidean Algorithm for the Tate Pairing on FPGA. FPL 2004: 911-916 - [c4]Takehiro Ito, Xiao Zhou, Takao Nishizeki:
Partitioning a Weighted Graph to Connected Subgraphs of Almost Uniform Size. WG 2004: 365-376 - 2002
- [c3]Takehiro Ito, Takao Nishizeki, Xiao Zhou:
Algorithms for the Multicolorings of Partial k-Trees. COCOON 2002: 430-439 - [c2]Takehiro Ito, Xiao Zhou, Takao Nishizeki:
Partitioning Trees of Supply and Demand. ISAAC 2002: 612-623
1990 – 1999
- 1997
- [c1]Takehiro Ito, Itsuo Takanami:
On fault injection approaches for fault tolerance of feedforward neural networks. Asian Test Symposium 1997: 88-93
Coauthor Index
[j48] [c65] [c62] [j41] [c57] [j38] [j37] [c53] [i9] [j35] [c50] [c47] [c46] [c44] [i8] [j32] [j31] [c41] [i7] [j29] [j28] [c38] [j25] [j22] [j20] [c37] [c36] [c31] [c30] [i3] [i2] [j17] [c28] [c25] [j16] [j15] [j13] [c23] [j11] [c20] [c18] [c17] [c16] [j7] [j5] [c11] [j4] [j3] [j2] [c9] [c8] [j1] [c7] [c6] [c4] [c3] [c2]
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-25 20:14 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
