Apart from explicit node-link representations, implicit visualizations and especially the
Treemap as their frontrunner have acquired a solid position among the available techniques …

We present a method to detect and visualize evolution patterns in C++ source code. Our
method consists of three steps. First, we extract an annotated syntax tree (AST) from each …

We study the totally asymmetric simple exclusion process (TASEP) on trees where particles
are generated at the root. Particles can only jump away from the root, and they jump from x …

In this paper, we propose a new layout algorithm that draws the secondary structure of a
Ribonucleic Acid (RNA) automatically according to some of the biologists' aesthetic criteria …

The Strahler number was originally proposed to characterize the complexity of river
bifurcation and has found various applications. This article proposes a computation of the …

In response to the large number of existing tree layouts, generic “meta-layouts” have
recently been proposed. These generic approaches utilize layout design spaces to pinpoint …

For the register function for t-ary trees, recently introduced by Auber et al., we prove that the
average is log4 n+ O (1), if all such trees with n internal nodes are considered to be equally …

We introduce a generic model of emergence of musical categories during the listening
process. The model is based on a preprocessing and a categorization module …

Network structures (graphs) have become a natural part of everyday life and their analysis
helps to gain an understanding of their inherent structure and the real-world aspects thereby …

We propose a method for the visualization of large graphs. Our approach is based on the
calculation of a density function resulting from the application of a metric on the vertices of a …