- Hiroshi Eto, Takehiro Ito, Eiji Miyano, Akira Suzuki and Yuma Tamura,

**Happy Set Problem on Subclasses of Co-comparability Graphs**,

Algorithmica, to appear. - Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yuta Nozaki, Yoshio Okamoto and Kenta Ozeki,

**On Reachable Assignments under Dichotomous Preferences**,

Theoretical Computer Science, Vol. 979, Article 114196, 10 November 2023. - Takehiro Ito, Jun Kawahara, Shin-ichi Minato, Yota Otachi, Toshiki Saitoh, Akira Suzuki, Ryuhei Uehara, Takeaki Uno, Katsuhisa Yamanaka and Ryo Yoshinaka,

**Sorting Balls and Water: Equivalence and Computational Complexity**,

Theoretical Computer Science, Vol. 978, Article 114158, 2 November 2023. - Nicolas Bousquet, Takehiro Ito, Yusuke Kobayashi, Haruka Mizuta, Paul Ouvrard, Akira Suzuki and Kunihiro Wasa,

**Reconfiguration of Spanning Trees with Degree Constraints or Diameter Constraints**,

Algorithmica, Vol. 85, pp. 2779-2816, September 2023. - Takehiro Ito, Hirotaka Ono and Yota Otachi,

**Reconfiguration of Cliques in a Graph**,

Discrete Applied Mathematics, Vol. 333, pp. 43-58, 15 July 2023. - Tatsuhiko Hatanaka, Felix Hommelsheim, Takehiro Ito, Yusuke Kobayashi, Moritz Mühlenthaler and Akira Suzuki,

**Fixed-Parameter Algorithms for Graph Constraint Logic**,

Theoretical Computer Science, Vol. 959, Article 113863, 30 May 2023. - Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto and Kenta Ozeki,

**Monotone Edge Flips to an Orientation of Maximum Edge-Connectivity à la Nash-Williams**,

ACM Transactions on Algorithms, Vol. 19, Issue 1, Article No. 6, pp. 1-22, 20 February 2023. - Takehiro Ito, Yuni Iwamasa, Yasuaki Kobayashi, Yu Nakahata, Yota Otachi and Kunihiro Wasa,

**Reconfiguring (Non-Spanning) Arborescences**,

Theoretical Computer Science, Vol. 943, pp. 131-141, 17 January 2023. - Hiroshi Eto, Takehiro Ito, Zhilong Liu and Eiji Miyano,

**Approximability of the Distance Independent Set Problem on Regular Graphs and Planar Graphs**,

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, Vol. E105-A, Issue 9, pp. 1211-1222, 1 September 2022. - Takehiro Ito, Haruka Mizuta, Naomi Nishimura and Akira Suzuki,

**Incremental Optimization of Independent Sets Under the Reconfiguration Framework**,

Journal of Combinatorial Optimization, Vol. 43, pp. 1264-1279, July 2022. - Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi and Yoshio Okamoto,

**A Parameterized View to the Robust Recoverable Base Problem of Matroids Under Structural Uncertainty**,

Operations Research Letters, Vol. 50, Issue 3, pp. 370-375, 13 May 2022. - Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi and Yoshio Okamoto,

**Shortest Reconfiguration of Perfect Matchings via Alternating Cycles**,

SIAM Journal on Discrete Mathematics, Vol. 36, Issue 2, pp. 1102-1123, 28 April 2022. - Takehiro Ito, Naoyuki Kamiyama, Yusuke Kobayashi and Yoshio Okamoto,

**Algorithms for Gerrymandering over Graphs**,

Theoretical Computer Science, Vol. 868, pp. 30-45, 8 May 2021. - Yuma Tamura, Takehiro Ito and Xiao Zhou,

**Approximability of the Independent Feedback Vertex Set Problem for Bipartite Graphs**,

Theoretical Computer Science, Vol. 849, pp. 227-236, 6 January 2021. - Takehiro Ito, Naonori Kakimura and Yusuke Kobayashi,

**Complexity of the Multi-Service Center Problem**,

Theoretical Computer Science, Vol. 842, pp. 18-27, 24 November 2020. - Marthe Bonamy, Marc Heinrich, Takehiro Ito, Yusuke Kobayashi, Haruka Mizuta, Moritz Mühlenthaler, Akira Suzuki and Kunihiro Wasa,

**Diameter of Colorings Under Kempe Changes**,

Theoretical Computer Science, Vol. 838, pp. 45-57, 24 October 2020. - Takehiro Ito, Marcin Kamiński, Hirotaka Ono, Akira Suzuki, Ryuhei Uehara and Katsuhisa Yamanaka,

**Parameterized Complexity of Independent Set Reconfiguration Problems**,

Discrete Applied Mathematics, Vol. 283, pp. 336-345, September 2020. - Tesshu Hanaka, Takehiro Ito, Haruka Mizuta, Benjamin Moore, Naomi Nishimura, Vijay Subramanya, Akira Suzuki and Krishna Vaidyanathan,

**Reconfiguring Spanning and Induced Subgraphs**,

Theoretical Computer Science, Vol. 806, pp. 553-566, February 2020. - Takehiro Ito and Yota Otachi,

**Reconfiguration of Colorable Sets in Classes of Perfect Graphs**,

Theoretical Computer Science, Vol. 772, pp. 111-122, June 2019. - Tatsuhiko Hatanaka, Takehiro Ito and Xiao Zhou,

**The Coloring Reconfiguration Problem on Specific Graph Classes**,

IEICE Transactions on Information and Systems, Vol. E102-D, No. 3, pp. 423-429, March 2019. - Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi and Yoshio Okamoto,

**Reconfiguration of Maximum-Weight b-Matchings in a Graph**,

Journal of Combinatorial Optimization, Vol. 37, Issue 2, pp. 454-464, February 2019. - Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi and Yoshio Okamoto,

**Minimum-Cost b-Edge Dominating Sets on Trees**,

Algorithmica, Vol. 81, Issue 1, pp. 343-366, January 2019. - Tatsuhiko Hatanaka, Takehiro Ito and Xiao Zhou,

**Parameterized Complexity of the List Coloring Reconfiguration Problem with Graph Parameters**,

Theoretical Computer Science, Vol. 739, pp. 65-79, August 2018. - Hiroki Osawa, Akira Suzuki, Takehiro Ito and Xiao Zhou,

**The Complexity of (List) Edge-Coloring Reconfiguration Problem**,

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, Vol. E101-A, No. 1, pp. 232-238, January 2018. - Takashi Horiyama, Takehiro Ito, Keita Nakatsuka, Akira Suzuki and Ryuhei Uehara,

**Complexity of Tiling a Polygon with Trominoes or Bars**,

Discrete & Computational Geometry, Vol. 58, Issue 3, pp. 686-704, October 2017. - Haruka Mizuta, Takehiro Ito and Xiao Zhou,

**Reconfiguration of Steiner Trees in an Unweighted Graph**,

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, Vol. E100-A, No. 7, pp. 1532-1540, July 2017. - Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi and Yoshio Okamoto,

**Efficient Stabilization of Cooperative Matching Games**,

