Energy-Efficient Threshold Circuits Computing Mod Functions. - Akira Suzuki 001; Kei Uchizawa; Xiao Zhou 001 (CATS, 2011)

On the Rainbow Connectivity of Graphs: Complexity and FPT Algorithms. - Kei Uchizawa; Takanori Aoki; Takehiro Ito; Akira Suzuki 001; Xiao Zhou 001 (COCOON, 2011)

Energy and Fan-In of Threshold Circuits Computing Mod Functions. - Akira Suzuki 001; Kei Uchizawa; Xiao Zhou 001 (TAMC, 2011)

Packing Trominoes is NP-Complete, #P-Complete and ASP-Complete. - Takashi Horiyama; Takehiro Ito; Keita Nakatsuka; Akira Suzuki 001; Ryuhei Uehara (CCCG, 2012)

Hitori Number. - Akira Suzuki 001; Kei Uchizawa; Takeaki Uno (FUN, 2012)

On the Minimum Caterpillar Problem in Digraphs. - Taku Okada; Akira Suzuki 001; Takehiro Ito; Xiao Zhou 001 (COCOON, 2013)

On the Parameterized Complexity of Reconfiguration Problems. - Amer E. Mouawad; Naomi Nishimura; Venkatesh Raman 001; Narges Simjour; Akira Suzuki 001 (IPEC, 2013)

Energy-Efficient Threshold Circuits Detecting Global Pattern in 1-Dimentional Arrays. - Akira Suzuki 001; Kei Uchizawa; Xiao Zhou 001 (TAMC, 2013)

Energy and fan-in of logic circuits computing symmetric Boolean functions. - Akira Suzuki 001; Kei Uchizawa; Xiao Zhou 001 (Theor. Comput. Sci., 2013)

Reconfiguration of Dominating Sets. - Akira Suzuki 001; Amer E. Mouawad; Naomi Nishimura (COCOON, 2014)

Swapping Labeled Tokens on Graphs. - Katsuhisa Yamanaka; Erik D. Demaine; Takehiro Ito; Jun Kawahara; Masashi Kiyomi; Yoshio Okamoto; Toshiki Saitoh; Akira Suzuki 001; Kei Uchizawa; Takeaki Uno (FUN, 2014)

On the Parameterized Complexity for Token Jumping on Graphs. - Takehiro Ito; Marcin Kaminski 001; Hirotaka Ono 001; Akira Suzuki 001; Ryuhei Uehara; Katsuhisa Yamanaka (TAMC, 2014)

Computational Complexity of Competitive Diffusion on (Un)weighted Graphs. - Takehiro Ito; Yota Otachi; Toshiki Saitoh; Hisayuki Satoh; Akira Suzuki 001; Kei Uchizawa; Ryuhei Uehara; Katsuhisa Yamanaka; Xiao Zhou 001 (CoRR, 2014)

The Complexity of Dominating Set Reconfiguration. - Arash Haddadan; Takehiro Ito; Amer E. Mouawad; Naomi Nishimura; Hirotaka Ono 001; Akira Suzuki 001; Youcef Tebbal (WADS, 2015)

Competitive Diffusion on Weighted Graphs. - Takehiro Ito; Yota Otachi; Toshiki Saitoh; Hisayuki Satoh; Akira Suzuki 001; Kei Uchizawa; Ryuhei Uehara; Katsuhisa Yamanaka; Xiao Zhou 001 (WADS, 2015)

Complexity of Coloring Reconfiguration under Recolorability Constraints. - Hiroki Osawa; Akira Suzuki 001; Takehiro Ito; Xiao Zhou 001 (ISAAC, 2017)

The Complexity of (List) Edge-Coloring Reconfiguration Problem. - Hiroki Osawa; Akira Suzuki 001; Takehiro Ito; Xiao Zhou 001 (WALCOM, 2017)

Sequentially Swapping Colored Tokens on Graphs. - Katsuhisa Yamanaka; Erik D. Demaine; Takashi Horiyama; Akitoshi Kawamura; Shin-Ichi Nakano; Yoshio Okamoto; Toshiki Saitoh; Akira Suzuki 001; Ryuhei Uehara; Takeaki Uno (WALCOM, 2017)

Complexity of Tiling a Polygon with Trominoes or Bars. - Takashi Horiyama; Takehiro Ito; Keita Nakatsuka; Akira Suzuki 001; Ryuhei Uehara (Discret. Comput. Geom., 2017)

Hitori Numbers. - Akira Suzuki 001; Masashi Kiyomi; Yota Otachi; Kei Uchizawa; Takeaki Uno (J. Inf. Process., 2017)

