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

Vincent Cohen-Addad et al. (2021)

> Home

Details and statistics

DOI: 10.1145/3450704

access: closed

type: Journal Article

metadata version: 2021-09-01

- view
  - electronic edition via DOI
  - unpaywalled version
  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)

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.