We study the following combinatorial problem. Given a set of n y-monoton...
The segment number of a planar graph is the smallest number of line
segm...
We study the following combinatorial problem. Given a set of n y-monoton...
An effective way to reduce clutter in a graph drawing that has (many)
cr...
Given a drawing of a graph, its visual complexity is defined as the
numb...