Extending Nearly Complete 1-Planar Drawings in Polynomial Time

Abstract

Full Citation:

Eiben, Eduard, Ganian, Robert, Hamm, Thekla, Klute, Fabian, Nöllenburg, Martin. Extending Nearly Complete 1-Planar Drawings in Polynomial Time. Mathematical Foundations of Computer Science (MFCS'20) (Esparza, Javier and Král’, Daniel), volume 170 of LIPIcs, pages 31:1-31:16, 2020, Schloss Dagstuhl – Leibniz-Zentrum für Informatik.

Robert Ganian

Robert Ganian is a Professor at the Algorithms and Complexity Group.

Martin Nöllenburg

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