Philipp Kindermann

activity

20242026

most citedDetermining Factorial Speed Fast

1 citations · 1 across the 6 of their papers we have counts for

collaborators

Showing 2024Show all

3 papers · 1 filter

cs.CG2024

Weakly Leveled Planarity with Bounded Span

Michael Bekos, Giordano Da Lozzo, Fabrizio Frati +5

This paper studies planar drawings of graphs in which each vertex is represented as a point along a sequence of horizontal lines, called levels, and each edge is either a horizonta…

cs.CG2024

On $k$ -Plane Insertion into Plane Drawings

Julia Katheder, Philipp Kindermann, Fabian Klute +2

We introduce the $k$ -Plane Insertion into Plane drawing ( $k$ -PIP) problem: given a plane drawing of a planar graph $G$ and a set $F$ of edges, insert the edges in $F$ into the draw…

cs.CG2024

Geometric Thickness of Multigraphs is $\exists R$ -complete

Henry FÃ¶rster, Philipp Kindermann, Tillmann Miltzow +3

We say that a (multi)graph $G = (V, E)$ has geometric thickness $t$ if there exists a straight-line drawing $I ¨ : V \to R^{2}$ and a $t$ -coloring of its edges where no…

Weakly Leveled Planarity with Bounded Span

On k-Plane Insertion into Plane Drawings

Geometric Thickness of Multigraphs is ∃R-complete

On $k$ -Plane Insertion into Plane Drawings

Geometric Thickness of Multigraphs is $\exists R$ -complete