Soh Kumabe

Publication Activity (10 Years)

Years Active: 2018-2024
Publications (10 Years): 24

Top Topics

Knapsack Problem

Top Venues

Publications

Soh Kumabe, Yuichi Yoshida
Lipschitz Continuous Allocations for Optimization Games. ICALP (2024)
Soh Kumabe, Yuichi Yoshida
Lipschitz Continuous Allocations for Optimization Games. CoRR (2024)
Tatsuya Gima, Soh Kumabe, Kazuhiro Kurita, Yuto Okada, Yota Otachi
Dichotomies for Tree Minor Containment with Structural Parameters. WALCOM (2024)
Soh Kumabe, Yuichi Yoshida
Average sensitivity of the Knapsack Problem. CoRR (2024)
Soh Kumabe, Yuichi Yoshida
Lipschitz Continuous Algorithms for Covering Problems. CoRR (2023)
Soh Kumabe, Yuichi Yoshida
Lipschitz Continuous Algorithms for Graph Problems. FOCS (2023)
Tatsuya Gima, Soh Kumabe, Kazuhiro Kurita, Yuto Okada, Yota Otachi
Dichotomies for Tree Minor Containment with Structural Parameters. CoRR (2023)
Soh Kumabe, Yuichi Yoshida
Lipschitz Continuous Algorithms for Graph Problems. CoRR (2022)
Soh Kumabe, Shinya Shiroshita, Takanori Hayashi, Shirou Maruyama
Learning General Inventory Management Policy for Large Supply Chain Network. CoRR (2022)
Soh Kumabe, Yuichi Yoshida
Average Sensitivity of Dynamic Programming. SODA (2022)
Soh Kumabe, Yuichi Yoshida
Average Sensitivity of the Knapsack Problem. ESA (2022)
Soh Kumabe, Yuichi Yoshida
Average Sensitivity of Dynamic Programming. CoRR (2021)
Soh Kumabe, Takanori Maehara
r-Gathering Problems on Spiders: Hardness, FPT Algorithms, and PTASes. WALCOM (2021)
Soh Kumabe
Interval Query Problem on Cube-Free Median Graphs. ISAAC (2021)
Soh Kumabe, Takanori Maehara
Prophet Secretary for k-Knapsack and l-Matroid Intersection via Continuous Exchange Property. IWOCA (2021)
Soh Kumabe, Takanori Maehara
Convexity of b-matching Games. IJCAI (2020)
Soh Kumabe
Interval Query Problem on Cube-free Median Graphs. CoRR (2020)
Soh Kumabe, Takanori Maehara
Convexity of Hypergraph Matching Game. AAMAS (2020)
Soh Kumabe, Takanori Maehara
r-Gathering Problems on Spiders: Hardness, FPT Algorithms, and PTASes. CoRR (2020)
Soh Kumabe, Takanori Maehara
PTAS and Exact Algorithms for r-Gathering Problems on Tree. CoRR (2019)
Soh Kumabe, Takanori Maehara
r-Gather Clustering and r-Gathering on Spider: FPT Algorithms and Hardness. CoRR (2019)
Soh Kumabe, Takanori Maehara, Ryoma Sin'ya
Linear Pseudo-Polynomial Factor Algorithm for Automaton Constrained Tree Knapsack Problem. WALCOM (2019)
Ikumi Hide, Soh Kumabe, Takanori Maehara
Incorrect implementations of the Floyd-Warshall algorithm give correct solutions after three repeats. CoRR (2019)
Soh Kumabe, Takanori Maehara, Ryoma Sin'ya
Linear Pseudo-Polynomial Factor Algorithm for Automaton Constrained Tree Knapsack Problem. CoRR (2018)