A Truthful (2-2/k)-Approximation Mechanism for the Steiner Tree Problem with k Terminals. - Luciano Gualà; Guido Proietti (COCOON, 2005)

Designing a Truthful Mechanism for a Spanning Arborescence Bicriteria Problem. - Davide Bilò; Luciano Gualà; Guido Proietti (CAAN, 2006)

On the Existence of Truthful Mechanisms for the Minimum-Cost Approximate Shortest-Paths Tree Problem. - Davide Bilò; Luciano Gualà; Guido Proietti (SIROCCO, 2006)

Locating Facilities on a Network to Minimize Their Average Service Radius. - Davide Bilò; Jörg Derungs; Luciano Gualà; Guido Proietti; Peter Widmayer (ISAAC, 2007)

An algorithm composition scheme preserving monotonicity. - Davide Bilò; Luca Forlizzi; Luciano Gualà; Guido Proietti (PODC, 2007)

Exact and Approximate Truthful Mechanisms for the Shortest Paths Tree Problem. - Luciano Gualà; Guido Proietti (Algorithmica, 2007)

Efficient truthful mechanisms for the single-source shortest paths tree problem. - Luciano Gualà; Guido Proietti (Concurr. Comput. Pract. Exp., 2007)

Computational Aspects of a 2-Player Stackelberg Shortest Paths Tree Game. - Davide Bilò; Luciano Gualà; Guido Proietti; Peter Widmayer (WINE, 2008)

Approximate Mechanisms for the Graphical TSP and Other Graph-Traversal Problems. - Davide Bilò; Luca Forlizzi; Luciano Gualà; Guido Proietti (Internet Math., 2008)

Stability of Networks in Stretchable Graphs. - Davide Bilò; Michael Gatto; Luciano Gualà; Guido Proietti; Peter Widmayer (SIROCCO, 2009)

On Stackelberg Pricing with Computationally Bounded Consumers. - Patrick Briest; Martin Hoefer 001; Luciano Gualà; Carmine Ventre (WINE, 2009)

Dynamic mechanism design. - Davide Bilò; Luciano Gualà; Guido Proietti (Theor. Comput. Sci., 2009)

On stackelberg pricing with computationally bounded customers. - Patrick Briest; Luciano Gualà; Martin Hoefer 001; Carmine Ventre (Networks, 2012)

Improved approximability and non-approximability results for graph diameter decreasing problems. - Davide Bilò; Luciano Gualà; Guido Proietti (Theor. Comput. Sci., 2012)

Polygon-Constrained Motion Planning Problems. - Davide Bilò; Yann Disser; Luciano Gualà; Matús Mihalák; Guido Proietti; Peter Widmayer (ALGOSENSORS, 2013)

Bejeweled, Candy Crush and other match-three games are (NP-)hard. - Luciano Gualà; Stefano Leucci 001; Emanuele Natale (CIG, 2014)

Finding Best Swap Edges Minimizing the Routing Cost of a Spanning Tree. - Davide Bilò; Luciano Gualà; Guido Proietti (Algorithmica, 2014)

Improved Purely Additive Fault-Tolerant Spanners. - Davide Bilò; Fabrizio Grandoni 001; Luciano Gualà; Stefano Leucci 001; Guido Proietti (ESA, 2015)

A Faster Computation of All the Best Swap Edges of a Tree Spanner. - Davide Bilò; Feliciano Colella; Luciano Gualà; Stefano Leucci 001; Guido Proietti (SIROCCO, 2015)

A Faster Computation of All the Best Swap Edges of a Shortest Paths Tree. - Davide Bilò; Luciano Gualà; Guido Proietti (Algorithmica, 2015)

Reducing the diameter of a unit disk graph via node addition. - Miriam Di Ianni; Luciano Gualà; Gianluca Rossi (Inf. Process. Lett., 2015)

Network verification via routing table queries. - Evangelos Bampas; Davide Bilò; Guido Drovandi; Luciano Gualà; Ralf Klasing; Guido Proietti (J. Comput. Syst. Sci., 2015)

