Author of the publication

Online Semidefinite Programming.

, , and . ICALP, volume 55 of LIPIcs, page 40:1-40:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)

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

Non-preemptive buffer management for latency sensitive packets., and . J. Sched., 20 (4): 337-353 (2017)Tight Bounds for Online Weighted Tree Augmentation., , and . Algorithmica, 84 (2): 304-324 (2022)Structured Robust Submodular Maximization: Offline and Online Algorithms., , , , , and . INFORMS J. Comput., 33 (4): 1590-1607 (2021)Offline and Online Algorithms for SSD Management., , and . SIGMETRICS (Abstracts), page 89-90. ACM, (2022)A (1-e-1-ε)-Approximation for the Monotone Submodular Multiple Knapsack Problem., , , , and . ESA, volume 173 of LIPIcs, page 44:1-44:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)General Knapsack Problems in a Dynamic Setting., , , and . APPROX-RANDOM, volume 207 of LIPIcs, page 15:1-15:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)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)Online k-Taxi via Double Coverage and Time-Reverse Primal-Dual., , and . IPCO, volume 12707 of Lecture Notes in Computer Science, page 15-29. Springer, (2021)Lossless Online Rounding for Online Bipartite Matching (Despite its Impossibility)., , and . SODA, page 2030-2068. SIAM, (2023)O(depth)-Competitive Algorithm for Online Multi-level Aggregation., , , and . SODA, page 1235-1244. SIAM, (2017)