Beyond-Planar Graphs: Combinatorics, Models and Algorithms (Dagstuhl Seminar 19092)
This report documents the program and the outcomes of Dagstuhl Seminar 19092 "Beyond-Planar Graphs: Combinatorics, Models and Algorithms" which brought together 36 researchers in the areas of graph theory, combinatorics, computational geometry, and graph
drawing. This seminar continued the work initiated in Dagstuhl Seminar 16452 "Beyond-Planar Graphs: Algorithmics and Combinatorics" and focused on the exploration of structural properties and the development of algorithms for so-called beyond-planar graphs, i.e., non-planar graphs that admit a drawing with topological constraints such as specific types of crossings, or with some forbidden crossing patterns.
The seminar began with four talks about the results of scientific collaborations originating from the previous Dagstuhl seminar. Next we discussed open research problems
about beyond planar graphs, such as their combinatorial structures (e.g., book thickness, queue number), their topology (e.g., simultaneous embeddability, gap planarity, quasi-quasiplanarity), their geometric representations
(e.g., representations on few segments or arcs), and applications
(e.g., manipulation of graph drawings by untangling operations). Six working groups were formed that investigated several of the open research questions. In addition, talks on related subjects and recent conference contributions were presented in the morning opening sessions. Abstracts of all talks and a report from each working group are included in this report.
combinatorial geometry
geometric algorithms
graph algorithms
graph drawing
graph theory
network visualization
123-156
Regular Paper
Seok-Hee
Hong
Seok-Hee Hong
Michael
Kaufmann
Michael Kaufmann
János
Pach
János Pach
Csaba D.
Tóth
Csaba D. Tóth
10.4230/DagRep.9.2.123
Creative Commons Attribution 3.0 Unported license
https://creativecommons.org/licenses/by/3.0/legalcode