The max-distance network creation game on general host graphs. - Davide Bilò; Luciano Gualà; Stefano Leucci 001; Guido Proietti (Theor. Comput. Sci., 2015)

Specializations and generalizations of the Stackelberg minimum spanning tree game. - Davide Bilò; Luciano Gualà; Stefano Leucci 001; Guido Proietti (Theor. Comput. Sci., 2015)

Bounded-Distance Network Creation Games. - Davide Bilò; Luciano Gualà; Guido Proietti (ACM Trans. Economics and Comput., 2015)

Compact and Fast Sensitivity Oracles for Single-Source Distances. - Davide Bilò; Luciano Gualà; Stefano Leucci 001; Guido Proietti (ESA, 2016)

Large Peg-Army Maneuvers. - Luciano Gualà; Stefano Leucci 001; Emanuele Natale; Roberto Tauraso (FUN, 2016)

Exact and approximate algorithms for movement problems on (special classes of) graphs. - Davide Bilò; Luciano Gualà; Stefano Leucci 001; Guido Proietti (Theor. Comput. Sci., 2016)

Locality-Based Network Creation Games. - Davide Bilò; Luciano Gualà; Stefano Leucci 001; Guido Proietti (ACM Trans. Parallel Comput., 2016)

Rational Fair Consensus in the Gossip Model. - Andrea Clementi; Luciano Gualà; Guido Proietti; Giacomo Scornavacca (IPDPS, 2017)

Effective Edge-Fault-Tolerant Single-Source Spanners via Best (or Good) Swap Edges. - Davide Bilò; Feliciano Colella; Luciano Gualà; Stefano Leucci 001; Guido Proietti (SIROCCO, 2017)

Brief Announcement: On the Parallel Undecided-State Dynamics with Two Colors. - Andrea Clementi; Luciano Gualà; Francesco Pasquale; Giacomo Scornavacca (DISC, 2017)

On the Parallel Undecided-State Dynamics with Two Colors. - Andrea Clementi; Luciano Gualà; Francesco Pasquale; Giacomo Scornavacca (CoRR, 2017)

On the Complexity of Two Dots for Narrow Boards and Few Colors. - Davide Bilò; Luciano Gualà; Stefano Leucci 001; Neeldhara Misra (FUN, 2018)

On the PSPACE-completeness of Peg Duotaire and other Peg-Jumping Games. - Davide Bilò; Luciano Gualà; Stefano Leucci 001; Guido Proietti; Mirko Rossi (FUN, 2018)

A Tight Analysis of the Parallel Undecided-State Dynamics with Two Colors. - Andrea Clementi; Mohsen Ghaffari 001; Luciano Gualà; Emanuele Natale; Francesco Pasquale; Giacomo Scornavacca (MFCS, 2018)

Efficient Oracles and Routing Schemes for Replacement Paths. - Davide Bilò; Keerti Choudhary; Luciano Gualà; Stefano Leucci 001; Merav Parter; Guido Proietti (STACS, 2018)

Fault-Tolerant Approximate Shortest-Path Trees. - Davide Bilò; Luciano Gualà; Stefano Leucci 001; Guido Proietti (Algorithmica, 2018)

Consensus Needs Broadcast in Noiseless Models but can be Exponentially Easier in the Presence of Noise. - Andrea Clementi; Luciano Gualà; Emanuele Natale; Francesco Pasquale; Giacomo Scornavacca; Luca Trevisan 001 (CoRR, 2018)

Coalition Resilient Outcomes in Max k-Cut Games. - Raffaello Carosi; Simone Fioravanti; Luciano Gualà; Gianpiero Monaco (SOFSEM, 2019)

Consensus vs Broadcast, with and Without Noise (Extended Abstract). - Andrea Clementi; Luciano Gualà; Emanuele Natale; Francesco Pasquale; Giacomo Scornavacca; Luca Trevisan 001 (ITCS, 2020)

