Evangelos Kranakis

TL;DR: Three constructions for orientations with minimum number of arcs and such that they produce a digraph with bounded stretch factor have applications into the problem of establishing strongly connected sensor network when sensors are equipped with directional antennae.

TL;DR: If all of the sides of a simple orthogonal polygon without holes have odd lengths, then it cannot be tiled by dominoes, and similar characterizations are provided for Orthogonal polygons with sides of arbitrary length.

TL;DR: In this article, the authors study the problem of barrier coverage by stationary wireless sensors that are assisted by a mobile robot with the capacity to move sensors, and give an optimal linear-time offline algorithm that gives a minimum-length trajectory for a robot that starts at one end of the barrier and achieves the restoration of barrier covering.

TL;DR: This work analyzes the problem of unaware nodes determining their location in the presence of misbehaving neighboring nodes that provide false data during the execution of the positioning process and provides algorithms that enable the location-unaware nodes to determine their coordinates in presence of these adversaries.

TL;DR: Efficient algorithms for collections of robots known to contain at most one faulty robot are given, when the proportion of byzantine robots is known to be less than one half or one third, and algorithms with small constant competitive ratios are proposed.