Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data.
VLDB 2026 Research / reviewers in the wild / expert

Paul S. Dwyer

dblp:02/6794 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 1957
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Applied, interdisciplinary, general and emerging computing · 1 · 1 first-author

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 2 heaviest of 2, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Mathematical optimization
linear programming		 0.011957
The Method of Reduced Matrices for a General Transportation Problem · J. ACM 1957
Mathematical optimization › combinatorial optimization › network optimization
transportation problem		 0.011957
The Method of Reduced Matrices for a General Transportation Problem · J. ACM 1957

Methods — techniques the papers use, named apart from their topics

reduced matrices · 0.0
YearPublicationVenuePosition
1957 The Method of Reduced Matrices for a General Transportation Problem
abstract
In the usual statement of the transportation problem [1], one has N items to send from shipping points A1, ... , Ap to receiving points B1 , "'" , Bq .The amounts available for shipment from A1, • • • , Ap are a~, • • • , ap, respectively, and the amounts needed at B~, • • • , Bq are bl, • • • , bq, respectively, where p q ~a, = ~b~ = N. i=l 5=i
Paul S. Dwyer, Bernard A. Galler
 J. ACM1