Takehiro Ito
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
84
Venues
26
Active years
2002–2026
Best venue rank
A*
Where they publish
- BISAAC17 papers
- BWALCOM12 papers
- NationalCOCOON10 papers
- BWADS5 papers
- BMFCS4 papers
- CCOCOA4 papers
- CTAMC4 papers
- NationalFUN3 papers
- AESA3 papers
- CIWOCA3 papers
- A*ICALP2 papers
- ASTACS2 papers
- BWG2 papers
- A*KR1 paper
- AECAI1 paper
- BSoCS1 paper
- BCPAIOR1 paper
- BICTAI1 paper
- A*AAAI1 paper
- BCPM1 paper
- BPRIMA1 paper
- A*SODA1 paper
- BFCT1 paper
- NationalFAW1 paper
- CISCAS1 paper
- BFPL1 paper
Papers
84 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 2026 | FUN | Computational Complexity of Swish Is Solved. | Takashi Horiyama, Takehiro Ito, Jun Kawahara, Shin-ichi Minato, Akira Suzuki, Ryuhei Uehara, Yutaro Yamaguchi |
| 2026 | KR | SRIP: A SAT-based System for Independent Set Reconfiguration. | Takehide Soh, Akifumi Kuwahara, Mutsunori Banbara, Naoyuki Tamura, Yasuaki Kobayashi, Yuta Nozaki, Takehiro Ito |
| 2026 | WALCOM | Parameterized Complexity of Reconfiguring Vertex-Disjoint Shortest Paths. | Rin Saito, Takehiro Ito |
| 2025 | ECAI | Multi-Objective Combinatorial Reconfiguration Considering Cost and Length by Answer Set Programming: Algorithms, Encodings, and Empirical Analysis. | Kazuki Takada, Mutsunori Banbara, Takehiro Ito, Jun Kawahara, Shin-ichi Minato, Torsten Schaub, Ryuhei Uehara |
| 2025 | ISAAC | Minimum Sum Coloring with Bundles in Trees and Bipartite Graphs. | Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto |
| 2025 | WALCOM | Independent Set Reconfiguration Under Bounded-Hop Token Jumping. | Hiroki Hatano, Naoki Kitamura, Taisuke Izumi, Takehiro Ito, Toshimitsu Masuzawa |
| 2024 | SoCS | CoRe Challenge 2022/2023: Empirical Evaluations for Independent Set Reconfiguration Problems (Extended Abstract). | Takehide Soh, Tomoya Tanjo, Yoshio Okamoto, Takehiro Ito |
| 2023 | CPAIOR | ZDD-Based Algorithmic Framework for Solving Shortest Reconfiguration Problems. | Takehiro Ito, Jun Kawahara, Yu Nakahata, Takehide Soh, Akira Suzuki, Junichi Teruyama, Takahisa Toda |
| 2023 | ICALP | Rerouting Planar Curves and Disjoint Paths. | Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki |
| 2023 | ICALP | Hardness of Finding Combinatorial Shortest Paths on Graph Associahedra. | Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto |
| 2023 | ICTAI | Solving Reconfiguration Problems of First-Order Expressible Properties of Graph Vertices with Boolean Satisfiability. | Takahisa Toda, Takehiro Ito, Jun Kawahara, Takehide Soh, Akira Suzuki, Junichi Teruyama |
| 2023 | WADS | Reconfiguration of Time-Respecting Arborescences. | Takehiro Ito, Yuni Iwamasa, Naoyuki Kamiyama, Yasuaki Kobayashi, Yusuke Kobayashi, Shun-ichi Maezawa, Akira Suzuki |
| 2023 | WADS | Algorithmic Theory of Qubit Routing. | Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto |
| 2023 | WALCOM | Reconfiguration of Vertex-Disjoint Shortest Paths on Graphs. | Rin Saito, Hiroshi Eto, Takehiro Ito, Ryuhei Uehara |
| 2022 | AAAI | Reforming an Envy-Free Matching. | Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki |
| 2022 | CPM | Invitation to Combinatorial Reconfiguration (Invited Talk). | Takehiro Ito |
| 2022 | ESA | Algorithmic Meta-Theorems for Combinatorial Reconfiguration Revisited. | Tatsuya Gima, Takehiro Ito, Yasuaki Kobayashi, Yota Otachi |
| 2022 | FUN | Sorting Balls and Water: Equivalence and Computational Complexity. | Takehiro Ito, Jun Kawahara, Shin-ichi Minato, Yota Otachi, Toshiki Saitoh, Akira Suzuki, Ryuhei Uehara, Takeaki Uno, Katsuhisa Yamanaka, Ryo Yoshinaka |
| 2022 | MFCS | Independent Set Reconfiguration on Directed Graphs. | Takehiro Ito, Yuni Iwamasa, Yasuaki Kobayashi, Yu Nakahata, Yota Otachi, Masahiro Takahashi, Kunihiro Wasa |
| 2022 | PRIMA | On Reachable Assignments Under Dichotomous Preferences. | Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki |
| 2022 | SODA | Monotone edge flips to an orientation of maximum edge-connectivity la Nash-Williams. | Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki |
| 2022 | STACS | Reconfiguration of Spanning Trees with Degree Constraint or Diameter Constraint. | Nicolas Bousquet, Takehiro Ito, Yusuke Kobayashi, Haruka Mizuta, Paul Ouvrard, Akira Suzuki, Kunihiro Wasa |
| 2022 | WALCOM | Reconfiguration of Regular Induced Subgraphs. | Hiroshi Eto, Takehiro Ito, Yasuaki Kobayashi, Yota Otachi, Kunihiro Wasa |
| 2022 | WALCOM | Happy Set Problem on Subclasses of Co-comparability Graphs. | Hiroshi Eto, Takehiro Ito, Eiji Miyano, Akira Suzuki, Yuma Tamura |
| 2022 | WALCOM | Invitation to Combinatorial Reconfiguration. | Takehiro Ito |
| 2021 | COCOON | Reconfiguring Directed Trees in a Digraph. | Takehiro Ito, Yuni Iwamasa, Yasuaki Kobayashi, Yu Nakahata, Yota Otachi, Kunihiro Wasa |
| 2020 | ESA | Reconfiguration of Spanning Trees with Many or Few Leaves. | Nicolas Bousquet, Takehiro Ito, Yusuke Kobayashi, Haruka Mizuta, Paul Ouvrard, Akira Suzuki, Kunihiro Wasa |
| 2020 | ISAAC | Minimization and Parameterized Variants of Vertex Partition Problems on Graphs. | Yuma Tamura, Takehiro Ito, Xiao Zhou |
| 2020 | STACS | Shortest Reconfiguration of Colorings Under Kempe Changes. | Marthe Bonamy, Marc Heinrich, Takehiro Ito, Yusuke Kobayashi, Haruka Mizuta, Moritz Mhlenthaler, Akira Suzuki, Kunihiro Wasa |
| 2020 | WALCOM | Approximability of the Independent Feedback Vertex Set Problem for Bipartite Graphs. | Yuma Tamura, Takehiro Ito, Xiao Zhou |
| 2019 | COCOON | Diameter of Colorings Under Kempe Changes. | Marthe Bonamy, Marc Heinrich, Takehiro Ito, Yusuke Kobayashi, Haruka Mizuta, Moritz Mhlenthaler, Akira Suzuki, Kunihiro Wasa |
| 2019 | COCOON | Incremental Optimization of Independent Sets Under the Reconfiguration Framework. | Takehiro Ito, Haruka Mizuta, Naomi Nishimura, Akira Suzuki |
| 2019 | ESA | Shortest Reconfiguration of Perfect Matchings via Alternating Cycles. | Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto |
| 2019 | MFCS | The Perfect Matching Reconfiguration Problem. | Marthe Bonamy, Nicolas Bousquet, Marc Heinrich, Takehiro Ito, Yusuke Kobayashi, Arnaud Mary, Moritz Mhlenthaler, Kunihiro Wasa |
| 2019 | MFCS | Reconfiguration of Minimum Steiner Trees via Vertex Exchanges. | Haruka Mizuta, Tatsuhiko Hatanaka, Takehiro Ito, Xiao Zhou |
| 2019 | WG | Shortest Reconfiguration of Matchings. | Nicolas Bousquet, Tatsuhiko Hatanaka, Takehiro Ito, Moritz Mhlenthaler |
| 2018 | COCOON | Reconfiguring Spanning and Induced Subgraphs. | Tesshu Hanaka, Takehiro Ito, Haruka Mizuta, Benjamin R. Moore, Naomi Nishimura, Vijay Subramanya, Akira Suzuki, Krishna Vaidyanathan |
| 2018 | ISAAC | Algorithms for Coloring Reconfiguration Under Recolorability Constraints. | Hiroki Osawa, Akira Suzuki, Takehiro Ito, Xiao Zhou |
| 2017 | COCOA | The Coloring Reconfiguration Problem on Specific Graph Classes. | Tatsuhiko Hatanaka, Takehiro Ito, Xiao Zhou |
| 2017 | COCOON | Reconfiguration of Maximum-Weight b-Matchings in a Graph. | Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto |
| 2017 | ISAAC | Complexity of the Multi-Service Center Problem. | Takehiro Ito, Naonori Kakimura, Yusuke Kobayashi |
| 2017 | ISAAC | Complexity of Coloring Reconfiguration under Recolorability Constraints. | Hiroki Osawa, Akira Suzuki, Takehiro Ito, Xiao Zhou |
| 2017 | MFCS | Parameterized Complexity of the List Coloring Reconfiguration Problem with Graph Parameters. | Tatsuhiko Hatanaka, Takehiro Ito, Xiao Zhou |
| 2017 | WALCOM | Approximation Algorithm for the Distance-3 Independent Set Problem on Cubic Graphs. | Hiroshi Eto, Takehiro Ito, Zhilong Liu, Eiji Miyano |
| 2017 | WALCOM | The Complexity of (List) Edge-Coloring Reconfiguration Problem. | Hiroki Osawa, Akira Suzuki, Takehiro Ito, Xiao Zhou |
| 2016 | COCOA | Approximability of the Distance Independent Set Problem on Regular Graphs and Planar Graphs. | Hiroshi Eto, Takehiro Ito, Zhilong Liu, Eiji Miyano |
| 2016 | IWOCA | Reconfiguration of Steiner Trees in an Unweighted Graph. | Haruka Mizuta, Takehiro Ito, Xiao Zhou |
| 2015 | TAMC | Reconfiguration of Cliques in a Graph. | Takehiro Ito, Hirotaka Ono, Yota Otachi |
| 2015 | WADS | The Complexity of Dominating Set Reconfiguration. | Arash Haddadan, Takehiro Ito, Amer E. Mouawad, Naomi Nishimura, Hirotaka Ono, Akira Suzuki, Youcef Tebbal |
| 2015 | WADS | Competitive Diffusion on Weighted Graphs. | Takehiro Ito, Yota Otachi, Toshiki Saitoh, Hisayuki Satoh, Akira Suzuki, Kei Uchizawa, Ryuhei Uehara, Katsuhisa Yamanaka, Xiao Zhou |
| 2014 | COCOA | The Minimum Vulnerability Problem on Graphs. | Yusuke Aoki, Bjarni V. Halldrsson, Magns M. Halldrsson, Takehiro Ito, Christian Konrad, Xiao Zhou |
| 2014 | COCOA | The List Coloring Reconfiguration Problem for Bounded Pathwidth Graphs. | Tatsuhiko Hatanaka, Takehiro Ito, Xiao Zhou |
| 2014 | FUN | Swapping Labeled Tokens on Graphs. | Katsuhisa Yamanaka, Erik D. Demaine, Takehiro Ito, Jun Kawahara, Masashi Kiyomi, Yoshio Okamoto, Toshiki Saitoh, Akira Suzuki, Kei Uchizawa, Takeaki Uno |
| 2014 | ISAAC | Polynomial-Time Algorithm for Sliding Tokens on Trees. | Erik D. Demaine, Martin L. Demaine, Eli Fox-Epstein, Duc A. Hoang, Takehiro Ito, Hirotaka Ono, Yota Otachi, Ryuhei Uehara, Takeshi Yamada |
| 2014 | ISAAC | Minimum-Cost b -Edge Dominating Sets on Trees. | Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto |
| 2014 | ISAAC | Fixed-Parameter Tractability of Token Jumping on Planar Graphs. | Takehiro Ito, Marcin Jakub Kaminski, Hirotaka Ono |
| 2014 | IWOCA | Reconfiguration of Vertex Covers in a Graph. | Takehiro Ito, Hiroyuki Nooka, Xiao Zhou |
| 2014 | IWOCA | Deterministic Algorithms for the Independent Feedback Vertex Set Problem. | Yuma Tamura, Takehiro Ito, Xiao Zhou |
| 2014 | TAMC | On the Parameterized Complexity for Token Jumping on Graphs. | Takehiro Ito, Marcin Kaminski, Hirotaka Ono, Akira Suzuki, Ryuhei Uehara, Katsuhisa Yamanaka |
| 2013 | COCOON | On the Minimum Caterpillar Problem in Digraphs. | Taku Okada, Akira Suzuki, Takehiro Ito, Xiao Zhou |
| 2013 | FCT | Complexity of Finding Maximum Regular Induced Subgraphs with Prescribed Degree. | Yuichi Asahiro, Hiroshi Eto, Takehiro Ito, Eiji Miyano |
| 2013 | WALCOM | Base Location Problems for Base-Monotone Regions. | Jinhee Chun, Takashi Horiyama, Takehiro Ito, Natsuda Kaothanthong, Hirotaka Ono, Yota Otachi, Takeshi Tokuyama, Ryuhei Uehara, Takeaki Uno |
| 2013 | WALCOM | Generalized Rainbow Connectivity of Graphs. | Kei Uchizawa, Takanori Aoki, Takehiro Ito, Xiao Zhou |
| 2012 | ISAAC | Reconfiguration of List L(2, 1)-Labelings in a Graph. | Takehiro Ito, Kazuto Kawamura, Hirotaka Ono, Xiao Zhou |
| 2012 | ISAAC | A 4.31-Approximation for the Geometric Unique Coverage Problem on Unit Disks. | Takehiro Ito, Shin-Ichi Nakano, Yoshio Okamoto, Yota Otachi, Ryuhei Uehara, Takeaki Uno, Yushi Uno |
| 2011 | COCOON | On the Rainbow Connectivity of Graphs: Complexity and FPT Algorithms. | Kei Uchizawa, Takanori Aoki, Takehiro Ito, Akira Suzuki, Xiao Zhou |
| 2011 | TAMC | Approximability of the Subset Sum Reconfiguration Problem. | Takehiro Ito, Erik D. Demaine |
| 2011 | TAMC | An Improved Sufficient Condition for Reconfiguration of List Edge-Colorings in a Tree. | Takehiro Ito, Kazuto Kawamura, Xiao Zhou |
| 2010 | FAW | Minimum Cost Edge-Colorings of Trees Can Be Reduced to Matchings. | Takehiro Ito, Naoki Sakamoto, Xiao Zhou, Takao Nishizeki |
| 2010 | ISAAC | Minimum Cost Partitions of Trees with Supply and Demand. | Takehiro Ito, Takuya Hara, Xiao Zhou, Takao Nishizeki |
| 2009 | ISAAC | Parameterizing Cut Sets in a Graph by the Number of Their Components. | Takehiro Ito, Marcin Kaminski, Danil Paulusma, Dimitrios M. Thilikos |
| 2009 | ISAAC | Route-Enabling Graph Orientation Problems. | Takehiro Ito, Yuichiro Miyamoto, Hirotaka Ono, Hisao Tamaki, Ryuhei Uehara |
| 2009 | WADS | Reconfiguration of List Edge-Colorings in a Graph. | Takehiro Ito, Marcin Kaminski, Erik D. Demaine |
| 2008 | ISAAC | On the Complexity of Reconfiguration Problems. | Takehiro Ito, Erik D. Demaine, Nicholas J. A. Harvey, Christos H. Papadimitriou, Martha Sideri, Ryuhei Uehara, Yushi Uno |
| 2008 | ISAAC | Partitioning a Weighted Tree to Subtrees of Almost Uniform Size. | Takehiro Ito, Takeaki Uno, Xiao Zhou, Takao Nishizeki |
| 2007 | WALCOM | Partitioning Graphs of Supply and Demand. | Takehiro Ito |
| 2006 | COCOON | Partitioning a Multi-weighted Graph to Connected Subgraphs of Almost Uniform Size. | Takehiro Ito, Kazuya Goto, Xiao Zhou, Takao Nishizeki |
| 2006 | ISAAC | Approximability of Partitioning Graphs with Supply and Demand. | Takehiro Ito, Erik D. Demaine, Xiao Zhou, Takao Nishizeki |
| 2005 | COCOON | Algorithms for Finding Distance-Edge-Colorings of Graphs. | Takehiro Ito, Akira Kato, Xiao Zhou, Takao Nishizeki |
| 2005 | ISCAS | Partitioning graphs of supply and demand. | Takehiro Ito, Xiao Zhou, Takao Nishizeki |
| 2004 | FPL | Implementation of the Extended Euclidean Algorithm for the Tate Pairing on FPGA. | Takehiro Ito, Yuichiro Shibata, Kiyoshi Oguri |
| 2004 | WG | Partitioning a Weighted Graph to Connected Subgraphs of Almost Uniform Size. | Takehiro Ito, Xiao Zhou, Takao Nishizeki |
| 2002 | COCOON | Algorithms for the Multicolorings of Partial k-Trees. | Takehiro Ito, Takao Nishizeki, Xiao Zhou |
| 2002 | ISAAC | Partitioning Trees of Supply and Demand. | Takehiro Ito, Xiao Zhou, Takao Nishizeki |