Author of the publication

Tight approximation bounds for dominating set on graphs of bounded arboricity.

, and . Inf. Process. Lett., (2017)

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

Tight Bounds for Online Weighted Tree Augmentation., , and . Algorithmica, 84 (2): 304-324 (2022)The Online Broadcast Range-Assignment Problem., , and . Algorithmica, 85 (12): 3928-3956 (December 2023)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)Tight approximation bounds for dominating set on graphs of bounded arboricity., and . Inf. Process. Lett., (2017)On the Extended TSP Problem., , and . ISAAC, volume 212 of LIPIcs, page 42:1-42:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)The Power of Clairvoyance for Multi-Level Aggregation and Set Cover with Delay., , and . SODA, page 1594-1610. SIAM, (2023)Online Probabilistic Metric Embedding: A General Framework for Bypassing Inherent Bounds., , and . SODA, page 1538-1557. SIAM, (2020)Brief Announcement: Nested Active-Time Scheduling., , , , , and . SPAA, page 381-383. ACM, (2022)Nested Convex Bodies are Chaseable., , , , and . Algorithmica, 82 (6): 1640-1653 (2020)