Theoretical Computer Science, Vol. 677, pp. 69-82, May 2017. - Yusuke Aoki, Bjarni V. Halldórsson, Magnús M. Halldórsson, Takehiro Ito, Christian Konrad and Xiao Zhou,

**The Minimum Vulnerability Problem on Specific Graph Classes**,

Journal of Combinatorial Optimization, Vol. 32, Issue 4, pp. 1288-1304, November 2016. - Arash Haddadan, Takehiro Ito, Amer E. Mouawad, Naomi Nishimura, Hirotaka Ono, Akira Suzuki and Youcef Tebbal,

**The Complexity of Dominating Set Reconfiguration**,

Theoretical Computer Science, Vol. 651, pp. 37-49, October 2016. - Takehiro Ito, Hiroyuki Nooka and Xiao Zhou,

**Reconfiguration of Vertex Covers in a Graph**,

IEICE Transactions on Information and Systems, Vol. E99-D, No. 3, pp. 598-606, March 2016. - Takehiro Ito, Shin-ichi Nakano, Yoshio Okamoto, Yota Otachi, Ryuhei Uehara, Takeaki Uno and Yushi Uno,

**A Polynomial-Time Approximation Scheme for the Geometric Unique Coverage Problem on Unit Squares**,

Computational Geometry: Theory and Applications, Vol. 51, pp. 25-39, January 2016. - Erik D. Demaine, Martin L. Demaine, Eli Fox-Epstein, Duc A. Hoang, Takehiro Ito, Hirotaka Ono, Yota Otachi, Ryuhei Uehara and Takeshi Yamada,

**Linear-Time Algorithm for Sliding Tokens on Trees**,

Theoretical Computer Science, Vol. 600, pp. 132-142, October 2015. - Katsuhisa Yamanaka, Erik D. Demaine, Takehiro Ito, Jun Kawahara, Masashi Kiyomi, Yoshio Okamoto, Toshiki Saitoh, Akira Suzuki, Kei Uchizawa and Takeaki Uno,

**Swapping Labeled Tokens on Graphs**,

Theoretical Computer Science, Vol. 586, pp. 81-94, June 2015. - Yuma Tamura, Takehiro Ito and Xiao Zhou,

**Algorithms for the Independent Feedback Vertex Set Problem**,

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, Vol. E98-A, No. 6, pp. 1179-1188, June 2015. - Tatsuhiko Hatanaka, Takehiro Ito and Xiao Zhou,

**The List Coloring Reconfiguration Problem for Bounded Pathwidth Graphs**,

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, Vol. E98-A, No. 6, pp. 1168-1178, June 2015. - Takashi Hasegawa, Takehiro Ito, Akira Suzuki and Xiao Zhou,

**Experimental Evaluations of Dynamic Algorithm for Maintaining Shortest-Paths Trees on Real-World Networks**,

Interdisciplinary Information Sciences, Vol. 21, No. 1, pp. 25-35, March 2015. - Jinhee Chun, Takashi Horiyama, Takehiro Ito, Natsuda Kaothanthong, Hirotaka Ono, Yota Otachi, Takeshi Tokuyama, Ryuhei Uehara and Takeaki Uno,

**Base-Object Location Problems for Base-Monotone Regions**,

Theoretical Computer Science, Vol. 555, pp. 71-84, October 2014. - Kei Uchizawa, Takanori Aoki, Takehiro Ito and Xiao Zhou,

**Generalized Rainbow Connectivity of Graphs**,

Theoretical Computer Science, Vol. 555, pp. 35-42, October 2014. - Takehiro Ito and Erik D. Demaine,

**Approximability of the Subset Sum Reconfiguration Problem**, (erratum)

Journal of Combinatorial Optimization, Vol. 28, Issue 3, pp. 639-654, October 2014. - Yuichi Asahiro, Hiroshi Eto, Takehiro Ito and Eiji Miyano,

**Complexity of Finding Maximum Regular Induced Subgraphs with Prescribed Degree**,

Theoretical Computer Science, Vol. 550, pp. 21-35, September 2014. - Takehiro Ito, Shin-ichi Nakano, Yoshio Okamoto, Yota Otachi, Ryuhei Uehara, Takeaki Uno and Yushi Uno,

**A 4.31-Approximation for the Geometric Unique Coverage Problem on Unit Disks**,

Theoretical Computer Science, Vol. 544, pp. 14-31, August 2014. - Takehiro Ito, Kazuto Kawamura, Hirotaka Ono and Xiao Zhou,

**Reconfiguration of List L(2,1)-Labelings in a Graph**,

Theoretical Computer Science, Vol. 544, pp. 84-97, August 2014. - Taku Okada, Akira Suzuki, Takehiro Ito and Xiao Zhou,

**On the Minimum Caterpillar Problem in Digraphs**,

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, Vol. E97-A, No. 3, pp. 848-857, March 2014. - Kei Uchizawa, Takanori Aoki, Takehiro Ito, Akira Suzuki and Xiao Zhou,

**On the Rainbow Connectivity of Graphs: Complexity and FPT Algorithms**,

Algorithmica, Vol. 67, Issue 2, pp. 161-179, October 2013. - Takehiro Ito, Yuichiro Miyamoto, Hirotaka Ono, Hisao Tamaki and Ryuhei Uehara,

**Route-Enabling Graph Orientation Problems**,

Algorithmica, Vol. 65, Issue 2, pp. 317-338, February 2013. - Takehiro Ito, Takuya Hara, Xiao Zhou and Takao Nishizeki,

**Minimum Cost Partitions of Trees with Supply and Demand**,

Algorithmica, Vol. 64, Issue 3, pp. 400-415, November 2012. - Takehiro Ito, Marcin Kamiński and Erik D. Demaine,

**Reconfiguration of List Edge-Colorings in a Graph**,

Discrete Applied Mathematics, Vol. 160, Issue 15, pp. 2199-2207, October 2012. - Takehiro Ito, Takao Nishizeki, Michael Schröder, Takeaki Uno and Xiao Zhou,

**Partitioning a Weighted Tree into Subtrees with Weights in a Given Range**,

Algorithmica, Vol. 62, Issues 3-4, pp. 823-841, April 2012. - Takehiro Ito, Kazuto Kawamura and Xiao Zhou,

**An Improved Sufficient Condition for Reconfiguration of List Edge-Colorings in a Tree**,

IEICE Transactions on Information and Systems, Vol. E95-D, No. 3, pp. 737-745, March 2012. - Takehiro Ito, Marcin Kamiński, Daniël Paulusma and Dimitrios M. Thilikos,

**Parameterizing Cut Sets in a Graph by the Number of Their Components**,

Theoretical Computer Science, Vol. 412, Issue 45, pp. 6340-6350, October 2011. - Takehiro Ito, Marcin Kamiński, Daniël Paulusma and Dimitrios M. Thilikos,

**On Disconnected Cuts and Separators**,

Discrete Applied Mathematics, Vol. 159, Issue 13, pp. 1345-1351, August 2011. - Takehiro Ito, Erik D. Demaine, Nicholas J. A. Harvey, Christos H. Papadimitriou, Martha Sideri, Ryuhei Uehara and Yushi Uno,

