Graph layout problems are a particular class of combinatorial optimization problems whose goal is to find a linear layout of an input graph in such way that a certain objective cost is optimized.â€¦ (More)

We study universal stability of directed and undirected graphs in the adversarial queuing model for static packet routing. In this setting, packets are injected in some edge and have to traverse aâ€¦ (More)

In this paper we initiate the generalization of the Adversarial Queueing Theory (aqt) model to capture the dynamics of continuous scenarios in which the usually assumed synchronicity of the evolutionâ€¦ (More)

In this paper, we study the approximability of several layout problems on a family of random geometric graphs. Vertices of random geometric graphs are randomly distributed on the unit square and areâ€¦ (More)

We consider the Moran process, as generalized by Lieberman et al. (Nature 433:312â€“316, 2005). A population resides on the vertices of a finite, connected, undirected graph and, at each time step, anâ€¦ (More)