3 citations · 5 across the 7 of their papers we have counts for
Showing 2016Show all
3 papers · 1 filter
cs.CG2016
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(…
cs.CG2016★ 2 cited
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…
cs.CG2016★ 3 cited
Sliding k-Transmitters: Hardness and Approximation
Therese Biedl, Saeed Mehrabi, Ziting Yu
A sliding k-transmitter in an orthogonal polygon P is a mobile guard that travels back and forth along an orthogonal line segment s inside P. It can see a point p in P if the perpe…