Our goal is to visualize an additional data dimension of a tree with
mul...
A mixed interval graph is an interval graph that has, for every pair of
...
We study the crossing minimization problem in a layered graph drawing of...
A mixed graph has a set of vertices, a set of undirected egdes, and a se...
The segment number of a planar graph G is the smallest number of line
se...
Given a polyline on n vertices, the polyline simplification problem asks...
The Polyline Bundle Simplification (PBS) problem is a generalization of ...
We study upward planar straight-line drawings that use only a constant n...
The task of scheduling jobs to machines while minimizing the total makes...
The aim of this research is a practical method to draw cable plans of co...
We point out two flaws in the algorithm of Brandes and Köpf (Proc. GD
20...
We study the following combinatorial problem. Given a set of n y-monoton...
We propose and study generalizations to the well-known problem of polyli...
Stick graphs are intersection graphs of horizontal and vertical line seg...
We study the following combinatorial problem. Given a set of n y-monoton...
We study the following classes of beyond-planar graphs: 1-planar, IC-pla...
Many applications in graph theory are motivated by routing or flow probl...