| 2026 | ESA | Kernelization for H-Packing Revisited. | Tomohiro Koana, Soh Kumabe |
| 2026 | ICALP | On the Complexity of the Matching Problem of Regular Expressions with Backreferences. | Soh Kumabe, Yuya Uezato |
| 2025 | ESA | Courcelle's Theorem for Lipschitz Continuity. | Tatsuya Gima, Soh Kumabe, Yuichi Yoshida |
| 2025 | ESA | Max-Distance Sparsification for Diversification and Clustering. | Soh Kumabe |
| 2025 | ISAAC | Quadratic Kernel for Cliques or Trees Vertex Deletion. | Soh Kumabe |
| 2025 | SODA | Lipschitz Continuous Algorithms for Covering Problems. | Soh Kumabe, Yuichi Yoshida |
| 2024 | ICALP | Lipschitz Continuous Allocations for Optimization Games. | Soh Kumabe, Yuichi Yoshida |
| 2024 | WALCOM | Dichotomies for Tree Minor Containment with Structural Parameters. | Tatsuya Gima, Soh Kumabe, Kazuhiro Kurita, Yuto Okada, Yota Otachi |
| 2023 | FOCS | Lipschitz Continuous Algorithms for Graph Problems. | Soh Kumabe, Yuichi Yoshida |
| 2022 | ESA | Average Sensitivity of the Knapsack Problem. | Soh Kumabe, Yuichi Yoshida |
| 2022 | SODA | Average Sensitivity of Dynamic Programming. | Soh Kumabe, Yuichi Yoshida |
| 2021 | ISAAC | Interval Query Problem on Cube-Free Median Graphs. | Soh Kumabe |
| 2021 | IWOCA | Prophet Secretary for k-Knapsack and l-Matroid Intersection via Continuous Exchange Property. | Soh Kumabe, Takanori Maehara |
| 2021 | WALCOM | r-Gathering Problems on Spiders: Hardness, FPT Algorithms, and PTASes. | Soh Kumabe, Takanori Maehara |
| 2020 | IJCAI | Convexity of b-matching Games. | Soh Kumabe, Takanori Maehara |
| 2019 | WALCOM | Linear Pseudo-Polynomial Factor Algorithm for Automaton Constrained Tree Knapsack Problem. | Soh Kumabe, Takanori Maehara, Ryoma Sin'ya |