96 citations · 329 across the 48 of their papers we have counts for
5 papers · 1 filter
Spirality and Rectilinear Planarity Testing of Independent-Parallel SP-Graphs
Walter Didimo, Michael Kaufmann, Giuseppe Liotta +1
We study the long-standing open problem of efficiently testing rectilinear planarity of series-parallel graphs (SP-graphs) in the variable embedding setting. A key ingredient behin…
Quasi-upward Planar Drawings with Minimum Curve Complexity
Carla Binucci, Emilio Di Giacomo, Giuseppe Liotta +1
This paper studies the problem of computing quasi-upward planar drawings of bimodal plane digraphs with minimum curve complexity, i.e., drawings such that the maximum number of ben…
Optimal-area visibility representations of outer-1-plane graphs
Therese Biedl, Giuseppe Liotta, Jayson Lynch +1
This paper studies optimal-area visibility representations of -vertex outer-1-plane graphs, i.e. graphs with a given embedding where all vertices are on the boundary of the oute…
Generalized LR-drawings of trees
Therese Biedl, Giuseppe Liotta, Jayson Lynch +1
The LR-drawing-method is a method of drawing an ordered rooted binary tree based on drawing one root-to-leaf path on a vertical line and attaching recursively obtained drawings of…
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^Δ)…