PROIETTI, GUIDO
PROIETTI, GUIDO
Hardness of an asymmetric 2-player stackelberg network pricing game
2021 Bilo, D; Guala, L; Proietti, G
Network creation games with traceroute-based strategies
2021 Bilo D.; Guala L.; Leucci S.; Proietti G.
An Improved Algorithm for Computing All the Best Swap Edges of a Tree Spanner
2020 Bilo D.; Colella F.; Guala L.; Leucci S.; Proietti G.
Hardness, approximability, and fixed-parameter tractability of the clustered shortest-path tree problem
2019 D'Emidio M.; Forlizzi L.; Frigioni D.; Leucci S.; Proietti G.
Fault-Tolerant Approximate Shortest-Path Trees
2018 Bilò, Davide; Gualà, Luciano; Leucci, Stefano; Proietti, Guido
Exact and approximate algorithms for movement problems on (special classes of) graphs
2016 Bilo, D; Guala, L; Leucci, S; Proietti, G
Locality-Based Network Creation Games
2016 Bilò, Davide; Gualà, Luciano; Leucci, Stefano; Proietti, Guido
A Faster Computation of All the Best Swap Edges of a Shortest Paths Tree
2015 Bilo, D; Guala, L; Proietti, G
A Faster Computation of All the Best Swap Edges of a Tree Spanner
2015 Davide Bilò ; Feliciano Colella; Luciano Gualà; Stefano Leucci; Guido Proietti
Bounded-Distance Network Creation Games
2015 Bilo, Davide; Guala, Luciano; Proietti, Guido
Dynamic maintenance of a shortest-path tree on homogeneous batches of updates: New algorithms and experiments
2015 D'Andrea A.; D'Emidio M.; Frigioni D.; Leucci S.; Proietti G.
Improved Purely Additive FaultTolerant Spanners
2015 Bilò, Davide; Grandoni, Fabrizio; Gualà, Luciano; Leucci, Stefano; Proietti, Guido
Network verification via routing table queries
2015 Bampas, E; Bilo, D; Drovandi, G; Guala, L; Klasing, R; Proietti, G
Path-Fault-Tolerant Approximate Shortest-Path Trees
2015 Annalisa D'Andrea ; Mattia D'Emidio; Daniele Frigioni; Stefano Leucci; Guido Proietti
Specializations and generalizations of the Stackelberg minimum spanning tree game
2015 Bilo, D; Guala, L; Leucci, S; Proietti, G
The Max-Distance Network Creation Game on General Host Graphs
2015 Davide Bilò; Luciano Gualà; Stefano Leucci; Guido Proietti
Finding Best Swap Edges Minimizing the Routing Cost of a Spanning Tree
2014 Bilò, D; Gualà, L; Proietti, G
Polygon-Constrained Motion Planning Problems
2014 Bilò, D; Disser, Y; Gualà, L; Mihal'Ak, M; Proietti, G; Widmayer, P
A Faster Computation of All the Best Swap Edges of a Shortest Paths Tree
2013 D. Bilò; L. Gualà;G. Proietti
Dynamically Maintaining Shortest Path Trees Under Batches of Updates
2013 D'Andrea, A; D'Emidio, M; Frigioni, D; Leucci, S; Proietti, G
| Titolo | Data di pubblicazione | Autore(i) | File |
|---|---|---|---|
| Hardness of an asymmetric 2-player stackelberg network pricing game | 1-gen-2021 | Bilo, D; Guala, L; Proietti, G | |
| Network creation games with traceroute-based strategies | 1-gen-2021 | Bilo D.; Guala L.; Leucci S.; Proietti G. | |
| An Improved Algorithm for Computing All the Best Swap Edges of a Tree Spanner | 1-gen-2020 | Bilo D.; Colella F.; Guala L.; Leucci S.; Proietti G. | |
| Hardness, approximability, and fixed-parameter tractability of the clustered shortest-path tree problem | 1-gen-2019 | D'Emidio M.; Forlizzi L.; Frigioni D.; Leucci S.; Proietti G. | |
| Fault-Tolerant Approximate Shortest-Path Trees | 1-gen-2018 | Bilò, Davide; Gualà, Luciano; Leucci, Stefano; Proietti, Guido | |
| Exact and approximate algorithms for movement problems on (special classes of) graphs | 1-gen-2016 | Bilo, D; Guala, L; Leucci, S; Proietti, G | |
| Locality-Based Network Creation Games | 1-gen-2016 | Bilò, Davide; Gualà, Luciano; Leucci, Stefano; Proietti, Guido | |
| A Faster Computation of All the Best Swap Edges of a Shortest Paths Tree | 1-gen-2015 | Bilo, D; Guala, L; Proietti, G | |
| A Faster Computation of All the Best Swap Edges of a Tree Spanner | 1-gen-2015 | Davide Bilò ; Feliciano Colella; Luciano Gualà; Stefano Leucci; Guido Proietti | |
| Bounded-Distance Network Creation Games | 1-gen-2015 | Bilo, Davide; Guala, Luciano; Proietti, Guido | |
| Dynamic maintenance of a shortest-path tree on homogeneous batches of updates: New algorithms and experiments | 1-gen-2015 | D'Andrea A.; D'Emidio M.; Frigioni D.; Leucci S.; Proietti G. | |
| Improved Purely Additive FaultTolerant Spanners | 1-gen-2015 | Bilò, Davide; Grandoni, Fabrizio; Gualà, Luciano; Leucci, Stefano; Proietti, Guido | |
| Network verification via routing table queries | 1-gen-2015 | Bampas, E; Bilo, D; Drovandi, G; Guala, L; Klasing, R; Proietti, G | |
| Path-Fault-Tolerant Approximate Shortest-Path Trees | 1-gen-2015 | Annalisa D'Andrea ; Mattia D'Emidio; Daniele Frigioni; Stefano Leucci; Guido Proietti | |
| Specializations and generalizations of the Stackelberg minimum spanning tree game | 1-gen-2015 | Bilo, D; Guala, L; Leucci, S; Proietti, G | |
| The Max-Distance Network Creation Game on General Host Graphs | 1-gen-2015 | Davide Bilò; Luciano Gualà; Stefano Leucci; Guido Proietti | |
| Finding Best Swap Edges Minimizing the Routing Cost of a Spanning Tree | 1-gen-2014 | Bilò, D; Gualà, L; Proietti, G | |
| Polygon-Constrained Motion Planning Problems | 1-gen-2014 | Bilò, D; Disser, Y; Gualà, L; Mihal'Ak, M; Proietti, G; Widmayer, P | |
| A Faster Computation of All the Best Swap Edges of a Shortest Paths Tree | 1-gen-2013 | D. Bilò; L. Gualà;G. Proietti | |
| Dynamically Maintaining Shortest Path Trees Under Batches of Updates | 1-gen-2013 | D'Andrea, A; D'Emidio, M; Frigioni, D; Leucci, S; Proietti, G |