research
∙
02/27/2020
The Complexity of Finding Tangles
We study the following combinatorial problem. Given a set of n y-monoton...
share
research
∙
08/23/2019
Variants of the Segment Number of a Graph
The segment number of a planar graph is the smallest number of line segm...
research
∙
01/19/2019
Computing Optimal Tangles Faster
We study the following combinatorial problem. Given a set of n y-monoton...
research
∙
12/11/2018
Bundled Crossings Revisited
An effective way to reduce clutter in a graph drawing that has (many) cr...
research
∙
09/20/2017
