18 papers · 1 filter
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…
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…
Parameterized Algorithms for Queue Layouts
Sujoy Bhore, Robert Ganian, Fabrizio Montecchiani +1
An -queue layout of a graph consists of a linear order of its vertices and a partition of its edges into queues, such that no two independent edges of the same queue nes…
On Layered Fan-Planar Graph Drawings
Therese Biedl, Steven Chaplick, Jiři Fiala +4
In this paper, we study fan-planar drawings that use layers and are proper, i.e., edges connect adjacent layers. We show that if the embedding of the graph is fixed, then testi…
An Experimental Study of a 1-planarity Testing and Embedding Algorithm
Carla Binucci, Walter Didimo, Fabrizio Montecchiani
The definition of -planar graphs naturally extends graph planarity, namely a graph is -planar if it can be drawn in the plane with at most one crossing per edge. Unfortunatel…