6 citations · 13 across the 7 of their papers we have counts for
7 papers · 1 filter
The Complexity of Mixed-Connectivity
Édouard Bonnet, Sergio Cabello
We investigate the parameterized complexity in and of determining whether a graph~ has a subset of vertices and edges whose removal disconnects , or disconnec…
Encoding 3SUM
Sergio Cabello, Jean Cardinal, John Iacono +3
We consider the following problem: given three sets of real numbers, output a word-RAM data structure from which we can efficiently recover the sign of the sum of any triple of num…
The inverse Voronoi problem in graphs
Édouard Bonnet, Sergio Cabello, Bojan Mohar +1
We introduce the inverse Voronoi diagram problem in graphs: given a graph with positive edge-lengths and a collection of subsets of vertices of , decide whet…
Minimum Shared-Power Edge Cut
Sergio Cabello, Kshitij Jain, Anna Lubiw +1
We introduce a problem called the Minimum Shared-Power Edge Cut (MSPEC). The input to the problem is an undirected edge-weighted graph with distinguished vertices s and t, and the…
The parameterized complexity of finding a 2-sphere in a simplicial complex
Benjamin Burton, Sergio Cabello, Stefan Kratsch +1
We consider the problem of finding a subcomplex K' of a simplicial complex K such that K' is homeomorphic to the 2-dimensional sphere, S^2. We study two variants of this problem. T…
Interval Selection in the Streaming Model
Sergio Cabello, Pablo Pérez-Lantero
A set of intervals is independent when the intervals are pairwise disjoint. In the interval selection problem we are given a set of intervals and we want to find an in…