Sfoglia per Autore
Finding Best Swap Edges Minimizing the Routing Cost of a Spanning Tree
2010-01-01 Bilò, D.; L., Gualà; Proietti, Guido
Reconstructing visibility graphs with simple robots
2010-01-01 Bilò, Davide; Disser, Y.; Mihalak, M.; Suri, S.; Vicari, E.; Widmayer, P.
Discovery of network properties with all-shortest-paths queries
2010-01-01 Bilò, Davide; Erlebach, T.; Mihalak, M.; Widmayer, P.
Improved Approximability and Non-approximability Results for Graph Diameter Decreasing Problems
2010-01-01 Bilò, D.; L., Gualà; Proietti, Guido
Specializations and Generalizations of the Stackelberg Minimum Spanning Tree Game
2010-01-01 Bilò, D.; Gualà, L.; Leucci, S.; Proietti, Guido
Approximating the Metric TSP in Linear Time
2011-01-01 Bilò, D.; Forlizzi, Luca; Proietti, Guido
Reoptimization of the shortest common superstring problem
2011-01-01 Bilò, Davide; Bockenhauer, H. -J.; Komm, D.; Kralovic, R.; Momke, T.; Seibert, S.; Zych, A.
Network Verification via Routing Table Queries
2011-01-01 E., Bampas; Bilò, D.; G., Drovandi; L., Gualà; R., Klasing; Proietti, Guido
New reoptimization techniques applied to steiner tree problem
2011-01-01 Bilò, Davide; Zyck, Anna
Improved Approximability and Non-approximability Results for Graph Diameter Decreasing Problems
2012-01-01 Bilò, D.; L., Gualà; Proietti, Guido
Reconstructing visibility graphs with simple robots
2012-01-01 Bilò, Davide; Disser, Y.; Mihalak, M.; Suri, S.; Vicari, E.; Widmayer, P.
Bounded-Distance Network Creation Games
2012-01-01 Bilò, D.; L., Gualà; Proietti, Guido
The Max-Distance Network Creation Game on General Host Graphs
2012-01-01 Bilò, D; Gualà, L; Leucci, Stefano; Proietti, Guido
New advances in reoptimizing the minimum Steiner tree problem
2012-01-01 Bilò, Davide.; Zych, A.
Exact and Approximate Algorithms for Movement Problems on (Special Classes of) Graphs
2013-01-01 Bilò, D.; Gualà, L.; Leucci, S.; Proietti, Guido
New bounds for the balloon popping problem
2013-01-01 Bilò, Davide; Bilò, V.
A Faster Computation of All the Best Swap Edges of a Shortest Paths Tree
2013-01-01 Bilò, D.; L., Gualà; Proietti, Guido
Polygon-Constrained Motion Planning Problems
2013-01-01 Bilò, D.; Y., Disser; L., Gualà; M., Mihal’Ak; Proietti, Guido; P., Widmayer
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
| Titolo | Data di pubblicazione | Autore(i) | File |
|---|---|---|---|
| Finding Best Swap Edges Minimizing the Routing Cost of a Spanning Tree | 1-gen-2010 | Bilò, D.; L., Gualà; Proietti, Guido | |
| Reconstructing visibility graphs with simple robots | 1-gen-2010 | Bilò, Davide; Disser, Y.; Mihalak, M.; Suri, S.; Vicari, E.; Widmayer, P. | |
| Discovery of network properties with all-shortest-paths queries | 1-gen-2010 | Bilò, Davide; Erlebach, T.; Mihalak, M.; Widmayer, P. | |
| Improved Approximability and Non-approximability Results for Graph Diameter Decreasing Problems | 1-gen-2010 | Bilò, D.; L., Gualà; Proietti, Guido | |
| Specializations and Generalizations of the Stackelberg Minimum Spanning Tree Game | 1-gen-2010 | Bilò, D.; Gualà, L.; Leucci, S.; Proietti, Guido | |
| Approximating the Metric TSP in Linear Time | 1-gen-2011 | Bilò, D.; Forlizzi, Luca; Proietti, Guido | |
| Reoptimization of the shortest common superstring problem | 1-gen-2011 | Bilò, Davide; Bockenhauer, H. -J.; Komm, D.; Kralovic, R.; Momke, T.; Seibert, S.; Zych, A. | |
| Network Verification via Routing Table Queries | 1-gen-2011 | E., Bampas; Bilò, D.; G., Drovandi; L., Gualà; R., Klasing; Proietti, Guido | |
| New reoptimization techniques applied to steiner tree problem | 1-gen-2011 | Bilò, Davide; Zyck, Anna | |
| Improved Approximability and Non-approximability Results for Graph Diameter Decreasing Problems | 1-gen-2012 | Bilò, D.; L., Gualà; Proietti, Guido | |
| Reconstructing visibility graphs with simple robots | 1-gen-2012 | Bilò, Davide; Disser, Y.; Mihalak, M.; Suri, S.; Vicari, E.; Widmayer, P. | |
| Bounded-Distance Network Creation Games | 1-gen-2012 | Bilò, D.; L., Gualà; Proietti, Guido | |
| The Max-Distance Network Creation Game on General Host Graphs | 1-gen-2012 | Bilò, D; Gualà, L; Leucci, Stefano; Proietti, Guido | |
| New advances in reoptimizing the minimum Steiner tree problem | 1-gen-2012 | Bilò, Davide.; Zych, A. | |
| Exact and Approximate Algorithms for Movement Problems on (Special Classes of) Graphs | 1-gen-2013 | Bilò, D.; Gualà, L.; Leucci, S.; Proietti, Guido | |
| New bounds for the balloon popping problem | 1-gen-2013 | Bilò, Davide; Bilò, V. | |
| A Faster Computation of All the Best Swap Edges of a Shortest Paths Tree | 1-gen-2013 | Bilò, D.; L., Gualà; Proietti, Guido | |
| Polygon-Constrained Motion Planning Problems | 1-gen-2013 | Bilò, D.; Y., Disser; L., Gualà; M., Mihal’Ak; Proietti, Guido; P., Widmayer | |
| 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 |
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