Almost tight lower bounds for hard cutting problems in embedded graphs - AGPIG Accéder directement au contenu
Communication Dans Un Congrès Année : 2019

Dates et versions

hal-02136928 , version 1 (22-05-2019)

Identifiants

Citer

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⟩
99 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More