In this paper we survey the recent results and open questions about some graph layout problems.

We consider the H-coloring problem on graphs with vertices of large degree. We prove that for H an odd cycle, the problem belongs to P. We also study the phase transition of the problem, for an infinite family of ...

This paper deals with some aspects on finding good solutions for the Minimum Linear Arrangement problem (MinLA). We consider some random type of sparse graphs, for which it is possible to obtain trivial constant ...

Embedding graphs in a geographical or latent space, i.e. inferring locations for vertices in Euclidean space or on a smooth manifold or submanifold, is a common task in network analysis, statistical inference, and graph ...

El dia 17 de març l’Acadèmia de Ciències Noruega va anunciar que el Premi Abel 2021 s’atorgava a Laszló Lovász i Avi Widgerson per, segons es llegeix de la laudatio del premi, “. . . les seves contribucions fonamentals a ...

In this paper we present the research that has been done with Linear Dynamical Systems to generate almost uniformly elements from a given set, and thus approximate some hard counting problems. We also indicate how non-linear ...

In this paper we prove that the Min-Bisection problem is NP-hard on unit disk graphs, thus solving a longstanding open question.

In this work we look into the parallelization (in the NC sense) of the Markov Chain approach to almost random generation (as described by Sinclair (1993)). We prove that for several problems rapid mixing is

In this paper we analyze the expected depth of a circuit randomly generated from a uniform model. We show that the expected depth of such circuits is polylogarithmic in the number of gates. This result allows us to place ...

Given any two vertices u, v of a random geometric graph G(n, r), denote by dE(u, v) their Euclidean distance and by dE(u, v) their graph distance. The problem of finding upper bounds on dG(u, v) conditional on dE(u, v) ...