Author of the publication

Dominating Sets and Connected Dominating Sets in Dynamic Graphs.

, , , and . STACS, volume 126 of LIPIcs, page 35:1-35:17. 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

2-Edge Connectivity in Directed Graphs., , , and . CoRR, (2014)Incremental 2-Edge-Connectivity in Directed Graphs., , and . ICALP, volume 55 of LIPIcs, page 49:1-49:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)Decremental Data Structures for Connectivity and Dominators in Directed Graphs., , , , and . ICALP, volume 80 of LIPIcs, page 42:1-42:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)Optimal Decremental Connectivity in Non-Sparse Graphs., , , , , and . CoRR, (2021)Fully Dynamic k-Clustering in Õ(k) Update Time., , , and . CoRR, (2023)Strong Connectivity in Directed Graphs under Failures, with Applications., , and . SIAM J. Comput., 49 (5): 865-926 (2020)Fully Dynamic Consistent Facility Location., , , , and . NeurIPS, page 3250-3260. (2019)A New Framework for Strong Connectivity and 2-Connectivity in Directed Graphs., , and . CoRR, (2015)Dynamic Algorithms for the Massively Parallel Computation Model., , , and . SPAA, page 49-58. ACM, (2019)2-Connectivity in Directed Graphs., , and . ESA, volume 57 of LIPIcs, page 1:1-1:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)