Author of the publication

Tight Bounds for Online Weighted Tree Augmentation.

, , and . ICALP, volume 132 of LIPIcs, page 88:1-88:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)

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.

 

Other publications of authors with the same name

The Online Broadcast Range-Assignment Problem., , and . ISAAC, volume 181 of LIPIcs, page 60:1-60:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)LAST but not Least: Online Spanners for Buy-at-Bulk., , , and . SODA, page 589-599. SIAM, (2017)Online Constrained Forest and Prize-Collecting Network Design., , and . Algorithmica, 80 (11): 3335-3364 (2018)LP-Based Robust Algorithms for Noisy Minor-Free and Bounded Treewidth Graphs., , and . SODA, page 1964-1979. SIAM, (2017)Tight Bounds for Online Weighted Tree Augmentation., , and . ICALP, volume 132 of LIPIcs, page 88:1-88:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Timing Matters: Online Dynamics in Broadcast Games., , , , and . WINE, volume 11316 of Lecture Notes in Computer Science, page 80-95. Springer, (2018)Bounded-degree light approximate shortest-path trees in doubling metrics., , and . Discret. Appl. Math., (2021)Online Weighted Cardinality Joint Replenishment Problem with Delay., , and . ICALP, volume 229 of LIPIcs, page 40:1-40:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Nested Active-Time Scheduling., , , , , and . ISAAC, volume 248 of LIPIcs, page 36:1-36:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Online Matching with Set and Concave Delays., and . APPROX/RANDOM, volume 275 of LIPIcs, page 17:1-17:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)