Filtrer vos résultats
- 24
- 12
- 28
- 6
- 1
- 1
- 35
- 2
- 1
- 4
- 2
- 13
- 6
- 2
- 5
- 3
- 1
- 36
- 24
- 4
- 3
- 3
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 36
- 7
- 6
- 4
- 4
- 4
- 3
- 3
- 3
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
36 résultats
|
|
triés par
|
|
On the Power of Louvain in the Stochastic Block ModelAdvances in Neural Information Processing Systems (NeurIPS 2020), Dec 2020, Vancourer (virtual), Canada
Communication dans un congrès
hal-03140367v1
|
||
|
The Bane of Low-Dimensionality ClusteringACM-SIAM Symposium on Discrete Algorithms, Jan 2018, New Orleans, United States
Communication dans un congrès
hal-01649763v1
|
||
The Invisible Hand of Dynamic Market Pricingthe 2016 ACM Conference on Economics and Computation, Jul 2016, Maastricht, Netherlands. pp.383-400
Communication dans un congrès
hal-02169519v1
|
|||
Local Search Yields Approximation Schemes for k-Means and k-Median in Euclidean and Minor-Free Metrics2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS), Oct 2016, New Brunswick, United States. pp.353-364
Communication dans un congrès
hal-02169522v1
|
|||
|
A Near-Linear Approximation Scheme for Multicuts of Embedded Graphs with a Fixed Number of TerminalsSIAM Journal on Computing, 2021, 50 (1), pp.1-31. ⟨10.1137/18M1183297⟩
Article dans une revue
hal-04531792v1
|
||
|
Inapproximability of Clustering in Lp-metricsFOCS'19 - 60th Annual IEEE Symposium on Foundations of Computer Science, Nov 2019, Baltimore, United States
Communication dans un congrès
hal-02360762v2
|
||
|
A Fast Approximation Scheme for Low-Dimensional k-MeansSODA 2018 - 29h Annual ACM-SIAM Symposium on Discrete Algorithms, Jan 2018, New Orleans, LA, United States. pp.430-440, ⟨10.1137/1.9781611975031.29⟩
Communication dans un congrès
hal-02169544v1
|
||
Approximating connectivity domination in weighted bounded-genus graphsthe 48th Annual ACM SIGACT Symposium on Theory of Computing, Jun 2016, Cambridge, United States. pp.584-597
Communication dans un congrès
hal-02169515v1
|
|||
|
Algorithmic Aspects of Switch Cographs2013
Pré-publication, Document de travail
hal-00921760v1
|
||
|
Improved Coresets and Sublinear Algorithms for Power Means in Euclidean SpacesAdvances in Neural Information Processing Systems, Dec 2021, Virtual, France. pp.21085--21098
Communication dans un congrès
hal-03944707v1
|
||
On the Local Structure of Stable Clustering Instances2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS), Oct 2017, Berkeley, United States. pp.49-60
Communication dans un congrès
hal-02169532v1
|
|||
|
A Fixed Parameter Tractable Approximation Scheme for the Optimal Cut Graph of a Surface23rd Annual European Symposium on Algorithms, pp.386-398, 2015
Chapitre d'ouvrage
hal-02169505v1
|
||
|
Steinberg's Conjecture is falseJournal of Combinatorial Theory, Series B, 2017, 122, pp.452-456. ⟨10.1016/j.jctb.2016.07.006⟩
Article dans une revue
hal-02169535v1
|
||
|
A Polynomial-Time Approximation Scheme for Facility Location on Planar GraphsFOCS'19, Nov 2019, Baltimore, United States
Communication dans un congrès
hal-02360765v1
|
||
|
Local Search Yields Approximation Schemes for $k$-Means and $k$-Median in Euclidean and Minor-Free MetricsSIAM Journal on Computing, 2019, 48 (2), pp.644-667. ⟨10.1137/17M112717X⟩
Article dans une revue
hal-02169573v1
|
||
|
Algorithmic aspects of switch cographsDiscrete Applied Mathematics, 2016, 200, pp.23 - 42. ⟨10.1016/j.dam.2015.07.008⟩
Article dans une revue
hal-01423053v1
|
||
|
Balanced centroidal power diagrams for redistrictingThe 26th ACM SIGSPATIAL International Conference, Nov 2018, Seattle, United States. pp.389-396, ⟨10.1145/3274895.3274979⟩
Communication dans un congrès
hal-02169538v1
|
||
|
Almost tight lower bounds for hard cutting problems in embedded graphsJournal of the ACM (JACM), 2021, 68 (30), pp.1-26. ⟨10.1145/3450704⟩
Article dans une revue
hal-04510609v1
|
||
|
Instance-Optimality in the Noisy Value-and Comparison-ModelProceedings of the 2020 {ACM-SIAM} Symposium on Discrete Algorithms, {SODA} 2020, Jan 2020, Salt Lake City, United States. pp.2124-2143, ⟨10.1137/1.9781611975994.131⟩
Communication dans un congrès
hal-02697939v1
|
||
|
Fully Dynamic Consistent Facility LocationNeurIPS'19 - 33rd Conference on Neural Information Processing Systems, Dec 2019, Vancouver, United States
Communication dans un congrès
hal-02360783v1
|
||
|
Hierarchical ClusteringJournal of the ACM (JACM), 2019, 66 (4), pp.1-42. ⟨10.1145/3321386⟩
Article dans une revue
hal-02371814v1
|
||
|
Subquadratic High-Dimensional Hierarchical ClusteringNeurIPS'19 - 33rd Conference on Neural Information Processing Systems, Dec 2019, Vancouver, Canada
Communication dans un congrès
hal-02360775v1
|
||
|
Tight FPT Approximations for k-Median and k-Means46th International Colloquium on Automata, Languages, and Programming (ICALP 2019), Jul 2019, Patras, Greece. pp.42:1--42:14, ⟨10.4230/LIPIcs.ICALP.2019.42⟩
Communication dans un congrès
hal-02360773v1
|
||
|
Near-linear time approximations schemes for clustering in doubling metricsFOCS'19, Nov 2019, Baltimore, United States
Communication dans un congrès
hal-02360768v1
|
||
|
On the Fixed-Parameter Tractability of Capacitated Clustering46th International Colloquium on Automata, Languages, and Programming (ICALP 2019), Jul 2019, Patras, Greece. pp.41:1--41:14, ⟨10.4230/LIPIcs.ICALP.2019.41⟩
Communication dans un congrès
hal-02169579v1
|
||
|
Oblivious dimension reduction for k -means: beyond subspaces and the Johnson-Lindenstrauss lemmaSTOC 2019 - 51st Annual ACM SIGACT Symposium on Theory of Computing, Jun 2019, Phoenix, United States. pp.1039-1050, ⟨10.1145/3313276.3316318⟩
Communication dans un congrès
hal-02169563v1
|
||
|
Hierarchical Clustering: Objective Functions and AlgorithmsSODA 2018 - Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, Jan 2018, New Orleans, LA, United States. pp.378-397, ⟨10.1137/1.9781611975031.26⟩
Communication dans un congrès
hal-02169539v1
|
||
|
Fast fencingThe 50th Annual ACM SIGACT Symposium on Theory of Computing, Jun 2018, Los Angeles, United States. pp.564-573, ⟨10.1145/3188745.3188878⟩
Communication dans un congrès
hal-02169561v1
|
||
|
Fast and Compact Exact Distance Oracle for Planar Graphs2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS), Oct 2017, Berkeley, France. pp.962-973, ⟨10.1109/FOCS.2017.93⟩
Communication dans un congrès
hal-02169530v1
|
||
|
Efficient Approximation Schemes for Uniform-Cost Clustering Problems in Planar GraphsEuropean Symposium on Algorithms, Sep 2019, Munich, Germany. pp.33:1--33:14, ⟨10.4230/LIPIcs.ESA.2019.33⟩
Communication dans un congrès
hal-02371844v1
|
- 1
- 2