6 citations · 13 across the 7 of their papers we have counts for
6 papers · 1 filter
On the Minimum Consistent Subset Problem
Ahmad Biniaz, Sergio Cabello, Paz Carmi +4
Let be a set of colored points in the plane. Introduced by Hart (1968), a consistent subset of , is a set such that for every point in ,…
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…
Computing Shapley values in the plane
Sergio Cabello, Timothy M. Chan
We consider the problem of computing Shapley values for points in the plane, where each point is interpreted as a player, and the value of a coalition is defined by the area of usu…
Maximum Volume Subset Selection for Anchored Boxes
Karl Bringmann, Sergio Cabello, Michael T. M. Emmerich
Let be a set of axis-parallel boxes in such that each box has a corner at the origin and the other corner in the positive quadrant of , and let…
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…