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. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page
Demo Data from VLDB 2026 / reviewers in the wild / expert

Gerhard Gierz

dblp:84/313 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 1985
—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 · 77% Algorithms and data structures · 23%

Topics — the 2 heaviest of 2, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Mathematical optimization
discrete optimization		 0.011985
Algorithmic approaches to setup minimization · SIAM J. Comput. 1985
Algorithms and data structures › data structure design
ordered sets		 0.011985
Algorithmic approaches to setup minimization · SIAM J. Comput. 1985

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

structural class construction · 0.0greedy algorithm · 0.0
YearPublicationVenuePosition
1985 Algorithmic approaches to setup minimization
abstract
Construction of classes of ordered sets are given for which the setup minimization problem can be solved by an efficient algorithm. Those constructions generalize series-parallel connections. Special classes of ordered sets are exhibited for which the greedy algorithm yields an optimal linear extension. In particular, it is shown that the class of N-free ordered sets is both defect optimal and strongly greedy.
Ulrich Faigle, Gerhard Gierz, Rainer Schrader
 SIAM J. Comput.2