1 citations · 1 across the 2 of their papers we have counts for
4 papers
Emergency Vertex Cover
Eric Angel, Evangelos Bampas, Evripidis Bampis +4
The Minimum Vertex Cover problem is a fundamental combinatorial optimization problem, aiming to identify a minimum subset of vertices in a graph such that every edge is incident to…
Perpetual exploration in anonymous synchronous networks with a Byzantine black hole
Adri Bhattacharya, Pritam Goswami, Evangelos Bampas +1
In this paper, we investigate: ``How can a group of initially co-located mobile agents perpetually explore an unknown graph, when one stationary node occasionally behaves malicious…
Maximal Exploration of Trees with Energy-Constrained Agents
Evangelos Bampas, Jérémie Chalopin, Shantanu Das +2
We consider the problem of exploring an unknown tree with a team of initially colocated mobile agents. Each agent has limited energy and cannot, as a result, traverse more than…
Self-Stabilizing Balancing Algorithm for Containment-Based Trees
Evangelos Bampas, Anissa Lamani, Franck Petit +1
Containment-based trees encompass various handy structures such as B+-trees, R-trees and M-trees. They are widely used to build data indexes, range-queryable overlays, publish/subs…