( en | de | ru )

 

Disambiguation of "Saulpic, David"

Author of the publication

copydeleteadd this publication to your clipboard
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.

Bodo David

Erich David

Ernst David

Baruch Davidoff

Frida David

 

Other publications of authors with the same name

Polynomial-Time Approximation Schemes for k-Center and Bounded-Capacity Vehicle Routing in Metrics with Bounded Highway Dimension., , and . CoRR, (2017)Near-Linear Time Approximation Schemes for Clustering in Doubling Metrics., , and . CoRR, (2018)Approximation Algorithms and Sketches for Clustering. (Algorithmes d'approximation et sketches pour les problèmes de clustering).. Sorbonne University, Paris, France, (2022)Polynomial Time Approximation Schemes for Clustering in Low Highway Dimension Graphs., and . ESA, volume 173 of LIPIcs, page 46:1-46:22. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)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)Community Recovery in the Degree-Heterogeneous Stochastic Block Model., , and . COLT, volume 178 of Proceedings of Machine Learning Research, page 1662-1692. PMLR, (2022)Towards optimal lower bounds for k-median and k-means coresets., , , and . STOC, page 1038-1051. ACM, (2022)A Quasi-Polynomial-Time Approximation Scheme for Vehicle Routing on Planar and Bounded-Genus Graphs., , and . ESA, volume 87 of LIPIcs, page 12:1-12:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)Near-linear Time Approximation Schemes for Clustering in Doubling Metrics., , and . J. ACM, 68 (6): 44:1-44:34 (2021)An Improved Local Search Algorithm for k-Median., , , , and . SODA, page 1556-1612. SIAM, (2022)