Wolfgang Mulzer

activity

20122022

most citedInterference Minimization in Asymmetric Sensor Networks

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

collaborators

Showing cs.CGShow all

6 papers · 1 filter

cs.CG2022

Nearest-Neighbor Decompositions of Drawings

Jonas Cleve, Nicolas Grelier, Kristin Knorr +3

Let $D$ be a set of straight-line segments in the plane, potentially crossing, and let $c$ be a positive integer. We denote by $P$ the union of the endpoints of the strai…

cs.CG2022

Unique Sink Orientations of Grids is in Unique End of Potential Line

Michaela Borzechowski, Wolfgang Mulzer

The complexity classes Unique End of Potential Line (UEOPL) and its promise version PUEOPL were introduced in 2018 by Fearnly et al. UEOPL captures search problems where the instan…

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…