Conference Papers
Year : 2019
Arnaud de Mesmay : Connect in order to contact the contributor
https://hal.science/hal-02136928
Submitted on : Wednesday, May 22, 2019-3:05:58 PM
Last modification on : Tuesday, April 11, 2023-3:14:05 PM
Cite
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 - 35th International Symposium on Computational Geometry, Jun 2019, Portland, OR, United States. ⟨hal-02136928⟩
Collections
88
View
0
Download