3 citations · 5 across the 6 of their papers we have counts for
13 papers
Monotone Arc Diagrams with few Biarcs
Steven Chaplick, Henry Förster, Michael Hoffmann +1
We show that every planar graph has a monotone topological 2-page book embedding where at most (4n-10)/5 (of potentially 3n-6) edges cross the spine, and every edge crosses the spi…
Recognizing and Embedding Simple Optimal 2-Planar Graphs
Henry Förster, Michael Kaufmann, Chrysanthi N. Raftopoulou
In the area of beyond-planar graphs, i.e. graphs that can be drawn with some local restrictions on the edge crossings, the recognition problem is prominent next to the density ques…
-Layer -Planar Graphs: Density, Crossing Lemma, Relationships, and Pathwidth
Patrizio Angelini, Giordano Da Lozzo, Henry Förster +1
The -layer drawing model is a well-established paradigm to visualize bipartite graphs. Several beyond-planar graph classes have been studied under this model. Surprisingly, howe…
Drawing Shortest Paths in Geodetic Graphs
Sabine Cornelsen, Maximilian Pfister, Henry Förster +4
Motivated by the fact that in a space where shortest paths are unique, no two shortest paths meet twice, we study a question posed by Greg Bodwin: Given a geodetic graph , i.e.,…
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.
Drawing Graphs with Circular Arcs and Right-Angle Crossings
Steven Chaplick, Henry Förster, Myroslav Kryven +1
In a RAC drawing of a graph, vertices are represented by points in the plane, adjacent vertices are connected by line segments, and crossings must form right angles. Graphs that ad…