In this paper, we revisit the online recoloring problem introduced recently by Azar et al. In
online recoloring, there is a fixed set $ V $ of $ n $ vertices and an initial coloring $ c_0 …

The dynamic offline linear arrangement problem deals with reordering n elements subject to
a sequence of edge requests. The input consists of a sequence of m edges (ie, unordered …

In the online balanced graph repartitioning problem, one has to maintain a clustering of n
nodes into ℓ ℓ clusters, each having k= n/ℓ k= n/ℓ nodes. During runtime, an online algorithm …

Networked systems are increasingly flexible and reconfigurable. This enables demand-
aware infrastructures whose resources can be adjusted according to the traffic pattern they …

In the well-known Minimum Linear Arrangement problem (MinLA), the goal is to arrange the
nodes of an undirected graph into a permutation so that the total stretch of the edges is …

We study the online balanced graph re-partitioning problem (OBGR) which was introduced
by Avin, Bienkowski, Loukas, Pacut, and Schmid [2] and has recently received significant …

Correlation for radio interferometer array applications, including Very Long Baseline
Interferometry (VLBI), is a multidisciplinary field that traditionally involves astronomy …

Resource allocation in distributed and networked systems such as the Cloud is becoming
increasingly flexible, allowing these systems to dynamically adjust toward the workloads …

The performance of many large-scale and data-intensive distributed systems critically
depends on the capacity of the interconnecting network. This paper is motivated by the …

The online bisection problem is a natural dynamic variant of the classic optimization
problem, where one has to dynamically maintain a partition of $ n $ elements into two …