3 citations · 5 across the 11 of their papers we have counts for
8 papers · 1 filter
Crossing-Optimal Extension of Simple Drawings
Robert Ganian, Thekla Hamm, Fabian Klute +2
In extension problems of partial graph drawings one is given an incomplete drawing of an input graph and is asked to complete the drawing while maintaining certain properties.…
Efficient Segment Folding is Hard
Takashi Horiyama, Fabian Klute, Matias Korman +3
We introduce a computational origami problem which we call the segment folding problem: given a set of line-segments in the plane the aim is to make creases along all segments…
Saturated -Plane Drawings with Few Edges
Fabian Klute, Irene Parada
A drawing of a graph is -plane if no edge is crossed more than times. In this paper we study saturated -plane drawings with few edges. This are -plane drawings in whic…
Extending Nearly Complete 1-Planar Drawings in Polynomial Time
Eduard Eiben, Robert Ganian, Thekla Hamm +2
The problem of extending partial geometric graph representations such as plane graphs has received considerable attention in recent years. In particular, given a graph , a conne…
Extending Partial 1-Planar Drawings
Eduard Eiben, Robert Ganian, Thekla Hamm +2
Algorithmic extension problems of partial graph representations such as planar graph drawings or geometric intersection representations are of growing interest in topological graph…
Four Pages Are Indeed Necessary for Planar Graphs
Michael A. Bekos, Michael Kaufmann, Fabian Klute +3
An embedding of a graph in a book consists of a linear order of its vertices along the spine of the book and of an assignment of its edges to the pages of the book, so that no two…
Finding large matchings in 1-planar graphs of minimum degree 3
Therese Biedl, Fabian Klute
A matching is a set of edges without common endpoint. It was recently shown that every 1-planar graph (i.e., a graph that can be drawn in the plane with at most one crossing per ed…
Balanced Independent and Dominating Sets on Colored Interval Graphs
Sujoy Bhore, Jan-Henrik Haunert, Fabian Klute +2
We study two new versions of independent and dominating set problems on vertex-colored interval graphs, namely -Balanced Independent Set (-BIS) and -Balanced Dominating Se…