15. Quadratic Kernel for Cliques or Trees Vertex Deletion (arXiv)
Soh Kumabe, ISAAC'25.
14. Max-Distance Sparsification for Diversification and Clustering (arXiv)
Soh Kumabe, ESA'25.
13. Courcelle’s Theorem for Lipschitz Continuity (arXiv)
Tatsuya Gima, Soh Kumabe, and Yuichi Yoshida, ESA'25.
12. Lipschitz Continuous Algorithms for Covering Problems (arXiv)
Soh Kumabe and Yuichi Yoshida, SODA'25.
11. Lipschitz Continuous Allocations for Optimization Games (arXiv)
Soh Kumabe and Yuichi Yoshida, ICALP'24.
10. Dichotomies for Tree Minor Containment with Structural Parameters (arXiv)
Tatsuya Gima, Soh Kumabe, Kazuhiro Kurita, Yuto Okada, and Yota Otachi, WALCOM'24.
9. Lipschitz Continuous Algorithms for Graph Problems (arXiv)
Soh Kumabe and Yuichi Yoshida, FOCS'23.
8. Average Sensitivity of the Knapsack Problem. (arXiv)
Soh Kumabe and Yuichi Yoshida, ESA'22.
7. Average Sensitivity of Dynamic Programming (arXiv)
Soh Kumabe and Yuichi Yoshida. SODA'22.
6. Interval Query Problem on Cube-free Median Graphs (arXiv)
Soh Kumabe. ISAAC'21. Best Student Paper Award
5. Prophet Secretary for k-Knapsack and l-Matroid Intersection via Continuous Exchange Property (Proceeding)
Soh Kumabe and Takanori Maehara. IWOCA'21.
4. r-Gathering Problems on Spiders: Hardness, FPT Algorithms, and PTASes (arXiv)
Soh Kumabe and Takanori Maehara. WALCOM'21.
3. Convexity of b-matching Games (Proceeding)
Soh Kumabe and Takanori Maehara. IJCAI'20.
2. Convexity of Hypergraph Matching Game (Proceeding)
Soh Kumabe and Takanori Maehara. AAMAS'20.
1. Linear Pseudo-Polynomial Factor Algorithm for Automaton Constrained Tree Knapsack Problem (arXiv)
Soh Kumabe, Takanori Maehara, and Ryoma Sin'ya. WALCOM'19.
1. Incorrect implementations of the Floyd--Warshall algorithm give correct solutions after three repeats (arXiv)
Ikumi Hide, Soh Kumabe and Takanori Maehara