An Improved Algorithm for Computing All the Best Swap Edges of a Tree Spanner. - Davide Bilò; Feliciano Colella; Luciano Gualà; Stefano Leucci 001; Guido Proietti (Algorithmica, 2020)

Tracking routes in communication networks. - Davide Bilò; Luciano Gualà; Stefano Leucci 001; Guido Proietti (Theor. Comput. Sci., 2020)

Network Creation Games with Traceroute-Based Strategies. - Davide Bilò; Luciano Gualà; Stefano Leucci 001; Guido Proietti (Algorithms, 2021)

Hardness of an Asymmetric 2-Player Stackelberg Network Pricing Game. - Davide Bilò; Luciano Gualà; Guido Proietti (Algorithms, 2021)

Finding single-source shortest p-disjoint paths: fast computation and sparse preservers. - Davide Bilò; Gianlorenzo D'Angelo; Luciano Gualà; Stefano Leucci 001; Guido Proietti; Mirko Rossi (CoRR, 2021)

Sparse Temporal Spanners with Low Stretch. - Davide Bilò; Gianlorenzo D'Angelo; Luciano Gualà; Stefano Leucci 001; Mirko Rossi (ESA, 2022)

Single-Source Shortest p-Disjoint Paths: Fast Computation and Sparse Preservers. - Davide Bilò; Gianlorenzo D'Angelo; Luciano Gualà; Stefano Leucci 001; Guido Proietti; Mirko Rossi (STACS, 2022)

Multiple-Edge-Fault-Tolerant Approximate Shortest-Path Trees. - Davide Bilò; Luciano Gualà; Stefano Leucci 001; Guido Proietti (Algorithmica, 2022)

Cutting bamboo down to size. - Davide Bilò; Luciano Gualà; Stefano Leucci 001; Guido Proietti; Giacomo Scornavacca (Theor. Comput. Sci., 2022)

New approximation algorithms for the heterogeneous weighted delivery problem. - Davide Bilò; Luciano Gualà; Stefano Leucci 001; Guido Proietti; Mirko Rossi (Theor. Comput. Sci., 2022)

Resilient Level Ancestor, Bottleneck, and Lowest Common Ancestor Queries in Dynamic Trees. - Luciano Gualà; Stefano Leucci 001; Isabella Ziccardi (Algorithmica, 2023)

Graph Spanners for Group Steiner Distances. - Davide Bilò; Luciano Gualà; Stefano Leucci 001; Alessandro Straziota (ESA, 2024)

Uniform-Budget Solo Chess with Only Rooks or Only Knights Is Hard. - Davide Bilò; Luca Di Donato; Luciano Gualà; Stefano Leucci 001 (FUN, 2024)

Swapping Mixed-Up Beers to Keep Them Cool. - Davide Bilò; Maurizio Fiusco; Luciano Gualà; Stefano Leucci 001 (FUN, 2024)

Temporal Queries for Dynamic Temporal Forests. - Davide Bilò; Luciano Gualà; Stefano Leucci 001; Guido Proietti; Alessandro Straziota (ISAAC, 2024)

Blackout-tolerant temporal spanners. - Davide Bilò; Gianlorenzo D'Angelo; Luciano Gualà; Stefano Leucci 001; Mirko Rossi (J. Comput. Syst. Sci., 2024)

Maintaining k-MinHash Signatures over Fully-Dynamic Data Streams with Recovery. - Andrea Clementi; Luciano Gualà; Luca Pepè Sciarria; Alessandro Straziota (WSDM, 2025)

Finding diameter-reducing shortcuts in trees. - Davide Bilò; Luciano Gualà; Stefano Leucci 001; Luca Pepè Sciarria (J. Comput. Syst. Sci., 2025)

Approximate 2-hop neighborhoods on incremental graphs: An efficient lazy approach. - Luca Becchetti; Andrea Clementi; Luciano Gualà; Luca Pepè Sciarria; Alessandro Straziota; Matteo Stromieri (CoRR, 2025)