VLDB 2026 Research / reviewers in the wild / expert
Tsuyoshi Hirayama
dblp:340/2374
· DBLP profile ↗
1ranked-venue papers
1as first author
1since 2021 · last 2023
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 1 · 1 first-author · 1 since 2021
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Theoretical computer science
1 paper |
Mathematical optimization · 100% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Mathematical optimization
combinatorial optimization |
0.7 | 1 | 2023 | A Polynomial Time Algorithm for Finding a Minimum 4-Partition of a Submodular Function · SODA 2023 |
Mathematical optimization › discrete optimization
submodular function minimization |
0.7 | 1 | 2023 | A Polynomial Time Algorithm for Finding a Minimum 4-Partition of a Submodular Function · SODA 2023 |
Mathematical optimization › submodular optimization
submodular partitioning |
0.7 | 1 | 2023 | A Polynomial Time Algorithm for Finding a Minimum 4-Partition of a Submodular Function · SODA 2023 |
Methods — techniques the papers use, named apart from their topics
polynomial-time algorithm · 0.7
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2023 | A Polynomial Time Algorithm for Finding a Minimum 4-Partition of a Submodular FunctionabstractIn this paper, we study the minimum k-partition problem of submodular functions, i.e., given a finite set V and a submodular function f: 2V → ℝ, computing a k-partition {V1,…, Vk} of V with minimum . The problem is a natural generalization of the minimum k-cut problem in graphs and hypergraphs. It is known that the problem is NP-hard for general k, and solvable in polynomial time for k ≤ 3. In this paper, we construct the first polynomial-time algorithm for the minimum 4-partition problem. * Authors are ordered alphabetically. Tsuyoshi Hirayama, Yuhao Liu 0003, Kazuhisa Makino, Chao Xu 0002 |
SODA | 1 |