Bilò, Davide; Friedrich, Tobias; Lenzner, Pascal; Melnichenko, Anna Geometric network creation games. (English) Zbl 07793140 SIAM J. Discrete Math. 38, No. 1, 277-315 (2024). MSC: 91A43 91A68 91A11 68Q17 PDFBibTeX XMLCite \textit{D. Bilò} et al., SIAM J. Discrete Math. 38, No. 1, 277--315 (2024; Zbl 07793140) Full Text: DOI arXiv
Bilò, Davide; D’Angelo, Gianlorenzo; Gualà, Luciano; Leucci, Stefano; Rossi, Mirko Blackout-tolerant temporal spanners. (English) Zbl 07792500 J. Comput. Syst. Sci. 141, Article ID 103495, 14 p. (2024). MSC: 68-XX PDFBibTeX XMLCite \textit{D. Bilò} et al., J. Comput. Syst. Sci. 141, Article ID 103495, 14 p. (2024; Zbl 07792500) Full Text: DOI
Bilò, Davide; Choudhary, Keerti; Cohen, Sarel; Friedrich, Tobias; Krogmann, Simon; Schirneck, Martin Compact distance oracles with large sensitivity and low stretch. (English) Zbl 07789702 Morin, Pat (ed.) et al., Algorithms and data structures. 18th international symposium, WADS 2023, Montreal, QC, Canada, July 31 – August 2, 2023. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 14079, 149-163 (2023). MSC: 68P05 68Wxx PDFBibTeX XMLCite \textit{D. Bilò} et al., Lect. Notes Comput. Sci. 14079, 149--163 (2023; Zbl 07789702) Full Text: DOI arXiv
Bilò, Davide; Gualà, Luciano; Leucci, Stefano; Proietti, Guido; Rossi, Mirko New approximation algorithms for the heterogeneous weighted delivery problem. (English) Zbl 07585798 Theor. Comput. Sci. 932, 102-115 (2022). MSC: 68Qxx PDFBibTeX XMLCite \textit{D. Bilò} et al., Theor. Comput. Sci. 932, 102--115 (2022; Zbl 07585798) Full Text: DOI
Bilò, Davide; Gualà, Luciano; Leucci, Stefano; Proietti, Guido Multiple-edge-fault-tolerant approximate shortest-path trees. (English) Zbl 1518.68248 Algorithmica 84, No. 1, 37-59 (2022). MSC: 68R10 05C85 68M15 68P05 68W40 PDFBibTeX XMLCite \textit{D. Bilò} et al., Algorithmica 84, No. 1, 37--59 (2022; Zbl 1518.68248) Full Text: DOI Link
Bilò, Davide; Gualà, Luciano; Leucci, Stefano; Proietti, Guido; Rossi, Mirko New approximation algorithms for the heterogeneous weighted delivery problem. (English) Zbl 07495139 Jurdziński, Tomasz (ed.) et al., Structural information and communication complexity. 28th international colloquium, SIROCCO 2021, Wrocław, Poland, June 28 – July 1, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12810, 167-184 (2021). MSC: 68Mxx 68Q11 68R10 PDFBibTeX XMLCite \textit{D. Bilò} et al., Lect. Notes Comput. Sci. 12810, 167--184 (2021; Zbl 07495139) Full Text: DOI
Bilò, Davide; Lenzner, Pascal On the tree conjecture for the network creation game. (English) Zbl 1443.91071 Theory Comput. Syst. 64, No. 3, 422-443 (2020). Reviewer: Vladimír Lacko (Košice) MSC: 91A43 91A68 05C90 PDFBibTeX XMLCite \textit{D. Bilò} and \textit{P. Lenzner}, Theory Comput. Syst. 64, No. 3, 422--443 (2020; Zbl 1443.91071) Full Text: DOI Link
Bilò, Davide; Colella, Feliciano; Gualà, Luciano; Leucci, Stefano; Proietti, Guido An improved algorithm for computing all the best swap edges of a tree spanner. (English) Zbl 1433.68281 Algorithmica 82, No. 2, 279-299 (2020). MSC: 68R10 68W40 PDFBibTeX XMLCite \textit{D. Bilò} et al., Algorithmica 82, No. 2, 279--299 (2020; Zbl 1433.68281) Full Text: DOI Link
Bilò, Davide; Lenzner, Pascal On the tree conjecture for the network creation game. (English) Zbl 1487.91017 Niedermeier, Rolf (ed.) et al., 35th symposium on theoretical aspects of computer science, STACS 2018, Caen, France, February 28 – March 3, 2018. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 96, Article 14, 15 p. (2018). MSC: 91A43 91A68 05C90 PDFBibTeX XMLCite \textit{D. Bilò} and \textit{P. Lenzner}, LIPIcs -- Leibniz Int. Proc. Inform. 96, Article 14, 15 p. (2018; Zbl 1487.91017) Full Text: DOI arXiv
Bilò, Davide; Choudhary, Keerti; Gualà, Luciano; Leucci, Stefano; Parter, Merav; Proietti, Guido Efficient oracles and routing schemes for replacement paths. (English) Zbl 1487.68051 Niedermeier, Rolf (ed.) et al., 35th symposium on theoretical aspects of computer science, STACS 2018, Caen, France, February 28 – March 3, 2018. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 96, Article 13, 15 p. (2018). MSC: 68M15 68M10 68P05 68Q25 68R10 PDFBibTeX XMLCite \textit{D. Bilò} et al., LIPIcs -- Leibniz Int. Proc. Inform. 96, Article 13, 15 p. (2018; Zbl 1487.68051) Full Text: DOI
Bilò, Davide; Gualà, Luciano; Leucci, Stefano; Proietti, Guido Fault-tolerant approximate shortest-path trees. (English) Zbl 1397.05045 Algorithmica 80, No. 12, 3437-3460 (2018). MSC: 05C12 05C05 05C38 68M15 68P05 68R10 PDFBibTeX XMLCite \textit{D. Bilò} et al., Algorithmica 80, No. 12, 3437--3460 (2018; Zbl 1397.05045) Full Text: DOI arXiv
Bilò, Davide; Colella, Feliciano; Gualà, Luciano; Leucci, Stefano; Proietti, Guido An improved algorithm for computing all the best swap edges of a tree spanner. (English) Zbl 1457.68205 Okamoto, Yoshio (ed.) et al., 28th international symposium on algorithms and computation, ISAAC 2017, December 9–12, 2017, Phuket, Thailand. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 92, Article 14, 13 p. (2017). MSC: 68R10 68W40 PDFBibTeX XMLCite \textit{D. Bilò} et al., LIPIcs -- Leibniz Int. Proc. Inform. 92, Article 14, 13 p. (2017; Zbl 1457.68205) Full Text: DOI arXiv
Bilò, Davide; Gualà, Luciano; Leucci, Stefano; Proietti, Guido Exact and approximate algorithms for movement problems on (special classes of) graphs. (English) Zbl 1353.68255 Theor. Comput. Sci. 652, 86-101 (2016). MSC: 68T20 05C85 68W05 68W25 90C35 PDFBibTeX XMLCite \textit{D. Bilò} et al., Theor. Comput. Sci. 652, 86--101 (2016; Zbl 1353.68255) Full Text: DOI
Bilò, Davide; Colella, Feliciano; Gualà, Luciano; Leucci, Stefano; Proietti, Guido A faster computation of all the best swap edges of a tree spanner. (English) Zbl 1471.68186 Scheideler, Christian (ed.), Structural information and communication complexity. 22nd international colloquium, SIROCCO 2015, Montserrat, Spain, July 14–16, 2015. Post-proceedings. Cham: Springer. Lect. Notes Comput. Sci. 9439, 239-253 (2015). MSC: 68R10 68M15 68Q25 PDFBibTeX XMLCite \textit{D. Bilò} et al., Lect. Notes Comput. Sci. 9439, 239--253 (2015; Zbl 1471.68186) Full Text: DOI
Bilò, Davide; Grandoni, Fabrizio; Gualà, Luciano; Leucci, Stefano; Proietti, Guido Improved purely additive fault-tolerant spanners. (English) Zbl 1465.68205 Bansal, Nikhil (ed.) et al., Algorithms – ESA 2015. 23rd annual European symposium, Patras, Greece, September 14–16, 2015. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 9294, 167-178 (2015). MSC: 68R10 05C12 68M15 PDFBibTeX XMLCite \textit{D. Bilò} et al., Lect. Notes Comput. Sci. 9294, 167--178 (2015; Zbl 1465.68205) Full Text: DOI arXiv
Bilò, Davide; Gualà, Luciano; Leucci, Stefano; Proietti, Guido The max-distance network creation game on general host graphs. (English) Zbl 1318.68125 Theor. Comput. Sci. 573, 43-53 (2015). MSC: 68R10 91A10 91A43 PDFBibTeX XMLCite \textit{D. Bilò} et al., Theor. Comput. Sci. 573, 43--53 (2015; Zbl 1318.68125) Full Text: DOI
Bilò, Davide; Gualà, Luciano; Leucci, Stefano; Proietti, Guido Exact and approximate algorithms for movement problems on (special classes of) graphs. (English) Zbl 1353.68254 Moscibroda, Thomas (ed.) et al., Structural information and communication complexity. 20th international colloquium, SIROCCO 2013, Ischia, Italy, July 1–3, 2013. Revised selected papers. Berlin: Springer (ISBN 978-3-319-03577-2/pbk). Lecture Notes in Computer Science 8179, 322-333 (2013). MSC: 68T20 05C85 68W05 68W25 90C35 PDFBibTeX XMLCite \textit{D. Bilò} et al., Lect. Notes Comput. Sci. 8179, 322--333 (2013; Zbl 1353.68254) Full Text: DOI arXiv
Bilò, Davide; Forlizzi, Luca; Proietti, Guido Approximating the metric TSP in linear time. (English) Zbl 1227.68029 Theory Comput. Syst. 49, No. 3, 615-631 (2011). MSC: 68Q17 68R10 68W25 PDFBibTeX XMLCite \textit{D. Bilò} et al., Theory Comput. Syst. 49, No. 3, 615--631 (2011; Zbl 1227.68029) Full Text: DOI
Bilò, Davide; Gualà, Luciano; Proietti, Guido Dynamic mechanism design. (English) Zbl 1159.90025 Theor. Comput. Sci. 410, No. 17, 1564-1572 (2009). MSC: 90C35 05C85 91A43 PDFBibTeX XMLCite \textit{D. Bilò} et al., Theor. Comput. Sci. 410, No. 17, 1564--1572 (2009; Zbl 1159.90025) Full Text: DOI
Bilò, Davide; Forlizzi, Luca; Proietti, Guido Approximating the metric TSP in linear time. (English) Zbl 1202.90259 Broersma, Hajo (ed.) et al., Graph-theoretic concepts in computer science. 34th international workshop, WG 2008, Durham, UK, June 30–July 2, 2008. Revised papers. Berlin: Springer (ISBN 978-3-540-92247-6/pbk). Lecture Notes in Computer Science 5344, 43-54 (2008). MSC: 90C35 05C12 68Q17 68Q25 68W25 90C27 90C59 PDFBibTeX XMLCite \textit{D. Bilò} et al., Lect. Notes Comput. Sci. 5344, 43--54 (2008; Zbl 1202.90259) Full Text: DOI