Sfoglia per Autore
A Faster Computation of All the Best Swap Edges of a Shortest Paths Tree
2014-01-01 Bilò, Davide; Gualà, Luciano; Proietti, Guido
Locality-based Network Creation Games
2014-01-01 Bilò, D.; Gualà, L.; Leucci, S.; Proietti, Guido
Network Creation Games with Traceroute-Based Strategies
2014-01-01 Bilò, D.; Gualà, L.; Leucci, S.; Proietti, Guido
Bounded-Distance Network Creation Games
2015-01-01 Bilò, D.; L., Gualà; Proietti, Guido
A faster computation of all the best swap edges of a tree spanner
2015-01-01 Bilò, Davide; Colella, Feliciano; Gualà, Luciano; Leucci, Stefano; Proietti, Guido
Specializations and Generalizations of the Stackelberg Minimum Spanning Tree Game
2015-01-01 Bilò, D.; Gualà, L.; Leucci, S.; Proietti, Guido
Network Verification via Routing Table Queries
2015-01-01 E., Bampas; Bilò, D.; G., Drovandi; L., Gualà; R., Klasing; Proietti, Guido
Improved Purely Additive Fault-Tolerant Spanners
2015-01-01 Bilò, D.; Grandoni, F.; Gualà, L.; Leucci, S.; Proietti, Guido
The max-distance network creation game on general host graphs
2015-01-01 Bilò, D.; Gualà, L.; Leucci, S.; Proietti, Guido
New bounds for the balloon popping problem
2015-01-01 Bilò, Davide; Bilò, V.
Locality-Based Network Creation Games
2016-01-01 Bilò, Davide; Gualà, Luciano; Leucci, Stefano; Proietti, Guido
Multiple-edge-fault-tolerant approximate shortest-path trees
2016-01-01 Bilò, Davide; Gualà, Luciano; Leucci, Stefano; Proietti, Guido
Compact and fast sensitivity oracles for single-source distances
2016-01-01 Bilò, Davide; Gualà, Luciano; Leucci, Stefano; Proietti, Guido
Exact and approximate algorithms for movement problems on (special classes of) graphs
2016-01-01 Bilò, Davide; Gualà, Luciano; Leucci, Stefano; Proietti, Guido
Effective edge-fault-tolerant single-source spanners via best (or good) swap edges
2017-01-01 Bilò, Davide; Colella, Feliciano; Gualà, Luciano; Leucci, Stefano; Proietti, Guido
An improved algorithm for computing all the best swap edges of a tree spanner
2017-01-01 Bilò, Davide; Colella, Feliciano; Gualà, Luciano; Leucci, Stefano; Proietti, Guido
New algorithms for Steiner tree reoptimization
2018-01-01 Bilò, Davide
A novel algorithm for the all-best-swap-edge problem on tree spanners
2018-01-01 Bilò, Davide; Papadopoulos, K.
Almost optimal algorithms for diameter-optimally augmenting trees
2018-01-01 Bilò, Davide
On the tree conjecture for the network creation game
2018-01-01 Bilò, Davide; Lenzner, P.
Titolo | Data di pubblicazione | Autore(i) | File |
---|---|---|---|
A Faster Computation of All the Best Swap Edges of a Shortest Paths Tree | 1-gen-2014 | Bilò, Davide; Gualà, Luciano; Proietti, Guido | |
Locality-based Network Creation Games | 1-gen-2014 | Bilò, D.; Gualà, L.; Leucci, S.; Proietti, Guido | |
Network Creation Games with Traceroute-Based Strategies | 1-gen-2014 | Bilò, D.; Gualà, L.; Leucci, S.; Proietti, Guido | |
Bounded-Distance Network Creation Games | 1-gen-2015 | Bilò, D.; L., Gualà; Proietti, Guido | |
A faster computation of all the best swap edges of a tree spanner | 1-gen-2015 | Bilò, Davide; Colella, Feliciano; Gualà, Luciano; Leucci, Stefano; Proietti, Guido | |
Specializations and Generalizations of the Stackelberg Minimum Spanning Tree Game | 1-gen-2015 | Bilò, D.; Gualà, L.; Leucci, S.; Proietti, Guido | |
Network Verification via Routing Table Queries | 1-gen-2015 | E., Bampas; Bilò, D.; G., Drovandi; L., Gualà; R., Klasing; Proietti, Guido | |
Improved Purely Additive Fault-Tolerant Spanners | 1-gen-2015 | Bilò, D.; Grandoni, F.; Gualà, L.; Leucci, S.; Proietti, Guido | |
The max-distance network creation game on general host graphs | 1-gen-2015 | Bilò, D.; Gualà, L.; Leucci, S.; Proietti, Guido | |
New bounds for the balloon popping problem | 1-gen-2015 | Bilò, Davide; Bilò, V. | |
Locality-Based Network Creation Games | 1-gen-2016 | Bilò, Davide; Gualà, Luciano; Leucci, Stefano; Proietti, Guido | |
Multiple-edge-fault-tolerant approximate shortest-path trees | 1-gen-2016 | Bilò, Davide; Gualà, Luciano; Leucci, Stefano; Proietti, Guido | |
Compact and fast sensitivity oracles for single-source distances | 1-gen-2016 | Bilò, Davide; Gualà, Luciano; Leucci, Stefano; Proietti, Guido | |
Exact and approximate algorithms for movement problems on (special classes of) graphs | 1-gen-2016 | Bilò, Davide; Gualà, Luciano; Leucci, Stefano; Proietti, Guido | |
Effective edge-fault-tolerant single-source spanners via best (or good) swap edges | 1-gen-2017 | Bilò, Davide; Colella, Feliciano; Gualà, Luciano; Leucci, Stefano; Proietti, Guido | |
An improved algorithm for computing all the best swap edges of a tree spanner | 1-gen-2017 | Bilò, Davide; Colella, Feliciano; Gualà, Luciano; Leucci, Stefano; Proietti, Guido | |
New algorithms for Steiner tree reoptimization | 1-gen-2018 | Bilò, Davide | |
A novel algorithm for the all-best-swap-edge problem on tree spanners | 1-gen-2018 | Bilò, Davide; Papadopoulos, K. | |
Almost optimal algorithms for diameter-optimally augmenting trees | 1-gen-2018 | Bilò, Davide | |
On the tree conjecture for the network creation game | 1-gen-2018 | Bilò, Davide; Lenzner, P. |
Legenda icone
- file ad accesso aperto
- file disponibili sulla rete interna
- file disponibili agli utenti autorizzati
- file disponibili solo agli amministratori
- file sotto embargo
- nessun file disponibile