Soh Kumabe - RankMe

32 papers A* 5A 4B 5C 1Journal 17

Year	Rank	Type	Title / Venue / Authors
2025	A	`conf`	Courcelle's Theorem for Lipschitz Continuity. ESA Tatsuya Gima, Soh Kumabe, Yuichi Yoshida
2025	J	`jnl`	Courcelle's Theorem for Lipschitz Continuity. CoRR Tatsuya Gima, Soh Kumabe, Yuichi Yoshida
2025	J	`jnl`	Dichotomies for tree minor containment with structural parameters. Theor. Comput. Sci. Tatsuya Gima, Soh Kumabe, Kazuhiro Kurita, Yuto Okada, Yota Otachi
2025	A*	`conf`	Lipschitz Continuous Algorithms for Covering Problems. SODA Soh Kumabe, Yuichi Yoshida
2025	A	`conf`	Max-Distance Sparsification for Diversification and Clustering. ESA Soh Kumabe
2025	B	`conf`	Quadratic Kernel for Cliques or Trees Vertex Deletion. ISAAC Soh Kumabe
2025	J	`jnl`	Quadratic Kernel for Cliques or Trees Vertex Deletion. CoRR Soh Kumabe
2024	J	`jnl`	Average sensitivity of the Knapsack Problem. CoRR Soh Kumabe, Yuichi Yoshida
2024	B	`conf`	Dichotomies for Tree Minor Containment with Structural Parameters. WALCOM Tatsuya Gima, Soh Kumabe, Kazuhiro Kurita, Yuto Okada, Yota Otachi
2024	A*	`conf`	Lipschitz Continuous Allocations for Optimization Games. ICALP Soh Kumabe, Yuichi Yoshida
2024	J	`jnl`	Lipschitz Continuous Allocations for Optimization Games. CoRR Soh Kumabe, Yuichi Yoshida
2024	J	`jnl`	Max-Distance Sparsification for Diversification and Clustering. CoRR Soh Kumabe
2023	J	`jnl`	Dichotomies for Tree Minor Containment with Structural Parameters. CoRR Tatsuya Gima, Soh Kumabe, Kazuhiro Kurita, Yuto Okada, Yota Otachi
2023	J	`jnl`	Lipschitz Continuous Algorithms for Covering Problems. CoRR Soh Kumabe, Yuichi Yoshida
2023	A*	`conf`	Lipschitz Continuous Algorithms for Graph Problems. FOCS Soh Kumabe, Yuichi Yoshida
2022	A*	`conf`	Average Sensitivity of Dynamic Programming. SODA Soh Kumabe, Yuichi Yoshida
2022	A	`conf`	Average Sensitivity of the Knapsack Problem. ESA Soh Kumabe, Yuichi Yoshida
2022	J	`jnl`	Learning General Inventory Management Policy for Large Supply Chain Network. CoRR Soh Kumabe, Shinya Shiroshita, Takanori Hayashi, Shirou Maruyama
2022	J	`jnl`	Lipschitz Continuous Algorithms for Graph Problems. CoRR Soh Kumabe, Yuichi Yoshida
2021	J	`jnl`	Average Sensitivity of Dynamic Programming. CoRR Soh Kumabe, Yuichi Yoshida
2021	B	`conf`	Interval Query Problem on Cube-Free Median Graphs. ISAAC Soh Kumabe
2021	C	`conf`	Prophet Secretary for k-Knapsack and l-Matroid Intersection via Continuous Exchange Property. IWOCA Soh Kumabe, Takanori Maehara
2021	B	`conf`	r-Gathering Problems on Spiders: Hardness, FPT Algorithms, and PTASes. WALCOM Soh Kumabe, Takanori Maehara
2020	A	`conf`	Convexity of Hypergraph Matching Game. AAMAS Soh Kumabe, Takanori Maehara
2020	A*	`conf`	Convexity of b-matching Games. IJCAI Soh Kumabe, Takanori Maehara
2020	J	`jnl`	Interval Query Problem on Cube-free Median Graphs. CoRR Soh Kumabe
2020	J	`jnl`	r-Gathering Problems on Spiders: Hardness, FPT Algorithms, and PTASes. CoRR Soh Kumabe, Takanori Maehara
2019	J	`jnl`	Incorrect implementations of the Floyd-Warshall algorithm give correct solutions after three repeats. CoRR Ikumi Hide, Soh Kumabe, Takanori Maehara
2019	B	`conf`	Linear Pseudo-Polynomial Factor Algorithm for Automaton Constrained Tree Knapsack Problem. WALCOM Soh Kumabe, Takanori Maehara, Ryoma Sin'ya
2019	J	`jnl`	PTAS and Exact Algorithms for r-Gathering Problems on Tree. CoRR Soh Kumabe, Takanori Maehara
2019	J	`jnl`	r-Gather Clustering and r-Gathering on Spider: FPT Algorithms and Hardness. CoRR Soh Kumabe, Takanori Maehara
2018	J	`jnl`	Linear Pseudo-Polynomial Factor Algorithm for Automaton Constrained Tree Knapsack Problem. CoRR Soh Kumabe, Takanori Maehara, Ryoma Sin'ya