3 citations · 6 across the 9 of their papers we have counts for
12 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…
Cops and Robbers on 1-Planar Graphs
Stephane Durocher, Shahin Kamali, Myroslav Kryven +6
Cops and Robbers is a well-studied pursuit-evasion game in which a set of cops seeks to catch a robber in a graph G, where cops and robber move along edges of G. The cop number of…
An FPT Algorithm for Bipartite Vertex Splitting
Reyan Ahmed, Stephen Kobourov, Myroslav Kryven
Bipartite graphs model the relationship between two disjoint sets of objects. They have a wide range of applications and are often visualized as a 2-layered drawing, where each set…
The Segment Number: Algorithms and Universal Lower Bounds for Some Classes of Planar Graphs
Ina Goeßmann, Jonathan Klawitter, Boris Klemz +5
The segment number of a planar graph is the smallest number of line segments needed for a planar straight-line drawing of . Dujmović, Eppstein, Suderman, and Wood [CGTA'07]…
Drawing Graphs with Circular Arcs and Right-Angle Crossings
Steven Chaplick, Henry Förster, Myroslav Kryven +1
In a RAC drawing of a graph, vertices are represented by points in the plane, adjacent vertices are connected by line segments, and crossings must form right angles. Graphs that ad…
On Random Graph Properties
Hang Chen, Vahan Huroyan, Stephen Kobourov +1
We consider 15 properties of labeled random graphs that are of interest in the graph-theoretical and the graph mining literature, such as clustering coefficients, centrality measur…
On Arrangements of Orthogonal Circles
Steven Chaplick, Henry Förster, Myroslav Kryven +1
In this paper, we study arrangements of orthogonal circles, that is, arrangements of circles where every pair of circles must either be disjoint or intersect at a right angle. Usin…
Bundled Crossings Revisited
Steven Chaplick, Thomas C. van Dijk, Myroslav Kryven +3
An effective way to reduce clutter in a graph drawing that has (many) crossings is to group edges that travel in parallel into \emph{bundles}. Each edge can participate in many suc…
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…
Drawing Graphs on Few Circles and Few Spheres
Myroslav Kryven, Alexander Ravsky, Alexander Wolff
Given a drawing of a graph, its \emph{visual complexity} is defined as the number of geometrical entities in the drawing, for example, the number of segments in a straight-line dra…
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…
Integral equation approach for the numerical solution of a Robin problem for the Klein-Gordon equation in a doubly connected domain
Myroslav Kryven
In this paper we consider a Robin problem for the Klein-Gordon equation in a doubly connected domain. The solution domain considered is a bounded smooth doubly connected planar dom…