k-colored Point-set Embeddability of Outerplanar Graphs (2009)
Emilio Di, Giacomo Walter, Henk Meijer, Francesco Trotta, Stephen K. Wismath
This paper addresses the problem of designing drawing algorithms that receive as input a planar graph G, a partitioning of the vertices of G into k different semantic categories V0, · · · ,...
1 Introduction On Embedding a Graph on Two Sets of Points (2008)
Emilio Di, Liotta Francesco Trotta
Let S0, S1,..., Sk−1 be k sets of points such that the points of Si are colored with color i (i = 0,...,k−1).
Article Type Communicated by Submitted Revised (2008)
Emilio Di, Giacomo Walter, Henk Meijer
A radial drawing is a representation of a graph in which the vertices lie on concentric circles of finite radius. In this paper we study the problem of computing radial drawings of planar graphs by...
Matched Drawings of Planar Graphs ∗ (2008)
Emilio Di, Giacomo Walter Didimo, Marc Kreveld, Bettina Speckmann, Emilio Di, Giacomo Walter, ...
A natural way to draw two planar graphs whose vertex sets are matched is to assign each matched pair a unique y-coordinate. In this paper we introduce the concept of such matched drawings, which are...
Homothetic triangle contact representations of planar graphs (2007)
Melanie Badent, Carla Binucci, Emilio Di, Giacomo Walter, Didimo Stefan Felsner, Francesco Giordano, ...
In this paper we study the problem of computing homothetic triangle contact representations of planar graphs. Since not all planar graphs admit such a representation, we concentrate on meaningful...
Drawing Bipartite Graphs on Two Parallel Convex Curves (2006)
Let G be a bipartite graph, and let λe, λi be two parallel convex curves; we study the question about whether G admits a planar straight-line drawing such that the vertices of one partite set of G...