BILÒ, Davide
BILÒ, Davide
SCIENZE UMANISTICHE E SOCIALI
A 13/10-approximation Algorithm for Minimum-size 2-Vertex-connectivity of Hamiltonian Graphs
2005-01-01 Bilò, Davide; Proietti, Guido
A 5/4-Approximation Algorithm for Biconnecting a Graph with a Given Hamiltonian Path
2005-01-01 Bilò, Davide; Proietti, Guido
A faster computation of all the best swap edges of a shortest paths tree
2015-01-01 Bilò, Davide; Gualà, Luciano; Proietti, Guido
A faster computation of all the best swap edges of a shortest paths tree
2013-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
A novel algorithm for the all-best-swap-edge problem on tree spanners
2018-01-01 Bilo, D.; Papadopoulos, K.
Almost optimal algorithms for diameter-optimally augmenting trees
2018-01-01 Bilo, D.
An algorithm composition scheme preserving monotonicity
2007-01-01 Bilò, Davide; Forlizzi, Luca; Gualà, Luciano; 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
An Improved Algorithm for Computing All the Best Swap Edges of a Tree Spanner
2019-01-01 Bilo, D.; Colella, F.; Guala, L.; Leucci, S.; Proietti, G.
Approximate Mechanisms for the Graphical TSP and Other Graph Traversal Problems
2007-01-01 Bilò, Davide; Forlizzi, Luca; Gualà, Luciano; Proietti, Guido
Approximate mechanisms for the graphical TSP and other graph-traversal problems
2008-01-01 Bilò, Davide; Forlizzi, Luca; Gualà, Luciano; Proietti, Guido
Approximating the Metric TSP in Linear Time
2011-01-01 Bilò, Davide; Forlizzi, Luca; Proietti, Guido
Approximating the Metric TSP in Linear Time
2008-01-01 Bilò, Davide; Forlizzi, Luca; Proietti, Guido
Augmenting the Edge-Connectivity of a Spider Tree
2004-01-01 Bilò, Davide; Proietti, Guido
Bounded-distance network creation game
2012-01-01 Bilò, Davide; Gualà, Luciano; Proietti, Guido
Bounded-distance network creation games
2015-01-01 Bilò, Davide; Gualà, Luciano; Proietti, Guido
Compact and Fast Sensitivity Oracles for Single-Source Distances
2016-01-01 Bilò, Davide; Gualà, Luciano; Leucci, Stefano; Proietti, Guido
Computational Aspects of a 2-Player Stackelberg Shortest Paths Tree Game
2008-01-01 Bilò, Davide; Gualà, Luciano; Proietti, Guido; Widmayer, Peter
Cutting bamboo down to size
2020-01-01 Bilò, D.; Gualà, L.; Leucci, S.; Proietti, G.; Scornavacca, G.
| Titolo | Data di pubblicazione | Autore(i) | File |
|---|---|---|---|
| A 13/10-approximation Algorithm for Minimum-size 2-Vertex-connectivity of Hamiltonian Graphs | 1-gen-2005 | Bilò, Davide; Proietti, Guido | |
| A 5/4-Approximation Algorithm for Biconnecting a Graph with a Given Hamiltonian Path | 1-gen-2005 | Bilò, Davide; Proietti, Guido | |
| A faster computation of all the best swap edges of a shortest paths tree | 1-gen-2015 | Bilò, Davide; Gualà, Luciano; Proietti, Guido | |
| A faster computation of all the best swap edges of a shortest paths tree | 1-gen-2013 | 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 | |
| A novel algorithm for the all-best-swap-edge problem on tree spanners | 1-gen-2018 | Bilo, D.; Papadopoulos, K. | |
| Almost optimal algorithms for diameter-optimally augmenting trees | 1-gen-2018 | Bilo, D. | |
| An algorithm composition scheme preserving monotonicity | 1-gen-2007 | Bilò, Davide; Forlizzi, Luca; Gualà, Luciano; 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 | |
| An Improved Algorithm for Computing All the Best Swap Edges of a Tree Spanner | 1-gen-2019 | Bilo, D.; Colella, F.; Guala, L.; Leucci, S.; Proietti, G. | |
| Approximate Mechanisms for the Graphical TSP and Other Graph Traversal Problems | 1-gen-2007 | Bilò, Davide; Forlizzi, Luca; Gualà, Luciano; Proietti, Guido | |
| Approximate mechanisms for the graphical TSP and other graph-traversal problems | 1-gen-2008 | Bilò, Davide; Forlizzi, Luca; Gualà, Luciano; Proietti, Guido | |
| Approximating the Metric TSP in Linear Time | 1-gen-2011 | Bilò, Davide; Forlizzi, Luca; Proietti, Guido | |
| Approximating the Metric TSP in Linear Time | 1-gen-2008 | Bilò, Davide; Forlizzi, Luca; Proietti, Guido | |
| Augmenting the Edge-Connectivity of a Spider Tree | 1-gen-2004 | Bilò, Davide; Proietti, Guido | |
| Bounded-distance network creation game | 1-gen-2012 | Bilò, Davide; Gualà, Luciano; Proietti, Guido | |
| Bounded-distance network creation games | 1-gen-2015 | Bilò, Davide; Gualà, Luciano; Proietti, Guido | |
| Compact and Fast Sensitivity Oracles for Single-Source Distances | 1-gen-2016 | Bilò, Davide; Gualà, Luciano; Leucci, Stefano; Proietti, Guido | |
| Computational Aspects of a 2-Player Stackelberg Shortest Paths Tree Game | 1-gen-2008 | Bilò, Davide; Gualà, Luciano; Proietti, Guido; Widmayer, Peter | |
| Cutting bamboo down to size | 1-gen-2020 | Bilò, D.; Gualà, L.; Leucci, S.; Proietti, G.; Scornavacca, G. |