LEUCCI, STEFANO
LEUCCI, STEFANO
Dipartimento di Ingegneria e scienze dell'informazione e matematica
Specializations and Generalizations of the Stackelberg Minimum Spanning Tree Game
2010-01-01 Bilò, D.; Gualà, L.; Leucci, S.; Proietti, Guido
The Max-Distance Network Creation Game on General Host Graphs
2012-01-01 Bilò, D; Gualà, L; Leucci, Stefano; Proietti, Guido
Exact and Approximate Algorithms for Movement Problems on (Special Classes of) Graphs
2013-01-01 Bilò, D.; Gualà, L.; Leucci, S.; Proietti, Guido
Dynamically Maintaining Shortest Path Trees under Batches of Updates
2013-01-01 D'Andrea, A; D'Emidio, Mattia; Frigioni, Daniele; Leucci, S; Proietti, Guido
Experimental Evaluation of Dynamic Shortest Path Tree Algorithms on Homogeneous Batches
2014-01-01 D'Andrea, A.; D'Emidio, M.; Frigioni, Daniele; Leucci, S.; Proietti, Guido
Bejeweled, candy crush and other match-three games are (NP-)hard
2014-01-01 Guala, L.; Leucci, S.; Natale, E.
Fault-Tolerant Approximate Shortest-Path Trees
2014-01-01 Bilò, D.; Gualà, L.; Leucci, S.; Proietti, Guido
Locality-based Network Creation Games
2014-01-01 Bilò, D.; Gualà, L.; Leucci, S.; Proietti, Guido
Network Creation Games with Traceroute-Based Strategies
2014-01-01 Bilò, D.; Gualà, L.; Leucci, S.; Proietti, Guido
A faster computation of all the best swap edges of a tree spanner
2015-01-01 Bilò, Davide; Colella, Feliciano; Gualà, Luciano; Leucci, Stefano; Proietti, Guido
Path-Fault-Tolerant Approximate Shortest-Path Trees
2015-01-01 D'Andrea, A.; D'Emidio, Mattia; Frigioni, Daniele; Leucci, Stefano; Proietti, Guido
Specializations and Generalizations of the Stackelberg Minimum Spanning Tree Game
2015-01-01 Bilò, D.; Gualà, L.; Leucci, S.; Proietti, Guido
Improved Purely Additive Fault-Tolerant Spanners
2015-01-01 Bilò, D.; Grandoni, F.; Gualà, L.; Leucci, S.; Proietti, Guido
The max-distance network creation game on general host graphs
2015-01-01 Bilò, D.; Gualà, L.; Leucci, S.; Proietti, Guido
Dynamic Maintenance of a Shortest-Path Tree on Homogeneous Batches of Updates: New Algorithms and Experiments
2015-01-01 D'Andrea, A.; D'Emidio, M.; Frigioni, Daniele; Leucci, S.; Proietti, Guido
Compact and fast sensitivity oracles for single-source distances
2016-01-01 Bilò, Davide; Gualà, Luciano; Leucci, Stefano; Proietti, Guido
On the clustered shortest-path tree problem
2016-01-01 D'Emidio, Mattia; Forlizzi, Luca; Frigioni, Daniele; Leucci, Stefano; Proietti, Guido
Multiple-edge-fault-tolerant approximate shortest-path trees
2016-01-01 Bilò, Davide; Gualà, Luciano; Leucci, Stefano; Proietti, Guido
Trainyard is NP-hard
2016-01-01 Almanza, M.; Leucci, S.; Panconesi, A.
Locality-Based Network Creation Games
2016-01-01 Bilò, Davide; Gualà, Luciano; Leucci, Stefano; Proietti, Guido
Titolo | Data di pubblicazione | Autore(i) | File |
---|---|---|---|
Specializations and Generalizations of the Stackelberg Minimum Spanning Tree Game | 1-gen-2010 | Bilò, D.; Gualà, L.; Leucci, S.; Proietti, Guido | |
The Max-Distance Network Creation Game on General Host Graphs | 1-gen-2012 | Bilò, D; Gualà, L; Leucci, Stefano; Proietti, Guido | |
Exact and Approximate Algorithms for Movement Problems on (Special Classes of) Graphs | 1-gen-2013 | Bilò, D.; Gualà, L.; Leucci, S.; Proietti, Guido | |
Dynamically Maintaining Shortest Path Trees under Batches of Updates | 1-gen-2013 | D'Andrea, A; D'Emidio, Mattia; Frigioni, Daniele; Leucci, S; Proietti, Guido | |
Experimental Evaluation of Dynamic Shortest Path Tree Algorithms on Homogeneous Batches | 1-gen-2014 | D'Andrea, A.; D'Emidio, M.; Frigioni, Daniele; Leucci, S.; Proietti, Guido | |
Bejeweled, candy crush and other match-three games are (NP-)hard | 1-gen-2014 | Guala, L.; Leucci, S.; Natale, E. | |
Fault-Tolerant Approximate Shortest-Path Trees | 1-gen-2014 | Bilò, D.; Gualà, L.; Leucci, S.; Proietti, Guido | |
Locality-based Network Creation Games | 1-gen-2014 | Bilò, D.; Gualà, L.; Leucci, S.; Proietti, Guido | |
Network Creation Games with Traceroute-Based Strategies | 1-gen-2014 | Bilò, D.; Gualà, L.; Leucci, S.; Proietti, Guido | |
A faster computation of all the best swap edges of a tree spanner | 1-gen-2015 | Bilò, Davide; Colella, Feliciano; Gualà, Luciano; Leucci, Stefano; Proietti, Guido | |
Path-Fault-Tolerant Approximate Shortest-Path Trees | 1-gen-2015 | D'Andrea, A.; D'Emidio, Mattia; Frigioni, Daniele; Leucci, Stefano; Proietti, Guido | |
Specializations and Generalizations of the Stackelberg Minimum Spanning Tree Game | 1-gen-2015 | Bilò, D.; Gualà, L.; Leucci, S.; Proietti, Guido | |
Improved Purely Additive Fault-Tolerant Spanners | 1-gen-2015 | Bilò, D.; Grandoni, F.; Gualà, L.; Leucci, S.; Proietti, Guido | |
The max-distance network creation game on general host graphs | 1-gen-2015 | Bilò, D.; Gualà, L.; Leucci, S.; Proietti, Guido | |
Dynamic Maintenance of a Shortest-Path Tree on Homogeneous Batches of Updates: New Algorithms and Experiments | 1-gen-2015 | D'Andrea, A.; D'Emidio, M.; Frigioni, Daniele; Leucci, S.; Proietti, Guido | |
Compact and fast sensitivity oracles for single-source distances | 1-gen-2016 | Bilò, Davide; Gualà, Luciano; Leucci, Stefano; Proietti, Guido | |
On the clustered shortest-path tree problem | 1-gen-2016 | D'Emidio, Mattia; Forlizzi, Luca; Frigioni, Daniele; Leucci, Stefano; Proietti, Guido | |
Multiple-edge-fault-tolerant approximate shortest-path trees | 1-gen-2016 | Bilò, Davide; Gualà, Luciano; Leucci, Stefano; Proietti, Guido | |
Trainyard is NP-hard | 1-gen-2016 | Almanza, M.; Leucci, S.; Panconesi, A. | |
Locality-Based Network Creation Games | 1-gen-2016 | Bilò, Davide; Gualà, Luciano; Leucci, Stefano; Proietti, Guido |