Leucci, Stefano

1. Bejeweled, Candy Crush and other Match-Three Games are (NP-)Hard
   2014/03/24 by Luciano Gualà, Gualà, Luciano, Stefano Leucci +3 · 1 voice · 1 citation
   #cs.CC
2. Motivo: fast motif counting via succinct color coding and adaptive sampling
   2019/06/04 by Marco Bressan, Stefano Leucci, Bressan, Marco +3 · 2 citations
   Computer Science · #Advanced Graph Theory Research #Complexity and Algorithms in Graphs #Databases (cs.DB) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #Graph Theory and Algorithms #Information Retrieval (cs.IR)
3. Exact and approximate algorithms for movement problems on (special classes of) graphs
   2014/07/02 by Gualà, Davide Bilò Luciano, Leucci, Stefano, Proietti, Guido · 1 citation
   #Computational Complexity (cs.CC) #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences
4. Improved Purely Additive Fault-Tolerant Spanners
   2015/07/02 by Davide Bilò, Bilò, Davide, Fabrizio Grandoni +7 · 1 citation
   Computer Science · #Advanced Graph Theory Research #Complexity and Algorithms in Graphs #Computational Geometry and Mesh Generation #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences
5. Multiple-Edge-Fault-Tolerant Approximate Shortest-Path Trees
   2016/01/16 by Bilò, Davide, Gualà, Luciano, Leucci, Stefano +1 · 1 citation
   #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #G.2.2
6. On the approximability of graph visibility problems
   2024/06/29 by Bilò, Davide, Di Fonso, Alessia, Di Stefano, Gabriele +1 · 2 citations
   #Computational Complexity (cs.CC) #FOS: Computer and information sciences
7. Hardness, Approximability, and Fixed-Parameter Tractability of the\n Clustered Shortest-Path Tree Problem
   2018/01/31 by Mattia D’Emidio, D'Emidio, Mattia, Luca Forlizzi +7 · 1 citation
   Business, Management and Accounting · Engineering · Environmental Science · #Facility Location and Emergency Management #Asphalt Pavement Performance Evaluation #Municipal Solid Waste Management
8. On the Inapproximability of Finding Minimum Monitoring Edge-Geodetic Sets
   2024/05/22 by Davide Bilò, Giordano Colli, Bilò, Davide +5 · 1 citation
   Engineering · Social Sciences · #Computational Complexity (cs.CC) #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #Historical Geography and Cartography #Inertial Sensor and Navigation #Satellite Image Processing and Photogrammetry
9. Graph Spanners for Group Steiner Distances
   2024/07/01 by Bilò, Davide, Gualà, Luciano, Leucci, Stefano +1 · 1 citation
   #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences