Deterministic Algorithms for the Independent Feedback Vertex Set Problem. - Yuma Tamura; Takehiro Ito; Xiao Zhou 001 (IWOCA, 2014)

Algorithms for the Independent Feedback Vertex Set Problem. - Yuma Tamura; Takehiro Ito; Xiao Zhou 001 (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2015)

Minimization and Parameterized Variants of Vertex Partition Problems on Graphs. - Yuma Tamura; Takehiro Ito; Xiao Zhou 001 (ISAAC, 2020)

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

Approximability of the independent feedback vertex set problem for bipartite graphs. - Yuma Tamura; Takehiro Ito; Xiao Zhou 001 (Theor. Comput. Sci., 2021)

On the Routing Problems in Graphs with Ordered Forbidden Transitions. - Kota Kumakura; Akira Suzuki 001; Yuma Tamura; Xiao Zhou 001 (COCOON (1), 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)

Happy Set Problem on Subclasses of Co-comparability Graphs. - Hiroshi Eto; Takehiro Ito; Eiji Miyano; Akira Suzuki 001; Yuma Tamura (Algorithmica, 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)

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

Absolute Zeta functions and periodicity of quantum walks on cycles. - Jirô Akahori; Norio Konno; Iwao Sato; Yuma Tamura (Quantum Inf. Comput., 2024)

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

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 (Theor. Comput. Sci., 2025)

Parameterized complexity of weighted target set selection. - Takahiro Suzuki; Kei Kimura; Akira Suzuki 001; Yuma Tamura; Xiao Zhou 001 (Theor. Comput. Sci., 2025)