7 papers
Bounding the Treewidth of Outer -Planar Graphs via Triangulations
Oksana Firman, Grzegorz Gutowski, Myroslav Kryven +2
The treewidth is a structural parameter that measures the tree-likeness of a graph. Many algorithmic and combinatorial results are expressed in terms of the treewidth. In this pape…
Deciding the Feasibility and Minimizing the Height of Tangles
Oksana Firman, Philipp Kindermann, Boris Klemz +3
We study the following combinatorial problem. Given a set of y-monotone \emph{wires}, a \emph{tangle} determines the order of the wires on a number of horizontal \emph{layers}…
Morphing Graph Drawings in the Presence of Point Obstacles
Oksana Firman, Tim Hegemann, Boris Klemz +4
A crossing-free morph is a continuous deformation between two graph drawings that preserves straight-line pairwise noncrossing edges. Motivated by applications in 3D morphing probl…
Outerplanar and Forest Storyplans
Jiří Fiala, Oksana Firman, Giuseppe Liotta +2
We study the problem of gradually representing a complex graph as a sequence of drawings of small subgraphs whose union is the complex graph. The sequence of drawings is called \em…
Outside-Obstacle Representations with All Vertices on the Outer Face
Oksana Firman, Philipp Kindermann, Jonathan Klawitter +3
An obstacle representation of a graph consists of a set of polygonal obstacles and a drawing of as a visibility graph with respect to the obstacles: vertices are mapped to…
The Complexity of Finding Tangles
Oksana Firman, Philipp Kindermann, Boris Klemz +3
We study the following combinatorial problem. Given a set of y-monotone curves, which we call wires, a tangle determines the order of the wires on a number of horizontal layers…
Computing Height-Optimal Tangles Faster
Oksana Firman, Philipp Kindermann, Alexander Ravsky +2
We study the following combinatorial problem. Given a set of y-monotone wires, a tangle determines the order of the wires on a number of horizontal layers such that the orders…