Almost Tight Lower Bounds for Hard Cutting Problems in Embedded Graphs

This is a publication. If there is no link to the publication on this page, you can try the pre-formated search via the search engines listed on this page.

Authors: Cohen-Addad, V; de, Verdière É C; Marx, Dániel; de, Mesmay A

Journal title: 35th International Symposium on Computational Geometry (SoCG 2019)

Journal number: 2019

Journal publisher: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik

Published year: 2019

Published pages: 27:1--27:16

DOI identifier: 10.4230/lipics.socg.2019.27

ISBN: 978-3-95977-104-7