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.DSShow all

3 papers · 1 filter

cs.DS2026

Upward Book Embeddings of Partitioned Digraphs

Giordano Da Lozzo, Fabrizio Frati, Ignaz Rutter

In 1999, Heath, Pemmaraju, and Trenk [SIAM J. Comput. 28(4), 1999] extended the classic notion of book embeddings to digraphs, introducing the concept of upward book embeddings, in…

cs.DS2024

Grandchildren-weight-balanced binary search trees

Vincent Jugé

We revisit weight-balanced trees, also known as trees of bounded balance. This class of binary search trees was invented by Nievergelt and Reingold in 1972. Such trees are obtained…

cs.DS2020

2-Level Quasi-Planarity or How Caterpillars Climb (SPQR-)Trees

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

Given a bipartite graph $G = (V_{b}, V_{r}, E)$ , the $2$ -Level Quasi-Planarity problem asks for the existence of a drawing of $G$ in the plane such that the vertices in $V_{b}$ and in $V_{r}$ …