1 citations · 2 across the 17 of their papers we have counts for
5 papers · 1 filter
On the Upward Book Thickness Problem: Combinatorial and Complexity Results
Sujoy Bhore, Giordano Da Lozzo, Fabrizio Montecchiani +1
A long-standing conjecture by Heath, Pemmaraju, and Trenk states that the upward book thickness of outerplanar DAGs is bounded above by a constant. In this paper, we show that the…
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…
A User Study on Hybrid Graph Visualizations
Emilio Di Giacomo, Walter Didimo, Fabrizio Montecchiani +1
Hybrid visualizations mix different metaphors in a single layout of a network. In particular, the popular NodeTrix model, introduced by Henry, Fekete, and McGuffin in 2007, combine…
On Morphing 1-Planar Drawings
Patrizio Angelini, Michael A. Bekos, Fabrizio Montecchiani +1
Computing a morph between two drawings of a graph is a classical problem in computational geometry and graph drawing. While this problem has been widely studied in the context of p…
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…