**On the Complexity of Reconfiguration Problems**,

Theoretical Computer Science, Vol. 412, Issues 12-14, pp. 1054-1065, March 2011. - Takehiro Ito, Naoki Sakamoto, Xiao Zhou and Takao Nishizeki,

**Minimum Cost Edge-Colorings of Trees Can be Reduced to Matchings**,

IEICE Transactions on Information and Systems, Vol. E94-D, No. 2, pp. 190-195, February 2011. - Takehiro Ito, Xiao Zhou and Takao Nishizeki,

**Partitioning Graphs of Supply and Demand**,

Discrete Applied Mathematics, Vol. 157, Issue 12, pp. 2620-2633, June 2009.

(Special issue of Second Workshop on Graph Classes, Optimization, and Width Parameters, 2005) - Takehiro Ito, Erik D. Demaine, Xiao Zhou and Takao Nishizeki,

**Approximability of Partitioning Graphs with Supply and Demand**,

Journal of Discrete Algorithms, Vol. 6, No. 4, pp. 627-650, 2008. - Takehiro Ito, Akira Kato, Xiao Zhou and Takao Nishizeki,

**Algorithms for Finding Distance-Edge-Colorings of Graphs**,

Journal of Discrete Algorithms, Vol. 5, No. 2, pp. 304-322, 2007. - Takehiro Ito, Kazuya Goto, Xiao Zhou and Takao Nishizeki,

**Partitioning a Multi-Weighted Graph to Connected Subgraphs of Almost Uniform Size**,

IEICE Transactions on Information and Systems, Vol. E90-D, No. 2, pp. 449-456, 2007. - Takehiro Ito, Xiao Zhou and Takao Nishizeki,

**Partitioning a Graph of Bounded Tree-Width to Connected Subgraphs of Almost Uniform Size**,

Journal of Discrete Algorithms, Vol. 4, No. 1, pp. 142-154, 2006. - Takehiro Ito, Xiao Zhou and Takao Nishizeki,

**Partitioning Trees of Supply and Demand**,

International Journal of Foundations of Computer Science, Vol. 16, No. 4, pp. 803-827, 2005.

(This paper received Noguchi Incentive Award.) - Takehiro Ito, Takao Nishizeki and Xiao Zhou,

**Algorithms for Multicolorings of Partial k-Trees**,

IEICE Transactions on Information and Systems, Vol. E86-D, No. 2, pp. 191-200, 2003.

(This paper received the TELECOM System Technology Award for Student.)

- Takahisa Toda, Takehiro Ito, Jun Kawahara, Takehide Soh, Akira Suzuki and Junichi Teruyama,

**Solving Reconfiguration Problems of First-Order Expressible Properties of Graph Vertices with Boolean Satisfiability**,

in Proceedings of the 35th IEEE International Conference on Tools with Artificial Intelligence (ICTAI 2023),

to appear. - Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi and Yoshio Okamoto,

**Algorithmic Theory of Qubit Routing**,

in Proceedings of the 18th Algorithms and Data Structures Symposium (WADS 2023),

Lecture Notes in Computer Science, Vol. 14079, pp. 533-546, 28 July 2023.

(Montreal, Canada, July 31-August 4, 2023: Our presentation was on July 31.) - Takehiro Ito, Yuni Iwamasa, Naoyuki Kamiyama, Yasuaki Kobayashi, Yusuke Kobayashi, Shun-ichi Maezawa and Akira Suzuki,

**Reconfiguration of Time-Respecting Arborescences**,

in Proceedings of the 18th Algorithms and Data Structures Symposium (WADS 2023),

Lecture Notes in Computer Science, Vol. 14079, pp. 521-532, 28 July 2023.

(Montreal, Canada, July 31-August 4, 2023: Our presentation was on August 1.) - Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki and Yoshio Okamoto,

**Hardness of Finding Combinatorial Shortest Paths on Graph Associahedra**,

in Proceedings of the 50th EATCS International Colloquium on Automata, Languages and Programming (ICALP 2023),

Leibniz International Proceedings in Informatics, Vol. 261, 82:1-82:17, 05 July 2023.

(Paderborn, Germany, July 10-14, 2023: Our presentation was on July 12.) - Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto and Kenta Ozeki,

**Rerouting Planar Curves and Disjoint Paths**,

in Proceedings of the 50th EATCS International Colloquium on Automata, Languages and Programming (ICALP 2023),

Leibniz International Proceedings in Informatics, Vol. 261, 81:1-81:19, 05 July 2023.

(Paderborn, Germany, July 10-14, 2023: Our presentation was on July 12.) - Takehiro Ito, Yuni Iwamasa, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto and Kenta Ozeki,

**Reconfiguration of Colorings in Triangulations of the Sphere**,

in Proceedings of the 39th International Symposium on Computational Geometry (SoCG 2023),

Leibniz International Proceedings in Informatics, Vol. 258, pp. 43:1-43:16, 09 June 2023.

(Dallas, Texas, USA, June 12-15, 2023: Our presentation was on June 15.) - Takehiro Ito, Jun Kawahara, Yu Nakahata, Takehide Soh, Akira Suzuki, Junichi Teruyama and Takahisa Toda,

**ZDD-Based Algorithmic Framework for Solving Shortest Reconfiguration Problems**,

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

Lecture Notes in Computer Science, Vol. 13884, pp. 167-183, 23 May 2023.

(Nice, France, May 29-June 1, 2023: Our presentation was on May 30.) - Rin Saito, Hiroshi Eto, Takehiro Ito and Ryuhei Uehara,

**Reconfiguration of Vertex-Disjoint Shortest Paths on Graphs**,

in Proceedings of the 17th International Conference and Workshops on Algorithms and Computation (WALCOM 2023),

Lecture Notes in Computer Science, Vol. 13973, pp. 191-201, 13 March 2023.

(Hsinchu, Taiwan, March 22-24, 2023: Our presentation was on March 23.) - Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yuta Nozaki, Yoshio Okamoto and Kenta Ozeki,

**On Reachable Assignments under Dichotomous Preferences**,

in Proceedings of the 24th International Conference on Principles and Practice of Multi-Agent Systems (PRIMA 2022),

Lecture Notes in Computer Science, Vol. 13753, pp. 650-658, 12 November 2022.

(Valencia, Spain, November 16-18, 2022: Our presentation was on November 17.) - Tatsuya Gima, Takehiro Ito, Yasuaki Kobayashi and Yota Otachi,

**Algorithmic Meta-Theorems for Combinatorial Reconfiguration Revisited**,

in Proceedings of the 30th Annual European Symposium on Algorithms (ESA 2022),

Leibniz International Proceedings in Informatics, Vol. 244, pp. 61:1-61:15, 24 August 2022.

(Potsdam, Germany, September 5-7, 2022: Our presentation was on September 5.) - Takehiro Ito, Yuni Iwamasa, Yasuaki Kobayashi, Yu Nakahata, Yota Otachi, Masahiro Takahashi and Kunihiro Wasa,

**Independent Set Reconfiguration on Directed Graphs**,

in Proceedings of the 47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022),

Leibniz International Proceedings in Informatics, Vol. 241, pp. 58:1-58:15, 22 August 2022.

