Orthogonal graph drawing has many applications, e.g., for laying out UML...
Given a straight-line drawing of a graph, a segment is a maximal set of
...
A mixed interval graph is an interval graph that has, for every pair of
...
We consider the problem of drawing multiple gene trees inside a single
s...
In this paper, we investigate crossing-free 3D morphs between planar
str...
Orthogonal graph drawings are used in applications such as UML diagrams,...
A mixed graph has a set of vertices, a set of undirected egdes, and a se...
An obstacle representation of a graph G consists of a set of pairwise
di...
An obstacle representation of a graph G consists of a set of polygonal
o...
The segment number of a planar graph G is the smallest number of line
se...
We consider the problem of morphing between rectangular duals of a plane...
Floor planning is an important and difficult task in architecture. When
...
We study whether a given graph can be realized as an adjacency graph of ...
A rectangular dual of a graph G is a contact representation of G by
axis...
The aim of this research is a practical method to draw cable plans of co...
In a RAC drawing of a graph, vertices are represented by points in the p...
We study the following combinatorial problem. Given a set of n y-monoton...
Consider a graph with a rotation system, namely, for every vertex, a cir...
The segment number of a planar graph is the smallest number of line
segm...
Contact representations of graphs have a long history.
Most research h...
A measure for the visual complexity of a straight-line crossing-free dra...
In this paper, we study arrangements of orthogonal circles, that is,
arr...
Stick graphs are intersection graphs of horizontal and vertical line seg...
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...
While orthogonal drawings have a long history, smooth orthogonal drawing...
We study the following classes of beyond-planar graphs: 1-planar, IC-pla...
We initiate the study of the following natural geometric optimization
pr...
In the classical Steiner tree problem, one is given an undirected, conne...
Given a drawing of a graph, its visual complexity is defined as the
numb...
Storyline visualizations show the structure of a story, by depicting the...
We study planar drawings of directed graphs in the L-drawing standard. W...
We study straight-line drawings of graphs where the vertices are placed ...