1 citations · 1 across the 7 of their papers we have counts for
7 papers
On Planar Straight-Line Dominance Drawings
Patrizio Angelini, Michael A. Bekos, Giuseppe Di Battista +3
We study the following question, which has been considered since the 90's: Does every -planar graph admit a planar straight-line dominance drawing? We show concrete evidence fo…
Quantum Speedups for Polynomial-Time Dynamic Programming Algorithms
Susanna Caroppo, Giordano Da Lozzo, Giuseppe Di Battista +2
We introduce a quantum dynamic programming framework that allows us to directly extend to the quantum realm a large body of classical dynamic programming algorithms. The correspond…
Unit Edge-Length Rectilinear Drawings with Crossings and Rectangular Faces
Patrizio Angelini, Carla Binucci, Giuseppe Di Battista +5
Unit edge-length drawings, rectilinear drawings (where each edge is either a horizontal or a vertical segment), and rectangular face drawings are among the most studied subjects in…
Ranking and Unranking of the Planar Embeddings of a Planar Graph
Giuseppe Di Battista, Fabrizio Grosso, Giulia Maragno +1
Let be the set of all the planar embeddings of a (not necessarily connected) -vertex graph . We present a bijection from to the natural number…
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…
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 …