(Vienna, Austria, August 22-26, 2022: Our presentation was on August 26.) - Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yuta Nozaki, Yoshio Okamoto and Kenta Ozeki,

**Reforming an Envy-Free Matching**,

in Proceedings of the 36th AAAI Conference on Artificial Intelligence (AAAI 2022),

Vol. 36, No. 5, pp. 5084-5091, 28 June 2022.

(Online, February 22 - March 1, 2022: Our presentation was on February 25 and 26.) - Takehiro Ito, Jun Kawahara, Shin-ichi Minato, Yota Otachi, Toshiki Saitoh, Akira Suzuki, Ryuhei Uehara, Takeaki Uno, Katsuhisa Yamanaka and Ryo Yoshinaka,

**Sorting Balls and Water: Equivalence and Computational Complexity**,

in Proceedings of the 11th International Conference on Fun with Algorithms (FUN 2022),

Leibniz International Proceedings in Informatics, Vol. 226, pp. 16:1-16:17, 23 May 2022.

(Sicily, Italy, May 30 - June 3, 2022: Our presentation was on June 1.) - Hiroshi Eto, Takehiro Ito, Eiji Miyano, Akira Suzuki and Yuma Tamura,

**Happy Set Problem on Subclasses of Co-comparability Graphs**,

in Proceedings of the 16th International Conference and Workshops on Algorithms and Computation (WALCOM 2022),

Lecture Notes in Computer Science, Vol. 13174, pp. 149-160, 16 March 2022.

(Jember, Indonesia, March 24-26, 2022: Our presentation was on March 25.) - Hiroshi Eto, Takehiro Ito, Yasuaki Kobayashi, Yota Otachi and Kunihiro Wasa,

**Reconfiguration of Regular Induced Subgraphs**,

in Proceedings of the 16th International Conference and Workshops on Algorithms and Computation (WALCOM 2022),

Lecture Notes in Computer Science, Vol. 13174, pp. 35-46, 16 March 2022.

(Jember, Indonesia, March 24-26, 2022: Our presentation was on March 24.) - Nicolas Bousquet, Takehiro Ito, Yusuke Kobayashi, Haruka Mizuta, Paul Ouvrard, Akira Suzuki and Kunihiro Wasa,

**Reconfiguration of Spanning Trees with Degree Constraint or Diameter Constraint**,

in Proceedings of the 39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022),

Leibniz International Proceedings in Informatics, Vol. 219, pp. 15:1-15:21, 9 March 2022.

(Online, March 15-18, 2022: Our presentation was on March 18.) - Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto and Kenta Ozeki,

**Monotone Edge Flips to an Orientation of Maximum Edge-Connectivity à la Nash-Williams**,

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

pp. 1342-1355, 2022.

(Online, January 9-12, 2022: Our presentation was on January 10.) - Takehiro Ito, Yuni Iwamasa, Yasuaki Kobayashi, Yu Nakahata, Yota Otachi and Kunihiro Wasa,

**Reconfiguring Directed Trees in a Digraph**,

in Proceedings of the 27th International Computing and Combinatorics Conference (COCOON 2021),

Lecture Notes in Computer Science, Vol. 13025, pp. 343-354, 20 October 2021.

(Taiwan, October 24-26, 2021: Our presentation was on October 26.) - Yuma Tamura, Takehiro Ito and Xiao Zhou,

**Minimization and Parameterized Variants of Vertex Partition Problems on Graphs**,

in Proceedings of the 31st International Symposium on Algorithms and Computation (ISAAC 2020),

Leibniz International Proceedings in Informatics, Vol. 181, pp. 40:1-40:13, 4 December 2020.

(Hong Kong, December 14-18, 2020: Our presentation was on December 16.) - Tatsuhiko Hatanaka, Felix Hommelsheim, Takehiro Ito, Yusuke Kobayashi, Moritz Mühlenthaler and Akira Suzuki,

**Fixed-Parameter Algorithms for Graph Constraint Logic**,

in Proceedings of the 15th International Symposium on Parameterized and Exact Computation (IPEC 2020),

Leibniz International Proceedings in Informatics, Vol. 180, pp. 15:1-15:15, 4 December 2020.

(Hong Kong, December 14-18, 2020: Our presentation was on December 16.) - Nicolas Bousquet, Takehiro Ito, Yusuke Kobayashi, Haruka Mizuta, Paul Ouvrard, Akira Suzuki and Kunihiro Wasa,

**Reconfiguration of Spanning Trees with Many or Few Leaves**,

in Proceedings of the 28th Annual European Symposium on Algorithms (ESA 2020),

Leibniz International Proceedings in Informatics, Vol. 173, pp. 24:1-24:15, 26 August 2020.

(Pisa, Italy, September 7-9, 2020: Our presentation was on September 7.) - Yuma Tamura, Takehiro Ito and Xiao Zhou,

**Approximability of the Independent Feedback Vertex Set Problem for Bipartite Graphs**,

in Proceedings of the 14th International Conference and Workshops on Algorithms and Computation (WALCOM 2020),

Lecture Notes in Computer Science, Vol. 12049, pp. 286-295, 2020.

(Singapore, March 31 - April 2, 2020: Our presentation was on April 2.) - Marthe Bonamy, Marc Heinrich, Takehiro Ito, Yusuke Kobayashi, Haruka Mizuta, Moritz Mühlenthaler, Akira Suzuki and Kunihiro Wasa,

**Shortest Reconfiguration of Colorings Under Kempe Changes**,

in Proceedings of the 37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020),

Leibniz International Proceedings in Informatics, Vol. 154, pp. 35:1-35:14, 2020.

(Montpellier, France, March 10-13, 2020: Our presentation was on March 12.) - Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi and Yoshio Okamoto,

**Shortest Reconfiguration of Perfect Matchings via Alternating Cycles**,

in Proceedings of the 27th Annual European Symposium on Algorithms (ESA 2019),

Leibniz International Proceedings in Informatics, Vol. 144, pp. 61:1-61:15, 2019.

(Munich, Germany, September 9-11, 2019: Our presentation was on September 9.) - Marthe Bonamy, Nicolas Bousquet, Marc Heinrich, Takehiro Ito, Yusuke Kobayashi, Arnaud Mary, Moritz Mühlenthaler and Kunihiro Wasa,

**The Perfect Matching Reconfiguration Problem**,

in Proceedings of the 44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019),

Leibniz International Proceedings in Informatics, Vol. 138, pp. 80:1-80:14, 2019.

(Aachen, Germany, August 26-30, 2019: Our presentation was on August 30.) - Haruka Mizuta, Tatsuhiko Hatanaka, Takehiro Ito and Xiao Zhou,

**Reconfiguration of Minimum Steiner Trees via Vertex Exchanges**,

in Proceedings of the 44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019),

Leibniz International Proceedings in Informatics, Vol. 138, pp. 79:1-79:11, 2019.

(Aachen, Germany, August 26-30, 2019: Our presentation was on August 30.) - Takehiro Ito, Haruka Mizuta, Naomi Nishimura and Akira Suzuki,

**Incremental Optimization of Independent Sets Under the Reconfiguration Framework**,

