Sfoglia per Autore
Network creation games with traceroute-based strategies
2014-01-01 Bilò, Davide; Gualà, Luciano; Leucci, Stefano; Proietti, Guido
Finding the best swap edges minimizing the routing cost of a spanning tree
2014-01-01 Bilò, Davide; Gualà, Luciano; Proietti, Guido
Locality-based network creation game
2014-01-01 Bilò, Davide; Gualà, Luciano; Leucci, Stefano; Proietti, Guido
Fault-tolerant approximate shortest-path trees
2014-01-01 Bilò, Davide; Guala, L; Leucci, S; Proietti, G.
A faster computation of all the best swap edges of a shortest paths tree
2015-01-01 Bilò, Davide; Gualà, Luciano; Proietti, Guido
The max-distance network creation game on general host graphs
2015-01-01 Bilò, Davide; Guala, Luciano; Leucci, Stefano; Proietti, Guido
Specializations and generalizations of the Stackelberg minimum spanning tree game
2015-01-01 Bilò, Davide; Guala', Luciano; Leucci, Stefano; Proietti, Guido
Improved Purely Additive Fault-Tolerant Spanners
2015-01-01 Bilò, Davide; Grandoni, Fabrizio; Gualà, Luciano; Leucci, Stefano; Proietti, Guido
Bounded-distance network creation games
2015-01-01 Bilò, Davide; Gualà, Luciano; 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
New bounds for the balloon popping problem
2015-01-01 Bilò, Davide; Bilo', Vittorio
Network verification via routing table queries
2015-01-01 Bampas, Evangelos; Bilò, Davide; Drovandi, Guido; Guala', Luciano; Klasing, Ralf; Proietti, Guido
Multiple-edge-fault-tolerant approximate shortest-path trees
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
Compact and Fast Sensitivity Oracles for Single-Source Distances
2016-01-01 Bilò, Davide; Gualà, Luciano; Leucci, Stefano; Proietti, Guido
Locality-Based Network Creation Games
2016-01-01 Bilò, Davide; Gualà, Luciano; Leucci, Stefano; Proietti, Guido
Fault-Tolerant Approximate Shortest-Path Trees
2017-01-01 Bilò, Davide; 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
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
A novel algorithm for the all-best-swap-edge problem on tree spanners
2018-01-01 Bilo, D.; Papadopoulos, K.
Titolo | Data di pubblicazione | Autore(i) | File |
---|---|---|---|
Network creation games with traceroute-based strategies | 1-gen-2014 | Bilò, Davide; Gualà, Luciano; Leucci, Stefano; Proietti, Guido | |
Finding the best swap edges minimizing the routing cost of a spanning tree | 1-gen-2014 | Bilò, Davide; Gualà, Luciano; Proietti, Guido | |
Locality-based network creation game | 1-gen-2014 | Bilò, Davide; Gualà, Luciano; Leucci, Stefano; Proietti, Guido | |
Fault-tolerant approximate shortest-path trees | 1-gen-2014 | Bilò, Davide; Guala, L; Leucci, S; Proietti, G. | |
A faster computation of all the best swap edges of a shortest paths tree | 1-gen-2015 | Bilò, Davide; Gualà, Luciano; Proietti, Guido | |
The max-distance network creation game on general host graphs | 1-gen-2015 | Bilò, Davide; Guala, Luciano; Leucci, Stefano; Proietti, Guido | |
Specializations and generalizations of the Stackelberg minimum spanning tree game | 1-gen-2015 | Bilò, Davide; Guala', Luciano; Leucci, Stefano; Proietti, Guido | |
Improved Purely Additive Fault-Tolerant Spanners | 1-gen-2015 | Bilò, Davide; Grandoni, Fabrizio; Gualà, Luciano; Leucci, Stefano; Proietti, Guido | |
Bounded-distance network creation games | 1-gen-2015 | Bilò, Davide; Gualà, Luciano; 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 | |
New bounds for the balloon popping problem | 1-gen-2015 | Bilò, Davide; Bilo', Vittorio | |
Network verification via routing table queries | 1-gen-2015 | Bampas, Evangelos; Bilò, Davide; Drovandi, Guido; Guala', Luciano; Klasing, Ralf; Proietti, Guido | |
Multiple-edge-fault-tolerant approximate shortest-path trees | 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 | |
Compact and Fast Sensitivity Oracles for Single-Source Distances | 1-gen-2016 | Bilò, Davide; Gualà, Luciano; Leucci, Stefano; Proietti, Guido | |
Locality-Based Network Creation Games | 1-gen-2016 | Bilò, Davide; Gualà, Luciano; Leucci, Stefano; Proietti, Guido | |
Fault-Tolerant Approximate Shortest-Path Trees | 1-gen-2017 | Bilò, Davide; 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 | |
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 | |
A novel algorithm for the all-best-swap-edge problem on tree spanners | 1-gen-2018 | Bilo, D.; Papadopoulos, K. |
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