10 citations · 10 across the 3 of their papers we have counts for
10 papers
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…
Coalition Resilient Outcomes in Max k-Cut Games
Raffaello Carosi, Simone Fioravanti, Luciano Gualà +1
We investigate strong Nash equilibria in the \emph{max -cut game}, where we are given an undirected edge-weighted graph together with a set of colors. Node…
Consensus Needs Broadcast in Noiseless Models but can be Exponentially Easier in the Presence of Noise
Andrea Clementi, Luciano Gualà, Emanuele Natale +3
Consensus and Broadcast are two fundamental problems in distributed computing, whose solutions have several applications. Intuitively, Consensus should be no harder than Broadcast,…
An Improved Algorithm for Computing All the Best Swap Edges of a Tree Spanner
Davide Bilò, Feliciano Colella, Luciano Gualà +2
A tree -spanner of a positively real-weighted -vertex and -edge undirected graph is a spanning tree of which approximately preserves (i.e., up to a multiplicat…