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
2015, with author Proietti G., in the category ALL
(or show them all): (Items found: 9)
2015 [top]
- Bampas E., Bilò D., Drovandi G., Gualà L., Klasing R., Proietti G.: Network Verification via Routing Table Queries, Journal of Computer and System Sciences 81(1), 234-248, 2015
- Bilò D., Colella F., Gualà L., Leucci S., Proietti G.: A Faster Computation of All the Best Swap Edges of a Tree Spanner, in the Proceedings of 22nd International Colloquium on Structural Information and Communication Complexity (SIROCCO’15), Lecture Notes in Computer Science, 9439, 2015
- Bilò D., Grandoni F., Gualà L., Leucci S., Proietti G.: Improved Purely Additive FaultTolerant Spanners, in the Proceedings of 23rd European Symposium on Algorithms (ESA’15), September 14-16, 2015, Patras, Greece, Lecture Notes in Computer Science, 9294, 2015
- Bilò D., Gualà L., Leucci S., Proietti G.: The Max-Distance Network Creation Game on General Host Graphs, Theoretical Computer Science 573, 43-53, 2015
- Bilò D., Gualà L., Leucci S., Proietti G.: Specializations and Generalizations of the Stackelberg Minimum Spanning Tree Game, Theoretical Computer Science 562, 643-657, 2015
- Bilò D., Gualà L., Proietti G.: A Faster Computation of All the Best Swap Edges of a Shortest Paths Tree, Algorithmica 73(3), 547-570, 2015
- Bilò D., Gualà L., Proietti G.: Bounded-Distance Network Creation Games, ACM Transactions on Economics and Computation 3(3), 2015
- D'Andrea A., D'Emidio M., Frigioni D., Leucci S., Proietti G.: Dynamic Maintenance of a Shortest-Path Tree on Homogeneous Batches of Updates: New Algorithms and Experiments, ACM Journal of Experimental Algorithmics Vol. 20, No. 1, 2015
- D'Andrea A., D'Emidio M., Frigioni D., Leucci S., Proietti G.: Path-Fault-Tolerant Approximate Shortest-Path Trees, Lecture Notes in Computer Science, 9439, 2015
|
