3 citations · 6 across the 9 of their papers we have counts for
3 papers · 1 filter
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…
Planar Steiner Orientation is NP-complete
Moritz Beck, Johannes Blum, Myroslav Kryven +2
Many applications in graph theory are motivated by routing or flow problems. Among these problems is Steiner Orientation: given a mixed graph G (having directed and undirected edge…
Beyond Outerplanarity
Steven Chaplick, Myroslav Kryven, Giuseppe Liotta +2
We study straight-line drawings of graphs where the vertices are placed in convex position in the plane, i.e., \emph{convex drawings}. We consider two families of graph classes wit…