45 citations · 81 across the 10 of their papers we have counts for
12 papers
On the existence of -temporal cliques in random simple temporal graphs
George B. Mertzios, Sotiris Nikoletseas, Christoforos Raptopoulos +1
We consider random simple temporal graphs in which every edge of the complete graph appears once within the time interval [0,1] independently and uniformly at random. Our mai…
A spectral algorithm for finding maximum cliques in dense random intersection graphs
Filippos Christodoulou, Sotiris Nikoletseas, Christoforos Raptopoulos +1
In a random intersection graph , each of vertices selects a random subset of a set of labels by including each label independently with probability and edges…
An algorithmic study in the vector model for Wireless Power Transfer maximization
Ioannis Katsidimas, Sotiris Nikoletseas, Theofanis P. Raptis +1
Rapid technological advances in the domain of Wireless Power Transfer (WPT) pave the way for novel methods for power management in systems of wireless devices and recent research w…
Wireless charging for weighted energy balance in populations of mobile peers
Sotiris Nikoletseas, Theofanis P. Raptis, Christoforos Raptopoulos
Wireless energy transfer is an emerging technology that is used in networks of battery-powered devices in order to deliver energy and keep the network functional. Existing state-of…
Radiation-constrained algorithms for Wireless Energy Transfer in Ad hoc Networks
Sotiris Nikoletseas, Theofanis P. Raptis, Christoforos Raptopoulos
We study the problem of efficiently charging a set of rechargeable nodes using a set of wireless chargers, under safety constraints on the electromagnetic radiation incurred. In pa…
MAX CUT in Weighted Random Intersection Graphs and Discrepancy of Sparse Random Set Systems
Sotiris Nikoletseas, Christoforos Raptopoulos, Paul Spirakis
Let be a set of vertices, a set of labels, and let be an matrix of independent Bernoulli random variables with success probability…