Almost Tight Lower Bounds for Hard Cutting Problems in Embedded Graphs

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. In Gill Barequet, Yusu Wang, editors, 35th International Symposium on Computational Geometry, SoCG 2019, June 18-21, 2019, Portland, Oregon, USA. Volume 129 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2019. [doi]

Abstract

Abstract is missing.