Wolfgang Mulzer

activity

20122016

most citedInterference Minimization in Asymmetric Sensor Networks

2 citations · 2 across the 4 of their papers we have counts for

collaborators

4 papers

cs.CG2016

The Rainbow at the End of the Line --- A PPAD Formulation of the Colorful Carathéodory Theorem with Applications

Frédéric Meunier, Wolfgang Mulzer, Pauline Sarrabezolles +1

Let $C_{1}, ..., C_{d + 1}$ be $d + 1$ point sets in $R^{d}$ , each containing the origin in its convex hull. A subset $C$ of $⋃_{i = 1}^{d + 1} C_{i}$ is called a colorful choice (o…

cs.CG2014

Approximate k-flat Nearest Neighbor Search

Wolfgang Mulzer, Huy L. Nguyen, Paul Seiferth +1

Let $k$ be a nonnegative integer. In the approximate $k$ -flat nearest neighbor ( $k$ -ANN) problem, we are given a set $P \subset R^{d}$ of $n$ points in $d$ -dimensional space…

cs.CG2014★ 2 cited

Interference Minimization in Asymmetric Sensor Networks

Yves Brise, Kevin Buchin, Dustin Eversmann +2

A fundamental problem in wireless sensor networks is to connect a given set of sensors while minimizing the \emph{receiver interference}. This is modeled as follows: each sensor no…

cs.CG2012

A Lower Bound for Shallow Partitions

Wolfgang Mulzer, Daniel Werner

Let P be a planar n-point set. A k-partition of P is a subdivision of P into n/k parts of roughly equal size and a sequence of triangles such that each part is contained in a trian…