Follow
Luciano Gualà
Title
Cited by
Cited by
Year
Improved approximability and non-approximability results for graph diameter decreasing problems
D Biḷ, L Gualà, G Proietti
Theoretical Computer Science 417, 12-22, 2012
442012
Improved approximability and non-approximability results for graph diameter decreasing problems
D Biḷ, L Gualà, G Proietti
Theoretical Computer Science 417, 12-22, 2012
442012
Improved purely additive fault-tolerant spanners
D Biḷ, F Grandoni, L Gualà, S Leucci, G Proietti
Algorithms-ESA 2015, 167-178, 2015
412015
Fault-tolerant approximate shortest-path trees
D Biḷ, L Gualà, S Leucci, G Proietti
Algorithmica 80 (12), 3437-3460, 2018
352018
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
342014
Multiple-edge-fault-tolerant approximate shortest-path trees
D Biḷ, L Gualà, S Leucci, G Proietti
arXiv preprint arXiv:1601.04169, 2016
302016
Bounded-distance network creation games
D Biḷ, L Gualà, G Proietti
ACM Transactions on Economics and Computation (TEAC) 3 (3), 1-20, 2015
292015
Locality-based network creation games
D Biḷ, L Gualà, S Leucci, G Proietti
ACM Transactions on Parallel Computing (TOPC) 3 (1), 1-26, 2016
272016
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
172017
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
172015
Network creation games with traceroute-based strategies
D Biḷ, L Gualà, S Leucci, G Proietti
International Colloquium on Structural Information and Communication …, 2014
172014
Computational aspects of a 2-player Stackelberg shortest paths tree game
D Biḷ, L Gualà, G Proietti, P Widmayer
International Workshop on Internet and Network Economics, 251-262, 2008
172008
Compact and fast sensitivity oracles for single-source distances
D Biḷ, L Gualà, S Leucci, G Proietti
arXiv preprint arXiv:1608.04769, 2016
152016
Efficient truthful mechanisms for the single-source shortest paths tree problem
L Gualà, G Proietti
European Conference on Parallel Processing, 941-951, 2005
152005
On stackelberg pricing with computationally bounded consumers
P Briest, M Hoefer, L Guala, C Ventre
International Workshop on Internet and Network Economics, 42-54, 2009
142009
A faster computation of all the best swap edges of a tree spanner
D Biḷ, F Colella, L Gualà, S Leucci, G Proietti
International Colloquium on Structural Information and Communication …, 2015
122015
On stackelberg pricing with computationally bounded customers
P Briest, L Guala, M Hoefer, C Ventre
Networks 60 (1), 31-44, 2012
122012
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
122005
Polygon-constrained motion planning problems
D Biḷ, Y Disser, L Gualà, M Mihal’ák, G Proietti, P Widmayer
International Symposium on Algorithms and Experiments for Sensor Systems …, 2013
112013
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
102019
The system can't perform the operation now. Try again later.
Articles 1–20