
Planar Straightline Realizations of 2Trees with Prescribed Edge Lengths
We study a classic problem introduced thirty years ago by Eades and Worm...
read it

On the Upward Book Thickness Problem: Combinatorial and Complexity Results
A longstanding conjecture by Heath, Pemmaraju, and Trenk states that th...
read it

Planar Drawings with Few Slopes of Halin Graphs and Nested Pseudotrees
The planar slope number psn(G) of a planar graph G is the minimum number...
read it

2Level QuasiPlanarity or How Caterpillars Climb (SPQR)Trees
Given a bipartite graph G=(V_b,V_r,E), the 2Level QuasiPlanarity probl...
read it

2Layer kPlanar Graphs: Density, Crossing Lemma, Relationships, and Pathwidth
The 2layer drawing model is a wellestablished paradigm to visualize bi...
read it

Planar LDrawings of Bimodal Graphs
In a planar Ldrawing of a directed graph (digraph) each edge e is repre...
read it

Book Embeddings of Nonplanar Graphs with Small Faces in Few Pages
An embedding of a graph in a book, called book embedding, consists of a ...
read it

On the Area Requirements of Planar Greedy Drawings of Triconnected Planar Graphs
In this paper we study the area requirements of planar greedy drawings o...
read it

CPlanarity Testing of Embedded Clustered Graphs with Bounded Dual CarvingWidth
For a clustered graph, i.e, a graph whose vertex set is recursively part...
read it

How to Morph a Tree on a Small Grid
In this paper we study planar morphs between straightline planar grid d...
read it

Simple kPlanar Graphs are Simple (k+1)Quasiplanar
A simple topological graph is kquasiplanar (k≥ 2) if it contains no k p...
read it

Graph Stories in Small Area
We study the problem of drawing a dynamic graph, where each vertex appea...
read it

Computing kModal Embeddings of Planar Digraphs
Given a planar digraph G and a positive even integer k, an embedding of ...
read it

Upward Book Embeddings of stGraphs
We study kpage upward book embeddings (kUBEs) of stgraphs, that is, bo...
read it

Morphing Contact Representations of Graphs
We consider the problem of morphing between contact representations of a...
read it

Extending Upward Planar Graph Drawings
In this paper we study the computational complexity of the Upward Planar...
read it

Upward Planar Morphs
We prove that, given two topologicallyequivalent upward planar straight...
read it

SubexponentialTime and FPT Algorithms for Embedded Flat Clustered Planarity
The CPlanarity problem asks for a drawing of a clustered graph, i.e., a...
read it

SquareContact Representations of Partial 2Trees and Triconnected SimplyNested Graphs
A squarecontact representation of a planar graph G=(V,E) maps vertices ...
read it

Analogies between the crossing number and the tangle crossing number
Tanglegrams are special graphs that consist of a pair of rooted binary t...
read it

Planar LDrawings of Directed Graphs
We study planar drawings of directed graphs in the Ldrawing standard. W...
read it
Giordano Da Lozzo
is this you? claim profile