Vincent Cohen-Addad

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Éric Colin de Verdière

> Home > Persons > Vincent Cohen-Addad

Publications

2021
[j8]
- view
  authority control:
- export record
  dblp key:
  - journals/jacm/Cohen-AddadVMM21
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jacm/Cohen-AddadVMM21
Vincent Cohen-Addad, Éric Colin de Verdière, Dániel Marx, Arnaud de Mesmay:
Almost Tight Lower Bounds for Hard Cutting Problems in Embedded Graphs. J. ACM 68(4): 30:1-30:26 (2021)
[j5]
- view
  authority control:
- export record
  dblp key:
  - journals/siamcomp/Cohen-AddadVM21
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/siamcomp/Cohen-AddadVM21
Vincent Cohen-Addad, Éric Colin de Verdière, Arnaud de Mesmay:
A Near-Linear Approximation Scheme for Multicuts of Embedded Graphs With a Fixed Number of Terminals. SIAM J. Comput. 50(1): 1-31 (2021)
2019
[c29]
- view
  - electronic edition via DOI (open access)
  - details & citations
  authority control:
- export record
  dblp key:
  - conf/compgeom/Cohen-AddadVMM19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/compgeom/Cohen-AddadVMM19
Vincent Cohen-Addad, Éric Colin de Verdière, Dániel Marx, Arnaud de Mesmay:
Almost Tight Lower Bounds for Hard Cutting Problems in Embedded Graphs. SoCG 2019: 27:1-27:16
[i24]
- view
  - electronic edition @ arxiv.org (open access)
  - details & citations
- export record
  dblp key:
  - journals/corr/abs-1903-08603
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-1903-08603
Vincent Cohen-Addad, Éric Colin de Verdière, Dániel Marx, Arnaud de Mesmay:
Almost Tight Lower Bounds for Hard Cutting Problems in Embedded Graphs. CoRR abs/1903.08603 (2019)
2018
[c13]
- view
  - electronic edition via DOI (open access)
  - details & citations
  authority control:
- export record
  dblp key:
  - conf/soda/Cohen-AddadVM18
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/soda/Cohen-AddadVM18
Vincent Cohen-Addad, Éric Colin de Verdière, Arnaud de Mesmay:
A Near-Linear Approximation Scheme for Multicuts of Embedded Graphs with a Fixed Number of Terminals. SODA 2018: 1439-1458
2016
[c4]
- view
  authority control:
- export record
  dblp key:
  - conf/stoc/Cohen-AddadVKMM16
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/stoc/Cohen-AddadVKMM16
Vincent Cohen-Addad, Éric Colin de Verdière, Philip N. Klein, Claire Mathieu, David Meierfrankenfeld:
Approximating connectivity domination in weighted bounded-genus graphs. STOC 2016: 584-597
[i6]
- view
  - electronic edition @ arxiv.org (open access)
  - details & citations
- export record
  dblp key:
  - journals/corr/Cohen-AddadVM16
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/Cohen-AddadVM16
Vincent Cohen-Addad, Éric Colin de Verdière, Arnaud de Mesmay:
A Near-Linear Approximation Scheme for Multicuts of Embedded Graphs with a Fixed Number of Terminals. CoRR abs/1611.02966 (2016)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.