1 citations · 1 across the 3 of their papers we have counts for
4 papers · 1 filter
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…