6 citations · 13 across the 7 of their papers we have counts for
8 papers
Block Crossings in Storyline Visualizations
Thomas C. van Dijk, Martin Fink, Norbert Fischer +5
Storyline visualizations help visualize encounters of the characters in a story over time. Each character is represented by an x-monotone curve that goes from left to right. A meet…
The Bundled Crossing Number
Md. Jawaherul Alam, Martin Fink, Sergey Pupyrev
We study the algorithmic aspect of edge bundling. A bundled crossing in a drawing of a graph is a group of crossings between two sets of parallel edges. The bundled crossing number…
Drawing Graphs within Restricted Area
Maximilian Aulbach, Martin Fink, Julian Schuhmann +1
We study the problem of selecting a maximum-weight subgraph of a given graph such that the subgraph can be drawn within a prescribed drawing area subject to given non-uniform verte…
Improved Approximation Algorithms for Box Contact Representations
Michael A. Bekos, Thomas C. van Dijk, Martin Fink +5
We study the following geometric representation problem: Given a graph whose vertices correspond to axis-aligned rectangles with fixed dimensions, arrange the rectangles without ov…
Many-to-One Boundary Labeling with Backbones
Michael A. Bekos, Sabine Cornelsen, Martin Fink +5
In this paper we study \emph{many-to-one boundary labeling with backbone leaders}. In this new many-to-one model, a horizontal backbone reaches out of each label into the feature-e…
Metro-Line Crossing Minimization: Hardness, Approximations, and Tractable Cases
Martin Fink, Sergey Pupyrev
Crossing minimization is one of the central problems in graph drawing. Recently, there has been an increased interest in the problem of minimizing crossings between paths in drawin…