Stefano Leucci
- Bejeweled, Candy Crush and other Match-Three Games are (NP-)Hard
2014/03/24 by Luciano Gualà, Stefano Leucci, Gualà, Luciano +3 · 1 voice · 1 citation
#cs.CC
- 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)
- 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
- Hardness, Approximability, and Fixed-Parameter Tractability of the\n Clustered Shortest-Path Tree Problem
2018/01/31 by Mattia D’Emidio, Luca Forlizzi, D'Emidio, Mattia +7 · 1 citation
Business, Management and Accounting · Engineering · Environmental Science · #Facility Location and Emergency Management #Asphalt Pavement Performance Evaluation #Municipal Solid Waste Management
- On the Inapproximability of Finding Minimum Monitoring Edge-Geodetic Sets
2024/05/22 by Davide Bilò, Bilò, Davide, Giordano Colli +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