37 citations · 132 across the 52 of their papers we have counts for
Showing 2014Show all
3 papers · 1 filter
cs.CG2014★ 1 cited
-String -VPG Representation of Planar Graphs
Therese Biedl, Martin Derka
In this paper, we prove that every planar graph has a 1-string -VPG representation---a string representation using paths in a rectangular grid that contain at most two bends.…
cs.CG2014
1-String CZ-Representation of Planar Graphs
Therese Biedl, Martin Derka
In this paper, we prove that every planar 4-connected graph has a CZ-representation---a string representation using paths in a rectangular grid that contain at most one vertical se…
cs.CG2014
Straightening out planar poly-line drawings
Therese Biedl
We show that any -monotone poly-line drawing can be straightened out while maintaining -coordinates and height. The width may increase much, but we also show that on some gra…