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

Manolis Vardas

dblp:260/0528 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 2020
—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
Approximation and online algorithms · 100%

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

TopicWeightPapersLastEvidence papers
Approximation and online algorithms › set cover
min-sum set cover
0.412020
The Online Min-Sum Set Cover Problem · ICALP 2020
Approximation and online algorithms
online algorithms
0.412020
The Online Min-Sum Set Cover Problem · ICALP 2020
YearPublicationVenuePosition
2020 The Online Min-Sum Set Cover Problem
Dimitris Fotakis 0001, Loukas Kavouras, Grigorios Koumoutsos, Stratis Skoulakis, Manolis Vardas
ICALP5