( en | de | ru )

 

Disambiguation of "Bilò, Davide"

Author of the publication

copydeleteadd this publication to your clipboard
Multiple-Edge-Fault-Tolerant Approximate Shortest-Path Trees.

, , , and . Algorithmica, 84 (1): 37-59 (2022)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Albrecht Bilow

Dietrich Bilo

Reinhard Bilo

Heinz Bilo

Michael Bilo

 

Other publications of authors with the same name

An algorithm composition scheme preserving monotonicity., , , and . PODC, page 360-361. ACM, (2007)A Novel Algorithm for the All-Best-Swap-Edge Problem on Tree Spanners., and . ISAAC, volume 123 of LIPIcs, page 7:1-7:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Almost optimal algorithms for diameter-optimally augmenting trees.. Theor. Comput. Sci., (2022)Effective Edge-Fault-Tolerant Single-Source Spanners via Best (or Good) Swap Edges., , , , and . SIROCCO, volume 10641 of Lecture Notes in Computer Science, page 303-317. Springer, (2017)Range Augmentation Problems in Static Ad-Hoc Wireless Networks., and . SIROCCO, volume 3499 of Lecture Notes in Computer Science, page 49-64. Springer, (2005)On the Existence of Truthful Mechanisms for the Minimum-Cost Approximate Shortest-Paths Tree Problem., , and . SIROCCO, volume 4056 of Lecture Notes in Computer Science, page 295-309. Springer, (2006)Exact and Approximate Algorithms for Movement Problems on (Special Classes of) Graphs., , , and . SIROCCO, volume 8179 of Lecture Notes in Computer Science, page 322-333. Springer, (2013)Dynamic Mechanism Design., , and . WINE, volume 4286 of Lecture Notes in Computer Science, page 3-15. Springer, (2006)Compact and Fast Sensitivity Oracles for Single-Source Distances., , , and . ESA, volume 57 of LIPIcs, page 13:1-13:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)On the Complexity of Two Dots for Narrow Boards and Few Colors., , , and . FUN, volume 100 of LIPIcs, page 7:1-7:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)