10 citations · 22 across the 9 of their papers we have counts for
14 papers · 1 filter
An Optimal Sorting Algorithm for Persistent Random Comparison Faults
Barbara Geissmann, Stefano Leucci, Chih-Hung Liu +1
We consider the problem of sorting elements subject to persistent random comparison errors. In this problem, each comparison between two elements can be wrong with some fixed (…
On the (In)Approximability of the Monitoring Edge Geodetic Set Problem
Davide Bilò, Giordano Colli, Luca Forlizzi +1
We study the minimum \emph{Monitoring Edge Geodetic Set} (\megset) problem introduced in [Foucaud et al., CALDAM'23]: given a graph , we say that an edge is monitored by a pair…
Temporal queries for dynamic temporal forests
Davide Bilò, Luciano Gualà, Stefano Leucci +2
In a temporal forest each edge has an associated set of time labels that specify the time instants in which the edges are available. A temporal path from vertex to vertex i…
Resilient Level Ancestor, Bottleneck, and Lowest Common Ancestor Queries in Dynamic Trees
Luciano Gualà, Stefano Leucci, Isabella Ziccardi
We study the problem of designing a \emph{resilient} data structure maintaining a tree under the Faulty-RAM model [Finocchi and Italiano, STOC'04] in which up to memory words c…
Finding single-source shortest -disjoint paths: fast computation and sparse preservers
Davide Bilò, Gianlorenzo D'Angelo, Luciano Gualà +3
Let be a directed graph with vertices, edges, and non-negative edge costs. Given , a fixed source vertex , and a positive integer , we consider the problem of…
Cutting Bamboo Down to Size
Davide Bilò, Luciano Gualà, Stefano Leucci +2
This paper studies the problem of programming a robotic panda gardener to keep a bamboo garden from obstructing the view of the lake by your house. The garden consists of bambo…