Stefano Leucci

108 papers A* 1A 12B 18C 1Misc 8Journal 61Unranked 6

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	An Almost-Optimal Upper Bound on the Push Number of the Torus Puzzle. CoRR Matteo Caporrella, Stefano Leucci
2026	J	`jnl`	Complexity Thresholds for the Constrained Colored Token Swapping Problem. CoRR Davide Bilò, Stefano Leucci, Andrea Martinelli
2026	J	`jnl`	On the approximability of graph visibility problems. Theor. Comput. Sci. Davide Bilò, Alessia Di Fonso, Gabriele Di Stefano, Stefano Leucci
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`	An Optimal Sorting Algorithm for Persistent Random Comparison Faults. CoRR Barbara Geissmann, Stefano Leucci, Chih-Hung Liu, Paolo Penna
2025	J	`jnl`	Finding diameter-reducing shortcuts in trees. J. Comput. Syst. Sci. Davide Bilò, Luciano Gualà, Stefano Leucci, Luca Pepè Sciarria
2025	B	`conf`	On the (In)Approximability of the Monitoring Edge Geodetic Set Problem. ISAAC Davide Bilò, Giordano Colli, Luca Forlizzi, Stefano Leucci
2025	J	`jnl`	On the (In)Approximability of the Monitoring Edge Geodetic Set Problem. CoRR Davide Bilò, Giordano Colli, Luca Forlizzi, Stefano Leucci
2025	B	`conf`	On the Approximability of Graph Visibility Problems. WALCOM Davide Bilò, Alessia Di Fonso, Gabriele Di Stefano, Stefano Leucci
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	—	`conf`	On the Inapproximability of Finding Minimum Monitoring Edge-Geodetic Sets (short paper). ICTCS Davide Bilò, Giordano Colli, Luca Forlizzi, Stefano Leucci
2024	J	`jnl`	On the Inapproximability of Finding Minimum Monitoring Edge-Geodetic Sets. CoRR Davide Bilò, Giordano Colli, Luca Forlizzi, Stefano Leucci
2024	J	`jnl`	On the approximability of graph visibility problems. CoRR Davide Bilò, Alessia Di Fonso, Gabriele Di Stefano, Stefano Leucci
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	J	`jnl`	Approximate Minimum Selection with Unreliable Comparisons. Algorithmica Stefano Leucci, Chih-Hung Liu
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`	Faster Motif Counting via Succinct Color Coding and Adaptive Sampling. ACM Trans. Knowl. Discov. Data Marco Bressan, Stefano Leucci, Alessandro Panconesi
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`	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	J	`jnl`	Cutting Bamboo Down to Size. CoRR Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti, Giacomo Scornavacca
2020	J	`jnl`	Faster motif counting via succinct color coding and adaptive sampling. CoRR Marco Bressan, Stefano Leucci, Alessandro Panconesi
2020	J	`jnl`	Optimal Dislocation with Persistent Errors in Subquadratic Time. Theory Comput. Syst. Barbara Geissmann, Stefano Leucci, Chih-Hung Liu, Paolo Penna
2020	J	`jnl`	Tracking routes in communication networks. Theor. Comput. Sci. Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti
2020	J	`jnl`	Tracks from hell - When finding a proof may be easier than checking it. Theor. Comput. Sci. Matteo Almanza, Stefano Leucci, Alessandro Panconesi
2019	B	`conf`	Dual-Mode Greedy Algorithms Can Save Energy. ISAAC Barbara Geissmann, Stefano Leucci, Chih-Hung Liu, Paolo Penna, Guido Proietti
2019	J	`jnl`	Hardness, approximability, and fixed-parameter tractability of the clustered shortest-path tree problem. J. Comb. Optim. Mattia D'Emidio, Luca Forlizzi, Daniele Frigioni, Stefano Leucci, Guido Proietti
2019	J	`jnl`	Motivo: Fast Motif Counting via Succinct Color Coding and Adaptive Sampling. Proc. VLDB Endow. Marco Bressan, Stefano Leucci, Alessandro Panconesi
2019	J	`jnl`	Motivo: fast motif counting via succinct color coding and adaptive sampling. CoRR Marco Bressan, Stefano Leucci, Alessandro Panconesi
2019	A	`conf`	Optimal Sorting with Persistent Comparison Errors. ESA Barbara Geissmann, Stefano Leucci, Chih-Hung Liu, Paolo Penna
2019	A	`conf`	Resilient Dictionaries for Randomly Unreliable Memory. ESA Stefano Leucci, Chih-Hung Liu, Simon Meierhans
2019	B	`conf`	Tracking Routes in Communication Networks. SIROCCO Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti
2018	J	`jnl`	A Nearly Optimal Algorithm for Approximate Minimum Selection with Unreliable Comparisons. CoRR Stefano Leucci, Chih-Hung Liu
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	J	`jnl`	Hardness, Approximability, and Fixed-Parameter Tractability of the Clustered Shortest-Path Tree Problem. CoRR Mattia D'Emidio, Luca Forlizzi, Daniele Frigioni, Stefano Leucci, Guido Proietti
2018	J	`jnl`	Motif Counting Beyond Five Nodes. ACM Trans. Knowl. Discov. Data Marco Bressan, Flavio Chierichetti, Ravi Kumar, Stefano Leucci, Alessandro Panconesi
2018	J	`jnl`	No truthful mechanism can be better than Games Econ. Behav. Stefano Leucci, Akaki Mamageishvili, Paolo Penna
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
2018	A	`conf`	Optimal Dislocation with Persistent Errors in Subquadratic Time. STACS Barbara Geissmann, Stefano Leucci, Chih-Hung Liu, Paolo Penna
2018	J	`jnl`	Optimal Sorting with Persistent Comparison Errors. CoRR Barbara Geissmann, Stefano Leucci, Chih-Hung Liu, Paolo Penna
2018	Misc	`conf`	Tracks from hell - when finding a proof may be easier than checking it. FUN Matteo Almanza, Stefano Leucci, Alessandro Panconesi
2018	J	`jnl`	Trainyard is NP-Hard. Theor. Comput. Sci. Matteo Almanza, Stefano Leucci, Alessandro Panconesi
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`	Counting Graphlets: Space vs Time. WSDM Marco Bressan, Flavio Chierichetti, Ravi Kumar, Stefano Leucci, Alessandro Panconesi
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`	No truthful mechanism can be better than n approximate for two natural problems. CoRR Stefano Leucci, Akaki Mamageishvili, Paolo Penna
2017	B	`conf`	Sorting with Recurrent Comparison Errors. ISAAC Barbara Geissmann, Stefano Leucci, Chih-Hung Liu, Paolo Penna
2017	J	`jnl`	Sorting with Recurrent Comparison Errors. CoRR Barbara Geissmann, Stefano Leucci, Chih-Hung Liu, Paolo Penna
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
2016	—	`conf`	On the Clustered Shortest-Path Tree Problem. ICTCS Mattia D'Emidio, Luca Forlizzi, Daniele Frigioni, Stefano Leucci, Guido Proietti
2016	—	`—`	On the size-stretch tradeoff in fault-tolerant spanners and autonomous networks. Stefano Leucci
2016	A*	`conf`	The Limits of Popularity-Based Recommendations, and the Role of Social Ties. KDD Marco Bressan, Stefano Leucci, Alessandro Panconesi, Prabhakar Raghavan, Erisa Terolli
2016	J	`jnl`	The Limits of Popularity-Based Recommendations, and the Role of Social Ties. CoRR Marco Bressan, Stefano Leucci, Alessandro Panconesi, Prabhakar Raghavan, Erisa Terolli
2016	J	`jnl`	Trainyard is NP-Hard. CoRR Matteo Almanza, Stefano Leucci, Alessandro Panconesi
2016	Misc	`conf`	Trainyard is NP-hard. FUN Matteo Almanza, Stefano Leucci, Alessandro Panconesi
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`	Dynamic Maintenance of a Shortest-Path Tree on Homogeneous Batches of Updates: New Algorithms and Experiments. ACM J. Exp. Algorithmics Annalisa D'Andrea, Mattia D'Emidio, Daniele Frigioni, Stefano Leucci, 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	B	`conf`	Path-Fault-Tolerant Approximate Shortest-Path Trees. SIROCCO Annalisa D'Andrea, Mattia D'Emidio, Daniele Frigioni, Stefano Leucci, Guido Proietti
2015	J	`jnl`	Path-Fault-Tolerant Approximate Shortest-Path Trees. CoRR Annalisa D'Andrea, Mattia D'Emidio, Daniele Frigioni, Stefano Leucci, Guido Proietti
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	B	`conf`	Experimental Evaluation of Dynamic Shortest Path Tree Algorithms on Homogeneous Batches. SEA Annalisa D'Andrea, Mattia D'Emidio, Daniele Frigioni, 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	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	B	`conf`	Dynamically Maintaining Shortest Path Trees under Batches of Updates. SIROCCO Annalisa D'Andrea, Mattia D'Emidio, Daniele Frigioni, Stefano Leucci, 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
2012	—	`conf`	The Max-Distance Network Creation Game on General Host Graphs. WINE Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti
2010	—	`conf`	Specializations and Generalizations of the Stackelberg Minimum Spanning Tree Game. WINE Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti