"Almost Tight Lower Bounds for Hard Cutting Problems in Embedded Graphs."

Vincent Cohen-Addad et al. (2019)

> Home

Details and statistics

DOI: 10.4230/LIPICS.SOCG.2019.27

access: open

type: Conference or Workshop Paper

metadata version: 2021-06-16

- view
  - electronic edition via DOI (open access)
  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

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.