84 citations · 92 across the 11 of their papers we have counts for
6 papers · 1 filter
Monotone Arc Diagrams with few Biarcs
Steven Chaplick, Henry Förster, Michael Hoffmann +1
We show that every planar graph can be represented by a monotone topological 2-page book embedding where at most 15n/16 (of potentially 3n-6) edges cross the spine exactly once.
On Layered Fan-Planar Graph Drawings
Therese Biedl, Steven Chaplick, Jiři Fiala +4
In this paper, we study fan-planar drawings that use layers and are proper, i.e., edges connect adjacent layers. We show that if the embedding of the graph is fixed, then testi…
3D Visibility Representations of 1-planar Graphs
Patrizio Angelini, Michael A. Bekos, Michael Kaufmann +1
We prove that every 1-planar graph G has a z-parallel visibility representation, i.e., a 3D visibility representation in which the vertices are isothetic disjoint rectangles parall…
On Optimal 2- and 3-Planar Graphs
Michael A. Bekos, Michael Kaufmann, Chrysanthi N. Raftopoulou
A graph is -planar if it can be drawn in the plane such that no edge is crossed more than times. While for , optimal -planar graphs, i.e., those with vertices an…
The Planar Tree Packing Theorem
Markus Geyer, Michael Hoffmann, Michael Kaufmann +2
Packing graphs is a combinatorial problem where several given graphs are being mapped into a common host graph such that every edge is used at most once. In the planar tree packing…
Progress on Partial Edge Drawings
Till Bruckdorfer, Sabine Cornelsen, Carsten Gutwenger +4
Recently, a new way of avoiding crossings in straight-line drawings of non-planar graphs has been investigated. The idea of partial edge drawings (PED) is to drop the middle part o…