Sergio Cabello

activity

20092023

most citedParameterized Complexity of 1-Planarity

52 citations · 118 across the 27 of their papers we have counts for

collaborators

Showing 2012 · cs.DSShow all

2 papers · 2 filters

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.DS2012★ 6 cited

Multiple-Source Shortest Paths in Embedded Graphs

Sergio Cabello, Erin Wolf Chambers, Jeff Erickson

Let G be a directed graph with n vertices and non-negative weights in its directed edges, embedded on a surface of genus g, and let f be an arbitrary face of G. We describe a rando…