in Proceedings of the 25th International Computing and Combinatorics Conference (COCOON 2019),

Lecture Notes in Computer Science, Vol. 11653, pp. 313-324, 2019.

(Xian, China, July 29-31, 2019: Our presentation was on July 29.) - Marthe Bonamy, Marc Heinrich, Takehiro Ito, Yusuke Kobayashi, Haruka Mizuta, Moritz Mühlenthaler, Akira Suzuki and Kunihiro Wasa,

**Diameter of Colorings Under Kempe Changes**,

in Proceedings of the 25th International Computing and Combinatorics Conference (COCOON 2019),

Lecture Notes in Computer Science, Vol. 11653, pp. 52-64, 2019.

(Xian, China, July 29-31, 2019: Our presentation was on July 30.) - Nicolas Bousquet, Tatsuhiko Hatanaka, Takehiro Ito and Moritz Mühlenthaler,

**Shortest Reconfiguration of Matchings**,

in Proceedings of the 45th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2019),

Lecture Notes in Computer Science, Vol. 11789, pp. 162-174, 2019.

(Vall de Núria, Catalonia, Spain, June 19-21, 2019: Our presentation was on June 21.) - Takehiro Ito, Naoyuki Kamiyama, Yusuke Kobayashi and Yoshio Okamoto,

**Algorithms for Gerrymandering over Graphs**,

in Proceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems (AAMAS 2019),

pp. 1413-1421, 2019.

(Montreal, QC, Canada, May 13-17, 2019: Our presentation was on May 17.) - Hiroki Osawa, Akira Suzuki, Takehiro Ito and Xiao Zhou,

**Algorithms for Coloring Reconfiguration Under Recolorability Constraints**,

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

Leibniz International Proceedings in Informatics, Vol. 123, pp. 37:1-37:13, 2018.

(Jiaoxi, Taiwan, December 16-19, 2018: Our presentation was on December 18.) - Tesshu Hanaka, Takehiro Ito, Haruka Mizuta, Benjamin Moore, Naomi Nishimura, Vijay Subramanya, Akira Suzuki and Krishna Vaidyanathan,

**Reconfiguring Spanning and Induced Subgraphs**,

in Proceedings of the 24th Annual International Computing and Combinatorics Conference (COCOON 2018),

Lecture Notes in Computer Science, Vol. 10976, pp. 428-440, 2018.

(Qingdao, China, July 2-4, 2018: Our presentation was on July 3.) - Takehiro Ito and Yota Otachi,

**Reconfiguration of Colorable Sets in Classes of Perfect Graphs**,

in Proceedings of the 16th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2018),

Leibniz International Proceedings in Informatics, Vol. 101, pp. 27:1-27:13, 2018.

(Malmö, Sweden, June 18-20, 2018: Our presentation was on June 18.) - Tatsuhiko Hatanaka, Takehiro Ito and Xiao Zhou,

**The Coloring Reconfiguration Problem on Specific Graph Classes**,

in Proceedings of the 11th Annual International Conference on Combinatorial Optimization and Applications (COCOA 2017),

Lecture Notes in Computer Science, Vol. 10627, pp. 152-162, 2017.

(Shanghai, China, December 16-18, 2017: Our presentation was on December 17.) - Takehiro Ito, Naonori Kakimura and Yusuke Kobayashi,

**Complexity of the Multi-Service Center Problem**,

in Proceedings of the 28th International Symposium on Algorithms and Computation (ISAAC 2017),

Leibniz International Proceedings in Informatics, Vol. 92, pp. 48:1-48:12, 2017.

(Phuket, Thailand, December 10-12, 2017: Our presentation was on December 11.) - Hiroki Osawa, Akira Suzuki, Takehiro Ito and Xiao Zhou,

**Complexity of Coloring Reconfiguration under Recolorability Constraints**,

in Proceedings of the 28th International Symposium on Algorithms and Computation (ISAAC 2017),

Leibniz International Proceedings in Informatics, Vol. 92, pp. 62:1-62:12, 2017.

(Phuket, Thailand, December 10-12, 2017: Our presentation was on December 10.) - Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto and Taichi Shiitada,

**Tight Approximability of the Server Allocation Problem for Real-Time Applications**,

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

Lecture Notes in Computer Science, Vol. 10739, pp. 41-55, 2018.

(Vienna, Austria, September 5, 2017: Our presentation was on September 5.) - Tatsuhiko Hatanaka, Takehiro Ito and Xiao Zhou,

**Parameterized Complexity of the List Coloring Reconfiguration Problem with Graph Parameters**,

in Proceedings of the 42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017),

Leibniz International Proceedings in Informatics, Vol. 83, pp. 51:1-51:13, 2017.

(Aalborg, Denmark, August 21-25, 2017: Our presentation was on August 22.) - Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi and Yoshio Okamoto,

**Reconfiguration of Maximum-Weight b-Matchings in a Graph**,

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

Lecture Notes in Computer Science, Vol. 10392, pp. 287-296, 2017.

(Hong Kong, China, August 3-5, 2017: Our presentation was on August 4.) - Hiroki Osawa, Akira Suzuki, Takehiro Ito and Xiao Zhou,

**The Complexity of (List) Edge-Coloring Reconfiguration Problem**,

in Proceedings of the 11th International Conference and Workshops on Algorithms and Computation (WALCOM 2017),

Lecture Notes in Computer Science, Vol. 10167, pp. 347-358, 2017.

(Hsinchu, Taiwan, March 29-31, 2017: Our presentation was on March 30.) - Hiroshi Eto, Takehiro Ito, Zhilong Liu and Eiji Miyano,

**Approximation Algorithm for the Distance-3 Independent Set Problem on Cubic Graphs**,

in Proceedings of the 11th International Conference and Workshops on Algorithms and Computation (WALCOM 2017),

Lecture Notes in Computer Science, Vol. 10167, pp. 228-240, 2017.

(Hsinchu, Taiwan, March 29-31, 2017: Our presentation was on March 30.) - Hiroshi Eto, Takehiro Ito, Zhilong Liu and Eiji Miyano,

**Approximability of the Distance Independent Set Problem on Regular Graphs and Planar Graphs**,

in Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA 2016),

Lecture Notes in Computer Science, Vol. 10043, pp. 270-284, 2016.

(Hong Kong, China, December 16-18, 2016: Our presentation was on December 17.) - Haruka Mizuta, Takehiro Ito and Xiao Zhou,

**Reconfiguration of Steiner Trees in an Unweighted Graph**,

in Proceedings of the 27th International Workshop on Combinatorial Algorithms (IWOCA 2016),

Lecture Notes in Computer Science, Vol. 9843, pp. 163-175, 2016.

(Helsinki, Finland, August 17-19, 2016: Our presentation was on August 17.) - Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi and Yoshio Okamoto,

**Efficient Stabilization of Cooperative Matching Games**,

in Proceedings of the 15th International Conference on Autonomous Agents and Multi-Agent Systems (AAMAS 2016),

pp. 41-49, 2016.

