The SCEAS System
| |||||||

## Search the dblp DataBase
Davide Bilò:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- 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] - 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] - Davide Bilò, Guido Proietti
**Augmenting the Edge-Connectivity of a Spider Tree.**[Citation Graph (0, 0)][DBLP] ISAAC, 2004, pp:159-171 [Conf] - 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] - Davide Bilò, Guido Proietti
**Range Augmentation Problems in Static Ad-Hoc Wireless Networks.**[Citation Graph (0, 0)][DBLP] SIROCCO, 2005, pp:49-64 [Conf] - 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] - Davide Bilò, Luciano Gualà, Guido Proietti
**Dynamic Mechanism Design.**[Citation Graph (0, 0)][DBLP] WINE, 2006, pp:3-15 [Conf] - 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] **Reoptimization of the Shortest Common Superstring Problem.**[Citation Graph (, )][DBLP]**Locating Facilities on a Network to Minimize Their Average Service Radius.**[Citation Graph (, )][DBLP]**Improved Approximability and Non-approximability Results for Graph Diameter Decreasing Problems.**[Citation Graph (, )][DBLP]**Finding Best Swap Edges Minimizing the Routing Cost of a Spanning Tree.**[Citation Graph (, )][DBLP]**Discovery of Network Properties with All-Shortest-Paths Queries.**[Citation Graph (, )][DBLP]**Stability of Networks in Stretchable Graphs.**[Citation Graph (, )][DBLP]**Reconstructing Visibility Graphs with Simple Robots.**[Citation Graph (, )][DBLP]**Reoptimization of Steiner Trees.**[Citation Graph (, )][DBLP]**Reoptimization of Weighted Graph and Covering Problems.**[Citation Graph (, )][DBLP]**Approximating the Metric TSP in Linear Time.**[Citation Graph (, )][DBLP]**Computational Aspects of a 2-Player Stackelberg Shortest Paths Tree Game.**[Citation Graph (, )][DBLP]**Approximate Mechanisms for the Graphical TSP and Other Graph Traversal Problems.**[Citation Graph (, )][DBLP]
Search in 0.002secs, Finished in 0.004secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |