14 citations · 25 across the 17 of their papers we have counts for
4 papers · 1 filter
Splitting -VPG graphs into outer-string and co-comparability graphs
Martin Derka, Therese Biedl
In this paper, we show that any -VPG graph (i.e., an intersection graph of orthogonal curves with at most 2 bends) can be decomposed into outerstring graphs or $O(…
Crossing Number for Graphs With Bounded Pathwidth
Therese Biedl, Markus Chimani, Martin Derka +1
The crossing number is the smallest number of pairwise edge-crossings when drawing a graph into the plane. There are only very few graph classes for which the exact crossing number…
Order-preserving 1-string representations of planar graphs
Therese Biedl, Martin Derka
This paper considers 1-string representations of planar graphs that are order-preserving in the sense that the order of crossings along the curve representing vertex is the sam…
Recognition of Triangulation Duals of Simple Polygons With and Without Holes
Martin Derka, Alejandro López-Ortiz, Daniela Maftuleac
We investigate the problem of determining if a given graph corresponds to the dual of a triangulation of a simple polygon. This is a graph recognition problem, where in our particu…