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

Chrysovalandis Agathangelou

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

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

Systems, architecture and hardware · 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
Distributed computing theory · 100%

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

TopicWeightPapersLastEvidence papers
Distributed computing theory
distributed robotics		 0.212013
A distributed algorithm for gathering many fat mobile robots in the plane · PODC 2013
Distributed computing theory
gathering		 0.212013
A distributed algorithm for gathering many fat mobile robots in the plane · PODC 2013
YearPublicationVenuePosition
2013 A distributed algorithm for gathering many fat mobile robots in the plane
abstract
We revisit the problem of gathering autonomous robots in the plane. In particular, we consider non-transparent unit-disc robots (i.e., fat) in an asynchronous setting with vision as the only means of coordination and robots only make local decisions. We use a state-machine representation to formulate the gathering problem and develop a distributed algorithm that solves the problem for any number of fat robots. The main idea behind the algorithm is to enforce the robots to reach a configuration in which all the following hold:
Chrysovalandis Agathangelou, Chryssis Georgiou, Marios Mavronicolas
 PODC1