1 citations · 1 across the 6 of their papers we have counts for
5 papers · 1 filter
Parameterized Approaches to Orthogonal Compaction
Walter Didimo, Siddharth Gupta, Philipp Kindermann +3
Orthogonal graph drawings are used in applications such as UML diagrams, VLSI layout, cable plans, and metro maps. We focus on drawing planar graphs and assume that we are given an…
Three Edge-disjoint Plane Spanning Paths in a Point Set
Philipp Kindermann, Jan KratochvÃl, Giuseppe Liotta +1
We consider the following problem: Given a set of distinct points in the plane, how many edge-disjoint plane straight-line spanning paths can be drawn on ? Each spanning…
Rectangular Duals on the Cylinder and the Torus
Therese Biedl, Philipp Kindermann, Jonathan Klawitter
A rectangular dual of a plane graph is a contact representation of by interior-disjoint rectangles such that (i) no four rectangles share a point, and (ii) the union of all…
Saturated Drawings of Geometric Thickness k
Patricia Bachmann, Anna Brötzner, Miriam Goetze +3
We investigate saturated geometric drawings of graphs with geometric thickness , where no edge can be added without increasing . We establish lower and upper bounds on the nu…
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…