Extending Nearly Complete 1-Planar Drawings in Polynomial Time

Martin Nöllenburg
January 2020
PDF Cite Project
Type
Conference Paper
Nfpc
Martin Nöllenburg
Martin Nöllenburg

Martin Nöllenburg is a Professor at the Algorithms and Complexity Group.