Planar embeddability of the vertices of a graph using a fixed point set is NP-hard. Cabello, Sergio — 2006 Journal of Graph Algorithms and Applications
The complexity of obtaining a distance-balanced graph. Cabello, Sergio; Lukšič, Primož — 2011 The Electronic Journal of Combinatorics [electronic only]
The Fibonacci dimension of a graph. Cabello, Sergio; Eppstein, David; Klavžar, Sandi — 2011 The Electronic Journal of Combinatorics [electronic only]
Geometric simultaneous embeddings of a graph and a matching. Cabello, Sergio; Van Kreveld, Marc; Liotta, Giuseppe; Meijer, Henk; Speckmann, Bettina; Verbeek, Kevin — 2011 Journal of Graph Algorithms and Applications