Recherche - Archive ouverte HAL

36 résultats

	Pour les 36 documents Envoyer sur ORCID RSS ATOM Exporter BibTeX XML-TEI CSV RTF EndNote PDF HTML Export avancé	Page : Page précédente 1 2 Page suivante	triés par Pertinence Auteur A→Z Auteur Z→A Titre A→Z Titre Z→A Date de publication croissante Date de publication décroissante Date de dépôt croissante Date de dépôt décroissante

		On the Power of Louvain in the Stochastic Block Model Vincent Cohen-Addad , Adrian Kosowski , Frederik Mallmann-Trenn , David Saulpic Advances in Neural Information Processing Systems (NeurIPS 2020), Dec 2020, Vancourer (virtual), Canada Communication dans un congrès hal-03140367v1	Envoyer sur ORCID Exporter BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite Export avancé Partager Gmail Facebook X LinkedIn More
		The Bane of Low-Dimensionality Clustering Vincent Cohen-Addad , Arnaud de Mesmay , Eva Rotenberg , Alan Roytman ACM-SIAM Symposium on Discrete Algorithms, Jan 2018, New Orleans, United States Communication dans un congrès hal-01649763v1	Envoyer sur ORCID Exporter BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite Export avancé Partager Gmail Facebook X LinkedIn More
		The Invisible Hand of Dynamic Market Pricing Vincent Cohen-Addad , Alon Eden , Michal Feldman , Amos Fiat the 2016 ACM Conference on Economics and Computation, Jul 2016, Maastricht, Netherlands. pp.383-400 Communication dans un congrès hal-02169519v1	Envoyer sur ORCID Exporter BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite Export avancé Partager Gmail Facebook X LinkedIn More
		Local Search Yields Approximation Schemes for k-Means and k-Median in Euclidean and Minor-Free Metrics Vincent Cohen-Addad , Philip Klein , Claire Mathieu 2016 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	Envoyer sur ORCID Exporter BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite Export avancé Partager Gmail Facebook X LinkedIn More
		A Near-Linear Approximation Scheme for Multicuts of Embedded Graphs with a Fixed Number of Terminals Vincent Cohen-Addad , Éric Colin de Verdière , Arnaud de Mesmay SIAM Journal on Computing, 2021, 50 (1), pp.1-31. ⟨10.1137/18M1183297⟩ Article dans une revue hal-04531792v1	Envoyer sur ORCID Exporter BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite Export avancé Partager Gmail Facebook X LinkedIn More
		Inapproximability of Clustering in Lp-metrics Vincent Cohen-Addad , Karthik Srikanta FOCS'19 - 60th Annual IEEE Symposium on Foundations of Computer Science, Nov 2019, Baltimore, United States Communication dans un congrès hal-02360762v2	Envoyer sur ORCID Exporter BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite Export avancé Partager Gmail Facebook X LinkedIn More
		A Fast Approximation Scheme for Low-Dimensional k-Means Vincent Cohen-Addad SODA 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	Envoyer sur ORCID Exporter BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite Export avancé Partager Gmail Facebook X LinkedIn More
		Approximating connectivity domination in weighted bounded-genus graphs Vincent Cohen-Addad , Eric Colin de Verdière , Philip Klein , Claire Mathieu , David Meierfrankenfeld the 48th Annual ACM SIGACT Symposium on Theory of Computing, Jun 2016, Cambridge, United States. pp.584-597 Communication dans un congrès hal-02169515v1	Envoyer sur ORCID Exporter BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite Export avancé Partager Gmail Facebook X LinkedIn More
		Algorithmic Aspects of Switch Cographs Vincent Cohen-Addad , Michel Habib , Fabien de Montgolfier 2013 Pré-publication, Document de travail hal-00921760v1	Envoyer sur ORCID Exporter BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite Export avancé Partager Gmail Facebook X LinkedIn More
		Improved Coresets and Sublinear Algorithms for Power Means in Euclidean Spaces Vincent Cohen-Addad , David Saulpic , Chris Schwiegelshohn Advances in Neural Information Processing Systems, Dec 2021, Virtual, France. pp.21085--21098 Communication dans un congrès hal-03944707v1	Envoyer sur ORCID Exporter BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite Export avancé Partager Gmail Facebook X LinkedIn More
		On the Local Structure of Stable Clustering Instances Vincent Cohen-Addad , Chris Schwiegelshohn 2017 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	Envoyer sur ORCID Exporter BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite Export avancé Partager Gmail Facebook X LinkedIn More
		A Fixed Parameter Tractable Approximation Scheme for the Optimal Cut Graph of a Surface Vincent Cohen-Addad , Arnaud de Mesmay 23rd Annual European Symposium on Algorithms, pp.386-398, 2015 Chapitre d'ouvrage hal-02169505v1	Envoyer sur ORCID Exporter BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite Export avancé Partager Gmail Facebook X LinkedIn More
		Steinberg's Conjecture is false Vincent Cohen-Addad , Michael Hebdige , Daniel Král' , Zhentao Li , Esteban Salgado Journal of Combinatorial Theory, Series B, 2017, 122, pp.452-456. ⟨10.1016/j.jctb.2016.07.006⟩ Article dans une revue hal-02169535v1	Envoyer sur ORCID Exporter BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite Export avancé Partager Gmail Facebook X LinkedIn More
		A Polynomial-Time Approximation Scheme for Facility Location on Planar Graphs Vincent Cohen-Addad , Marcin Pilipczuk , Michał Pilipczuk FOCS'19, Nov 2019, Baltimore, United States Communication dans un congrès hal-02360765v1	Envoyer sur ORCID Exporter BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite Export avancé Partager Gmail Facebook X LinkedIn More
		Local Search Yields Approximation Schemes for $k$-Means and $k$-Median in Euclidean and Minor-Free Metrics Vincent Cohen-Addad , Philip Klein , Claire Mathieu SIAM Journal on Computing, 2019, 48 (2), pp.644-667. ⟨10.1137/17M112717X⟩ Article dans une revue hal-02169573v1	Envoyer sur ORCID Exporter BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite Export avancé Partager Gmail Facebook X LinkedIn More
		Algorithmic aspects of switch cographs Vincent Cohen-Addad , Michel Habib , Fabien de Montgolfier Discrete Applied Mathematics, 2016, 200, pp.23 - 42. ⟨10.1016/j.dam.2015.07.008⟩ Article dans une revue hal-01423053v1	Envoyer sur ORCID Exporter BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite Export avancé Partager Gmail Facebook X LinkedIn More
		Balanced centroidal power diagrams for redistricting Vincent Cohen-Addad , Philip Klein , Neal Young The 26th ACM SIGSPATIAL International Conference, Nov 2018, Seattle, United States. pp.389-396, ⟨10.1145/3274895.3274979⟩ Communication dans un congrès hal-02169538v1	Envoyer sur ORCID Exporter BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite Export avancé Partager Gmail Facebook X LinkedIn More
		Almost tight lower bounds for hard cutting problems in embedded graphs Vincent Cohen-Addad , Éric Colin de Verdière , Dániel Marx , Arnaud de Mesmay Journal of the ACM (JACM), 2021, 68 (30), pp.1-26. ⟨10.1145/3450704⟩ Article dans une revue hal-04510609v1	Envoyer sur ORCID Exporter BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite Export avancé Partager Gmail Facebook X LinkedIn More
		Instance-Optimality in the Noisy Value-and Comparison-Model Vincent Cohen-Addad , Frederik Mallmann-Trenn , Claire Mathieu Proceedings 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	Envoyer sur ORCID Exporter BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite Export avancé Partager Gmail Facebook X LinkedIn More
		Fully Dynamic Consistent Facility Location Vincent Cohen-Addad , Niklas Hjuler , Nikos Parotsidis , David Saulpic , Chris Schwiegelshohn NeurIPS'19 - 33rd Conference on Neural Information Processing Systems, Dec 2019, Vancouver, United States Communication dans un congrès hal-02360783v1	Envoyer sur ORCID Exporter BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite Export avancé Partager Gmail Facebook X LinkedIn More
		Hierarchical Clustering Vincent Cohen-Addad , Varun Kanade , Frederik Mallmann-Trenn , Claire Mathieu Journal of the ACM (JACM), 2019, 66 (4), pp.1-42. ⟨10.1145/3321386⟩ Article dans une revue hal-02371814v1	Envoyer sur ORCID Exporter BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite Export avancé Partager Gmail Facebook X LinkedIn More
		Subquadratic High-Dimensional Hierarchical Clustering Amir Abboud , Vincent Cohen-Addad , Hussein Houdrougé NeurIPS'19 - 33rd Conference on Neural Information Processing Systems, Dec 2019, Vancouver, Canada Communication dans un congrès hal-02360775v1	Envoyer sur ORCID Exporter BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite Export avancé Partager Gmail Facebook X LinkedIn More
		Tight FPT Approximations for k-Median and k-Means Vincent Cohen-Addad , Anupam Gupta , Amit Kumar , Euiwoong Lee , Jason Li 46th 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	Envoyer sur ORCID Exporter BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite Export avancé Partager Gmail Facebook X LinkedIn More
		Near-linear time approximations schemes for clustering in doubling metrics Vincent Cohen-Addad , Andreas Emil Feldmann , David Saulpic FOCS'19, Nov 2019, Baltimore, United States Communication dans un congrès hal-02360768v1	Envoyer sur ORCID Exporter BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite Export avancé Partager Gmail Facebook X LinkedIn More
		On the Fixed-Parameter Tractability of Capacitated Clustering Vincent Cohen-Addad , Jason Li 46th 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	Envoyer sur ORCID Exporter BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite Export avancé Partager Gmail Facebook X LinkedIn More
		Oblivious dimension reduction for k -means: beyond subspaces and the Johnson-Lindenstrauss lemma Luca Becchetti , Marc Bury , Vincent Cohen-Addad , Fabrizio Grandoni , Chris Schwiegelshohn STOC 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	Envoyer sur ORCID Exporter BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite Export avancé Partager Gmail Facebook X LinkedIn More
		Hierarchical Clustering: Objective Functions and Algorithms Vincent Cohen-Addad , Varun Kanade , Frederik Mallmann-Trenn , Claire Mathieu SODA 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	Envoyer sur ORCID Exporter BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite Export avancé Partager Gmail Facebook X LinkedIn More
		Fast fencing Mikkel Abrahamsen , Anna Adamaszek , Karl Bringmann , Vincent Cohen-Addad , Mehran Mehr , et al. The 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	Envoyer sur ORCID Exporter BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite Export avancé Partager Gmail Facebook X LinkedIn More
		Fast and Compact Exact Distance Oracle for Planar Graphs Vincent Cohen-Addad , Soren Dahlgaard , Christian Wulff-Nilsen 2017 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	Envoyer sur ORCID Exporter BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite Export avancé Partager Gmail Facebook X LinkedIn More
		Efficient Approximation Schemes for Uniform-Cost Clustering Problems in Planar Graphs Vincent Cohen-Addad , Marcin Pilipczuk , Michał Pilipczuk European 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	Envoyer sur ORCID Exporter BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite Export avancé Partager Gmail Facebook X LinkedIn More

