Graph Drawing Research Group

The goal of the group is to develop new methodologies and tools for network analysis and visualization, with special attention to application fields like computer networks, information systems, and software engineering. The general approach is to study application-driven problems building on a solid theoretical background.

Recently, the group has produced a spin-off group on computer networks.

Topics

• Morphing Graph Drawings
  Models and algorithms to morph graph drawings.
• Clustered Graphs
  Models and algorithms to compute drawings of clustered graphs.
• Orthogonal Drawings
  Models and algorithms to compute orthogonal drawings of graphs.
• 3D Representations of Graphs
  Models and algorithms to compute 3D drawings of graphs.
• Clustered Planarity
  Work Package 05 of the GraDR EuroGIGA Project No. 10-EuroGIGA-OP-003.
• Planarity and Planar Graphs
  Models and algorithms to compute planar drawings of graphs.
• Minimum Size Representations of Graphs
  Algorithms and bounds for drawing graphs in minimum volume or area.
• Proximity Drawings
  Models and algorithms to compute proximity drawings of graphs.
• Simultaneous Information Visualization
  Models and algorithms to compute simultaneous drawings of graphs.

Tools

The following is the list of the currently supported tools. The full list is also available.

• BitConeView
  Visualization of Flows in the Bitcoin Transaction Graph.
• Radian
  A web tool that visualizes traceroute data performed in an IP network, e.g. the Internet.
• GDToolkit
  The Graph Drawing Toolkit. An object-oriented library for handling and drawing graphs.