73 citations · 178 across the 49 of their papers we have counts for
1 paper · 2 filters
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…