• Publications
  • Influence
Graph Visualization and Navigation in Information Visualization: A Survey
This is a survey on graph visualization and navigation techniques, as used in information visualization, which approaches the results of traditional graph drawing from a different perspective. Expand
Visual Analytics: Definition, Process, and Challenges
The possibilities to collect and store data increase at a faster rate than the ability to use it for making decisions, and in most applications, raw data has no value in itself; instead the authors want to extract the information contained in it. Expand
Multiscale visualization of small world networks
A metric that has been designed in order to identify the weakest edges in a small world network leading to an easy and low cost filtering procedure that breaks up a graph into smaller and highly connected components is described. Expand
Bubble Tree Drawing Algorithm
It is shown that the Bubble Tree drawing algorithm provides a planar drawing with at most one bend per edge in linear running time. Expand
Generating connected acyclic digraphs uniformly at random
A simple algorithm based on a Markov chain process to generate simply connected acyclic directed graphs over a fixed set of vertices, designed to generate acYclic digraphs, non-necessarily connected. Expand
Circular drawings of rooted trees
We describe an algorithm producing circular layouts for trees, that is drawings, where subtrees of a node lie within circles, and these circles are themselves placed on the circumference of a circle.Expand
Lyndon words, free algebras and shuffles
1. Introduction. A Lyndon word is a primitive word which is minimum in its conjugation class, for the lexicographical ordering. These words have been introduced by Lyndon in order to find bases ofExpand
Software components capture using graph clustering
A simple, fast computing and easy to implement method for finding relatively good clusterings of software systems by applying a straightforward metric, MQ, defined in terms of the neighborhoods of its end vertices to identify the weak edges of the graph. Expand
Tree Visualisation and Navigation Clues for Information Visualisation
This paper describes a visual clue: using the so‐called Strahler numbers, a map is provided that indicates which parts of the tree are interesting, and a second idea is that of “folding” away subtrees that are too “different” in some sense, thereby reducing the visual complexity of theTree. Expand
The Tulip 3 Framework: A Scalable Software Library for Information Visualization Applications Based on Relational Data
Tulip, an information visualization framework dedicated to the analysis and visualization of relational data, is presented, consisting of a suite of tools and techniques, that can be used to address a large variety of domain-specific problems. Expand