Clik here to view.
Generating Functionally Equivalent Programs Having Non-Isomorphic...
Rémi Géraud, Mirko Koscina, Paul Lenczner, David Naccache, David Saulpic: Generating Functionally Equivalent Programs Having Non-Isomorphic Control-Flow Graphs. CoRR abs/1709.08357 (2017)
View ArticleClik here to view.
Polynomial-Time Approximation Schemes for k-Center and Bounded-Capacity...
Amariah Becker, Philip N. Klein, David Saulpic: Polynomial-Time Approximation Schemes for k-Center and Bounded-Capacity Vehicle Routing in Metrics with Bounded Highway Dimension. CoRR abs/1707.08270...
View ArticleClik here to view.
Generating Functionally Equivalent Programs Having Non-isomorphic...
Rémi Géraud, Mirko Koscina, Paul Lenczner, David Naccache, David Saulpic: Generating Functionally Equivalent Programs Having Non-isomorphic Control-Flow Graphs. NordSec 2017: 265-279
View ArticleClik here to view.
A Quasi-Polynomial-Time Approximation Scheme for Vehicle Routing on Planar...
Amariah Becker, Philip N. Klein, David Saulpic: A Quasi-Polynomial-Time Approximation Scheme for Vehicle Routing on Planar and Bounded-Genus Graphs. ESA 2017: 12:1-12:15
View ArticleClik here to view.
Near-Linear Time Approximation Schemes for Clustering in Doubling Metrics.
Vincent Cohen-Addad, Andreas Emil Feldmann, David Saulpic: Near-Linear Time Approximation Schemes for Clustering in Doubling Metrics. CoRR abs/1812.08664 (2018)
View ArticleClik here to view.
Polynomial-Time Approximation Schemes for k-center, k-median, and Capacitated...
Amariah Becker, Philip N. Klein, David Saulpic: Polynomial-Time Approximation Schemes for k-center, k-median, and Capacitated Vehicle Routing in Bounded Highway Dimension. ESA 2018: 8:1-8:15
View ArticleClik here to view.
Dominating Sets and Connected Dominating Sets in Dynamic Graphs.
Niklas Hjuler, Giuseppe F. Italiano, Nikos Parotsidis, David Saulpic: Dominating Sets and Connected Dominating Sets in Dynamic Graphs. CoRR abs/1901.09877 (2019)
View ArticleClik here to view.
Dominating Sets and Connected Dominating Sets in Dynamic Graphs.
Niklas Hjuler, Giuseppe F. Italiano, Nikos Parotsidis, David Saulpic: Dominating Sets and Connected Dominating Sets in Dynamic Graphs. STACS 2019: 35:1-35:17
View ArticleClik here to view.
Fully Dynamic Consistent Facility Location.
Vincent Cohen-Addad, Niklas Hjuler, Nikos Parotsidis, David Saulpic, Chris Schwiegelshohn: Fully Dynamic Consistent Facility Location. NeurIPS 2019: 3250-3260
View ArticleClik here to view.
Near-Linear Time Approximations Schemes for Clustering in Doubling Metrics.
David Saulpic, Vincent Cohen-Addad, Andreas Emil Feldmann: Near-Linear Time Approximations Schemes for Clustering in Doubling Metrics. FOCS 2019: 540-559
View ArticleClik here to view.
Polynomial Time Approximation Schemes for Clustering in Low Highway Dimension...
Andreas Emil Feldmann, David Saulpic: Polynomial Time Approximation Schemes for Clustering in Low Highway Dimension Graphs. CoRR abs/2006.12897 (2020)
View ArticleClik here to view.
On the Power of Louvain in the Stochastic Block Model.
Vincent Cohen-Addad, Adrian Kosowski, Frederik Mallmann-Trenn, David Saulpic: On the Power of Louvain in the Stochastic Block Model. NeurIPS 2020
View ArticleClik here to view.
Polynomial Time Approximation Schemes for Clustering in Low Highway Dimension...
Andreas Emil Feldmann, David Saulpic: Polynomial Time Approximation Schemes for Clustering in Low Highway Dimension Graphs. ESA 2020: 46:1-46:22
View ArticleClik here to view.
An Improved Local Search Algorithm for k-Median.
Vincent Cohen-Addad, Anupam Gupta, Lunjia Hu, Hoon Oh, David Saulpic: An Improved Local Search Algorithm for k-Median. CoRR abs/2111.04589 (2021)
View ArticleClik here to view.
A New Coreset Framework for Clustering.
Vincent Cohen-Addad, David Saulpic, Chris Schwiegelshohn: A New Coreset Framework for Clustering. CoRR abs/2104.06133 (2021)
View ArticleClik here to view.
A new coreset framework for clustering.
Vincent Cohen-Addad, David Saulpic, Chris Schwiegelshohn: A new coreset framework for clustering. STOC 2021: 169-182
View ArticleClik here to view.
Improved Coresets and Sublinear Algorithms for Power Means in Euclidean Spaces.
Vincent Cohen-Addad, David Saulpic, Chris Schwiegelshohn: Improved Coresets and Sublinear Algorithms for Power Means in Euclidean Spaces. NeurIPS 2021: 21085-21098
View ArticleClik here to view.
Polynomial time approximation schemes for clustering in low highway dimension...
Andreas Emil Feldmann, David Saulpic: Polynomial time approximation schemes for clustering in low highway dimension graphs. J. Comput. Syst. Sci. 122: 72-93 (2021)
View ArticleClik here to view.
Near-linear Time Approximation Schemes for Clustering in Doubling Metrics.
Vincent Cohen-Addad, Andreas Emil Feldmann, David Saulpic: Near-linear Time Approximation Schemes for Clustering in Doubling Metrics. J. ACM 68(6): 44:1-44:34 (2021)
View ArticleClik here to view.
Improved Coresets for Euclidean k-Means.
Vincent Cohen-Addad, Kasper Green Larsen, David Saulpic, Chris Schwiegelshohn, Omar Ali Sheikh-Omar: Improved Coresets for Euclidean k-Means. CoRR abs/2211.08184 (2022)
View Article
