We prove that, given two topologically equivalent upward planar straight-line drawings of an $n$-vertex directed graph $G$, there …

A simple topological graph is $k$-quasiplanar ($k\geq 2$) if it contains no $k$ pairwise crossing edges, and $k$-planar if no edge is …

A graph drawing is *greedy* if, for every ordered pair of vertices $(x,y)$, there is a path from $x$ to $y$ such that the Euclidean …

In this paper we study the computational complexity of the *Upward Planarity Extension* problem, which takes in input an upward planar …

An embedding of a graph in a book, called *book embedding*, consists of a linear ordering of its vertices along the spine of the book and …

In this paper we settle the computational complexity of two open problems related to the extension of the notion of level planarity to …

Given a planar digraph $G$ and a positive even integer $k$, an embedding of $G$ in the plane is *$k$-modal*, if every vertex of $G$ is …

Given a graph $G$ and a pair $\langle e’,e’'\rangle$ of distinct edges of $G$, an *edge-edge addition on $\langle …*

In this paper, we study planar morphs between straight-line planar grid drawings of trees. A morph consists of a sequence of morphing …

In this paper we study the computational complexity of the *Upward Planarity Extension* problem, which takes in input an upward planar …

In this research we introduce a notion of planarity for graphs that are presented in a streaming fashion. A *streamed graph* is a stream …

In this paper we study the version of the *C-Planarity* problem in which edges connecting the same pair of clusters must be grouped into …

Tanglegrams are special graphs that consist of a pair of rooted binary trees with the same number of leaves, and a perfect matching …

In a paper first appeared at SODA ’04, Eppstein proved that testing the $3$-colorability of arrangements of line segments is an …

We prove that, given two topologically equivalent upward planar straight-line drawings of an $n$-vertex directed graph $G$, there …

Consider the following combinatorial problem$:$ Given a planar graph $G$ and a set of simple cycles $\mathcal C$ in $G$, find a planar …

Given a planar graph $G(V,E)$ and a partition of the neighbors of each vertex $v \in V$ in four sets $\overset{\nwarrow}{v}$, …

We introduce *L-drawings*, a novel paradigm for representing directed graphs aiming at combining the readability features of orthogonal …

A graph drawing is *greedy* if, for every ordered pair of vertices $(x,y)$, there is a path from $x$ to $y$ such that the Euclidean …

Given an $n$-vertex graph and two straight-line planar drawings of the graph that have the same faces and the same outer face, we show …

We study planar drawings of directed graphs in the L-drawing standard. We provide necessary conditions for the existence of these …

A simple topological graph is $k$-quasiplanar ($k\geq 2$) if it contains no $k$ pairwise crossing edges, and $k$-planar if no edge is …

A *square-contact representation* of a planar graph $G=(V,E)$ maps the vertices in $V$ to interior disjoint axis-aligned squares in the …

In this paper we introduce and study the *Strip Planarity Testing* problem, which takes as an input a planar graph $G(V,E)$ and a …

Given a planar graph $G(V,E)$ and a partition of the neighbors of each vertex $v \in V$ in four sets $\overset{\nwarrow}{v}$, …

We introduce and study the OrthoSEFE-$k$ problem$:$ Given~$k$ planar graphs each with maximum degree 4 and the same vertex set, is …

We introduce *L-drawings*, a novel paradigm for representing directed graphs aiming at combining the readability features of orthogonal …

In this paper we study the version of the *C-Planarity* problem in which edges connecting the same pair of clusters must be grouped into …

In this paper we settle the computational complexity of two open problems related to the extension of the notion of level planarity to …

The volume and the complexity of structured relational information created and handled by modern information systems has drastically …

PDF
Cite

In this research we introduce a notion of planarity for graphs that are presented in a streaming fashion. A *streamed graph* is a stream …

We consider the task of visually exploring relationships (such as established connections, similarity, reachability, etc) among a set …

In this paper we study two problems related to the drawing of level graphs, that is, *$T$-Level Planarity* and *Clustered-Level Planarity*. …

In a drawing of a clustered graph vertices and edges are drawn as points and curves, respectively, while clusters are represented by …

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 …*

In this work we investigate the complexity of some combinatorial problems related to the *Simultaneous Embedding with Fixed Edges* (SEFE) …

In this work we investigate the complexity of some combinatorial problems related to the *Simultaneous Embedding with Fixed Edges* (SEFE) …

We provide an algorithm for computing a planar morph between any two planar straight-line drawings of any $n$-vertex plane graph in …

In this paper we study two problems related to the drawing of level graphs, that is, *$T$-Level Planarity* and *Clustered-Level Planarity*. …

Motivated by finding planar embeddings that lead to drawings with favorable aesthetics, we study the problems MINMAXFACE and …

In this paper we study the *ANCHORED GRAPH DRAWING* (AGD) problem$:$ Given a planar graph $G$, an initial placement for its vertices, and …

In this paper we introduce and study the * strip planarity testing* problem, which takes as an input a planar graph $G(V,E)$ and a …

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 …*

All opinions expressed here are my own and do not necessarily represent those of any other agencies or groups. © 2021 Giordano Da Lozzo · Powered by the Academic theme for Hugo.