Extending nearly complete 1-planar drawings in polynomial time

Eduard Eiben; Robert Ganian; Thekla Hamm; Fabian Klute; Martin Nöllenburg

doi:10.4230/LIPIcs.MFCS.2020.31

Extending nearly complete 1-planar drawings in polynomial time

Eduard Eiben, Robert Ganian, Thekla Hamm, Fabian Klute, Martin Nöllenburg

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Original language	English
Title of host publication	45th International Symposium on Mathematical Foundations of Computer Science, MFCS 2020
Editors	Javier Esparza, Daniel Kral�, Daniel Kral�
Publisher	Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
Chapter	31
Pages	1-16
Number of pages	16
ISBN (Electronic)	9783959771597
DOIs	https://doi.org/10.4230/LIPIcs.MFCS.2020.31
Publication status	Published - 18 Aug 2020
Event	45th International Symposium on Mathematical Foundations of Computer Science, MFCS 2020 - Prague, Czech Republic Duration: 25 Aug 2020 → 26 Aug 2020

Publication series

Name	Leibniz International Proceedings in Informatics, LIPIcs
Volume	170
ISSN (Print)	1868-8969

Conference

Conference	45th International Symposium on Mathematical Foundations of Computer Science, MFCS 2020
Country/Territory	Czech Republic
City	Prague
Period	25/08/20 → 26/08/20

Keywords

1-planarity
Extension problems

Access to Document

10.4230/LIPIcs.MFCS.2020.31Licence: CC BY

Cite this

Eiben, E., Ganian, R., Hamm, T., Klute, F., & Nöllenburg, M. (2020). Extending nearly complete 1-planar drawings in polynomial time. In J. Esparza, D. Kral�, & D. Kral� (Eds.), 45th International Symposium on Mathematical Foundations of Computer Science, MFCS 2020 (pp. 1-16). Article MFCS-2020-31 (Leibniz International Proceedings in Informatics, LIPIcs; Vol. 170). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.MFCS.2020.31

Eiben, Eduard ; Ganian, Robert ; Hamm, Thekla et al. / Extending nearly complete 1-planar drawings in polynomial time. 45th International Symposium on Mathematical Foundations of Computer Science, MFCS 2020. editor / Javier Esparza ; Daniel Kral� ; Daniel Kral�. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 2020. pp. 1-16 (Leibniz International Proceedings in Informatics, LIPIcs).

@inproceedings{b9b8c07016174dc5bd19501ff8f1ec7d,

title = "Extending nearly complete 1-planar drawings in polynomial time",

keywords = "1-planarity, Extension problems",

author = "Eduard Eiben and Robert Ganian and Thekla Hamm and Fabian Klute and Martin N{\"o}llenburg",

year = "2020",

month = aug,

day = "18",

doi = "10.4230/LIPIcs.MFCS.2020.31",

language = "English",

series = "Leibniz International Proceedings in Informatics, LIPIcs",

publisher = "Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing",

pages = "1--16",

editor = "Javier Esparza and Daniel Kral� and Daniel Kral�",

booktitle = "45th International Symposium on Mathematical Foundations of Computer Science, MFCS 2020",

note = "45th International Symposium on Mathematical Foundations of Computer Science, MFCS 2020 ; Conference date: 25-08-2020 Through 26-08-2020",

}

Eiben, E, Ganian, R, Hamm, T, Klute, F & Nöllenburg, M 2020, Extending nearly complete 1-planar drawings in polynomial time. in J Esparza, D Kral� & D Kral� (eds), 45th International Symposium on Mathematical Foundations of Computer Science, MFCS 2020., MFCS-2020-31, Leibniz International Proceedings in Informatics, LIPIcs, vol. 170, Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, pp. 1-16, 45th International Symposium on Mathematical Foundations of Computer Science, MFCS 2020, Prague, Czech Republic, 25/08/20. https://doi.org/10.4230/LIPIcs.MFCS.2020.31

Extending nearly complete 1-planar drawings in polynomial time. / Eiben, Eduard; Ganian, Robert; Hamm, Thekla et al.
45th International Symposium on Mathematical Foundations of Computer Science, MFCS 2020. ed. / Javier Esparza; Daniel Kral�; Daniel Kral�. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 2020. p. 1-16 MFCS-2020-31 (Leibniz International Proceedings in Informatics, LIPIcs; Vol. 170).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

TY - GEN

T1 - Extending nearly complete 1-planar drawings in polynomial time

AU - Eiben, Eduard

AU - Ganian, Robert

AU - Hamm, Thekla

AU - Klute, Fabian

AU - Nöllenburg, Martin

PY - 2020/8/18

Y1 - 2020/8/18

KW - 1-planarity

KW - Extension problems

UR - http://www.scopus.com/inward/record.url?scp=85090506187&partnerID=8YFLogxK

U2 - 10.4230/LIPIcs.MFCS.2020.31

DO - 10.4230/LIPIcs.MFCS.2020.31

M3 - Conference contribution

AN - SCOPUS:85090506187

T3 - Leibniz International Proceedings in Informatics, LIPIcs

SP - 1

EP - 16

BT - 45th International Symposium on Mathematical Foundations of Computer Science, MFCS 2020

A2 - Esparza, Javier

A2 - Kral�, Daniel

PB - Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing

T2 - 45th International Symposium on Mathematical Foundations of Computer Science, MFCS 2020

Y2 - 25 August 2020 through 26 August 2020

ER -

Eiben E, Ganian R, Hamm T, Klute F, Nöllenburg M. Extending nearly complete 1-planar drawings in polynomial time. In Esparza J, Kral� D, Kral� D, editors, 45th International Symposium on Mathematical Foundations of Computer Science, MFCS 2020. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. 2020. p. 1-16. MFCS-2020-31. (Leibniz International Proceedings in Informatics, LIPIcs). doi: 10.4230/LIPIcs.MFCS.2020.31

Extending nearly complete 1-planar drawings in polynomial time

Publication series

Conference

Keywords

Access to Document

Other files and links

Cite this