18 citations · 28 across the 25 of their papers we have counts for
Showing 2020Show all
3 papers · 1 filter
cs.DS2020
The K-Centre Problem for Necklaces
Duncan Adamson, Argyrios Deligkas, Vladimir V. Gusev +1
In graph theory, the objective of the k-centre problem is to find a set of vertices for which the largest distance of any vertex to its closest vertex in the -set is minimis…
cs.DS2020
On Efficient Connectivity-Preserving Transformations in a Grid
Abdullah Almethen, Othon Michail, Igor Potapov
We consider a discrete system of devices lying on a 2-dimensional square grid and forming an initial connected shape . Each device is equipped with a linear-strength mecha…
cs.DS2020
Optimizing Reachability Sets in Temporal Graphs by Delaying
Argyrios Deligkas, Igor Potapov
A temporal graph is a dynamic graph where every edge is assigned a set of integer time labels that indicate at which discrete time step the edge is available. In this paper, we stu…