66 citations · 204 across the 20 of their papers we have counts for
3 papers · 1 filter
On the approximability and exact algorithms for vector domination and related problems in graphs
Ferdinando Cicalese, Martin Milanic, Ugo Vaccaro
We consider two graph optimization problems called vector domination and total vector domination. In vector domination one seeks a small subset S of vertices of a graph such that a…
Superselectors: Efficient Constructions and Applications
Ferdinando Cicalese, Ugo Vaccaro
We introduce a new combinatorial structure: the superselector. We show that superselectors subsume several important combinatorial structures used in the past few years to solve pr…
Competitive Boolean Function Evaluation: Beyond Monotonicity, and the Symmetric Case
Ferdinando Cicalese, Travis Gagie, Eduardo Laber +1
We study the extremal competitive ratio of Boolean function evaluation. We provide the first non-trivial lower and upper bounds for classes of Boolean functions which are not inclu…