by Eduard Eiben, Robert Ganian, Thekla Hamm, Fabian Klute, Martin Nöllenburg
Reference:
Extending Nearly Complete 1-Planar Drawings in Polynomial TimeEduard Eiben, Robert Ganian, Thekla Hamm, Fabian Klute, Martin NöllenburgMathematical Foundations of Computer Science (MFCS'20) (Javier Esparza, Daniel Král', eds.), volume 170 of LIPIcs, pages 31:1–31:16, 2020, Schloss Dagstuhl – Leibniz-Zentrum für Informatik.
Bibtex Entry:
@inproceedings{eghkn-enc1dpt-20,
Author = {Eiben, Eduard and Ganian, Robert and Hamm, Thekla and Klute, Fabian and Nöllenburg, Martin},
Title = {Extending Nearly Complete 1-Planar Drawings in Polynomial Time},
Booktitle = {Mathematical Foundations of Computer Science (MFCS'20)},
Year = {2020},
Editor = {Esparza, Javier and Král', Daniel},
Volume = {170},
Pages = {31:1--31:16},
Series = {LIPIcs},
Publisher = {Schloss Dagstuhl -- Leibniz-Zentrum für Informatik},
Url = {https://arxiv.org/abs/2007.05346},
Doi = {10.4230/LIPIcs.MFCS.2020.31},
Ee = {2007.05346},
}