4 citations · 7 across the 4 of their papers we have counts for
1 paper · 1 filter
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…