1 citations · 1 across the 7 of their papers we have counts for
8 papers
Weighted Book Thickness
Henry Förster, Michael Hoffmann, Stephen Kobourov +3
We introduce and study the weighted book thickness of graphs. A -page book embedding of a graph is defined by a spanning cycle for (which does not need to be p…
Rerouting Curves on Surfaces
Timo Brand, Stefan Felsner, Henry Förster +8
We study the problem of reconfiguring a crossing-free embedding of a graph on a surface, with edges represented as curves, into another crossing-free embedding of the same graph on…
Using Reinforcement Learning to Optimize the Global and Local Crossing Number
Timo Brand, Henry Förster, Stephen Kobourov +4
Graph drawing concerns the algorithmic visualization of graphs. A good drawing of a graph is easy to read and facilitates solving tasks on the graph. Several properties have been i…
On 1-bend Upward Point-set Embeddings of -digraphs
Emilio Di Giacomo, Henry Förster, Daria Kokhovich +4
We study the upward point-set embeddability of digraphs on one-sided convex point sets with at most 1 bend per edge. We provide an algorithm to compute a 1-bend upward point-set em…
Geometric Thickness of Multigraphs is -complete
Henry Förster, Philipp Kindermann, Tillmann Miltzow +3
We say that a (multi)graph has geometric thickness if there exists a straight-line drawing and a -coloring of its edges where no…
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…
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…
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…