Publications of Guido Proietti

This page shows all publications that appeared in the IASI annual research reports. Authors currently affiliated with the Institute are always listed with the full name.

You can browse through them using either the links of the following line or those associated with author names.

Show all publications of the year  2006, with author Proietti G., in the category ALL (or show them all):   (Items found: 10)


2006  [top]
  • Bilò D., Gualà L., Proietti G.: Dynamic Mechanism Design, in the Proceedings of 2nd International Workshop on Internet and Network Economics (WINE '06), Lecture Notes in Computer Science, 4286, Springer-Verlag Patras, Greece, 3-15, 2006
  • Bilò D., Gualà L., Proietti G.: Hardness of Designing a Truthful Mechanism for a Spanning Arborescence Bicriteria Problem, in the Proceedings of 3rd Workshop on Combinatorial and Algorithmic Aspects of Networking (CAAN '06), Lecture Notes in Computer Science, 4235, Springer-Verlag Chester, UK, 19-30, 2006
  • Bilò D., Gualà L., Proietti G.: On the Existence of Truthful Mechanisms for the Minimum-cost Approximate Shortest-paths Tree Problem, in the Proceedings of 13th Coll. on Structural Information and Communication Complexity (SIROCCO '06), Lecture Notes in Computer Science, 4056, Springer-Verlag Chester, UK, 295-309, 2006
  • Bilò D., Proietti G.: On the Complexity of Minimizing Interference in Ad-Hoc and Sensor Networks, in the Proceedings of 2nd Int. Workshop on Algorithmic Aspects of Wireless Sensor Networks (ALGOSENSORS '06), Lecture Notes in Computer Science, 4240, Springer-Verlag Venezia, Italy, 13-24, 2006
  • Bockenhauer H.J., Kneis J., Kupke J., Hromkovič J., Forlizzi L., Proietti G., Widmayer P.: Reusing Optimal TSP Solutions for Locally Modified Input Instances, in the Proceedings of 4th IFIP International Conference on Theoretical Computer Science (TCS '06), 209, Springer Santiago, Chile, 251-270, 2006
  • Forlizzi L., Hromkovič J., Proietti G., Seibert S.: On the Stability of Approximation for Hamiltonian Path Problems, Algorithmic Operations Research 1 (1), 31-45, 2006
  • Carlo Gaibisso, Proietti G., Tan R.: Efficient Management of Transient Station Failures in Linear Radio Communication Networks with Bases, Journal of Parallel and Distributed Computing 66 (4), 556-565, 2006
  • Nardelli E., Proietti G.: Efficient Unbalanced Merge-Sort, Information Sciences 176 (10), 1321-1337, 2006
  • Penna P., Proietti G., Widmayer P.: Strongly Polynomial-Time Truthful Mechanisms in One Shot, in the Proceedings of 2nd International Workshop on Internet and Network Economics (WINE '06), Lecture Notes in Computer Science, 4286, Springer-Verlag Patras, Greece, 77-88, 2006
  • Proietti G., Widmayer P.: Partitioning the Nodes of a Graph to Minimize the Sum of Subgraph Radii, in the Proceedings of 17th Annual International Symposium on Algorithms and Computation (ISAAC '06), Lecture Notes in Computer Science, 4288, Springer-Verlag Kolcata, India, 578-587, 2006
- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -