activity
20122023
most citedHow many vertex locations can be arbitrarily chosen when drawing planar graphs?

2 citations · 4 across the 10 of their papers we have counts for

collaborators

30 papers

cs.DS2021

Spirality and Rectilinear Planarity Testing of Independent-Parallel SP-Graphs

Walter Didimo, Michael Kaufmann, Giuseppe Liotta +1

We study the long-standing open problem of efficiently testing rectilinear planarity of series-parallel graphs (SP-graphs) in the variable embedding setting. A key ingredient behin…

cs.CG2021

Quasi-upward Planar Drawings with Minimum Curve Complexity

Carla Binucci, Emilio Di Giacomo, Giuseppe Liotta +1

This paper studies the problem of computing quasi-upward planar drawings of bimodal plane digraphs with minimum curve complexity, i.e., drawings such that the maximum number of ben…

cs.CG2021

Optimal-area visibility representations of outer-1-plane graphs

Therese Biedl, Giuseppe Liotta, Jayson Lynch +1

This paper studies optimal-area visibility representations of -vertex outer-1-plane graphs, i.e. graphs with a given embedding where all vertices are on the boundary of the oute…

cs.CG2021

Generalized LR-drawings of trees

Therese Biedl, Giuseppe Liotta, Jayson Lynch +1

The LR-drawing-method is a method of drawing an ordered rooted binary tree based on drawing one root-to-leaf path on a vertical line and attaching recursively obtained drawings of…

cs.SI2020

VAIM: Visual Analytics for Influence Maximization

Alessio Arleo, Walter Didimo, Giuseppe Liotta +2

In social networks, individuals' decisions are strongly influenced by recommendations from their friends and acquaintances. The influence maximization (IM) problem asks to select a…

cs.SI2020

Storyline Visualizations with Ubiquitous Actors

Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta +2

Storyline visualizations depict the temporal dynamics of social interactions, as they describe how groups of actors (individuals or organizations) change over time. A common constr…