23 citations · 158 across the 42 of their papers we have counts for
3 papers · 1 filter
Colored Non-Crossing Euclidean Steiner Forest
Sergey Bereg, Krzysztof Fleszar, Philipp Kindermann +3
Given a set of -colored points in the plane, we consider the problem of finding trees such that each tree connects all points of one color class, no two trees cross, and the…
Pixel and Voxel Representations of Graphs
Muhammad Jawaherul Alam, Thomas Bläsius, Ignaz Rutter +2
We study contact representations for graphs, which we call pixel representations in 2D and voxel representations in 3D. Our representations are based on the unit square grid whose…
On Monotone Drawings of Trees
Philipp Kindermann, André Schulz, Joachim Spoerhase +1
A crossing-free straight-line drawing of a graph is monotone if there is a monotone path between any pair of vertices with respect to some direction. We show how to construct a mon…