73 citations · 178 across the 49 of their papers we have counts for
Showing 2011Show all
2 papers · 1 filter
cs.DM2011
Computing Cartograms with Optimal Complexity
Md. Jawaherul Alam, Therese Biedl, Stefan Felsner +3
In a rectilinear dual of a planar graph vertices are represented by simple rectilinear polygons and edges are represented by side-contact between the corresponding polygons. A rect…
math.CO2011
On the bend-number of planar and outerplanar graphs
Daniel Heldt, Kolja Knauer, Torsten Ueckerdt
The bend-number b(G) of a graph G is the minimum k such that G may be represented as the edge intersection graph of a set of grid paths with at most k bends. We confirm a conjectur…