PhD Informatica e Automazione
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...
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...
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...