Polylogarithmic approximation for minimum planarization (almost)

DOI10.1109/FOCS.2017.77MaRDI QIDQ6946309zbMATH OpenFDO

Authors Ken-ichi Kawarabayashi, Anastasios Sidiropoulos

Publication date 6 August 2025

Full work available at URL https://doi.org/10.1109/FOCS.2017.77

Mathematics Subject Classification ID

Theory of computing (68Qxx) Discrete mathematics in relation to computer science (68Rxx) Algorithms in computer science (68Wxx)

Cited in

(3)

• Approximating the crossing number of dense graphs (poster abstract)
• Outer-planar vertex deletion on AT-free graphs
• An algorithm for estimating the crossing number of dense graphs, and continuous analogs of the crossing and rectilinear crossing numbers

This page was built for publication: Polylogarithmic approximation for minimum planarization (almost)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6946309)