Sfoglia per Autore
Bounded-Distance Network Creation Games
2012-01-01 Bilò, D; Guala', L; Proietti, G
The Max-Distance Network Creation Game on General Host Graphs
2012-01-01 Bilò, D; Guala', L; Leucci, S; Proietti, G
Polygon-Constrained Motion Planning Problems
2013-01-01 Bilò, D; Disser, Y; Guala', L; Mihalák, M; Proietti, G; Widmayer, P
A Faster Computation of All the Best Swap Edges of a Shortest Paths Tree
2013-01-01 Bilò, D; Guala', L; Proietti, G
Exact and Approximate Algorithms for Movement Problems on (Special Classes of) Graphs
2013-01-01 Bilò, D; Guala', L; Leucci, S; Proietti, G
Locality-based network creation games
2014-01-01 Bilò, D; Guala', L; Leucci, S; Proietti, G
Bejeweled, Candy Crush and other match-three games are (NP-)hard
2014-01-01 Guala', L; Leucci, S; Natale, E
Finding Best Swap Edges Minimizing the Routing Cost of a Spanning Tree
2014-01-01 Bilò, D; Guala', L; Proietti, G
Network Creation Games with Traceroute-Based Strategies
2014-01-01 Bilò, D; Guala', L; Leucci, S; Proietti, G
Fault-Tolerant Approximate Shortest-Path Trees
2014-01-01 Bilò, D; Guala', L; Leucci, S; Proietti, G
A Faster Computation of All the Best Swap Edges of a Shortest Paths Tree
2014-07-12 Bilo, D; Guala', L; Proietti, G
Improved purely additive fault-tolerant spanners
2015-01-01 Bilo, D; Grandoni, F; Guala', L; Leucci, S; Proietti, G
A faster computation of all the best swap edges of a tree spanner
2015-01-01 Bilò, D; Colella, F; Guala', L; Leucci, S; Proietti, G
Reducing the diameter of a unit disk graph via node addition
2015-01-01 DI IANNI, M; Guala', L; Rossi, G
Network verification via routing table queries
2015-01-01 Bampas, E; Bilò, D; Drovandi, G; Guala', L; Klasing, R; Proietti, G
Specializations and generalizations of the Stackelberg minimum spanning tree game
2015-01-01 Bilo, D; Guala', L; Leucci, S; Proietti, G
The max-distance network creation game on general host graphs
2015-03-30 Bilò, D; Guala', L; Leucci, S; Proietti, G
Bounded-Distance Network Creation Games
2015-06-01 Bilò, D; Guala', L; Proietti, G
Locality-based network creation games
2016-01-01 Bilò, D; Guala', L; Leucci, S; Proietti, G
Multiple-edge-fault-tolerant approximate shortest-path trees
2016-01-01 Bilo, D; Guala', L; Leucci, S; Proietti, G
| Data di pubblicazione | Titolo | Autore(i) | Tipo | File |
|---|---|---|---|---|
| 1-gen-2012 | Bounded-Distance Network Creation Games | Bilò, D; Guala', L; Proietti, G | Intervento a convegno | |
| 1-gen-2012 | The Max-Distance Network Creation Game on General Host Graphs | Bilò, D; Guala', L; Leucci, S; Proietti, G | Intervento a convegno | |
| 1-gen-2013 | Polygon-Constrained Motion Planning Problems | Bilò, D; Disser, Y; Guala', L; Mihalák, M; Proietti, G; Widmayer, P | Intervento a convegno | |
| 1-gen-2013 | A Faster Computation of All the Best Swap Edges of a Shortest Paths Tree | Bilò, D; Guala', L; Proietti, G | Intervento a convegno | |
| 1-gen-2013 | Exact and Approximate Algorithms for Movement Problems on (Special Classes of) Graphs | Bilò, D; Guala', L; Leucci, S; Proietti, G | Intervento a convegno | |
| 1-gen-2014 | Locality-based network creation games | Bilò, D; Guala', L; Leucci, S; Proietti, G | Intervento a convegno | |
| 1-gen-2014 | Bejeweled, Candy Crush and other match-three games are (NP-)hard | Guala', L; Leucci, S; Natale, E | Intervento a convegno | |
| 1-gen-2014 | Finding Best Swap Edges Minimizing the Routing Cost of a Spanning Tree | Bilò, D; Guala', L; Proietti, G | Articolo su rivista | |
| 1-gen-2014 | Network Creation Games with Traceroute-Based Strategies | Bilò, D; Guala', L; Leucci, S; Proietti, G | Intervento a convegno | |
| 1-gen-2014 | Fault-Tolerant Approximate Shortest-Path Trees | Bilò, D; Guala', L; Leucci, S; Proietti, G | Intervento a convegno | |
| 12-lug-2014 | A Faster Computation of All the Best Swap Edges of a Shortest Paths Tree | Bilo, D; Guala', L; Proietti, G | Articolo su rivista | |
| 1-gen-2015 | Improved purely additive fault-tolerant spanners | Bilo, D; Grandoni, F; Guala', L; Leucci, S; Proietti, G | Intervento a convegno | |
| 1-gen-2015 | A faster computation of all the best swap edges of a tree spanner | Bilò, D; Colella, F; Guala', L; Leucci, S; Proietti, G | Intervento a convegno | |
| 1-gen-2015 | Reducing the diameter of a unit disk graph via node addition | DI IANNI, M; Guala', L; Rossi, G | Articolo su rivista | |
| 1-gen-2015 | Network verification via routing table queries | Bampas, E; Bilò, D; Drovandi, G; Guala', L; Klasing, R; Proietti, G | Articolo su rivista | |
| 1-gen-2015 | Specializations and generalizations of the Stackelberg minimum spanning tree game | Bilo, D; Guala', L; Leucci, S; Proietti, G | Articolo su rivista | |
| 30-mar-2015 | The max-distance network creation game on general host graphs | Bilò, D; Guala', L; Leucci, S; Proietti, G | Articolo su rivista | |
| 1-giu-2015 | Bounded-Distance Network Creation Games | Bilò, D; Guala', L; Proietti, G | Articolo su rivista | |
| 1-gen-2016 | Locality-based network creation games | Bilò, D; Guala', L; Leucci, S; Proietti, G | Articolo su rivista | |
| 1-gen-2016 | Multiple-edge-fault-tolerant approximate shortest-path trees | Bilo, D; Guala', L; Leucci, S; Proietti, G | Intervento a convegno |
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