| Improved approximability and non-approximability results for graph diameter decreasing problems D Biḷ, L Gualà, G Proietti Theoretical Computer Science 417, 12-22, 2012 | 48 | 2012 |
| Improved approximability and non-approximability results for graph diameter decreasing problems D Biḷ, L Gualà, G Proietti Theoretical Computer Science 417, 12-22, 2012 | 48 | 2012 |
| Improved purely additive fault-tolerant spanners D Biḷ, F Grandoni, L Gualà, S Leucci, G Proietti Algorithms-ESA 2015: 23rd Annual European Symposium, Patras, Greece …, 2015 | 41 | 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 | 36 | 2014 |
| Multiple-edge-fault-tolerant approximate shortest-path trees D Biḷ, L Gualà, S Leucci, G Proietti arXiv preprint arXiv:1601.04169, 2016 | 32 | 2016 |
| Bounded-distance network creation games D Biḷ, L Gualà, G Proietti ACM Transactions on Economics and Computation (TEAC) 3 (3), 1-20, 2015 | 31 | 2015 |
| Locality-based network creation games D Biḷ, L Gualà, S Leucci, G Proietti ACM Transactions on Parallel Computing (TOPC) 3 (1), 1-26, 2016 | 28 | 2016 |
| Fault-tolerant approximate shortest-path trees D Biḷ, L Gualà, S Leucci, G Proietti Algorithms-ESA 2014: 22th Annual European Symposium, Wroclaw, Poland …, 2014 | 26 | 2014 |
| 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 |
| On stackelberg pricing with computationally bounded customers P Briest, L Guala, M Hoefer, C Ventre Networks 60 (1), 31-44, 2012 | 21 | 2012 |
| Compact and fast sensitivity oracles for single-source distances D Biḷ, L Gualà, S Leucci, G Proietti arXiv preprint arXiv:1608.04769, 2016 | 17 | 2016 |
| The max-distance network creation game on general host graphs D Biḷ, L Gualà, S Leucci, G Proietti Theoretical Computer Science 573, 43-53, 2015 | 17 | 2015 |
| Network creation games with traceroute-based strategies D Biḷ, L Gualà, S Leucci, G Proietti Structural Information and Communication Complexity: 21st International …, 2014 | 16 | 2014 |
| Computational aspects of a 2-player Stackelberg shortest paths tree game D Biḷ, L Gualà, G Proietti, P Widmayer Internet and Network Economics: 4th International Workshop, WINE 2008 …, 2008 | 16 | 2008 |
| Efficient truthful mechanisms for the single-source shortest paths tree problem L Gualà, G Proietti Euro-Par 2005 Parallel Processing: 11th International Euro-Par Conference …, 2005 | 15 | 2005 |
| Specializations and generalizations of the Stackelberg minimum spanning tree game D Biḷ, L Gualà, S Leucci, G Proietti Theoretical Computer Science 562, 643-657, 2015 | 13 | 2015 |
| Specializations and generalizations of the Stackelberg minimum spanning tree game D Biḷ, L Gualà, S Leucci, G Proietti Theoretical Computer Science 562, 643-657, 2015 | 13 | 2015 |
| A faster computation of all the best swap edges of a tree spanner D Biḷ, F Colella, L Gualà, S Leucci, G Proietti Structural Information and Communication Complexity: 22nd International …, 2015 | 12 | 2015 |
| Finding best swap edges minimizing the routing cost of a spanning tree D Biḷ, L Gualà, G Proietti Algorithmica 68 (2), 337-357, 2014 | 12 | 2014 |
| Polygon-constrained motion planning problems D Biḷ, Y Disser, L Gualà, M Mihal’ák, G Proietti, P Widmayer Algorithms for Sensor Systems: 9th International Symposium on Algorithms and …, 2013 | 12 | 2013 |
Guido ProiettiProfessor of Computer Science, University of L'AquilaVerified email at univaq.it