(Singapore, May 9-13, 2016: Our presentation was on May 11.) - Takehiro Ito, Yota Otachi, Toshiki Saitoh, Hisayuki Satoh, Akira Suzuki, Kei Uchizawa, Ryuhei Uehara, Katsuhisa Yamanaka and Xiao Zhou,

**Competitive Diffusion on Weighted Graphs**,

in Proceedings of the 14th Algorithms and Data Structures Symposium (WADS 2015),

Lecture Notes in Computer Science, Vol. 9214, pp. 422-433, 2015.

(Victoria, BC, Canada, August 5-7, 2015: Our presentation was on August 6.) - Arash Haddadan, Takehiro Ito, Amer E. Mouawad, Naomi Nishimura, Hirotaka Ono, Akira Suzuki and Youcef Tebbal,

**The Complexity of Dominating Set Reconfiguration**,

in Proceedings of the 14th Algorithms and Data Structures Symposium (WADS 2015),

Lecture Notes in Computer Science, Vol. 9214, pp. 398-409, 2015.

(Victoria, BC, Canada, August 5-7, 2015: Our presentation was on August 5.) - Takehiro Ito, Hirotaka Ono and Yota Otachi,

**Reconfiguration of Cliques in a Graph**,

in Proceedings of the 12th Annual Conference on Theory and Applications of Models of Computation (TAMC 2015),

Lecture Notes in Computer Science, Vol. 9076, pp. 212-223, 2015.

(Singapore, May 18-20, 2015: Our presentation was on May 19.) - Tatsuhiko Hatanaka, Takehiro Ito and Xiao Zhou,

**The List Coloring Reconfiguration Problem for Bounded Pathwidth Graphs**,

in Proceedings of the 8th Annual International Conference on Combinatorial Optimization and Applications (COCOA 2014),

Lecture Notes in Computer Science, Vol. 8881, pp. 314-328, 2014.

(Maui, Hawaii, USA, December 19-21, 2014: Our presentation was on December 20.) - Yusuke Aoki, Bjarni V. Halldórsson, Magnús M. Halldórsson, Takehiro Ito, Christian Konrad and Xiao Zhou,

**The Minimum Vulnerability Problem on Graphs**,

in Proceedings of the 8th Annual International Conference on Combinatorial Optimization and Applications (COCOA 2014),

Lecture Notes in Computer Science, Vol. 8881, pp. 299-313, 2014.

(Maui, Hawaii, USA, December 19-21, 2014: Our presentation was on December 20.) - Erik D. Demaine, Martin L. Demaine, Eli Fox-Epstein, Duc A. Hoang, Takehiro Ito, Hirotaka Ono, Yota Otachi, Ryuhei Uehara and Takeshi Yamada,

**Polynomial-Time Algorithm for Sliding Tokens on Trees**,

in Proceedings of the 25th Annual International Symposium on Algorithms and Computation (ISAAC 2014),

Lecture Notes in Computer Science, Vol. 8889, pp. 389-400, 2014.

(Jeonju, Korea, December 15-17, 2014: Our presentation was on December 16.) - Takehiro Ito, Marcin Kamiński and Hirotaka Ono,

**Fixed-Parameter Tractability of Token Jumping on Planar Graphs**,

in Proceedings of the 25th Annual International Symposium on Algorithms and Computation (ISAAC 2014),

Lecture Notes in Computer Science, Vol. 8889, pp. 208-219, 2014.

(Jeonju, Korea, December 15-17, 2014: Our presentation was on December 15.) - Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi and Yoshio Okamoto,

**Minimum-Cost b-Edge Dominating Sets on Trees**,

in Proceedings of the 25th Annual International Symposium on Algorithms and Computation (ISAAC 2014),

Lecture Notes in Computer Science, Vol. 8889, pp. 195-207, 2014.

(Jeonju, Korea, December 15-17, 2014: Our presentation was on December 15.) - Yuma Tamura, Takehiro Ito and Xiao Zhou,

**Deterministic Algorithms for the Independent Feedback Vertex Set Problem**,

in Proceedings of the 25th International Workshop on Combinatorial Algorithms (IWOCA 2014),

Lecture Notes in Computer Science, Vol. 8986, pp. 351-363, 2015.

(Duluth, Minnesota, USA, October 15-17, 2014: Our presentation was on October 17.) - Takehiro Ito, Hiroyuki Nooka and Xiao Zhou,

**Reconfiguration of Vertex Covers in a Graph**,

in Proceedings of the 25th International Workshop on Combinatorial Algorithms (IWOCA 2014),

Lecture Notes in Computer Science, Vol. 8986, pp. 164-175, 2015.

(Duluth, Minnesota, USA, October 15-17, 2014: Our presentation was on October 15.) - Katsuhisa Yamanaka, Erik D. Demaine, Takehiro Ito, Jun Kawahara, Masashi Kiyomi, Yoshio Okamoto, Toshiki Saitoh, Akira Suzuki, Kei Uchizawa and Takeaki Uno,

**Swapping Labeled Tokens on Graphs**,

in Proceedings of the 7th International Conference on FUN with Algorithms (FUN 2014),

Lecture Notes in Computer Science, Vol. 8496, pp. 364-375, 2014.

(Lipari Island, Sicily, Italy, July 1-3, 2014: Our presentation was on July 2.) - Takehiro Ito, Marcin Kamiński, Hirotaka Ono, Akira Suzuki, Ryuhei Uehara and Katsuhisa Yamanaka,

**On the Parameterized Complexity for Token Jumping on Graphs**,

in Proceedings of the 11th Annual Conference on Theory and Applications of Models of Computation (TAMC 2014),

Lecture Notes in Computer Science, Vol. 8402, pp. 341-351, 2014.

(Chennai, India, April 11-13, 2014: Our presentation was on April 12.) - Yuichi Asahiro, Hiroshi Eto, Takehiro Ito and Eiji Miyano,

**Complexity of Finding Maximum Regular Induced Subgraphs with Prescribed Degree**,

in Proceedings of the 19th International Symposium on Fundamentals of Computation Theory (FCT 2013),

Lecture Notes in Computer Science, Vol. 8070, pp. 28-39, 2013.

(Liverpool, United Kingdom, August 19-21, 2013: Our presentation was on August 19.) - Taku Okada, Akira Suzuki, Takehiro Ito and Xiao Zhou,

**On the Minimum Caterpillar Problem in Digraphs**,

in Proceedings of the 19th Annual International Computing and Combinatorics Conference (COCOON 2013),

Lecture Notes in Computer Science, Vol. 7936, pp. 729-736, 2013. - Kei Uchizawa, Takanori Aoki, Takehiro Ito and Xiao Zhou,

**Generalized Rainbow Connectivity of Graphs**,

in Proceedings of the 7th International Workshop on Algorithms and Computation (WALCOM 2013),

Lecture Notes in Computer Science, Vol. 7748, pp. 233-244, 2013. - Jinhee Chun, Takashi Horiyama, Takehiro Ito, Natsuda Kaothanthong, Hirotaka Ono, Yota Otachi, Takeshi Tokuyama, Ryuhei Uehara and Takeaki Uno,

**Base Location Problems for Base-Monotone Regions**,

in Proceedings of the 7th International Workshop on Algorithms and Computation (WALCOM 2013),

