Almost tight lower bounds for hard cutting problems in embedded graphs

Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-02136928
Contributor : Arnaud de Mesmay <>
Submitted on : Wednesday, May 22, 2019 - 3:05:58 PM
Last modification on : Tuesday, February 18, 2020 - 10:28:42 AM

Links full text

Identifiers

  • HAL Id : hal-02136928, version 1
  • ARXIV : 1903.08603

Citation

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. 35th International Symposium on Computational Geometry (SoCG 2019), Jun 2019, Portland, OR, United States. ⟨hal-02136928⟩

Share

Metrics

Record views

43