×

zbMATH — the first resource for mathematics

Bilò, Davide

Compute Distance To:
Author ID: bilo.davide Recent zbMATH articles by "Bilò, Davide"
Published as: Bilò, Davide; Bilò, D.
External Links: ORCID
Documents Indexed: 56 Publications since 2004

Publications by Year

Citations contained in zbMATH Open

36 Publications have been cited 137 times in 85 Documents Cited by Year
Reoptimization of Steiner trees. Zbl 1155.68574
Bilò, Davide; Böckenhauer, Hans-Joachim; Hromkovič, Juraj; Královič, Richard; Mömke, Tobias; Widmayer, Peter; Zych, Anna
15
2008
Reoptimization of weighted graph and covering problems. Zbl 1209.68632
Bilò, Davide; Widmayer, Peter; Zych, Anna
14
2009
Improved approximability and non-approximability results for graph diameter decreasing problems. Zbl 1234.68127
Bilò, Davide; Gualà, Luciano; Proietti, Guido
12
2012
Reoptimization of the shortest common superstring problem. Zbl 1238.68189
Bilò, Davide; Böckenhauer, Hans-Joachim; Komm, Dennis; Královič, Richard; Mömke, Tobias; Seibert, Sebastian; Zych, Anna
8
2011
Improved purely additive fault-tolerant spanners. Zbl 1465.68205
Bilò, Davide; Grandoni, Fabrizio; Gualà, Luciano; Leucci, Stefano; Proietti, Guido
8
2015
Finding best swap edges minimizing the routing cost of a spanning tree. Zbl 1317.68063
Bilò, Davide; Gualà, Luciano; Proietti, Guido
7
2014
On the complexity of minimizing interference in ad-hoc and sensor networks. Zbl 1156.68303
Bilò, Davide; Proietti, Guido
6
2008
New reoptimization techniques applied to Steiner tree problem. Zbl 1268.90073
Zych, Anna; Bilò, Davide
6
2011
New advances in reoptimizing the minimum Steiner tree problem. Zbl 1365.68466
Bilò, Davide; Zych, Anna
5
2012
Reoptimization of the shortest common superstring problem. (Extended abstract). Zbl 1247.68334
Bilò, Davide; Böckenhauer, Hans-Joachim; Komm, Dennis; Královič, Richard; Mömke, Tobias; Seibert, Sebastian; Zych, Anna
5
2009
Fault-tolerant approximate shortest-path trees. Zbl 1422.68181
Bilò, Davide; Gualà, Luciano; Leucci, Stefano; Proietti, Guido
5
2014
Reconstructing visibility graphs with simple robots. Zbl 1274.68618
Bilò, Davide; Disser, Yann; Mihalák, Matúš; Suri, Subhash; Vicari, Elias; Widmayer, Peter
4
2010
A faster computation of all the best swap edges of a shortest paths tree. Zbl 1325.68167
Bilò, Davide; Gualà, Luciano; Proietti, Guido
4
2015
Multiple-edge-fault-tolerant approximate shortest-path trees. Zbl 1388.68211
Bilò, Davide; Gualà, Luciano; Leucci, Stefano; Proietti, Guido
3
2016
A faster computation of all the best swap edges of a tree spanner. Zbl 06527693
Bilò, Davide; Colella, Feliciano; Gualà, Luciano; Leucci, Stefano; Proietti, Guido
3
2015
The max-distance network creation game on general host graphs. Zbl 1318.68125
Bilò, Davide; Gualà, Luciano; Leucci, Stefano; Proietti, Guido
3
2015
Network creation games with traceroute-based strategies. Zbl 1318.68124
Bilò, Davide; Gualà, Luciano; Leucci, Stefano; Proietti, Guido
3
2014
Network verification via routing table queries. Zbl 1401.90052
Bampas, Evangelos; Bilò, Davide; Drovandi, Guido; Gualà, Luciano; Klasing, Ralf; Proietti, Guido
3
2015
Reconstructing visibility graphs with simple robots. Zbl 1243.68286
Bilò, D.; Disser, Y.; Mihalák, M.; Suri, S.; Vicari, E.; Widmayer, P.
2
2012
On the existence of truthful mechanisms for the minimum-cost approximate shortest-paths tree problem. Zbl 1222.90008
Bilò, Davide; Gualà, Luciano; Proietti, Guido
2
2006
Compact and fast sensitivity oracles for single-source distances. Zbl 1397.68135
Bilò, Davide; Gualà, Luciano; Leucci, Stefano; Proietti, Guido
2
2016
Effective edge-fault-tolerant single-source spanners via best (or good) swap edges. Zbl 1390.68494
Bilò, Davide; Colella, Feliciano; Gualà, Luciano; Leucci, Stefano; Proietti, Guido
2
2017
Specializations and generalizations of the Stackelberg minimum spanning tree game. Zbl 1303.68090
Bilò, Davide; Gualà, Luciano; Leucci, Stefano; Proietti, Guido
2
2015
Locating facilities on a network to minimize their average service radius. Zbl 1193.90142
Bilò, Davide; Derungs, Jörg; Gualà, Luciano; Proietti, Guido; Widmayer, Peter
1
2007
Discovery of network properties with all-shortest-paths queries. Zbl 1143.68319
Bilò, Davide; Erlebach, Thomas; Mihalák, Matúš; Widmayer, Peter
1
2008
Approximating the metric TSP in linear time. Zbl 1202.90259
Bilò, Davide; Forlizzi, Luca; Proietti, Guido
1
2008
The max-distance network creation game on general host graphs. Zbl 1318.68123
Bilò, Davide; Gualà, Luciano; Leucci, Stefano; Proietti, Guido
1
2012
Stability of networks in stretchable graphs. Zbl 1274.68006
Bilò, Davide; Gatto, Michael; Gualà, Luciano; Proietti, Guido; Widmayer, Peter
1
2010
Discovery of network properties with all-shortest-paths queries. Zbl 1191.68028
Bilò, Davide; Erlebach, Thomas; Mihalák, Matúš; Widmayer, Peter
1
2010
An algorithm composition scheme preserving monotonicity. Zbl 1283.68268
Bilò, Davide; Forlizzi, Luca; Gualà, Luciano; Proietti, Guido
1
2007
A faster computation of all the best swap edges of a shortest paths tree. Zbl 1395.68205
Bilò, Davide; Gualà, Luciano; Proietti, Guido
1
2013
Polygon-constrained motion planning problems. Zbl 1397.68196
Bilò, Davide; Disser, Yann; Gualà, Luciano; Mihal’ák, Matúš; Proietti, Guido; Widmayer, Peter
1
2014
Tracking routes in communication networks. Zbl 07176650
Bilò, Davide; Gualà, Luciano; Leucci, Stefano; Proietti, Guido
1
2019
On the tree conjecture for the network creation game. Zbl 1443.91071
Bilò, Davide; Lenzner, Pascal
1
2020
On the complexity of two dots for narrow boards and few colors. Zbl 07229751
Bilò, Davide; Gualà, Luciano; Leucci, Stefano; Misra, Neeldhara
1
2018
On the PSPACE-completeness of Peg Duotaire and other peg-jumping games. Zbl 07229752
Bilò, Davide; Gualà, Luciano; Leucci, Stefano; Proietti, Guido; Rossi, Mirko
1
2018
On the tree conjecture for the network creation game. Zbl 1443.91071
Bilò, Davide; Lenzner, Pascal
1
2020
Tracking routes in communication networks. Zbl 07176650
Bilò, Davide; Gualà, Luciano; Leucci, Stefano; Proietti, Guido
1
2019
On the complexity of two dots for narrow boards and few colors. Zbl 07229751
Bilò, Davide; Gualà, Luciano; Leucci, Stefano; Misra, Neeldhara
1
2018
On the PSPACE-completeness of Peg Duotaire and other peg-jumping games. Zbl 07229752
Bilò, Davide; Gualà, Luciano; Leucci, Stefano; Proietti, Guido; Rossi, Mirko
1
2018
Effective edge-fault-tolerant single-source spanners via best (or good) swap edges. Zbl 1390.68494
Bilò, Davide; Colella, Feliciano; Gualà, Luciano; Leucci, Stefano; Proietti, Guido
2
2017
Multiple-edge-fault-tolerant approximate shortest-path trees. Zbl 1388.68211
Bilò, Davide; Gualà, Luciano; Leucci, Stefano; Proietti, Guido
3
2016
Compact and fast sensitivity oracles for single-source distances. Zbl 1397.68135
Bilò, Davide; Gualà, Luciano; Leucci, Stefano; Proietti, Guido
2
2016
Improved purely additive fault-tolerant spanners. Zbl 1465.68205
Bilò, Davide; Grandoni, Fabrizio; Gualà, Luciano; Leucci, Stefano; Proietti, Guido
8
2015
A faster computation of all the best swap edges of a shortest paths tree. Zbl 1325.68167
Bilò, Davide; Gualà, Luciano; Proietti, Guido
4
2015
A faster computation of all the best swap edges of a tree spanner. Zbl 06527693
Bilò, Davide; Colella, Feliciano; Gualà, Luciano; Leucci, Stefano; Proietti, Guido
3
2015
The max-distance network creation game on general host graphs. Zbl 1318.68125
Bilò, Davide; Gualà, Luciano; Leucci, Stefano; Proietti, Guido
3
2015
Network verification via routing table queries. Zbl 1401.90052
Bampas, Evangelos; Bilò, Davide; Drovandi, Guido; Gualà, Luciano; Klasing, Ralf; Proietti, Guido
3
2015
Specializations and generalizations of the Stackelberg minimum spanning tree game. Zbl 1303.68090
Bilò, Davide; Gualà, Luciano; Leucci, Stefano; Proietti, Guido
2
2015
Finding best swap edges minimizing the routing cost of a spanning tree. Zbl 1317.68063
Bilò, Davide; Gualà, Luciano; Proietti, Guido
7
2014
Fault-tolerant approximate shortest-path trees. Zbl 1422.68181
Bilò, Davide; Gualà, Luciano; Leucci, Stefano; Proietti, Guido
5
2014
Network creation games with traceroute-based strategies. Zbl 1318.68124
Bilò, Davide; Gualà, Luciano; Leucci, Stefano; Proietti, Guido
3
2014
Polygon-constrained motion planning problems. Zbl 1397.68196
Bilò, Davide; Disser, Yann; Gualà, Luciano; Mihal’ák, Matúš; Proietti, Guido; Widmayer, Peter
1
2014
A faster computation of all the best swap edges of a shortest paths tree. Zbl 1395.68205
Bilò, Davide; Gualà, Luciano; Proietti, Guido
1
2013
Improved approximability and non-approximability results for graph diameter decreasing problems. Zbl 1234.68127
Bilò, Davide; Gualà, Luciano; Proietti, Guido
12
2012
New advances in reoptimizing the minimum Steiner tree problem. Zbl 1365.68466
Bilò, Davide; Zych, Anna
5
2012
Reconstructing visibility graphs with simple robots. Zbl 1243.68286
Bilò, D.; Disser, Y.; Mihalák, M.; Suri, S.; Vicari, E.; Widmayer, P.
2
2012
The max-distance network creation game on general host graphs. Zbl 1318.68123
Bilò, Davide; Gualà, Luciano; Leucci, Stefano; Proietti, Guido
1
2012
Reoptimization of the shortest common superstring problem. Zbl 1238.68189
Bilò, Davide; Böckenhauer, Hans-Joachim; Komm, Dennis; Královič, Richard; Mömke, Tobias; Seibert, Sebastian; Zych, Anna
8
2011
New reoptimization techniques applied to Steiner tree problem. Zbl 1268.90073
Zych, Anna; Bilò, Davide
6
2011
Reconstructing visibility graphs with simple robots. Zbl 1274.68618
Bilò, Davide; Disser, Yann; Mihalák, Matúš; Suri, Subhash; Vicari, Elias; Widmayer, Peter
4
2010
Stability of networks in stretchable graphs. Zbl 1274.68006
Bilò, Davide; Gatto, Michael; Gualà, Luciano; Proietti, Guido; Widmayer, Peter
1
2010
Discovery of network properties with all-shortest-paths queries. Zbl 1191.68028
Bilò, Davide; Erlebach, Thomas; Mihalák, Matúš; Widmayer, Peter
1
2010
Reoptimization of weighted graph and covering problems. Zbl 1209.68632
Bilò, Davide; Widmayer, Peter; Zych, Anna
14
2009
Reoptimization of the shortest common superstring problem. (Extended abstract). Zbl 1247.68334
Bilò, Davide; Böckenhauer, Hans-Joachim; Komm, Dennis; Královič, Richard; Mömke, Tobias; Seibert, Sebastian; Zych, Anna
5
2009
Reoptimization of Steiner trees. Zbl 1155.68574
Bilò, Davide; Böckenhauer, Hans-Joachim; Hromkovič, Juraj; Královič, Richard; Mömke, Tobias; Widmayer, Peter; Zych, Anna
15
2008
On the complexity of minimizing interference in ad-hoc and sensor networks. Zbl 1156.68303
Bilò, Davide; Proietti, Guido
6
2008
Discovery of network properties with all-shortest-paths queries. Zbl 1143.68319
Bilò, Davide; Erlebach, Thomas; Mihalák, Matúš; Widmayer, Peter
1
2008
Approximating the metric TSP in linear time. Zbl 1202.90259
Bilò, Davide; Forlizzi, Luca; Proietti, Guido
1
2008
Locating facilities on a network to minimize their average service radius. Zbl 1193.90142
Bilò, Davide; Derungs, Jörg; Gualà, Luciano; Proietti, Guido; Widmayer, Peter
1
2007
An algorithm composition scheme preserving monotonicity. Zbl 1283.68268
Bilò, Davide; Forlizzi, Luca; Gualà, Luciano; Proietti, Guido
1
2007
On the existence of truthful mechanisms for the minimum-cost approximate shortest-paths tree problem. Zbl 1222.90008
Bilò, Davide; Gualà, Luciano; Proietti, Guido
2
2006
all top 5