Reconfiguring Spanning and Induced Subgraphs. - Tesshu Hanaka; Takehiro Ito; Haruka Mizuta; Benjamin R. Moore; Naomi Nishimura; Vijay Subramanya; Akira Suzuki 001; Krishna Vaidyanathan (COCOON, 2018)

Algorithms for Coloring Reconfiguration Under Recolorability Constraints. - Hiroki Osawa; Akira Suzuki 001; Takehiro Ito; Xiao Zhou 001 (ISAAC, 2018)

Incremental Optimization of Independent Sets under Reachability Constraints. - Takehiro Ito; Haruka Mizuta; Naomi Nishimura; Akira Suzuki 001 (CoRR, 2018)

Computational Power of Threshold Circuits of Energy at most Two. - Hiroki Maniwa; Takayuki Oki; Akira Suzuki 001; Kei Uchizawa; Xiao Zhou 001 (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2018)

Diameter of Colorings Under Kempe Changes. - Marthe Bonamy; Marc Heinrich; Takehiro Ito; Yusuke Kobayashi 001; Haruka Mizuta; Moritz Mühlenthaler; Akira Suzuki 001; Kunihiro Wasa (COCOON, 2019)

Max-Min 3-Dispersion Problems. - Takashi Horiyama; Shin-Ichi Nakano; Toshiki Saitoh; Koki Suetsugu; Akira Suzuki 001; Ryuhei Uehara; Takeaki Uno; Kunihiro Wasa (COCOON, 2019)

Incremental Optimization of Independent Sets Under the Reconfiguration Framework. - Takehiro Ito; Haruka Mizuta; Naomi Nishimura; Akira Suzuki 001 (COCOON, 2019)

Decremental Optimization of Dominating Sets Under Reachability Constraints. - Alexandre Blanché; Haruka Mizuta; Paul Ouvrard; Akira Suzuki 001 (CoRR, 2019)

Reconfiguration of Spanning Trees with Many or Few Leaves. - Nicolas Bousquet 001; Takehiro Ito; Yusuke Kobayashi 001; Haruka Mizuta; Paul Ouvrard; Akira Suzuki 001; Kunihiro Wasa (ESA, 2020)

Decremental Optimization of Dominating Sets Under the Reconfiguration Framework. - Alexandre Blanché; Haruka Mizuta; Paul Ouvrard; Akira Suzuki 001 (IWOCA, 2020)

Fixed-Parameter Algorithms for Graph Constraint Logic. - Tatsuhiko Hatanaka; Felix Hommelsheim; Takehiro Ito; Yusuke Kobayashi 001; Moritz Mühlenthaler; Akira Suzuki 001 (IPEC, 2020)

Shortest Reconfiguration of Colorings Under Kempe Changes. - Marthe Bonamy; Marc Heinrich; Takehiro Ito; Yusuke Kobayashi 001; Haruka Mizuta; Moritz Mühlenthaler; Akira Suzuki 001; Kunihiro Wasa (STACS, 2020)

Reconfiguring k-path Vertex Covers. - Duc A. Hoang 001; Akira Suzuki 001; Tsuyoshi Yagita (WALCOM, 2020)

Trichotomy for the Reconfiguration Problem of Integer Linear Systems. - Kei Kimura; Akira Suzuki 001 (WALCOM, 2020)

Parameterized complexity of independent set reconfiguration problems. - Takehiro Ito; Marcin Jakub Kaminski; Hirotaka Ono 001; Akira Suzuki 001; Ryuhei Uehara; Katsuhisa Yamanaka (Discret. Appl. Math., 2020)

Decremental Optimization of Vertex-Coloring Under the Reconfiguration Framework. - Yusuke Yanagisawa; Akira Suzuki 001; Yuma Tamura; Xiao Zhou 001 (COCOON, 2021)

Sorting Balls and Water: Equivalence and Computational Complexity. - Takehiro Ito; Jun Kawahara; Shin-ichi Minato; Yota Otachi; Toshiki Saitoh; Akira Suzuki 001; Ryuhei Uehara; Takeaki Uno; Katsuhisa Yamanaka; Ryo Yoshinaka (FUN, 2022)

Algorithms for Coloring Reconfiguration Under Recolorability Digraphs. - Soichiro Fujii; Yuni Iwamasa; Kei Kimura; Akira Suzuki 001 (ISAAC, 2022)

Reconfiguration of Spanning Trees with Degree Constraint or Diameter Constraint. - Nicolas Bousquet 001; Takehiro Ito; Yusuke Kobayashi 001; Haruka Mizuta; Paul Ouvrard; Akira Suzuki 001; Kunihiro Wasa (STACS, 2022)

Happy Set Problem on Subclasses of Co-comparability Graphs. - Hiroshi Eto; Takehiro Ito; Eiji Miyano; Akira Suzuki 001; Yuma Tamura (WALCOM, 2022)

