2 citations · 4 across the 7 of their papers we have counts for
7 papers
Efficient Enumeration of Drawings and Combinatorial Structures for Maximal Planar Graphs
Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati +2
We propose efficient algorithms for enumerating the notorious combinatorial structures of maximal planar graphs, called canonical orderings and Schnyder woods, and the related clas…
Treebar Maps: Schematic Representation of Networks at Scale
Giuseppe Di Battista, Fabrizio Grosso, Silvia Montorselli +1
Many data sets, crucial for today's applications, consist essentially of enormous networks, containing millions or even billions of elements. Having the possibility of visualizing…
Small Point-Sets Supporting Graph Stories
Giuseppe Di Battista, Walter Didimo, Luca Grilli +4
In a graph story the vertices enter a graph one at a time and each vertex persists in the graph for a fixed amount of time , called viewing window. At any time, the user can see…
st-Orientations with Few Transitive Edges
Carla Binucci, Walter Didimo, Maurizio Patrignani
The problem of orienting the edges of an undirected graph such that the resulting digraph is acyclic and has a single source s and a single sink t has a long tradition in graph the…
LR-Drawings of Ordered Rooted Binary Trees and Near-Linear Area Drawings of Outerplanar Graphs
Fabrizio Frati, Maurizio Patrignani, Vincenzo Roselli
In this paper we study a family of algorithms, introduced by Chan [SODA 1999] and called LR-algorithms, for drawing ordered rooted binary trees. In particular, we are interested in…
Computing NodeTrix Representations of Clustered Graphs
Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati +1
NodeTrix representations are a popular way to visualize clustered graphs; they represent clusters as adjacency matrices and inter-cluster edges as curves connecting the matrix boun…