96 citations · 329 across the 48 of their papers we have counts for
8 papers · 1 filter
Packing Trees into 1-planar Graphs
Felice De Luca, Emilio Di Giacomo, Seok-Hee Hong +6
We introduce and study the 1-planar packing problem: Given graphs with vertices , find a 1-planar graph that contains the given graphs as edge-disjoint spa…
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…
Simultaneous FPQ-Ordering and Hybrid Planarity Testing
Giuseppe Liotta, Ignaz Rutter, Alessandra Tappini
We study the interplay between embedding constrained planarity and hybrid planarity testing. We consider a constrained planarity testing problem, called 1-Fixed Constrained Planari…
On the edge-length ratio of 2-trees
Václav Blažej, Jiří Fiala, Giuseppe Liotta
We study planar straight-line drawings of graphs that minimize the ratio between the length of the longest and the shortest edge. We answer a question of Lazard et al. [Theor. Comp…
Simple -Planar Graphs are Simple -Quasiplanar
Patrizio Angelini, Michael A. Bekos, Franz J. Brandenburg +8
A simple topological graph is -quasiplanar () if it contains no pairwise crossing edges, and -planar if no edge is crossed more than times. In this paper, we…
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…
Sketched Representations and Orthogonal Planarity of Bounded Treewidth Graphs
Emilio Di Giacomo, Giuseppe Liotta, Fabrizio Montecchiani
Given a planar graph and an integer , OrthogonalPlanarity is the problem of deciding whether admits an orthogonal drawing with at most bends in total. We show that O…
Graph Planarity Testing with Hierarchical Embedding Constraints
Giuseppe Liotta, Ignaz Rutter, Alessandra Tappini
Hierarchical embedding constraints define a set of allowed cyclic orders for the edges incident to the vertices of a graph. These constraints are expressed in terms of FPQ-trees. F…