Demo Data from VLDB 2026 / reviewers in the wild / expert
Glenn N. Thomas
dblp:161/6109
· DBLP profile ↗
1ranked-venue papers
0as first author
0since 2021 · last 1977
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 1
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 · 50% Algorithms and data structures · 50% |
Topics — the 2 heaviest of 2, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Algorithms and data structures › polynomial-time algorithms
linear-time algorithms |
0.0 | 1 | 1977 | A Linear Time Algorithm for a 2 × n Transportation Problem · SIAM J. Comput. 1977 |
Mathematical optimization › combinatorial optimization › network optimization
transportation problem |
0.0 | 1 | 1977 | A Linear Time Algorithm for a 2 × n Transportation Problem · SIAM J. Comput. 1977 |
Methods — techniques the papers use, named apart from their topics
selection algorithm · 0.0necessary and sufficient conditions · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1977 | A Linear Time Algorithm for a 2 × n Transportation ProblemabstractThis paper considers a special case of the standard transportation problem obtained by restricting the number of origins to two. Necessary and sufficient conditions are established which lead to a direct construction of the optimal solution. Using an extension of a recent selection algorithm, an algorithm is developed to solve this special case of the transportation problem in $O(n)$ time in the worst case. The algorithm applies to both capacitated as well as uncapacitated problems. Donald L. Adolphson, Glenn N. Thomas |
SIAM J. Comput. | 2 |