( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Compact Distance Oracles with Large Sensitivity and Low Stretch.

, , , , , и . WADS, том 14079 из Lecture Notes in Computer Science, стр. 149-163. Springer, (2023)

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.

Albrecht Bilow

Dietrich Bilo

Reinhard Bilo

Heinz Bilo

Michael Bilo

 

Другие публикации лиц с тем же именем

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