
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

Generalized LRdrawings of trees
The LRdrawingmethod is a method of drawing an ordered rooted binary tr...
read it

VAIM: Visual Analytics for Influence Maximization
In social networks, individuals' decisions are strongly influenced by re...
read it

Storyline Visualizations with Ubiquitous Actors
Storyline visualizations depict the temporal dynamics of social interact...
read it

Rectilinear Planarity Testing of Plane SeriesParallel Graphs in Linear Time
A plane graph is rectilinear planar if it admits an embeddingpreserving...
read it

Packing Trees into 1planar Graphs
We introduce and study the 1planar packing problem: Given k graphs with...
read it

Optimal Orthogonal Drawings of Planar 3Graphs in Linear Time
A planar orthogonal drawing Γ of a planar graph G is a geometric represe...
read it

Simultaneous FPQOrdering and Hybrid Planarity Testing
We study the interplay between embedding constrained planarity and hybri...
read it

On the edgelength ratio of 2trees
We study planar straightline drawings of graphs that minimize the ratio...
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

The QuaSEFE Problem
We initiate the study of Simultaneous Graph Embedding with Fixed Edges i...
read it

Sketched Representations and Orthogonal Planarity of Bounded Treewidth Graphs
Given a planar graph G and an integer b, OrthogonalPlanarity is the prob...
read it

Graph Planarity Testing with Hierarchical Embedding Constraints
Hierarchical embedding constraints define a set of allowed cyclic orders...
read it

Polyline Drawings with Topological Constraints
Let G be a simple topological graph and let Γ be a polyline drawing of G...
read it

Turning Cliques into Paths to Achieve Planarity
Motivated by hybrid graph representations, we introduce and study the fo...
read it

Orthopolygon Visibility Representations of 3connected 1plane Graphs
An orthopolygon visibility representation Γ of a 1plane graph G (OPVR ...
read it

(k,p)Planarity: A Relaxation of Hybrid Planarity
We present a new model for hybrid planarity that relaxes existing hybrid...
read it

(k,p)Planarity: A Generalization of Hybrid Planarity
A graph G is (k,p)planar if its vertices can be partitioned into cluste...
read it

A Survey on Graph Drawing Beyond Planarity
Graph Drawing Beyond Planarity is a rapidly growing research area that c...
read it

Efficient Algorithms for Bendminimum Orthogonal Drawings of Planar 3Graphs
Let G be a planar 3graph (i.e., a planar graph with vertex degree at mo...
read it

Universal Slope Sets for Upward Planar Drawings
We prove that every set S of Δ slopes containing the horizontal slope i...
read it

On the Edgelength Ratio of Outerplanar Graphs
We show that any outerplanar graph admits a planar straightline drawing ...
read it

Colored Pointset Embeddings of Acyclic Graphs
We show that any planar drawing of a forest of three stars whose vertice...
read it

Beyond Outerplanarity
We study straightline drawings of graphs where the vertices are placed ...
read it
Giuseppe Liotta
is this you? claim profile