Folgen
Davide Bilò
Davide Bilò
Associate Professor in C.S., Dipartimento di Ingegneria e Scienze dell'Informazione e Matematica
Bestätigte E-Mail-Adresse bei univaq.it
Titel
Zitiert von
Zitiert von
Jahr
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
582008
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
432009
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
412015
Multiple-edge-fault-tolerant approximate shortest-path trees
D Bilò, L Gualà, S Leucci, G Proietti
arXiv preprint arXiv:1601.04169, 2016
322016
Bounded-distance network creation games
D Bilò, L Gualà, G Proietti
Internet and Network Economics, 72-85, 2012
312012
Locality-based network creation games
D Bilò, L Gualà, S Leucci, G Proietti
ACM Transactions on Parallel Computing (TOPC) 3 (1), 1-26, 2016
292016
Fault-tolerant approximate shortest-path trees
D Bilò, L Gualà, S Leucci, G Proietti
European Symposium on Algorithms, 137-148, 2014
262014
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
252022
On the tree conjecture for the network creation game
D Bilò, P Lenzner
Theory of Computing Systems 64, 422-443, 2020
222020
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
172016
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
172012
Network creation games with traceroute-based strategies
D Bilò, L Gualà, S Leucci, G Proietti
Structural Information and Communication Complexity: 21st International …, 2014
162014
New advances in reoptimizing the minimum Steiner tree problem
D Bilò, A Zych
International Symposium on Mathematical Foundations of Computer Science, 184-197, 2012
162012
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
152015
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20