Lecture Notes in Computer Science, Vol. 7748, pp. 53-64, 2013. - Takehiro Ito, Shin-ichi Nakano, Yoshio Okamoto, Yota Otachi, Ryuhei Uehara, Takeaki Uno and Yushi Uno,

**A 4.31-Approximation for the Geometric Unique Coverage Problem on Unit Disks**,

in Proceedings of the 23rd Annual International Symposium on Algorithms and Computation (ISAAC 2012),

Lecture Notes in Computer Science, Vol. 7676, pp. 372-381, 2012. - Takehiro Ito, Kazuto Kawamura, Hirotaka Ono and Xiao Zhou,

**Reconfiguration of List L(2,1)-Labelings in a Graph**,

in Proceedings of the 23rd Annual International Symposium on Algorithms and Computation (ISAAC 2012),

Lecture Notes in Computer Science, Vol. 7676, pp. 34-43, 2012. - Jinhee Chun, Takashi Horiyama, Takehiro Ito, Natsuda Kaothanthong, Hirotaka Ono, Yota Otachi, Takeshi Tokuyama, Ryuhei Uehara and Takeaki Uno,

**Algorithms for Computing Optimal Image Segmentation Using Quadtree Decomposition**,

in Proceedings of Thailand-Japan Joint Conference on Computational Geometry and Graphs (TJJCCGG 2012),

pp. 23-24, 2012.

(* This paper is on experimental results of the algorithms in our paper in WALCOM 2013.) - Takashi Horiyama, Takehiro Ito, Keita Nakatsuka, Akira Suzuki and Ryuhei Uehara,

**Packing Trominoes is NP-Complete, #P-Complete and ASP-Complete**,

in Proceedings of the 24th Canadian Conference on Computational Geometry (CCCG 2012),

pp. 219-224, 2012. - Takehiro Ito, Shin-ichi Nakano, Yoshio Okamoto, Yota Otachi, Ryuhei Uehara, Takeaki Uno and Yushi Uno,

**A Polynomial-Time Approximation Scheme for the Geometric Unique Coverage Problem on Unit Squares**,

in Proceedings of the 13th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2012),

Lecture Notes in Computer Science, Vol. 7357, pp. 24-35, 2012. - Kei Uchizawa, Takanori Aoki, Takehiro Ito, Akira Suzuki and Xiao Zhou,

**On the Rainbow Connectivity of Graphs: Complexity and FPT Algorithms**,

in Proceedings of the 17th Annual International Computing and Combinatorics Conference (COCOON 2011),

Lecture Notes in Computer Science, Vol. 6842, pp. 86-97, 2011. - Takehiro Ito, Kazuto Kawamura and Xiao Zhou,

**An Improved Sufficient Condition for Reconfiguration of List Edge-Colorings in a Tree**,

in Proceedings of the 8th Annual Conference on Theory and Applications of Models of Computation (TAMC 2011),

Lecture Notes in Computer Science, Vol. 6648, pp. 94-105, 2011. - Takehiro Ito and Erik D. Demaine,

**Approximability of the Subset Sum Reconfiguration Problem**, (erratum)

in Proceedings of the 8th Annual Conference on Theory and Applications of Models of Computation (TAMC 2011),

Lecture Notes in Computer Science, Vol. 6648, pp. 58-69, 2011. - Takehiro Ito, Takuya Hara, Xiao Zhou and Takao Nishizeki,

**Minimum Cost Partitions of Trees with Supply and Demand**,

in Proceedings (Part II) of the 21st Annual International Symposium on Algorithms and Computation (ISAAC 2010),

Lecture Notes in Computer Science, Vol. 6507, pp. 351-362, 2010. - Takehiro Ito, Naoki Sakamoto, Xiao Zhou and Takao Nishizeki,

**Minimum Cost Edge-Colorings of Trees Can be Reduced to Matchings**,

in Proceedings of the 4th International Frontiers of Algorithmics Workshop (FAW 2010),

Lecture Notes in Computer Science, Vol. 6213, pp. 274-284, 2010. - Takehiro Ito, Yuichiro Miyamoto, Hirotaka Ono, Hisao Tamaki and Ryuhei Uehara,

**Route-Enabling Graph Orientation Problems**,

in Proceedings of the 20th Annual International Symposium on Algorithms and Computation (ISAAC 2009),

Lecture Notes in Computer Science, Vol. 5878, pp. 403-412, 2009. - Takehiro Ito, Marcin Kamiński, Daniël Paulusma and Dimitrios M. Thilikos,

**Parameterizing Cut Sets in a Graph by the Number of Their Components**,

in Proceedings of the 20th Annual International Symposium on Algorithms and Computation (ISAAC 2009),

Lecture Notes in Computer Science, Vol. 5878, pp. 605-615, 2009. - Takehiro Ito, William S. Kennedy and Bruce A. Reed,

**A Characterization of Graphs with Fractional Total Chromatic Number Equal to Δ+2**,

in Proceedings of the V Latin-American Algorithms, Graphs and Optimization Symposium (LAGOS 2009),

Electronic Notes in Discrete Mathematics, Vol. 35, pp. 235-240, 2009. - Takehiro Ito, Marcin Kamiński and Erik D. Demaine,

**Reconfiguration of List Edge-Colorings in a Graph**,

in Proceedings of the 11th Algorithms and Data Structures Symposium (WADS 2009),

Lecture Notes in Computer Science Vol. 5664, pp. 375-386, 2009. - Takehiro Ito, Takeaki Uno, Xiao Zhou and Takao Nishizeki,

**Partitioning a Weighted Tree to Subtrees of Almost Uniform Size**,

in Proceedings of the 19th Annual International Symposium on Algorithms and Computation (ISAAC 2008),

Lecture Notes in Computer Science Vol. 5369, pp. 196-207, 2008.

(This paper received the Best Paper Award from ISAAC 2008.) - Takehiro Ito, Erik D. Demaine, Nicholas J. A. Harvey, Christos H. Papadimitriou, Martha Sideri, Ryuhei Uehara and Yushi Uno,

**On the Complexity of Reconfiguration Problems**,

in Proceedings of the 19th Annual International Symposium on Algorithms and Computation (ISAAC 2008),

Lecture Notes in Computer Science Vol. 5369, pp. 28-39, 2008. - Takehiro Ito, Erik D. Demaine, Xiao Zhou and Takao Nishizeki,

**Approximability of Partitioning Graphs with Supply and Demand**,

in Proceedings of the 17th Annual International Symposium on Algorithms and Computation (ISAAC 2006),

Lecture Notes in Computer Science Vol. 4288, pp. 121-130, 2006. - Takehiro Ito, Kazuya Goto, Xiao Zhou and Takao Nishizeki,

**Partitioning a Multi-weighted Graph to Connected Subgraphs of Almost Uniform Size**,

in Proceedings of the 12th Annual International Computing and Combinatorics Conference (COCOON 2006),

Lecture Notes in Computer Science Vol. 4112, pp. 63-72, 2006. - Takehiro Ito, Akira Kato, Xiao Zhou and Takao Nishizeki,

**Algorithms for Finding Distance-Edge-Colorings of Graphs**,

