Linear Pseudo-Polynomial Factor Algorithm for Automaton Constrained Tree Knapsack Problem. - Soh Kumabe; Takanori Maehara; Ryoma Sin'ya (WALCOM, 2019)

Incorrect implementations of the Floyd-Warshall algorithm give correct solutions after three repeats. - Ikumi Hide; Soh Kumabe; Takanori Maehara (CoRR, 2019)

PTAS and Exact Algorithms for r-Gathering Problems on Tree. - Soh Kumabe; Takanori Maehara (CoRR, 2019)

r-Gather Clustering and r-Gathering on Spider: FPT Algorithms and Hardness. - Soh Kumabe; Takanori Maehara (CoRR, 2019)

Convexity of Hypergraph Matching Game. - Soh Kumabe; Takanori Maehara (AAMAS, 2020)

Convexity of b-matching Games. - Soh Kumabe; Takanori Maehara (IJCAI, 2020)

Interval Query Problem on Cube-Free Median Graphs. - Soh Kumabe (ISAAC, 2021)

Prophet Secretary for k-Knapsack and l-Matroid Intersection via Continuous Exchange Property. - Soh Kumabe; Takanori Maehara (IWOCA, 2021)

r-Gathering Problems on Spiders: Hardness, FPT Algorithms, and PTASes. - Soh Kumabe; Takanori Maehara (WALCOM, 2021)

Average Sensitivity of the Knapsack Problem. - Soh Kumabe; Yuichi Yoshida (ESA, 2022)

Average Sensitivity of Dynamic Programming. - Soh Kumabe; Yuichi Yoshida (SODA, 2022)

Learning General Inventory Management Policy for Large Supply Chain Network. - Soh Kumabe; Shinya Shiroshita; Takanori Hayashi; Shirou Maruyama (CoRR, 2022)

Lipschitz Continuous Algorithms for Graph Problems. - Soh Kumabe; Yuichi Yoshida (FOCS, 2023)

Lipschitz Continuous Allocations for Optimization Games. - Soh Kumabe; Yuichi Yoshida (ICALP, 2024)

Max-Distance Sparsification for Diversification and Clustering. - Soh Kumabe (CoRR, 2024)

Lipschitz Continuous Algorithms for Covering Problems. - Soh Kumabe; Yuichi Yoshida (SODA, 2025)

Dichotomies for tree minor containment with structural parameters. - Tatsuya Gima; Soh Kumabe; Kazuhiro Kurita; Yuto Okada; Yota Otachi (Theor. Comput. Sci., 2025)

Courcelle's Theorem for Lipschitz Continuity. - Tatsuya Gima; Soh Kumabe; Yuichi Yoshida (CoRR, 2025)