We study the single-message broadcast problem in dynamic radio networks. We show that the time complexity of the problem depends on the amount of stability and connectivity of the dynamic networkâ€¦ (More)

We study an online problem in which a set of mobile resources o r centers have to be moved in order to optimally serve a set of demands. There is a set of n nodes and a set of k resources that areâ€¦ (More)

We study an online problem in which a set of mobile servers have to be moved in order to efficiently serve a set of requests that arrive in an online fashion. More formally, there is a set of n nodesâ€¦ (More)

We introduce a new scheduling problem in distributed computing that we call the DSMS problem. We are given a set of k â‰¥ 1 mobile identical servers that are initially hosted by some processors of theâ€¦ (More)

The Arrow protocol is a simple and elegant protocol to coordinate exclusive access to a shared object in a network. The protocol solves the underlying distributed queueing problem by using pathâ€¦ (More)

We consider the traveling salesman problem (TSP) with k â‰¥ 1 salespeople (k-TSP) on a hierarchically well-separated tree (HST). We show that the k-TSP can be optimally solved on HSTs. Based on thisâ€¦ (More)