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

D. Trstenský

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

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

Computer networks · 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
Approximation and online algorithms · 87% Graph algorithms and graph theory · 13%

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

TopicWeightPapersLastEvidence papers
Approximation and online algorithms
facility location		 0.011979
Assigning a Minimal Multiple-Center Under a Given Reliability Index in Tree Networks · IEEE Trans. Commun. 1979
Approximation and online algorithms › approximation algorithms
network design		 0.011979
Assigning a Minimal Multiple-Center Under a Given Reliability Index in Tree Networks · IEEE Trans. Commun. 1979
Graph algorithms and graph theory › network theory › network topology
tree network		 0.011979
Assigning a Minimal Multiple-Center Under a Given Reliability Index in Tree Networks · IEEE Trans. Commun. 1979

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

reliability index · 0.0
YearPublicationVenuePosition
1979 Assigning a Minimal Multiple-Center Under a Given Reliability Index in Tree Networks
abstract
An efficient algorithm is presented for assigning a minimal multiple-center in a tree network that satisfies a given reliability index.
D. Trstenský
 IEEE Trans. Commun.1