1 citations · 2 across the 3 of their papers we have counts for
Showing 2014Show all
3 papers · 1 filter
cs.DM2014★ 1 cited
Counting K_4-Subdivisions
Tillmann Miltzow, Jens M. Schmidt, Mingji Xia
A fundamental theorem in graph theory states that any 3-connected graph contains a subdivision of . As a generalization, we ask for the minimum number of -subdivisions th…
cs.CG2014★ 1 cited
Halving Balls in Deterministic Linear Time
Michael Hoffmann, Vincent Kusters, Tillmann Miltzow
Let $\D$ be a set of pairwise disjoint unit balls in and the set of their center points. A hyperplane $\Hy$ is an \emph{-separator} for $\D$ if each closed halfsp…
math.CO2014
Disjoint compatibility graph of non-crossing matchings of points in convex position
Oswin Aichholzer, Andrei Asinowski, Tillmann Miltzow
Let be a set of labeled points in convex position in the plane. We consider geometric non-intersecting straight-line perfect matchings of . Two such matchings…