Sergio Cabello

activity

20092012

most citedMinimum cell connection and separation in line segment arrangements

6 citations · 13 across the 3 of their papers we have counts for

collaborators

3 papers

cs.DS2012★ 6 cited

Stackelberg Shortest Path Tree Game, Revisited

Sergio Cabello

Let $G (V, E)$ be a directed graph with $n$ vertices and $m$ edges. The edges $E$ of $G$ are divided into two types: $E_{F}$ and $E_{P}$ . Each edge of $E_{F}$ has a fixed price. The edges…

cs.CG2011★ 6 cited

Minimum cell connection and separation in line segment arrangements

Helmut Alt, Sergio Cabello, Panos Giannopoulos +1

We study the complexity of the following cell connection and separation problems in segment arrangements. Given a set of straight-line segments in the plane and two points $a$ and…

math.CO2009★ 1 cited

The Fibonacci dimension of a graph

Sergio Cabello, David Eppstein, Sandi Klavzar

The Fibonacci dimension fdim(G) of a graph G is introduced as the smallest integer f such that G admits an isometric embedding into Gamma_f, the f-dimensional Fibonacci cube. We gi…