8 citations · 37 across the 25 of their papers we have counts for
14 papers · 1 filter
Product Structure Meets Track Layouts
Michael A. Bekos, Giordano Da Lozzo, Petr Hliněný +1
A track layout of a graph is a partition of its vertices into linearly ordered independent sets, called tracks, such that no two edges between the same pair of tracks cross. Given…
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…
Quantum Graph Drawing
Susanna Caroppo, Giordano Da Lozzo, Giuseppe Di Battista
In this paper, we initiate the study of quantum algorithms in the Graph Drawing research area. We focus on two foundational drawing standards: 2-level drawings and book layouts. Co…
Recognizing Map Graphs of Bounded Treewidth
Patrizio Angelini, Michael A. Bekos, Giordano Da Lozzo +3
A map graph is a graph admitting a representation in which vertices are nations on a spherical map and edges are shared curve segments or points between nations. We present an expl…
On Upward-Planar L-Drawings of Graphs
Patrizio Angelini, Steven Chaplick, Sabine Cornelsen +1
In an upward-planar L-drawing of a directed acyclic graph (DAG) each edge is represented as a polyline composed of a vertical segment with its lowest endpoint at the tail of $e…
C-Planarity Testing of Embedded Clustered Graphs with Bounded Dual Carving-Width
Giordano Da Lozzo, David Eppstein, Michael T. Goodrich +1
For a clustered graph, i.e, a graph whose vertex set is recursively partitioned into clusters, the C-Planarity Testing problem asks whether it is possible to find a planar embeddin…
Clustered Planarity with Pipes
Patrizio Angelini, Giordano Da Lozzo
We study the version of the C-Planarity problem in which edges connecting the same pair of clusters must be grouped into pipes, which generalizes the Strip Planarity problem. We gi…
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…
Planarity of Streamed Graphs
Giordano Da Lozzo, Ignaz Rutter
In this paper we introduce a notion of planarity for graphs that are presented in a streaming fashion. A is a stream of edges on a verte…
On the Complexity of Clustered-Level Planarity and T-Level Planarity
Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista +2
In this paper we study two problems related to the drawing of level graphs, that is, T-LEVEL PLANARITY and CLUSTERED-LEVEL PLANARITY. We show that both problems are NP-complete in…
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…