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 …

From social networks such as Facebook, the World Wide Web and the Internet, to the
complex interactions between proteins in the cells of our bodies, we constantly face the …

This monograph sets out a body of mathematical theory for finite graphs with nodes placed
randomly in Euclidean space and edges added to connect points that are close to each …

This paper deals with the Minimum Linear Arrangement problem from an experimental point
of view. Using a testsuite of sparse graphs, we experimentally compare several algorithms to …

In 2002, J. Díaz, M. Serna and the author published “A Survey of Graph Layout Problems”,
which then was a complete view of the current state of the art of layout problems from an …

The minimum linear arrangement problem is widely used and studied in many practical and
theoretical applications. In this paper we present a linear-time algorithm for the problem …

Modern service-oriented systems have increasingly complex loosely-coupled architectures
that often exhibit poor performance and resource efficiency and have high operating costs …

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 …

The Vertex Separation Problem belongs to a family of optimization problems in which the
objective is to find the best separator of vertices or edges in a generic graph. This …

The cutwidth of a graph G is defined to be the smallest integer k such that the vertices of G
can be arranged in a vertex ordering [v1,…, vn] in a way that, for every i= 1,…, n− 1, there …