
On Morphing 1Planar Drawings
Computing a morph between two drawings of a graph is a classical problem...
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

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

Parameterized Algorithms for Queue Layouts
An hqueue layout of a graph G consists of a linear order of its vertice...
read it

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

Grid Drawings of Graphs with Constant EdgeVertex Resolution
We study the algorithmic problem of computing drawings of graphs in whic...
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 Layered FanPlanar Graph Drawings
In this paper, we study fanplanar drawings that use h layers and are pr...
read it

An Experimental Study of a 1planarity Testing and Embedding Algorithm
The definition of 1planar graphs naturally extends graph planarity, nam...
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

Parameterized Algorithms for Book Embedding Problems
A kpage book embedding of a graph G draws the vertices of G on a line a...
read it

ChordLink: A New Hybrid Visualization Model
Many realworld networks are globally sparse but locally dense. Typical ...
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

Crossing Numbers of BeyondPlanar Graphs
We study the 1planar, quasiplanar, and fanplanar crossing number in c...
read it

Planar Graphs of Bounded Degree have Constant Queue Number
A queue layout of a graph consists of a linear order of its vertices and...
read it

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

Drawing Subcubic 1Planar Graphs with Few Bends, Few Slopes, and Large Angles
We show that the 1planar slope number of 3connected cubic 1planar gra...
read it

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

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

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

Geodesic Obstacle Representation of Graphs
An obstacle representation of a graph is a mapping of the vertices onto ...
read it

Gapplanar Graphs
We introduce the family of kgapplanar graphs for k ≥ 0, i.e., graphs t...
read it

3D Visibility Representations of 1planar Graphs
We prove that every 1planar graph G has a zparallel visibility represe...
read it
Fabrizio Montecchiani
is this you? claim profile