Networks are typically visualized with force-based or spectral layouts. These algorithms lack
reproducibility and perceptual uniformity because they do not use a node coordinate system …

We extend the popular force-directed approach to network (or graph) layout to allow
separation constraints, which enforce a minimum horizontal or vertical separation between …

Explaining outputs determined algorithmically by machines is one of the most pressing and
studied problems in Artificial Intelligence (AI) nowadays, but the equally pressing problem of …

Complex software systems are often modeled using data flow diagrams, in which nodes are
connected to each other through dedicated connection points called ports. The influence a …

Many different approaches have been proposed for the challenging problem of visually
analyzing large networks. Clustering is one of the most promising. In this paper, we propose …

We show how to improve the Sugiyama scheme by edge bundling. Our method modifies the
layout produced by the Sugiyama scheme by bundling some of the edges together. The …

We present ManuKnowVis, the result of a design study, in which we contextualize data from
multiple knowledge repositories of a manufacturing process for battery modules used in …

A standard approach to large network visualization is to provide an overview of the network
and a detailed view of a small component of the graph centred around a focal node. The …

A Software City is a an established way to visualize metrics such as the test coverage or
complexity. As current layouting algorithms are mainly based on the static code structure …

US PATENT DOCUMENTS 5,528,735 A 6, 1996 Strasnicket al. 5,537,630 A 7/1996 Berry et
al. 5,546,529 A 8, 1996 Bowers et al. 5,603,025 A 2, 1997 Tabb et al. 5,608,898 A 3/1997 …