Giordano Da Lozzo

activity

20132026

k

-Planar Graphs are Simple

(k + 1)

-Quasiplanar

12 citations · 13 across the 8 of their papers we have counts for

collaborators

Showing cs.CGShow all

3 papers · 1 filter

cs.CG2024

The Price of Upwardness

Patrizio Angelini, Therese Biedl, Markus Chimani +8

Not every directed acyclic graph (DAG) whose underlying undirected graph is planar admits an upward planar drawing. We are interested in pushing the notion of upward drawings beyon…

cs.CG2019★ 12 cited

Simple $k$ -Planar Graphs are Simple $(k + 1)$ -Quasiplanar

Patrizio Angelini, Michael A. Bekos, Franz J. Brandenburg +8

A simple topological graph is $k$ -quasiplanar ( $k \geq 2$ ) if it contains no $k$ pairwise crossing edges, and $k$ -planar if no edge is crossed more than $k$ times. In this paper, we…

cs.CG2013★ 1 cited

Strip Planarity Testing of Embedded Planar Graphs

Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista +1

In this paper we introduce and study the strip planarity testing problem, which takes as an input a planar graph $G (V, E)$ and a function $γ : V \to {1, 2, \dots, k}$ and asks…

The Price of Upwardness

Simple k-Planar Graphs are Simple (k+1)-Quasiplanar

Strip Planarity Testing of Embedded Planar Graphs

Simple $k$ -Planar Graphs are Simple $(k + 1)$ -Quasiplanar