Luciano Gualà

108 papers A* 1A 13B 19C 2Misc 7Journal 55Unranked 11

Year	Rank	Type	Title / Venue / Authors
2025	—	`conf`	Almost Tight Oracles for Fastest-Path Queries on Temporal Trees. ALGOWIN Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti, Alessandro Straziota
2025	J	`jnl`	Approximate 2-hop neighborhoods on incremental graphs: An efficient lazy approach. CoRR Luca Becchetti, Andrea Clementi, Luciano Gualà, Luca Pepè Sciarria, Alessandro Straziota, Matteo Stromieri
2025	J	`jnl`	Approximate 2-hop neighborhoods on incremental graphs: An efficient lazy approach. Proc. VLDB Endow. Luca Becchetti, Andrea Clementi, Luciano Gualà, Luca Pepè Sciarria, Alessandro Straziota, Matteo Stromieri
2025	J	`jnl`	Finding diameter-reducing shortcuts in trees. J. Comput. Syst. Sci. Davide Bilò, Luciano Gualà, Stefano Leucci, Luca Pepè Sciarria
2025	A	`conf`	Maintaining WSDM Andrea Clementi, Luciano Gualà, Luca Pepè Sciarria, Alessandro Straziota
2025	J	`jnl`	Uniform-budget solo chess with only rooks or only knights is hard. Theor. Comput. Sci. Davide Bilò, Luca Di Donato, Luciano Gualà, Stefano Leucci
2024	J	`jnl`	Blackout-tolerant temporal spanners. J. Comput. Syst. Sci. Davide Bilò, Gianlorenzo D'Angelo, Luciano Gualà, Stefano Leucci, Mirko Rossi
2024	A	`conf`	Graph Spanners for Group Steiner Distances. ESA Davide Bilò, Luciano Gualà, Stefano Leucci, Alessandro Straziota
2024	J	`jnl`	Graph Spanners for Group Steiner Distances. CoRR Davide Bilò, Luciano Gualà, Stefano Leucci, Alessandro Straziota
2024	J	`jnl`	Maintaining CoRR Andrea Clementi, Luciano Gualà, Luca Pepè Sciarria, Alessandro Straziota
2024	Misc	`conf`	Swapping Mixed-Up Beers to Keep Them Cool. FUN Davide Bilò, Maurizio Fiusco, Luciano Gualà, Stefano Leucci
2024	B	`conf`	Temporal Queries for Dynamic Temporal Forests. ISAAC Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti, Alessandro Straziota
2024	J	`jnl`	Temporal queries for dynamic temporal forests. CoRR Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti, Alessandro Straziota
2024	Misc	`conf`	Uniform-Budget Solo Chess with Only Rooks or Only Knights Is Hard. FUN Davide Bilò, Luca Di Donato, Luciano Gualà, Stefano Leucci
2023	B	`conf`	Finding Diameter-Reducing Shortcuts in Trees. WADS Davide Bilò, Luciano Gualà, Stefano Leucci, Luca Pepè Sciarria
2023	J	`jnl`	Finding Diameter-Reducing Shortcuts in Trees. CoRR Davide Bilò, Luciano Gualà, Stefano Leucci, Luca Pepè Sciarria
2023	J	`jnl`	Resilient Level Ancestor, Bottleneck, and Lowest Common Ancestor Queries in Dynamic Trees. Algorithmica Luciano Gualà, Stefano Leucci, Isabella Ziccardi
2022	C	`conf`	Blackout-Tolerant Temporal Spanners. ALGOSENSORS Davide Bilò, Gianlorenzo D'Angelo, Luciano Gualà, Stefano Leucci, Mirko Rossi
2022	J	`jnl`	Cutting bamboo down to size. Theor. Comput. Sci. Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti, Giacomo Scornavacca
2022	J	`jnl`	Multiple-Edge-Fault-Tolerant Approximate Shortest-Path Trees. Algorithmica Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti
2022	J	`jnl`	New approximation algorithms for the heterogeneous weighted delivery problem. Theor. Comput. Sci. Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti, Mirko Rossi
2022	A	`conf`	Single-Source Shortest p-Disjoint Paths: Fast Computation and Sparse Preservers. STACS Davide Bilò, Gianlorenzo D'Angelo, Luciano Gualà, Stefano Leucci, Guido Proietti, Mirko Rossi
2022	A	`conf`	Sparse Temporal Spanners with Low Stretch. ESA Davide Bilò, Gianlorenzo D'Angelo, Luciano Gualà, Stefano Leucci, Mirko Rossi
2022	J	`jnl`	Sparse Temporal Spanners with Low Stretch. CoRR Davide Bilò, Gianlorenzo D'Angelo, Luciano Gualà, Stefano Leucci, Mirko Rossi
2021	Misc	`conf`	Cutting Bamboo down to Size. FUN Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti, Giacomo Scornavacca
2021	J	`jnl`	Finding single-source shortest p-disjoint paths: fast computation and sparse preservers. CoRR Davide Bilò, Gianlorenzo D'Angelo, Luciano Gualà, Stefano Leucci, Guido Proietti, Mirko Rossi
2021	J	`jnl`	Hardness of an Asymmetric 2-Player Stackelberg Network Pricing Game. Algorithms Davide Bilò, Luciano Gualà, Guido Proietti
2021	J	`jnl`	Network Creation Games with Traceroute-Based Strategies. Algorithms Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti
2021	B	`conf`	New Approximation Algorithms for the Heterogeneous Weighted Delivery Problem. SIROCCO Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti, Mirko Rossi
2021	B	`conf`	Resilient Level Ancestor, Bottleneck, and Lowest Common Ancestor Queries in Dynamic Trees. ISAAC Luciano Gualà, Stefano Leucci, Isabella Ziccardi
2021	J	`jnl`	Resilient Level Ancestor, Bottleneck, and Lowest Common Ancestor Queries in Dynamic Trees. CoRR Luciano Gualà, Stefano Leucci, Isabella Ziccardi
2020	J	`jnl`	An Improved Algorithm for Computing All the Best Swap Edges of a Tree Spanner. Algorithmica Davide Bilò, Feliciano Colella, Luciano Gualà, Stefano Leucci, Guido Proietti
2020	A	`conf`	Consensus vs Broadcast, with and Without Noise (Extended Abstract). ITCS Andrea Clementi, Luciano Gualà, Emanuele Natale, Francesco Pasquale, Giacomo Scornavacca, Luca Trevisan
2020	J	`jnl`	Cutting Bamboo Down to Size. CoRR Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti, Giacomo Scornavacca
2020	J	`jnl`	Tracking routes in communication networks. Theor. Comput. Sci. Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti
2019	B	`conf`	Coalition Resilient Outcomes in Max k-Cut Games. SOFSEM Raffaello Carosi, Simone Fioravanti, Luciano Gualà, Gianpiero Monaco
2019	B	`conf`	Tracking Routes in Communication Networks. SIROCCO Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti
2018	B	`conf`	A Tight Analysis of the Parallel Undecided-State Dynamics with Two Colors. MFCS Andrea Clementi, Mohsen Ghaffari, Luciano Gualà, Emanuele Natale, Francesco Pasquale, Giacomo Scornavacca
2018	J	`jnl`	Coalition Resilient Outcomes in Max k-Cut Games. CoRR Raffaello Carosi, Simone Fioravanti, Luciano Gualà, Gianpiero Monaco
2018	J	`jnl`	Consensus Needs Broadcast in Noiseless Models but can be Exponentially Easier in the Presence of Noise. CoRR Andrea Clementi, Luciano Gualà, Emanuele Natale, Francesco Pasquale, Giacomo Scornavacca, Luca Trevisan
2018	A	`conf`	Efficient Oracles and Routing Schemes for Replacement Paths. STACS Davide Bilò, Keerti Choudhary, Luciano Gualà, Stefano Leucci, Merav Parter, Guido Proietti
2018	J	`jnl`	Fault-Tolerant Approximate Shortest-Path Trees. Algorithmica Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti
2018	Misc	`conf`	On the Complexity of Two Dots for Narrow Boards and Few Colors. FUN Davide Bilò, Luciano Gualà, Stefano Leucci, Neeldhara Misra
2018	Misc	`conf`	On the PSPACE-completeness of Peg Duotaire and other Peg-Jumping Games. FUN Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti, Mirko Rossi
2017	B	`conf`	An Improved Algorithm for Computing All the Best Swap Edges of a Tree Spanner. ISAAC Davide Bilò, Feliciano Colella, Luciano Gualà, Stefano Leucci, Guido Proietti
2017	J	`jnl`	An Improved Algorithm for Computing All the Best Swap Edges of a Tree Spanner. CoRR Davide Bilò, Feliciano Colella, Luciano Gualà, Stefano Leucci, Guido Proietti
2017	A	`conf`	Brief Announcement: On the Parallel Undecided-State Dynamics with Two Colors. DISC Andrea Clementi, Luciano Gualà, Francesco Pasquale, Giacomo Scornavacca
2017	B	`conf`	Effective Edge-Fault-Tolerant Single-Source Spanners via Best (or Good) Swap Edges. SIROCCO Davide Bilò, Feliciano Colella, Luciano Gualà, Stefano Leucci, Guido Proietti
2017	J	`jnl`	Effective Edge-Fault-Tolerant Single-Source Spanners via Best (or Good) Swap Edges. CoRR Davide Bilò, Feliciano Colella, Luciano Gualà, Stefano Leucci, Guido Proietti
2017	J	`jnl`	On the Parallel Undecided-State Dynamics with Two Colors. CoRR Andrea Clementi, Luciano Gualà, Francesco Pasquale, Giacomo Scornavacca
2017	J	`jnl`	Rational Fair Consensus in the GOSSIP Model. CoRR Andrea Clementi, Luciano Gualà, Guido Proietti, Giacomo Scornavacca
2017	A	`conf`	Rational Fair Consensus in the Gossip Model. IPDPS Andrea Clementi, Luciano Gualà, Guido Proietti, Giacomo Scornavacca
2016	A	`conf`	Compact and Fast Sensitivity Oracles for Single-Source Distances. ESA Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti
2016	J	`jnl`	Compact and Fast Sensitivity Oracles for Single-Source Distances. CoRR Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti
2016	J	`jnl`	Exact and approximate algorithms for movement problems on (special classes of) graphs. Theor. Comput. Sci. Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti
2016	Misc	`conf`	Large Peg-Army Maneuvers. FUN Luciano Gualà, Stefano Leucci, Emanuele Natale, Roberto Tauraso
2016	J	`jnl`	Large Peg-Army Maneuvers. CoRR Luciano Gualà, Stefano Leucci, Emanuele Natale, Roberto Tauraso
2016	J	`jnl`	Locality-Based Network Creation Games. ACM Trans. Parallel Comput. Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti
2016	J	`jnl`	Locality-based Network Creation Games. CoRR Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti
2016	A	`conf`	Multiple-Edge-Fault-Tolerant Approximate Shortest-Path Trees. STACS Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti
2016	J	`jnl`	Multiple-Edge-Fault-Tolerant Approximate Shortest-Path Trees. CoRR Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti
2015	J	`jnl`	A Faster Computation of All the Best Swap Edges of a Shortest Paths Tree. Algorithmica Davide Bilò, Luciano Gualà, Guido Proietti
2015	B	`conf`	A Faster Computation of All the Best Swap Edges of a Tree Spanner. SIROCCO Davide Bilò, Feliciano Colella, Luciano Gualà, Stefano Leucci, Guido Proietti
2015	J	`jnl`	Bounded-Distance Network Creation Games. ACM Trans. Economics and Comput. Davide Bilò, Luciano Gualà, Guido Proietti
2015	A	`conf`	Improved Purely Additive Fault-Tolerant Spanners. ESA Davide Bilò, Fabrizio Grandoni, Luciano Gualà, Stefano Leucci, Guido Proietti
2015	J	`jnl`	Improved Purely Additive Fault-Tolerant Spanners. CoRR Davide Bilò, Fabrizio Grandoni, Luciano Gualà, Stefano Leucci, Guido Proietti
2015	J	`jnl`	Network verification via routing table queries. J. Comput. Syst. Sci. Evangelos Bampas, Davide Bilò, Guido Drovandi, Luciano Gualà, Ralf Klasing, Guido Proietti
2015	J	`jnl`	Reducing the diameter of a unit disk graph via node addition. Inf. Process. Lett. Miriam Di Ianni, Luciano Gualà, Gianluca Rossi
2015	J	`jnl`	Specializations and generalizations of the Stackelberg minimum spanning tree game. Theor. Comput. Sci. Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti
2015	J	`jnl`	The max-distance network creation game on general host graphs. Theor. Comput. Sci. Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti
2014	J	`jnl`	Bejeweled, Candy Crush and other Match-Three Games are (NP-)Hard. CoRR Luciano Gualà, Stefano Leucci, Emanuele Natale
2014	—	`conf`	Bejeweled, Candy Crush and other match-three games are (NP-)hard. CIG Luciano Gualà, Stefano Leucci, Emanuele Natale
2014	J	`jnl`	Exact and approximate algorithms for movement problems on (special classes of) graphs. CoRR Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti
2014	A	`conf`	Fault-Tolerant Approximate Shortest-Path Trees. ESA Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti
2014	J	`jnl`	Fault-Tolerant Approximate Shortest-Path Trees. CoRR Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti
2014	J	`jnl`	Finding Best Swap Edges Minimizing the Routing Cost of a Spanning Tree. Algorithmica Davide Bilò, Luciano Gualà, Guido Proietti
2014	B	`conf`	Locality-based network creation games. SPAA Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti
2014	B	`conf`	Network Creation Games with Traceroute-Based Strategies. SIROCCO Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti
2014	J	`jnl`	Specializations and Generalizations of the Stackelberg Minimum Spanning Tree Game. CoRR Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti
2014	J	`jnl`	The Max-Distance Network Creation Game on General Host Graphs. CoRR Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti
2013	A	`conf`	A Faster Computation of All the Best Swap Edges of a Shortest Paths Tree. ESA Davide Bilò, Luciano Gualà, Guido Proietti
2013	B	`conf`	Exact and Approximate Algorithms for Movement Problems on (Special Classes of) Graphs. SIROCCO Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti
2013	C	`conf`	Polygon-Constrained Motion Planning Problems. ALGOSENSORS Davide Bilò, Yann Disser, Luciano Gualà, Matús Mihalák, Guido Proietti, Peter Widmayer
2012	—	`conf`	Bounded-Distance Network Creation Games. WINE Davide Bilò, Luciano Gualà, Guido Proietti
2012	J	`jnl`	Improved approximability and non-approximability results for graph diameter decreasing problems. Theor. Comput. Sci. Davide Bilò, Luciano Gualà, Guido Proietti
2012	J	`jnl`	On stackelberg pricing with computationally bounded customers. Networks Patrick Briest, Luciano Gualà, Martin Hoefer, Carmine Ventre
2012	—	`conf`	The Max-Distance Network Creation Game on General Host Graphs. WINE Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti
2011	J	`jnl`	Bounded-Distance Network Creation Games CoRR Davide Bilò, Luciano Gualà, Guido Proietti
2011	B	`conf`	Network Verification via Routing Table Queries. SIROCCO Evangelos Bampas, Davide Bilò, Guido Drovandi, Luciano Gualà, Ralf Klasing, Guido Proietti
2010	B	`conf`	Finding Best Swap Edges Minimizing the Routing Cost of a Spanning Tree. MFCS Davide Bilò, Luciano Gualà, Guido Proietti
2010	B	`conf`	Improved Approximability and Non-approximability Results for Graph Diameter Decreasing Problems. MFCS Davide Bilò, Luciano Gualà, Guido Proietti
2010	—	`conf`	Specializations and Generalizations of the Stackelberg Minimum Spanning Tree Game. WINE Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti
2009	J	`jnl`	Dynamic mechanism design. Theor. Comput. Sci. Davide Bilò, Luciano Gualà, Guido Proietti
2009	J	`jnl`	Hardness of an Asymmetric 2-player Stackelberg Network Pricing Game. Electron. Colloquium Comput. Complex. Davide Bilò, Luciano Gualà, Guido Proietti
2009	—	`conf`	On Stackelberg Pricing with Computationally Bounded Consumers. WINE Patrick Briest, Martin Hoefer, Luciano Gualà, Carmine Ventre
2009	B	`conf`	Stability of Networks in Stretchable Graphs. SIROCCO Davide Bilò, Michael Gatto, Luciano Gualà, Guido Proietti, Peter Widmayer
2008	J	`jnl`	Approximate Mechanisms for the Graphical TSP and Other Graph-Traversal Problems. Internet Math. Davide Bilò, Luca Forlizzi, Luciano Gualà, Guido Proietti
2008	—	`conf`	Computational Aspects of a 2-Player Stackelberg Shortest Paths Tree Game. WINE Davide Bilò, Luciano Gualà, Guido Proietti, Peter Widmayer
2007	A*	`conf`	An algorithm composition scheme preserving monotonicity. PODC Davide Bilò, Luca Forlizzi, Luciano Gualà, Guido Proietti
2007	—	`conf`	Approximate Mechanisms for the Graphical TSP and Other Graph Traversal Problems. WINE Davide Bilò, Luca Forlizzi, Luciano Gualà, Guido Proietti
2007	J	`jnl`	Efficient truthful mechanisms for the single-source shortest paths tree problem. Concurr. Comput. Pract. Exp. Luciano Gualà, Guido Proietti
2007	J	`jnl`	Exact and Approximate Truthful Mechanisms for the Shortest Paths Tree Problem. Algorithmica Luciano Gualà, Guido Proietti
2007	B	`conf`	Locating Facilities on a Network to Minimize Their Average Service Radius. ISAAC Davide Bilò, Jörg Derungs, Luciano Gualà, Guido Proietti, Peter Widmayer
2006	—	`conf`	Designing a Truthful Mechanism for a Spanning Arborescence Bicriteria Problem. CAAN Davide Bilò, Luciano Gualà, Guido Proietti
2006	—	`conf`	Dynamic Mechanism Design. WINE Davide Bilò, Luciano Gualà, Guido Proietti
2006	B	`conf`	On the Existence of Truthful Mechanisms for the Minimum-Cost Approximate Shortest-Paths Tree Problem. SIROCCO Davide Bilò, Luciano Gualà, Guido Proietti
2005	Misc	`conf`	A Truthful (2-2/ COCOON Luciano Gualà, Guido Proietti
2005	—	`conf`	Efficient Truthful Mechanisms for the Single-Source Shortest Paths Tree Problem. Euro-Par Luciano Gualà, Guido Proietti