# Author: Giordano Da Lozzo

We consider drawings of graphs that contain dense subgraphs. We introduce intersection-link representations for such graphs, in which each vertex u is represented by a geometric object R(u) and in which each edge (u,v) is represented by the intersection between R(u) and R(v) if it belongs...

## Optimal Morphs of Convex Drawings

We give an algorithm to compute a morph between any two convex drawings of the same plane graph. The morph preserves the convexity of the drawing at any time instant and moves each vertex...

## Streamed Graphs

In this research we introduce a notion of planarity for graphs that are presented in a streaming fashion. A streamed graph is a stream of edges e1,e2,…,em on a vertex set V. A streamed graph is ω–stream planar with respect to a...

## Drawing Georeferenced Graphs – Combining Graph Drawing and Geographic Data

We consider the task of visually exploring relationships (such as established connections, similarity, reachability, etc) among a set of practical solution based on separating and then integrating back again the networked and geographical dimensions of the...

## Drawing Graphs on a Smartphone

We present a system for the visualization of information modeled in terms of a graph on a smartphone. First, we show the adopted visualization paradigm, that allows the user to navigate the graph using...

## Algorithms and Bounds for Drawing Non-planar Graphs with Crossing-free Subgraphs

We initiate the study of the following problem: Given a non-planar graph G and a planar subgraph S of G, does there exist a straight-line drawing Γ of G in the plane such that the edges of...

## On the Complexity of Clustered-Level Planarity and T-Level Planarity

In this work we study two problems related to the drawing of level graphs, that is, T-Level Planarity and Clustered-Level Planarity. We show that both problems are NP-complete in the general case and that they...

## Planar Embeddings with Small and Uniform Faces

Motivated by finding planar embeddings that lead to drawings with favorable aesthetics, we study the problems MINMAXFACE and UNIFORMFACES of embedding a given biconnected multi-graph such that the largest face is as small as...

## Relaxing the constraints of clustered planarity

In a drawing of a clustered graph vertices and edges are drawn as points and curves, respectively, while clusters are represented by simple closed regions. A drawing of a clustered graph is c-planar if...