38 citations · 46 across the 12 of their papers we have counts for
14 papers
Stack and Queue Layouts with Defects
Michael A. Bekos, Carla Binucci, Emilio Di Giacomo +5
Linear layouts of graphs -- particularly \emph{stack} and \emph{queue} layouts -- are well-established types of representations in graph drawing, thanks to their connection with nu…
Minimum Monotone Spanning Trees
Emilio Di Giacomo, Walter Didimo, Eleni Katsanou +3
Given a finite set of points in the plane and a finite set of directions, a geometric spanning tree~ of~ is -monotone if every path in is m…
On 1-bend Upward Point-set Embeddings of -digraphs
Emilio Di Giacomo, Henry Förster, Daria Kokhovich +4
We study the upward point-set embeddability of digraphs on one-sided convex point sets with at most 1 bend per edge. We provide an algorithm to compute a 1-bend upward point-set em…
On the Parameterized Complexity of Bend-Minimum Orthogonal Planarity
Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta +2
Computing planar orthogonal drawings with the minimum number of bends is one of the most relevant topics in Graph Drawing. The problem is known to be NP-hard, even when we want to…
-planar Placement and Packing of -regular Caterpillars
Carla Binucci, Emilio Di Giacomo, Michael Kaufmann +2
This paper studies a \emph{packing} problem in the so-called beyond-planar setting, that is when the host graph is ``almost-planar'' in some sense. Precisely, we consider the case…
On the Complexity of the Storyplan Problem
Carla Binucci, Emilio Di Giacomo, William J. Lenhart +4
Motivated by dynamic graph visualization, we study the problem of representing a graph in the form of a \emph{storyplan}, that is, a sequence of frames with the following prope…
Testing Upward Planarity of Partial -Trees
Steven Chaplick, Emilio Di Giacomo, Fabrizio Frati +3
We present an -time algorithm to test whether an -vertex directed partial -tree is upward planar. This result improves upon the previously best known algorithm, which…
Planar Drawings with Few Slopes of Halin Graphs and Nested Pseudotrees
Steven Chaplick, Giordano Da Lozzo, Emilio Di Giacomo +2
The of a planar graph is the minimum number of edge slopes in a planar straight-line drawing of . It is known that $psn(G) \in O(c^Δ)…
Edge Partitions of Optimal -plane and -plane Graphs
Michael Bekos, Emilio Di Giacomo, Walter Didimo +3
A topological graph is a graph drawn in the plane. A topological graph is -plane, , if each edge is crossed at most times. We study the problem of partitioning the edge…
NodeTrix Planarity Testing with Small Clusters
Emilio Di Giacomo, Giuseppe Liotta, Maurizio Patrignani +2
We study the NodeTrix planarity testing problem for flat clustered graphs when the maximum size of each cluster is bounded by a constant . We consider both the case when the sid…
Visibility Representations of Boxes in 2.5 Dimensions
Alessio Arleo, Carla Binucci, Emilio Di Giacomo +7
We initiate the study of 2.5D box visibility representations (2.5D-BR) where vertices are mapped to 3D boxes having the bottom face in the plane and edges are unobstructed li…
1-bend Upward Planar Drawings of SP-digraphs
Emilio Di Giacomo, Giuseppe Liotta, Fabrizio Montecchiani
It is proved that every series-parallel digraph whose maximum vertex-degree is admits an upward planar drawing with at most one bend per edge such that each edge segment has on…
Ortho-polygon Visibility Representations of Embedded Graphs
Emilio Di Giacomo, Walter Didimo, William S. Evans +4
An ortho-polygon visibility representation of an -vertex embedded graph (OPVR of ) is an embedding-preserving drawing of that maps every vertex to a distinct orthogon…
Properties and Complexity of Fan-Planarity
Carla Binucci, Emilio Di Giacomo, Walter Didimo +3
In a \emph{fan-planar drawing} of a graph an edge can cross only edges with a common end-vertex. Fan-planar drawings have been recently introduced by Kaufmann and Ueckerdt, who pro…