Improved approximability and non-approximability results for graph diameter decreasing problems D Bilò, L Gualà, G Proietti Theoretical Computer Science 417, 12-22, 2012 | 52 | 2012 |
Improved purely additive fault-tolerant spanners D Bilò, F Grandoni, L Gualà, S Leucci, G Proietti Algorithms-ESA 2015: 23rd Annual European Symposium, Patras, Greece …, 2015 | 43 | 2015 |
Bejeweled, Candy Crush and other match-three games are (NP-) hard L Gualà, S Leucci, E Natale 2014 IEEE Conference on Computational Intelligence and Games, 1-8, 2014 | 43 | 2014 |
Multiple-edge-fault-tolerant approximate shortest-path trees D Bilò, L Gualà, S Leucci, G Proietti arXiv preprint arXiv:1601.04169, 2016 | 35 | 2016 |
Locality-based network creation games D Bilò, L Gualà, S Leucci, G Proietti ACM Transactions on Parallel Computing (TOPC) 3 (1), 1-26, 2016 | 33 | 2016 |
Bounded-distance network creation games D Bilò, L Gualà, G Proietti ACM Transactions on Economics and Computation (TEAC) 3 (3), 1-20, 2015 | 31 | 2015 |
Fault-tolerant approximate shortest-path trees D Bilò, L Gualà, S Leucci, G Proietti European Symposium on Algorithms, 137-148, 2014 | 26 | 2014 |
On stackelberg pricing with computationally bounded customers P Briest, L Gualà, M Hoefer, C Ventre Networks 60 (1), 31-44, 2012 | 26 | 2012 |
A tight analysis of the parallel undecided-state dynamics with two colors AEF Clementi, L Gualà, F Pasquale, G Scornavacca, E Natale, M Ghaffari arXiv preprint arXiv:1707.05135, 2017 | 21 | 2017 |
Network verification via routing table queries E Bampas, D Bilò, G Drovandi, L Gualà, R Klasing, G Proietti Journal of Computer and System Sciences 81 (1), 234-248, 2015 | 20 | 2015 |
Computational aspects of a 2-player Stackelberg shortest paths tree game D Bilò, L Gualà, G Proietti, P Widmayer Internet and Network Economics: 4th International Workshop, WINE 2008 …, 2008 | 20 | 2008 |
The max-distance network creation game on general host graphs D Bilò, L Gualà, S Leucci, G Proietti Theoretical Computer Science 573, 43-53, 2015 | 19 | 2015 |
Compact and fast sensitivity oracles for single-source distances D Bilò, L Gualà, S Leucci, G Proietti arXiv preprint arXiv:1608.04769, 2016 | 18 | 2016 |
Network creation games with traceroute-based strategies D Bilò, L Gualà, S Leucci, G Proietti Structural Information and Communication Complexity: 21st International …, 2014 | 17 | 2014 |
Specializations and generalizations of the Stackelberg minimum spanning tree game D Bilò, L Gualà, S Leucci, G Proietti Theoretical Computer Science 562, 643-657, 2015 | 15 | 2015 |
Efficient truthful mechanisms for the single-source shortest paths tree problem L Gualà, G Proietti European Conference on Parallel Processing, 941-951, 2005 | 15 | 2005 |
A faster computation of all the best swap edges of a tree spanner D Bilò, F Colella, L Gualà, S Leucci, G Proietti Structural Information and Communication Complexity: 22nd International …, 2015 | 13 | 2015 |
Finding best swap edges minimizing the routing cost of a spanning tree D Bilò, L Gualà, G Proietti Algorithmica 68 (2), 337-357, 2014 | 13 | 2014 |
A Truthful (2–2/k)-Approximation Mechanism for the Steiner Tree Problem with k Terminals L Gualà, G Proietti International Computing and Combinatorics Conference, 390-400, 2005 | 13 | 2005 |
Fault-tolerant approximate shortest-path trees D Bilò, L Gualà, S Leucci, G Proietti Algorithmica 80, 3437-3460, 2018 | 12 | 2018 |