| 2026 | COCOON | Parameterized Complexity of Odd Domination and its Generalization. | Toranosuke Kokai, Rin Saito, Tatsuhiro Suga, Takahiro Suzuki, Yuma Tamura |
| 2026 | COCOON | On the Complexity of k-Colorable Perfect Matching. | Toranosuke Kokai, Akira Suzuki, Yuma Tamura, Xiao Zhou |
| 2026 | ICALP | On (In)approximability of MaxMin Independent Set Reconfiguration. | Hung P. Hoang, Naoto Ohsaka, Rin Saito, Yuma Tamura |
| 2026 | MFCS | Finding Shortest Reconfiguration Sequences on Independent Set Polytopes. | Jean Cardinal, Kevin Mann, Akira Suzuki, Takahiro Suzuki, Yuma Tamura, Xiao Zhou |
| 2026 | SOFSEM | Spanning Trees with a Small Vertex Cover: The Complexity on Specific Graph Classes. | Toranosuke Kokai, Akira Suzuki, Takahiro Suzuki, Yuma Tamura, Xiao Zhou |
| 2026 | SOFSEM | Solution Discovery for Vertex Cover, Independent Set, Dominating Set, and Feedback Vertex Set. | Rin Saito, Anouk Sommer, Tatsuhiro Suga, Takahiro Suzuki, Yuma Tamura |
| 2025 | ISAAC | Coloring Reconfiguration Under Color Swapping. | Janosch Fuchs, Rin Saito, Tatsuhiro Suga, Takahiro Suzuki, Yuma Tamura |
| 2025 | ISAAC | Reachability of Independent Sets and Vertex Covers Under Extended Reconfiguration Rules. | Shuichi Hirahara, Naoto Ohsaka, Tatsuhiro Suga, Akira Suzuki, Yuma Tamura, Xiao Zhou |
| 2025 | WALCOM | Changing Induced Subgraph Isomorphisms Under Extended Reconfiguration Rules. | Tatsuhiro Suga, Akira Suzuki, Yuma Tamura, Xiao Zhou |
| 2024 | TAMC | Parameterized Complexity of Weighted Target Set Selection. | Takahiro Suzuki, Kei Kimura, Akira Suzuki, Yuma Tamura, Xiao Zhou |
| 2024 | WALCOM | The Shortest Path Reconfiguration Problem Based on Relaxation of Reconfiguration Rules. | Naoki Domon, Akira Suzuki, Yuma Tamura, Xiao Zhou |
| 2024 | WALCOM | On the Complexity of List H-Packing for Sparse Graph Classes. | Tatsuya Gima, Tesshu Hanaka, Yasuaki Kobayashi, Yota Otachi, Tomohito Shirai, Akira Suzuki, Yuma Tamura, Xiao Zhou |
| 2023 | COCOON | On the Routing Problems in Graphs with Ordered Forbidden Transitions. | Kota Kumakura, Akira Suzuki, Yuma Tamura, Xiao Zhou |
| 2023 | WALCOM | Parameterized Complexity of Optimizing List Vertex-Coloring Through Reconfiguration. | Yusuke Yanagisawa, Akira Suzuki, Yuma Tamura, Xiao Zhou |
| 2022 | WALCOM | Happy Set Problem on Subclasses of Co-comparability Graphs. | Hiroshi Eto, Takehiro Ito, Eiji Miyano, Akira Suzuki, Yuma Tamura |
| 2021 | COCOON | Decremental Optimization of Vertex-Coloring Under the Reconfiguration Framework. | Yusuke Yanagisawa, Akira Suzuki, Yuma Tamura, Xiao Zhou |
| 2020 | ISAAC | Minimization and Parameterized Variants of Vertex Partition Problems on Graphs. | Yuma Tamura, Takehiro Ito, Xiao Zhou |
| 2020 | WALCOM | Approximability of the Independent Feedback Vertex Set Problem for Bipartite Graphs. | Yuma Tamura, Takehiro Ito, Xiao Zhou |
| 2014 | IWOCA | Deterministic Algorithms for the Independent Feedback Vertex Set Problem. | Yuma Tamura, Takehiro Ito, Xiao Zhou |