1 citations · 1 across the 3 of their papers we have counts for
3 papers
cs.HC2023
Evaluating Animation Parameters for Morphing Edge Drawings
Carla Binucci, Henry Förster, Julia Katheder +1
Partial edge drawings (PED) of graphs avoid edge crossings by subdividing each edge into three parts and representing only its stubs, i.e., the parts incident to the end-nodes. The…
math.CO2023
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…
math.CO2023★ 1 cited
Linear Layouts of Bipartite Planar Graphs
Henry Förster, Michael Kaufmann, Laura Merker +2
A linear layout of a graph consists of a linear order of the vertices and a partition of the edges. A part is called a queue (stack) if no two edges nest (cross), tha…