6 citations · 13 across the 7 of their papers we have counts for
4 papers · 1 filter
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…
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…
Drawing Graphs with Vertices at Specified Positions and Crossings at Large Angles
Martin Fink, Jan-Henrik Haunert, Tamara Mchedlidze +2
Point-set embeddings and large-angle crossings are two areas of graph drawing that independently have received a lot of attention in the past few years. In this paper, we consider…
Maximum Betweenness Centrality: Approximability and Tractable Cases
Martin Fink, Joachim Spoerhase
The Maximum Betweenness Centrality problem (MBC) can be defined as follows. Given a graph find a -element node set that maximizes the probability of detecting communication…