Filtrer vos résultats

On the Power of Louvain in the Stochastic Block Model

The Bane of Low-Dimensionality Clustering

The Invisible Hand of Dynamic Market Pricing

Local Search Yields Approximation Schemes for k-Means and k-Median in Euclidean and Minor-Free Metrics

A Near-Linear Approximation Scheme for Multicuts of Embedded Graphs with a Fixed Number of Terminals

Inapproximability of Clustering in Lp-metrics

A Fast Approximation Scheme for Low-Dimensional k-Means

Approximating connectivity domination in weighted bounded-genus graphs

Algorithmic Aspects of Switch Cographs

Improved Coresets and Sublinear Algorithms for Power Means in Euclidean Spaces

On the Local Structure of Stable Clustering Instances

A Fixed Parameter Tractable Approximation Scheme for the Optimal Cut Graph of a Surface

Steinberg's Conjecture is false

A Polynomial-Time Approximation Scheme for Facility Location on Planar Graphs

Local Search Yields Approximation Schemes for $k$-Means and $k$-Median in Euclidean and Minor-Free Metrics

Algorithmic aspects of switch cographs

Balanced centroidal power diagrams for redistricting

Almost tight lower bounds for hard cutting problems in embedded graphs

Instance-Optimality in the Noisy Value-and Comparison-Model

Fully Dynamic Consistent Facility Location

Hierarchical Clustering

Subquadratic High-Dimensional Hierarchical Clustering

Tight FPT Approximations for k-Median and k-Means

Near-linear time approximations schemes for clustering in doubling metrics

On the Fixed-Parameter Tractability of Capacitated Clustering

Oblivious dimension reduction for k -means: beyond subspaces and the Johnson-Lindenstrauss lemma

Hierarchical Clustering: Objective Functions and Algorithms

Fast fencing

Fast and Compact Exact Distance Oracle for Planar Graphs

Efficient Approximation Schemes for Uniform-Cost Clustering Problems in Planar Graphs