Author of the publication

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

Universal Optimization for Non-Clairvoyant Subadditive Joint Replenishment., , , , and . APPROX/RANDOM, volume 317 of LIPIcs, page 12:1-12:24. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)LAST but not Least: Online Spanners for Buy-at-Bulk., , , and . SODA, page 589-599. SIAM, (2017)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)Online Computation of String Net Frequency., , , and . CoRR, (2024)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)Maximum Unique Coverage on Streams: Improved FPT Approximation Scheme and Tighter Space Lower Bound., , , and . APPROX/RANDOM, volume 317 of LIPIcs, page 25:1-25:23. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)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)