| 2009 |
|---|
| 12 | EE | Davide Bilò,
Luciano Gualà,
Guido Proietti:
Dynamic mechanism design.
Theor. Comput. Sci. 410(17): 1564-1572 (2009) |
| 2008 |
|---|
| 11 | EE | Davide Bilò,
Luciano Gualà,
Guido Proietti,
Peter Widmayer:
Computational Aspects of a 2-Player Stackelberg Shortest Paths Tree Game.
WINE 2008: 251-262 |
| 2007 |
|---|
| 10 | EE | Davide Bilò,
Jörg Derungs,
Luciano Gualà,
Guido Proietti,
Peter Widmayer:
Locating Facilities on a Network to Minimize Their Average Service Radius.
ISAAC 2007: 587-598 |
| 9 | EE | Davide Bilò,
Luca Forlizzi,
Luciano Gualà,
Guido Proietti:
An algorithm composition scheme preserving monotonicity.
PODC 2007: 360-361 |
| 8 | EE | Davide Bilò,
Luca Forlizzi,
Luciano Gualà,
Guido Proietti:
Approximate Mechanisms for the Graphical TSP and Other Graph Traversal Problems.
WINE 2007: 503-514 |
| 7 | EE | Luciano Gualà,
Guido Proietti:
Exact and Approximate Truthful Mechanisms for the Shortest Paths Tree Problem.
Algorithmica 49(3): 171-191 (2007) |
| 6 | EE | Luciano Gualà,
Guido Proietti:
Efficient truthful mechanisms for the single-source shortest paths tree problem.
Concurrency and Computation: Practice and Experience 19(17): 2285-2297 (2007) |
| 2006 |
|---|
| 5 | EE | Davide Bilò,
Luciano Gualà,
Guido Proietti:
Designing a Truthful Mechanism for a Spanning Arborescence Bicriteria Problem.
CAAN 2006: 19-30 |
| 4 | EE | Davide Bilò,
Luciano Gualà,
Guido Proietti:
On the Existence of Truthful Mechanisms for the Minimum-Cost Approximate Shortest-Paths Tree Problem.
SIROCCO 2006: 295-309 |
| 3 | EE | Davide Bilò,
Luciano Gualà,
Guido Proietti:
Dynamic Mechanism Design.
WINE 2006: 3-15 |
| 2005 |
|---|
| 2 | EE | Luciano Gualà,
Guido Proietti:
A Truthful (2-2/k)-Approximation Mechanism for the Steiner Tree Problem with k Terminals.
COCOON 2005: 390-400 |
| 1 | EE | Luciano Gualà,
Guido Proietti:
Efficient Truthful Mechanisms for the Single-Source Shortest Paths Tree Problem.
Euro-Par 2005: 941-951 |
