38 citations · 68 across the 29 of their papers we have counts for
21 papers · 1 filter
Upward Pointset Embeddings of Planar st-Graphs
Carlos Alegria, Susanna Caroppo, Giordano Da Lozzo +5
We study upward pointset embeddings (UPSEs) of planar -graphs. Let be a planar -graph and let be a pointset with . An UPSE of …
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…
Planar Straight-line Realizations of 2-Trees with Prescribed Edge Lengths
Carlos Alegría, Manuel Borrazzo, Giordano Da Lozzo +3
We study a classic problem introduced thirty years ago by Eades and Wormald. Let be a weighted planar graph, where is a length function.…
2-Level Quasi-Planarity or How Caterpillars Climb (SPQR-)Trees
Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista +2
Given a bipartite graph , the -Level Quasi-Planarity problem asks for the existence of a drawing of in the plane such that the vertices in and in …
Schematic Representation of Large Biconnected Graphs
Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani +1
Suppose that a biconnected graph is given, consisting of a large component plus several other smaller components, each separated from the main component by a separation pair. We in…
Optimal Orthogonal Drawings of Planar 3-Graphs in Linear Time
Walter Didimo, Giuseppe Liotta, Giacomo Ortali +1
A planar orthogonal drawing of a planar graph is a geometric representation of such that the vertices are drawn as distinct points of the plane, the edges are drawn as…
Graph Stories in Small Area
Manuel Borrazzo, Giordano Da Lozzo, Giuseppe Di Battista +2
We study the problem of drawing a dynamic graph, where each vertex appears in the graph at a certain time and remains in the graph for a fixed amount of time, called the window siz…
The QuaSEFE Problem
Patrizio Angelini, Henry Förster, Michael Hoffmann +4
We initiate the study of Simultaneous Graph Embedding with Fixed Edges in the beyond planarity framework. In the QuaSEFE problem, we allow edge crossings, as long as each graph ind…
On the Area Requirements of Planar Straight-Line Orthogonal Drawings of Ternary Trees
Barbara Covella, Fabrizio Frati, Maurizio Patrignani
In this paper, we study the area requirements of planar straight-line orthogonal drawings of ternary trees. We prove that every ternary tree admits such a drawing in sub-quadratic…
Upward Planar Morphs
Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati +2
We prove that, given two topologically-equivalent upward planar straight-line drawings of an -vertex directed graph , there always exists a morph between them such that all t…
Bend-minimum Orthogonal Drawings in Quadratic Time
Walter Didimo, Giuseppe Liotta, Maurizio Patrignani
Let be a planar -graph (i.e., a planar graph with vertex degree at most three) with vertices. We present the first -time algorithm that computes a planar orthogo…
Planar L-Drawings of Directed Graphs
Steven Chaplick, Markus Chimani, Sabine Cornelsen +5
We study planar drawings of directed graphs in the L-drawing standard. We provide necessary conditions for the existence of these drawings and show that testing for the existence o…
Visualizing Co-Phylogenetic Reconciliations
Tiziana Calamoneri, Valentino Di Donato, Diego Mariottini +1
We introduce a hybrid metaphor for the visualization of the reconciliations of co-phylogenetic trees, that are mappings among the nodes of two trees. The typical application is the…
NodeTrix Planarity Testing with Small Clusters
Emilio Di Giacomo, Giuseppe Liotta, Maurizio Patrignani +2
We study the NodeTrix planarity testing problem for flat clustered graphs when the maximum size of each cluster is bounded by a constant . We consider both the case when the sid…
Beyond Level Planarity
Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista +3
In this paper we settle the computational complexity of two open problems related to the extension of the notion of level planarity to surfaces different from the plane. Namely, we…
L-Drawings of Directed Graphs
Patrizio Angelini, Giordano Da Lozzo, Marco Di Bartolomeo +4
We introduce L-drawings, a novel paradigm for representing directed graphs aiming at combining the readability features of orthogonal drawings with the expressive power of matrix r…
Intersection-Link Representations of Graphs
Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista +3
We consider drawings of graphs that contain dense subgraphs. We introduce intersection-link representations for such graphs, in which each vertex is represented by a geometric…
Morphing Planar Graph Drawings Optimally
Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista +3
We provide an algorithm for computing a planar morph between any two planar straight-line drawings of any -vertex plane graph in morphing steps, thus improving upon the p…