-
Chapter and Conference Paper
Tiramisù: A Recipe for Visual Sensemaking of Multi-faceted Process Information
Knowledge-intensive processes represent a particularly challenging scenario for process mining. The flexibility that such processes allow constitutes a hurdle as it is hard to capture in a single model. To tac...
-
Chapter and Conference Paper
On Time and Space: An Experimental Study on Graph Structural and Temporal Encodings
Dynamic networks reflect temporal changes occurring to the graph’s structure and are used to model a wide variety of problems in many application fields. We investigate the design space of dynamic graph visual...
-
Chapter and Conference Paper
TimeLighting: Guidance-Enhanced Exploration of 2D Projections of Temporal Graphs
In temporal (or event-based) networks, time is a continuous axis, with real-valued time coordinates for each node and edge. Computing a layout for such graphs means embedding the node trajectories and edge surfac...
-
Chapter and Conference Paper
VAIM: Visual Analytics for Influence Maximization
In social networks, individuals’ decisions are strongly influenced by recommendations from their friends and acquaintances. The influence maximization (IM) problem asks to select a seed set of users that maximize...
-
Chapter and Conference Paper
GiViP: A Visual Profiler for Distributed Graph Processing Systems
Analyzing large-scale graphs provides valuable insights in different application scenarios. While many graph processing systems working on top of distributed infrastructures have been proposed to deal with big...
-
Chapter and Conference Paper
A Distributed Multilevel Force-Directed Algorithm
The wide availability of powerful and inexpensive cloud computing services naturally motivates the study of distributed graph layout algorithms, able to scale to very large graphs. Nowadays, to process Big Dat...
-
Chapter and Conference Paper
Visibility Representations of Boxes in 2.5 Dimensions
We initiate the study of 2.5D box visibility representations (2.5D-BR) where vertices are mapped to 3D boxes having the bottom face in the plane ...
-
Chapter and Conference Paper
A Million Edge Drawing for a Fistful of Dollars
In this paper we study the problem of designing a graph drawing algorithm for large graphs. The algorithm must be simple to implement and the computing infrastructure must not require major hardware or softwar...
