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 EDBT 2026 / reviewers in the wild / expert

Sofoklis Goulas

dblp:392/7817 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
1since 2021 · last 2024
0000-0001-7100-0647ORCID · reported

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

Artificial intelligence and machine learning · 1 · 1 first-author · 1 since 2021Theory of computation · 1 · 1 first-author · 1 since 2021

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
Algorithmic game theory and mechanism design · 62% Mathematical optimization · 38%

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

TopicWeightPapersLastEvidence papers
Mathematical optimization › combinatorial optimization
assignment problem		 0.212024
Optimal Cohort Partitions · EC 2024
Mathematical optimization
discrete optimization		 0.212024
Optimal Cohort Partitions · EC 2024

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

convex optimization · 0.8
YearPublicationVenuePosition
2024 Optimal Cohort Partitions
abstract
In the optimal cohort partition problem, a planner seeks to distribute a heterogeneous population of individuals into a fixed number of distinct groups to optimize their objective. This problem is prevalent across a wide range of applications, including assigning students to classes, forming teams of experts in organizations, maximizing biodiversity, and designing contests among teams.
Sofoklis Goulas, Faidra Monachou
 EC1