Παρακολούθηση
Davide Bilò
Davide Bilò
Associate Professor in C.S., Dipartimento di Ingegneria e Scienze dell'Informazione e Matematica
Η διεύθυνση ηλεκτρονικού ταχυδρομείου έχει επαληθευτεί στον τομέα univaq.it
Τίτλος
Παρατίθεται από
Παρατίθεται από
Έτος
Reoptimization of Steiner trees
D Bilò, HJ Böckenhauer, J Hromkovič, R Královič, T Mömke, P Widmayer, ...
Algorithm Theory–SWAT 2008: 11th Scandinavian Workshop on Algorithm Theory …, 2008
592008
Improved approximability and non-approximability results for graph diameter decreasing problems
D Bilò, L Gualà, G Proietti
Theoretical Computer Science 417, 12-22, 2012
502012
Improved approximability and non-approximability results for graph diameter decreasing problems
D Bilò, L Gualà, G Proietti
Theoretical Computer Science 417, 12-22, 2012
502012
Reoptimization of the shortest common superstring problem
D Bilò, HJ Böckenhauer, D Komm, R Královič, T Mömke, S Seibert, A Zych
Algorithmica 61, 227-251, 2011
492011
On the complexity of minimizing interference in ad-hoc and sensor networks
D Bilò, G Proietti
Theoretical Computer Science 402 (1), 43-55, 2008
462008
On the Complexity of Minimizing Interference in Ad-Hoc and Sensor Networks
D Bilò, G Proietti
462007
Reoptimization of weighted graph and covering problems
D Bilò, P Widmayer, A Zych
Approximation and Online Algorithms: 6th International Workshop, WAOA 2008 …, 2009
442009
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
342016
Multiple-edge-fault-tolerant approximate shortest-path trees
D Bilò, L Gualà, S Leucci, G Proietti
arXiv preprint arXiv:1601.04169, 2016
342016
Bounded-distance network creation games
D Bilò, L Gualà, G Proietti
Internet and Network Economics, 72-85, 2012
322012
Topological influence and locality in swap Schelling games
D Bilò, V Bilò, P Lenzner, L Molitor
Autonomous Agents and Multi-Agent Systems 36 (2), 47, 2022
292022
On the tree conjecture for the network creation game
D Bilò, P Lenzner
Theory of Computing Systems 64, 422-443, 2020
282020
Fault-tolerant approximate shortest-path trees
D Bilò, L Gualà, S Leucci, G Proietti
European Symposium on Algorithms, 137-148, 2014
262014
The max-distance network creation game on general host graphs
D Bilò, L Gualà, S Leucci, G Proietti
Internet and Network Economics, 392-405, 2012
202012
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
192008
Compact and fast sensitivity oracles for single-source distances
D Bilò, L Gualà, S Leucci, G Proietti
arXiv preprint arXiv:1608.04769, 2016
182016
Network creation games with traceroute-based strategies
D Bilò, L Gualà, S Leucci, G Proietti
Structural Information and Communication Complexity: 21st International …, 2014
182014
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
172015
Selfish creation of social networks
D Bilò, T Friedrich, P Lenzner, S Lowski, A Melnichenko
Proceedings of the AAAI Conference on Artificial Intelligence 35 (6), 5185-5193, 2021
162021
Δεν είναι δυνατή η εκτέλεση της ενέργειας από το σύστημα αυτή τη στιγμή. Προσπαθήστε ξανά αργότερα.
Άρθρα 1–20