1 citations · 1 across the 4 of their papers we have counts for
8 papers
Weakly and Strongly Fan-Planar Graphs
Otfried Cheong, Henry Förster, Julia Katheder +2
We study two notions of fan-planarity introduced by (Cheong et al., GD22), called weak and strong fan-planarity, which separate two non-equivalent definitions of fan-planarity in t…
Axis-Parallel Right Angle Crossing Graphs
Patrizio Angelini, Michael A. Bekos, Julia Katheder +3
A RAC graph is one admitting a RAC drawing, that is, a polyline drawing in which each crossing occurs at a right angle. Originally motivated by psychological studies on readability…
Simultaneous Drawing of Layered Trees
Julia Katheder, Stephen G. Kobourov, Axel Kuckuk +2
We study the crossing-minimization problem in a layered graph drawing of planar-embedded rooted trees whose leaves have a given total order on the first layer, which adheres to the…
The thickness of fan-planar graphs is at most three
Otfried Cheong, Maximilian Pfister, Lena Schlipf
We prove that in any strongly fan-planar drawing of a graph G the edges can be colored with at most three colors, such that no two edges of the same color cross. This implies that…
RAC Drawings of Graphs with Low Degree
Patrizio Angelini, Michael A. Bekos, Julia Katheder +2
Motivated by cognitive experiments providing evidence that large crossing-angles do not impair the readability of a graph drawing, RAC (Right Angle Crossing) drawings were introduc…
On Morphing 1-Planar Drawings
Patrizio Angelini, Michael A. Bekos, Fabrizio Montecchiani +1
Computing a morph between two drawings of a graph is a classical problem in computational geometry and graph drawing. While this problem has been widely studied in the context of p…
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.,…
Beyond-Planarity: Density Results for Bipartite Graphs
Patrizio Angelini, Michael A. Bekos, Michael Kaufmann +2
Beyond-planarity focuses on the study of geometric and topological graphs that are in some sense nearly-planar. Here, planarity is relaxed by allowing edge crossings, but only with…