Cited by 169 Authors

14 Bilò, Davide
11 Proietti, Guido
10 Gualà, Luciano
9 Leucci, Stefano
7 Mihalák, Matúš
6 Widmayer, Peter
5 Böckenhauer, Hans-Joachim
5 Boria, Nicolas
5 Disser, Yann
5 Gudmundsson, Joachim
5 Paschos, Vangelis Th.
4 Mömke, Tobias
4 Monnot, Jérôme
4 Zych, Anna
3 Chalopin, Jérémie
3 Colella, Feliciano
3 Das, Shantanu
3 Komm, Dennis
3 Messegué, Arnau
3 Pushparaj Shetty, D.
2 Àlvarez, Carme
2 Bae, Sang Won
2 Barbero, Florian
2 Baswana, Surender
2 Cheong, Otfried
2 Choudhary, Keerti
2 de Berg, Mark Theodoor
2 D’Emidio, Mattia
2 Frigioni, Daniele
2 Große, Ulrike
2 Hromkovič, Juraj
2 Isenmann, Lucas
2 Knauer, Christian
2 Královič, Richard
2 Levcopoulos, Christos
2 Panda, Bhawani Sankar
2 Parter, Merav
2 Roditty, Liam
2 Seibert, Sebastian
2 Smid, Michiel H. M.
2 Sprock, Andreas
2 Stehn, Fabian
2 Thiebaut, Jocelyn
2 Wang, Haitao
2 Weimann, Oren
1 Abam, Mohammad Ali
1 Abu-Khzam, Faisal N.
1 Ahmed, Reyan
1 Almanza, Matteo
1 Ausiello, Giorgio
1 Bampas, Evangelos
1 Banik, Aritra
1 Bärtschi, Andreas
1 Bazgan, Cristina
1 Bichler, Martin
1 Blesa, Maria J.
1 Bodwin, Greg
1 Böhnlein, Toni
1 Buhmann, Joachim M.
1 Cardinal, Jean
1 Chao, Kunmao
1 Chen, Danny Ziyi
1 Choudhary, Pratibha
1 Cohen, Nathann
1 Czyzowicz, Jurek
1 Dai, Wenkai
1 Damaschke, Peter
1 D’Andrea, Annalisa
1 Datta, Ajoy Kumar
1 Deĭneko, Vladimir G.
1 Della Croce, Federico
1 Demaine, Erik D.
1 Di Ianni, Miriam
1 Drovandi, Guido
1 Duan, Ran
1 Duch, Amalia
1 Escoffier, Bruno
1 Fernau, Henning
1 Ferragina, Paolo
1 Ferreira, Carlos Eduardo
1 Fiorini, Samuel
1 Forlizzi, Luca
1 Frati, Fabrizio
1 Freiermuth, Karin
1 Garnero, Valentin
1 Gaspers, Serge
1 Geissmann, Barbara
1 Ghosh, Subir Kumar
1 Gonçalves, Daniel
1 Goyal, Keshav
1 Graf, Daniel
1 Grandoni, Fabrizio
1 Gronskiy, A. Y.
1 Hamm, Keaton
1 Hao, Zhen
1 Huynh, Dung T.
1 Ishii, Toshimasa
1 Jebelli, Mohammad Javad Latifi
1 Joret, Gwenaël
1 Junosza-Szaniawski, Konstanty
...and 69 more Authors

Citations by Year