Path Cover Problems with Length Cost. - Kenya Kobayashi; Guohui Lin; Eiji Miyano; Toshiki Saitoh; Akira Suzuki 001; Tadatoshi Utashima; Tsuyoshi Yagita (WALCOM, 2022)

Reconfiguring k-Path Vertex Covers. - Duc A. Hoang 001; Akira Suzuki 001; Tsuyoshi Yagita (IEICE Trans. Inf. Syst., 2022)

On the Routing Problems in Graphs with Ordered Forbidden Transitions. - Kota Kumakura; Akira Suzuki 001; Yuma Tamura; Xiao Zhou 001 (COCOON (1), 2023)

ZDD-Based Algorithmic Framework for Solving Shortest Reconfiguration Problems. - Takehiro Ito; Jun Kawahara; Yu Nakahata; Takehide Soh; Akira Suzuki 001; Junichi Teruyama; Takahisa Toda (CPAIOR, 2023)

Solving Reconfiguration Problems of First-Order Expressible Properties of Graph Vertices with Boolean Satisfiability. - Takahisa Toda; Takehiro Ito; Jun Kawahara; Takehide Soh; Akira Suzuki 001; Junichi Teruyama (ICTAI, 2023)

Reconfiguration of Time-Respecting Arborescences. - Takehiro Ito; Yuni Iwamasa; Naoyuki Kamiyama; Yasuaki Kobayashi; Yusuke Kobayashi 001; Shun-ichi Maezawa; Akira Suzuki 001 (WADS, 2023)

Parameterized Complexity of Optimizing List Vertex-Coloring Through Reconfiguration. - Yusuke Yanagisawa; Akira Suzuki 001; Yuma Tamura; Xiao Zhou 001 (WALCOM, 2023)

Decremental optimization of vertex-colouring under the reconfiguration framework. - Yusuke Yanagisawa; Akira Suzuki 001; Yuma Tamura; Xiao Zhou 001 (Int. J. Comput. Math. Comput. Syst. Theory, 2023)

Reconfiguration of Spanning Trees with Degree Constraints or Diameter Constraints. - Nicolas Bousquet 001; Takehiro Ito; Yusuke Kobayashi 001; Haruka Mizuta; Paul Ouvrard; Akira Suzuki 001; Kunihiro Wasa (Algorithmica, 2023)

Feedback vertex set reconfiguration in planar graphs. - Nicolas Bousquet 001; Felix Hommelsheim; Yusuke Kobayashi 001; Moritz Mühlenthaler; Akira Suzuki 001 (Theor. Comput. Sci., 2023)

Card-Based Zero-Knowledge Proof Protocols for the 15-Puzzle and the Token Swapping Problem. - Yuma Tamura; Akira Suzuki 001; Takaaki Mizuki (APKC@AsiaCCS, 2024)

Finding Induced Subgraphs from Graphs with Small Mim-Width. - Yota Otachi; Akira Suzuki 001; Yuma Tamura (SWAT, 2024)

Parameterized Complexity of Weighted Target Set Selection. - Takahiro Suzuki 002; Kei Kimura; Akira Suzuki 001; Yuma Tamura; Xiao Zhou 001 (TAMC, 2024)

The Shortest Path Reconfiguration Problem Based on Relaxation of Reconfiguration Rules. - Naoki Domon; Akira Suzuki 001; Yuma Tamura; Xiao Zhou 001 (WALCOM, 2024)

On the Complexity of List H-Packing for Sparse Graph Classes. - Tatsuya Gima; Tesshu Hanaka; Yasuaki Kobayashi; Yota Otachi; Tomohito Shirai; Akira Suzuki 001; Yuma Tamura; Xiao Zhou 001 (WALCOM, 2024)

Scalable Hard Instances for Independent Set Reconfiguration. - Takehide Soh; Takumu Watanabe; Jun Kawahara; Akira Suzuki 001; Takehiro Ito (SEA, 2024)

Changing Induced Subgraph Isomorphisms Under Extended Reconfiguration Rules. - Tatsuhiro Suga; Akira Suzuki 001; Yuma Tamura; Xiao Zhou 001 (WALCOM, 2025)

Homotopy types of Hom complexes of graph homomorphisms whose codomains are cycles. - Soichiro Fujii; Yuni Iwamasa; Kei Kimura; Yuta Nozaki; Akira Suzuki 001 (J. Appl. Comput. Topol., 2025)

Reachability of Independent Sets and Vertex Covers Under Extended Reconfiguration Rules. - Shuichi Hirahara; Naoto Ohsaka; Tatsuhiro Suga; Akira Suzuki 001; Yuma Tamura; Xiao Zhou 001 (CoRR, 2025)