Davide Bil˛
Davide Bil˛
Associate Professor in C.S., Dipartimento di Scienze Umanistiche e Sociali, UniversitÓ di Sassari
Verified email at uniss.it
Title
Cited by
Cited by
Year
Reoptimization of Steiner trees
D Bil˛, HJ B÷ckenhauer, J Hromkovič, R Krßlovič, T M÷mke, P Widmayer, ...
Scandinavian Workshop on Algorithm Theory, 258-269, 2008
542008
Reoptimization of weighted graph and covering problems
D Bil˛, P Widmayer, A Zych
International Workshop on Approximation and Online Algorithms, 201-213, 2008
432008
On the complexity of minimizing interference in ad-hoc and sensor networks
D Bil˛, G Proietti
Theoretical Computer Science 402 (1), 43-55, 2008
412008
On the Complexity of Minimizing Interference in Ad-Hoc and Sensor Networks
D Bil˛, G Proietti
412007
Improved approximability and non-approximability results for graph diameter decreasing problems
D Bil˛, L GualÓ, G Proietti
Theoretical Computer Science 417, 12-22, 2012
372012
Improved approximability and non-approximability results for graph diameter decreasing problems
D Bil˛, L GualÓ, G Proietti
Theoretical Computer Science 417, 12-22, 2012
372012
Improved purely additive fault-tolerant spanners
D Bil˛, F Grandoni, L GualÓ, S Leucci, G Proietti
Algorithms-ESA 2015, 167-178, 2015
352015
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 (2), 227-251, 2011
312011
Bounded-distance network creation games
D Bil˛, L GualÓ, G Proietti
Internet and Network Economics, 72-85, 2012
282012
Fault-tolerant approximate shortest-path trees
D Bil˛, L GualÓ, S Leucci, G Proietti
European Symposium on Algorithms, 137-148, 2014
262014
Locality-based network creation games
D Bil˛, L GualÓ, S Leucci, G Proietti
ACM Transactions on Parallel Computing (TOPC) 3 (1), 1-26, 2016
252016
Multiple-edge-fault-tolerant approximate shortest-path trees
D Bil˛, L GualÓ, S Leucci, G Proietti
arXiv preprint arXiv:1601.04169, 2016
242016
Reoptimization of the shortest common superstring problem
D Bil˛, HJ B÷ckenhauer, D Komm, R Krßlovič, T M÷mke, S Seibert, A Zych
Annual Symposium on Combinatorial Pattern Matching, 78-91, 2009
202009
Network creation games with traceroute-based strategies
D Bil˛, L GualÓ, S Leucci, G Proietti
International Colloquium on Structural Information and Communicationá…, 2014
162014
Computational aspects of a 2-player Stackelberg shortest paths tree game
D Bilo, L Guala, G Proietti, P Widmayer
International Workshop on Internet and Network Economics, 251-262, 2008
162008
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
152012
On the tree conjecture for the network creation game
D Bil˛, P Lenzner
Theory of Computing Systems, 1-22, 2019
142019
Compact and fast sensitivity oracles for single-source distances
D Bil˛, L GualÓ, S Leucci, G Proietti
arXiv preprint arXiv:1608.04769, 2016
142016
New advances in reoptimizing the minimum Steiner tree problem
D Bil˛, A Zych
International Symposium on Mathematical Foundations of Computer Science, 184-197, 2012
142012
New reoptimization techniques applied to Steiner tree problem
A Zych, D Bil˛
Electronic Notes in Discrete Mathematics 37, 387-392, 2011
132011
The system can't perform the operation now. Try again later.
Articles 1–20