Items where authors include "Saulpic, D."

Article

Cohen-Addad, V., Feldmann, A.E. orcid.org/0000-0001-6229-5332 and Saulpic, D. orcid.org/0000-0003-4208-8541 (2021) Near-linear time approximation schemes for clustering in doubling metrics. Journal of the ACM, 68 (6). 44. ISSN 0004-5411

Feldmann, A.E. orcid.org/0000-0001-6229-5332 and Saulpic, D. orcid.org/0000-0003-4208-8541 (2021) Polynomial time approximation schemes for clustering in low highway dimension graphs. Journal of Computer and System Sciences, 122. pp. 72-93. ISSN 0022-0000

Proceedings Paper

Feldmann, A.E. orcid.org/0000-0001-6229-5332 and Saulpic, D. (2020) Polynomial time approximation schemes for clustering in low highway dimension graphs. In: Grandoni, F., Herman, G. and Sanders, P., (eds.) Leibniz International Proceedings in Informatics, LIPIcs. 28th Annual European Symposium on Algorithms (ESA 2020), 07-09 Sep 2020, Pisa, Italy. Leibniz International Proceedings in Informatics, 173 . Schloss Dagstuhl - Leibniz-Zentrum , Dagstuhl, Germany , 46:1-46:22. ISBN 978-3-95977-162-7

Cohen-Addad, V., Feldmann, A.E. orcid.org/0000-0001-6229-5332 and Saulpic, D. (2020) Near-linear time approximations schemes for clustering in doubling metrics. In: 2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS). 2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS), 09-12 Nov 2019, Baltimore, MD, USA. Institute of Electrical and Electronics Engineers (IEEE) , pp. 540-559. ISBN 9781728149530