Seuraa
Luciano Gualà
Luciano Gualà
Università di Roma "Tor Vergata"
Vahvistettu sähköpostiosoite verkkotunnuksessa mat.uniroma2.it - Kotisivu
Nimike
Viittaukset
Viittaukset
Vuosi
Improved approximability and non-approximability results for graph diameter decreasing problems
D Bilò, L Gualà, G Proietti
Theoretical Computer Science 417, 12-22, 2012
582012
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
462014
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
432015
Locality-based network creation games
D Bilò, L Gualà, S Leucci, G Proietti
ACM Transactions on Parallel Computing (TOPC) 3 (1), 1-26, 2016
372016
Multiple-edge-fault-tolerant approximate shortest-path trees
D Bilò, L Gualà, S Leucci, G Proietti
arXiv preprint arXiv:1601.04169, 2016
36*2016
Bounded-distance network creation games
D Bilò, L Gualà, G Proietti
ACM Transactions on Economics and Computation (TEAC) 3 (3), 1-20, 2015
332015
On stackelberg pricing with computationally bounded customers
P Briest, L Guala, M Hoefer, C Ventre
Networks 60 (1), 31-44, 2012
282012
Fault-tolerant approximate shortest-path trees
D Bilò, L Gualà, S Leucci, G Proietti
European Symposium on Algorithms, 137-148, 2014
262014
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
252015
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
242017
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
212015
Computational aspects of a 2-player Stackelberg shortest paths tree game
D Bilo, L Guala, G Proietti, P Widmayer
Internet and Network Economics: 4th International Workshop, WINE 2008 …, 2008
212008
Network creation games with traceroute-based strategies
D Bilò, L Gualà, S Leucci, G Proietti
Structural Information and Communication Complexity: 21st International …, 2014
202014
Compact and fast sensitivity oracles for single-source distances
D Bilò, L Gualà, S Leucci, G Proietti
arXiv preprint arXiv:1608.04769, 2016
192016
Sparse temporal spanners with low stretch
D Bilò, G D'Angelo, L Gualà, S Leucci, M Rossi
arXiv preprint arXiv:2206.11113, 2022
172022
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
162015
Efficient truthful mechanisms for the single-source shortest paths tree problem
L Gualà, G Proietti
European Conference on Parallel Processing, 941-951, 2005
152005
Coalition Resilient Outcomes in Max k-Cut Games
R Carosi, S Fioravanti, L Gualà, G Monaco
International Conference on Current Trends in Theory and Practice of …, 2019
142019
Finding best swap edges minimizing the routing cost of a spanning tree
D Bilò, L Gualà, G Proietti
Algorithmica 68 (2), 337-357, 2014
142014
Effcient oracles and routing schemes for replacement paths
D Bilò, K Choudhary, L Gualà, S Leucci, M Parter, G Proietti
35th Symposium on Theoretical Aspects of Computer Science (STACS 2018) 96, 13, 2018
132018
Järjestelmä ei voi suorittaa toimenpidettä nyt. Yritä myöhemmin uudelleen.
Artikkelit 1–20