Search the dblp DataBase

Publications of Author

1. Davide Bilò, Guido Proietti
   On the Complexity of Minimizing Interference in Ad-Hoc and Sensor Networks. [Citation Graph (0, 0)][DBLP]
   ALGOSENSORS, 2006, pp:13-24 [Conf]
   
2. Davide Bilò, Luciano Gualà, Guido Proietti
   Designing a Truthful Mechanism for a Spanning Arborescence Bicriteria Problem. [Citation Graph (0, 0)][DBLP]
   CAAN, 2006, pp:19-30 [Conf]
   
3. Davide Bilò, Guido Proietti
   Augmenting the Edge-Connectivity of a Spider Tree. [Citation Graph (0, 0)][DBLP]
   ISAAC, 2004, pp:159-171 [Conf]
   
4. Davide Bilò, Luciano Gualà, Guido Proietti
   On the Existence of Truthful Mechanisms for the Minimum-Cost Approximate Shortest-Paths Tree Problem. [Citation Graph (0, 0)][DBLP]
   SIROCCO, 2006, pp:295-309 [Conf]
   
5. Davide Bilò, Guido Proietti
   Range Augmentation Problems in Static Ad-Hoc Wireless Networks. [Citation Graph (0, 0)][DBLP]
   SIROCCO, 2005, pp:49-64 [Conf]
   
6. Davide Bilò, Guido Proietti
   A 5/4-Approximation Algorithm for Biconnecting a Graph with a Given Hamiltonian Path. [Citation Graph (0, 0)][DBLP]
   WAOA, 2004, pp:181-196 [Conf]
   
7. Davide Bilò, Luciano Gualà, Guido Proietti
   Dynamic Mechanism Design. [Citation Graph (0, 0)][DBLP]
   WINE, 2006, pp:3-15 [Conf]
   
8. Davide Bilò, Luca Forlizzi, Luciano Gualà, Guido Proietti
   An algorithm composition scheme preserving monotonicity. [Citation Graph (0, 0)][DBLP]
   PODC, 2007, pp:360-361 [Conf]
   
9. 
   Reoptimization of the Shortest Common Superstring Problem. [Citation Graph (, )][DBLP]
   
   
10. 
    Locating Facilities on a Network to Minimize Their Average Service Radius. [Citation Graph (, )][DBLP]
    
    
11. 
    Improved Approximability and Non-approximability Results for Graph Diameter Decreasing Problems. [Citation Graph (, )][DBLP]
    
    
12. 
    Finding Best Swap Edges Minimizing the Routing Cost of a Spanning Tree. [Citation Graph (, )][DBLP]
    
    
13. 
    Discovery of Network Properties with All-Shortest-Paths Queries. [Citation Graph (, )][DBLP]
    
    
14. 
    Stability of Networks in Stretchable Graphs. [Citation Graph (, )][DBLP]
    
    
15. 
    Reconstructing Visibility Graphs with Simple Robots. [Citation Graph (, )][DBLP]
    
    
16. 
    Reoptimization of Steiner Trees. [Citation Graph (, )][DBLP]
    
    
17. 
    Reoptimization of Weighted Graph and Covering Problems. [Citation Graph (, )][DBLP]
    
    
18. 
    Approximating the Metric TSP in Linear Time. [Citation Graph (, )][DBLP]
    
    
19. 
    Computational Aspects of a 2-Player Stackelberg Shortest Paths Tree Game. [Citation Graph (, )][DBLP]
    
    
20. 
    Approximate Mechanisms for the Graphical TSP and Other Graph Traversal Problems. [Citation Graph (, )][DBLP]