default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSoh Kumabe
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c11]Soh Kumabe, Yuichi Yoshida:
Lipschitz Continuous Allocations for Optimization Games. ICALP 2024: 102:1-102:16- [c10]Tatsuya Gima
, Soh Kumabe, Kazuhiro Kurita, Yuto Okada, Yota Otachi:
Dichotomies for Tree Minor Containment with Structural Parameters. WALCOM 2024: 392-405 - [i13]Soh Kumabe, Yuichi Yoshida:
Lipschitz Continuous Allocations for Optimization Games. CoRR abs/2405.11889 (2024) - [i12]Soh Kumabe, Yuichi Yoshida:
Average sensitivity of the Knapsack Problem. CoRR abs/2405.13343 (2024) - 2023
- [c9]Soh Kumabe, Yuichi Yoshida:
Lipschitz Continuous Algorithms for Graph Problems. FOCS 2023: 762-797 - [i11]Soh Kumabe, Yuichi Yoshida:
Lipschitz Continuous Algorithms for Covering Problems. CoRR abs/2307.08213 (2023) - [i10]Tatsuya Gima, Soh Kumabe, Kazuhiro Kurita, Yuto Okada, Yota Otachi:
Dichotomies for Tree Minor Containment with Structural Parameters. CoRR abs/2311.03225 (2023) - 2022
- [c8]Soh Kumabe, Yuichi Yoshida:
Average Sensitivity of the Knapsack Problem. ESA 2022: 75:1-75:14 - [c7]Soh Kumabe, Yuichi Yoshida:
Average Sensitivity of Dynamic Programming. SODA 2022: 1925-1961 - [i9]Soh Kumabe, Shinya Shiroshita, Takanori Hayashi, Shirou Maruyama:
Learning General Inventory Management Policy for Large Supply Chain Network. CoRR abs/2204.13378 (2022) - [i8]Soh Kumabe, Yuichi Yoshida:
Lipschitz Continuous Algorithms for Graph Problems. CoRR abs/2211.04674 (2022) - 2021
- [c6]Soh Kumabe:
Interval Query Problem on Cube-Free Median Graphs. ISAAC 2021: 18:1-18:14 - [c5]Soh Kumabe, Takanori Maehara:
Prophet Secretary for k-Knapsack and l-Matroid Intersection via Continuous Exchange Property. IWOCA 2021: 428-441 - [c4]Soh Kumabe, Takanori Maehara:
r-Gathering Problems on Spiders: Hardness, FPT Algorithms, and PTASes. WALCOM 2021: 154-165 - [i7]Soh Kumabe, Yuichi Yoshida:
Average Sensitivity of Dynamic Programming. CoRR abs/2111.02657 (2021) - 2020
- [c3]Soh Kumabe, Takanori Maehara:
Convexity of Hypergraph Matching Game. AAMAS 2020: 663-671 - [c2]Soh Kumabe, Takanori Maehara:
Convexity of b-matching Games. IJCAI 2020: 261-267 - [i6]Soh Kumabe:
Interval Query Problem on Cube-free Median Graphs. CoRR abs/2010.05652 (2020) - [i5]Soh Kumabe, Takanori Maehara:
r-Gathering Problems on Spiders: Hardness, FPT Algorithms, and PTASes. CoRR abs/2012.02981 (2020)
2010 – 2019
- 2019
- [c1]Soh Kumabe, Takanori Maehara, Ryoma Sin'ya:
Linear Pseudo-Polynomial Factor Algorithm for Automaton Constrained Tree Knapsack Problem. WALCOM 2019: 248-260 - [i4]Ikumi Hide, Soh Kumabe, Takanori Maehara:
Incorrect implementations of the Floyd-Warshall algorithm give correct solutions after three repeats. CoRR abs/1904.01210 (2019) - [i3]Soh Kumabe, Takanori Maehara:
PTAS and Exact Algorithms for r-Gathering Problems on Tree. CoRR abs/1907.04087 (2019) - [i2]Soh Kumabe, Takanori Maehara:
r-Gather Clustering and r-Gathering on Spider: FPT Algorithms and Hardness. CoRR abs/1907.04088 (2019) - 2018
- [i1]Soh Kumabe, Takanori Maehara, Ryoma Sin'ya:
Linear Pseudo-Polynomial Factor Algorithm for Automaton Constrained Tree Knapsack Problem. CoRR abs/1807.04942 (2018)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-07-03 21:35 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
