8 citations · 10 across the 5 of their papers we have counts for
6 papers
On Computing Pareto Optimal Paths in Weighted Time-Dependent Networks
Filippo Brunelli, Pierluigi Crescenzi, Laurent Viennot
A weighted point-availability time-dependent network is a list of temporal edges, where each temporal edge has an appearing time value, a travel time value, and a cost value. In th…
Simple and Fast Distributed Computation of Betweenness Centrality
Pierluigi Crescenzi, Pierre Fraigniaud, Ami Paz
Betweenness centrality is a graph parameter that has been successfully applied to network analysis. In the context of computer networks, it was considered for various objectives, r…
Trade-offs in Distributed Interactive Proofs
Pierluigi Crescenzi, Pierre Fraigniaud, Ami Paz
The study of interactive proofs in the context of distributed network computing is a novel topic, recently introduced by Kol, Oshman, and Saxena [PODC 2018]. In the spirit of seque…
Sigil3D: A Crowdsourcing Platform for Interactive 3D Content
Andrea Barillari, Daniele Bernardini, Pierluigi Crescenzi
In this paper we propose applying the crowdsourcing approach to a software platform that uses a modern and state-of-the-art 3D game engine. This platform could facilitate the gener…
Fast and Simple Computation of Top-k Closeness Centralities
Michele Borassi, Pierluigi Crescenzi, Andrea Marino
Closeness is an important centrality measure widely used in the analysis of real-world complex networks. In particular, the problem of selecting the k most central nodes with respe…
Rumor Spreading in Random Evolving Graphs
Andrea Clementi, Pierluigi Crescenzi, Carola Doerr +5
Randomized gossip is one of the most popular way of disseminating information in large scale networks. This method is appreciated for its simplicity, robustness, and efficiency. In…