BILO', DAVIDE
BILO', DAVIDE
Dipartimento di Ingegneria e scienze dell'informazione e matematica
A 5/4-approximation algorithm for biconnecting a graph with a given Hamiltonian path
2004-01-01 Bilo', D.; Proietti, Guido
Almost optimal algorithms for diameter-optimally augmenting trees
2018-01-01 Bilò, Davide
An Algorithm Composition Scheme Preserving Monotonicity
2007-01-01 Bilò, D.; Forlizzi, Luca; L., Gualà; Proietti, Guido
Approximate Mechanisms for the Metric TSP and other Graph Traversal Problems
2008-01-01 Bilò, D.; Forlizzi, Luca; L., Gualà; Proietti, Guido
Approximate Mechanisms for the Metric TSP and other Graph Traversal Problems
2007-01-01 Bilò, D.; Forlizzi, Luca; Gualà, L.; Proietti, G.
Approximating the Metric TSP in Linear Time
2011-01-01 Bilò, D.; Forlizzi, Luca; Proietti, Guido
Approximating the Metric TSP in Linear Time
2008-01-01 Bilò, D.; Forlizzi, Luca; Proietti, Guido
Augmenting the Edge-Connectivity of a Spider Tree
2004-01-01 Bilo', D.; Proietti, Guido
Bounded-Distance Network Creation Games
2012-01-01 Bilò, D.; L., Gualà; Proietti, Guido
Bounded-Distance Network Creation Games
2015-01-01 Bilò, D.; L., Gualà; 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ò, D.; L., Gualà; Proietti, Guido; P., Widmayer
Cutting Bamboo Down to Size
2020-01-01 Bilo', Davide; Gualà, Luciano; Leucci, Stefano; Proietti, Guido; Scornavacca, Giacomo
Cutting bamboo down to size
2022-01-01 Bilò, Davide; Gualà, L.; Leucci, S.; Proietti, G.; Scornavacca, G.
Designing a Truthful Mechanism for a Spanning Arborescence Bicriteria Problem
2006-01-01 Bilò, D.; L., Gualà; Proietti, Guido
Discovery of network properties with all-shortest-paths queries
2008-01-01 Bilò, Davide; Erlebach, T.; Mihalak, M.; Widmayer, P.
Discovery of network properties with all-shortest-paths queries
2010-01-01 Bilò, Davide; Erlebach, T.; Mihalak, M.; Widmayer, P.
Dynamic Mechanism Design
2009-01-01 Bilò, D.; L., Gualà; Proietti, Guido
Dynamic Mechanism Design
2006-01-01 Bilo', D.; Guala', L.; Proietti, Guido
Effcient oracles and routing schemes for replacement paths
2018-01-01 Bilò, Davide; Choudhary, Keerti; Gualà, Luciano; Leucci, Stefano; Parter, Merav; Proietti, Guido
| Titolo | Data di pubblicazione | Autore(i) | File |
|---|---|---|---|
| A 5/4-approximation algorithm for biconnecting a graph with a given Hamiltonian path | 1-gen-2004 | Bilo', D.; Proietti, Guido | |
| Almost optimal algorithms for diameter-optimally augmenting trees | 1-gen-2018 | Bilò, Davide | |
| An Algorithm Composition Scheme Preserving Monotonicity | 1-gen-2007 | Bilò, D.; Forlizzi, Luca; L., Gualà; Proietti, Guido | |
| Approximate Mechanisms for the Metric TSP and other Graph Traversal Problems | 1-gen-2008 | Bilò, D.; Forlizzi, Luca; L., Gualà; Proietti, Guido | |
| Approximate Mechanisms for the Metric TSP and other Graph Traversal Problems | 1-gen-2007 | Bilò, D.; Forlizzi, Luca; Gualà, L.; Proietti, G. | |
| Approximating the Metric TSP in Linear Time | 1-gen-2011 | Bilò, D.; Forlizzi, Luca; Proietti, Guido | |
| Approximating the Metric TSP in Linear Time | 1-gen-2008 | Bilò, D.; Forlizzi, Luca; Proietti, Guido | |
| Augmenting the Edge-Connectivity of a Spider Tree | 1-gen-2004 | Bilo', D.; Proietti, Guido | |
| Bounded-Distance Network Creation Games | 1-gen-2012 | Bilò, D.; L., Gualà; Proietti, Guido | |
| Bounded-Distance Network Creation Games | 1-gen-2015 | Bilò, D.; L., Gualà; 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ò, D.; L., Gualà; Proietti, Guido; P., Widmayer | |
| Cutting Bamboo Down to Size | 1-gen-2020 | Bilo', Davide; Gualà, Luciano; Leucci, Stefano; Proietti, Guido; Scornavacca, Giacomo | |
| Cutting bamboo down to size | 1-gen-2022 | Bilò, Davide; Gualà, L.; Leucci, S.; Proietti, G.; Scornavacca, G. | |
| Designing a Truthful Mechanism for a Spanning Arborescence Bicriteria Problem | 1-gen-2006 | Bilò, D.; L., Gualà; Proietti, Guido | |
| Discovery of network properties with all-shortest-paths queries | 1-gen-2008 | Bilò, Davide; Erlebach, T.; Mihalak, M.; Widmayer, P. | |
| Discovery of network properties with all-shortest-paths queries | 1-gen-2010 | Bilò, Davide; Erlebach, T.; Mihalak, M.; Widmayer, P. | |
| Dynamic Mechanism Design | 1-gen-2009 | Bilò, D.; L., Gualà; Proietti, Guido | |
| Dynamic Mechanism Design | 1-gen-2006 | Bilo', D.; Guala', L.; Proietti, Guido | |
| Effcient oracles and routing schemes for replacement paths | 1-gen-2018 | Bilò, Davide; Choudhary, Keerti; Gualà, Luciano; Leucci, Stefano; Parter, Merav; Proietti, Guido |