in Proceedings of the 11th Annual International Computing and Combinatorics Conference (COCOON 2005),

Lecture Notes in Computer Science Vol. 3595, pp. 798-807, 2005. - Takehiro Ito, Xiao Zhou and Takao Nishizeki,

**Partitioning Graphs of Supply and Demand**,

in Proceedings of the 2005 IEEE International Symposium on Circuits and Systems (ISCAS 2005),

pp. 160-163, 2005. - Takehiro Ito, Xiao Zhou and Takao Nishizeki,

**Partitioning a Weighted Graph to Connected Subgraphs of Almost Uniform Size**,

in Proceedings of the 30th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2004),

Lecture Notes in Computer Science Vol. 3353, pp. 365-376, 2004. - Takehiro Ito, Xiao Zhou and Takao Nishizeki,

**Partitioning Trees of Supply and Demand**,

in Proceedings of the 13th Annual International Symposium on Algorithms and Computation (ISAAC 2002),

Lecture Notes in Computer Science Vol. 2518, pp. 612-623, 2002.

(This paper received the Young C&C Author's Prize.) - Takehiro Ito, Takao Nishizeki and Xiao Zhou,

**Algorithms for the Multicolorings of Partial k-Trees**,

in Proceedings of the 8th Annual International Computing and Combinatorics Conference (COCOON 2002),

Lecture Notes in Computer Science Vol. 2387, pp. 430-439, 2002.

- Takehiro Ito,

**Invitation to Combinatorial Reconfiguration**,

The 33rd Annual Symposium on Combinatorial Pattern Matching (CPM 2022).

(Prague, Czech Republic, June 27-29, 2022: Our presentation was on June 29.) - Takehiro Ito,

**Invitation to Combinatorial Reconfiguration**,

The 4th International Workshop on Combinatorial Reconfiguration (CoRe 2022),

in Banff International Research Station (BIRS) for Mathematical Innovation and Discovery.

(Banff, Alberta, Canada, May 9-13, 2022: Our presentation was on May 9.) - Takehiro Ito,

**Invitation to Combinatorial Reconfiguration**,

The 16th International Conference and Workshops on Algorithms and Computation (WALCOM 2022).

(Jember, Indonesia, March 24-26, 2022: Our presentation was on March 25.) - Takehiro Ito,

**Invitation to Combinatorial Reconfiguration**,

2018 SIAM Conference on Discrete Mathematics (DM 18),

MS23: Reconfiguration Problems.

(Denver, Colorado, USA, June 4-8, 2018: Our presentation was on June 6.) - Takehiro Ito,

**Invitation to Combinatorial Reconfiguration**,

The 2nd International Workshop on Combinatorial Reconfiguration (CoRe 2017),

in Banff International Research Station (BIRS) for Mathematical Innovation and Discovery.

(Banff, Alberta, Canada, January 23-27, 2017: Our presentation was on January 23.) - Takehiro Ito,

**Invitation to Combinatorial Reconfiguration**,

2016 SIAM Conference on Discrete Mathematics (DM 16),

MS20: Combinatorial Reconfiguration.

(Atlanta, Georgia, USA, June 6-10, 2016: Our presentation was on June 7.) - Takehiro Ito,

**Partitioning Graphs of Supply and Demand**,

Workshop on Algorithms and Computation 2007 (WALCOM 2007),

Dhaka, People's Republic of Bangladesh, February 12, 2007.

- Takehiro Ito,

**Invitation to Combinatorial Reconfiguration**(Invited Talk),

in Proceedings of the 33rd Annual Symposium on Combinatorial Pattern Matching (CPM 2022).

Leibniz International Proceedings in Informatics, Vol. 223, p. 1:1, 22 June 2022.

(Prague, Czech Republic, June 27-29, 2022: Our presentation was on June 29.) - Takehiro Ito,

**Invitation to Combinatorial Reconfiguration**,

in Proceedings of the 16th International Conference and Workshops on Algorithms and Computation (WALCOM 2022),

Lecture Notes in Computer Science, Vol. 13174, pp. 26-31, 16 March 2022.

(Jember, Indonesia, March 24-26, 2022: Our presentation was on March 25.) - Toshimitsu Anzai, Takehiro Ito, Akira Suzuki and Xiao Zhou,

**The Multi-Service Center Decision Problem is NP-Complete for Split Graphs**,

Presented in the 6th World Congress on Engineering and Technology (CET 2016),

Paper ID 80060, 2016.

(Shanghai, China, October 21-23, 2016: Our presentation was on October 23.) - Yuichi Asahiro, Hiroshi Eto, Takehiro Ito and Eiji Miyano,

**Regular Induced Subgraphs in Bipartite and Planar Graphs**,

in Proceedings of the 19th Japan-Korea Joint Workshop on Algorithms and Computation (WAAC 2016),

Paper Number 43, 2016.

(Hakodate, Japan, August 30-31, 2016: Our presentation was on August 31.) - Haruka Mizuta, Takehiro Ito and Xiao Zhou,

**Reachability between Steiner Trees in a Graph**,

in Proceedings of the 9th Annual Meeting of Asian Association for Algorithms and Computation (AAAC 2016),

Session B1, 2016.

(Taipei, Taiwan, May 14-16, 2016: Our presentation was on May 15.) - Yuma Tamura, Takehiro Ito and Xiao Zhou,

**The Independent Feedback Vertex Set Problem**,

in Proceedings of the 17th Korea-Japan Joint Workshop on Algorithms and Computation (WAAC 2014),

pp. 11-18, 2014.

(Okinawa, Japan, July 13-15, 2014: Our presentation was on July 13.) - Yuichi Asahiro, Hiroshi Eto, Takehiro Ito and Eiji Miyano,

**Maximum r-Regular Induced Subgraph Problems for Chordal Bipartite Graphs**,

in Proceedings of the 7th Annual Meeting of Asian Association for Algorithms and Computation (AAAC 2014),

p. 18, 2014.

(Hangzhou, China, May 17-19, 2014: Our presentation was on May 17.) - Taku Okada, Akira Suzuki, Takehiro Ito and Xiao Zhou,

**Algorithm for the Minimum Caterpillar Problem with Terminals**,

in Proceedings of the 6th Annual Meeting of Asian Association for Algorithms and Computation (AAAC 2013),

p. 25, 2013. - Takehiro Ito,

**Partitioning Graphs of Supply and Demand**,

in Proceedings of Workshop on Algorithms and Computation 2007 (WALCOM 2007),

pp. 162-179, 2007. - Takehiro Ito, Yoshio Okamoto and Takeshi Tokuyama,

**Algorithms for the Full Steiner Tree Problem**,

in Proceedings of ICALP 2006 Affiliated Workshop "Improving Exponential Time Algorithms," (iETA),

pp. 39-45, 2006. - Takehiro Ito, Xiao Zhou and Takao Nishizeki,

**Algorithm for Partitioning Graphs of Bounded Tree-Width of Supply and Demand**,

in Proceedings of the 4th Japanese-Hungarian Symposium on Discrete Mathematics and its Applications (JH 2005),

pp. 114-121, 2005.

Last Updated: October 18, 2023

HOME