graph-drawing

Multilevel Planarity

In this paper, we introduce and study the multilevel-planarity testing problem, which is a generalization of upward planarity and level planarity. Let $G = (V, E)$ be a directed graph and let $\ell : V \rightarrow \mathcal P(\mathbb Z)$ be a function …

Towards a topology-shape-metrics framework for ortho-radial drawings

Ortho-Radial drawings are a generalization of orthogonal drawings to grids that are formed by concentric circles and straight-line spokes emanating from the circles' center. Such drawings have applications in schematic graph layouts, e.g., for metro …

Experimental Comparison of Semantic Word Clouds

We study the problem of computing semantics-preserving word clouds in which semantically related words are close to each other. We implement three earlier algorithms for creating word clouds and three new ones. We define several metrics for …

Semantic Word Cloud Representations: Hardness and Approximation Algorithms

We study a geometric representation problem, where we are given a set B of axis-aligned rectangles (boxes) with fixed dimensions and a graph with vertex set B. The task is to place the rectangles without overlap such that two rectangles touch if the …