Vincent Cohen-Addad

Available identifiers

zbMath Open cohen-addad.vincentMaRDI QIDQ345095

List of research outcomes

Publication	Date of Publication	Type
A Massively Parallel Modularity-Maximizing Algorithm with Provable Guarantees	2024-03-26	Paper
https://portal.mardi4nfdi.de/entity/Q6147414	2024-01-15	Paper
Bypassing the surface embedding: approximation schemes for network design in minor-free graphs	2023-12-08	Paper
Towards optimal lower bounds for k-median and k-means coresets	2023-12-08	Paper
Improved approximations for Euclidean k -means and k -median, via nested quasi-independent sets	2023-12-08	Paper
A new coreset framework for clustering	2023-11-14	Paper
A quasipolynomial (2 + ε )-approximation for planar sparsest cut	2023-11-14	Paper
A Linear-Time n 0.4 -Approximation for Longest Common Subsequence	2023-10-23	Paper
Almost Tight Lower Bounds for Hard Cutting Problems in Embedded Graphs	2022-12-08	Paper
Near-linear Time Approximation Schemes for Clustering in Doubling Metrics	2022-12-08	Paper
A 2-approximation for the bounded treewidth sparsest cut problem in \textsf{FPT} Time	2022-08-16	Paper
https://portal.mardi4nfdi.de/entity/Q5091191	2022-07-21	Paper
https://portal.mardi4nfdi.de/entity/Q5091192	2022-07-21	Paper
https://portal.mardi4nfdi.de/entity/Q5088957	2022-07-18	Paper
https://portal.mardi4nfdi.de/entity/Q5075771	2022-05-11	Paper
A Near-Linear Approximation Scheme for Multicuts of Embedded Graphs With a Fixed Number of Terminals	2021-02-08	Paper
Instance-Optimality in the Noisy Value-and Comparison-Model	2021-02-02	Paper
Approximation Schemes for Capacitated Clustering in Doubling Metrics	2021-02-02	Paper
New hardness results for planar graph problems in p and an algorithm for sparsest cut	2021-01-19	Paper
On Efficient Low Distortion Ultrametric Embedding	2020-08-15	Paper
Hierarchical Clustering	2020-02-11	Paper
Oblivious dimension reduction for k -means: beyond subspaces and the Johnson-Lindenstrauss lemma	2020-01-30	Paper
Lower bounds for text indexing with mismatches and differences	2019-10-15	Paper
Fast fencing	2019-08-22	Paper
Local Search Yields Approximation Schemes for $k$-Means and $k$-Median in Euclidean and Minor-Free Metrics	2019-05-07	Paper
https://portal.mardi4nfdi.de/entity/Q4607904	2018-03-15	Paper
https://portal.mardi4nfdi.de/entity/Q4607907	2018-03-15	Paper
https://portal.mardi4nfdi.de/entity/Q4607908	2018-03-15	Paper
https://portal.mardi4nfdi.de/entity/Q4607984	2018-03-15	Paper
https://portal.mardi4nfdi.de/entity/Q4598152	2017-12-19	Paper
https://portal.mardi4nfdi.de/entity/Q5368697	2017-10-10	Paper
Approximating connectivity domination in weighted bounded-genus graphs	2017-09-29	Paper
Steinberg's conjecture is false	2016-11-25	Paper
Algorithmic aspects of switch cographs	2016-01-21	Paper
Energy-Efficient Algorithms for Non-preemptive Speed-Scaling	2015-11-20	Paper
A Fixed Parameter Tractable Approximation Scheme for the Optimal Cut Graph of a Surface	2015-11-19	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: Vincent Cohen-Addad