W. Mulzer

activity

20132025

most citedThe Tree Stabbing Number is not Monotone

1 citations · 3 across the 8 of their papers we have counts for

collaborators

Showing 2020Show all

5 papers · 1 filter

cs.CG2020

A Simple Randomized $O (n lo g n)$ --Time Closest-Pair Algorithm in Doubling Metrics

Anil Maheshwari, Wolfgang Mulzer, Michiel Smid

Consider a metric space $(P, d i s t)$ with $N$ points whose doubling dimension is a constant. We present a simple, randomized, and recursive algorithm that computes, in $O (N lo g N)$ …

cs.CG2020

Long Alternating Paths Exist

Wolfgang Mulzer, Pavel Valtr

Let $P$ be a set of $2 n$ points in convex position, such that $n$ points are colored red and $n$ points are colored blue. A non-crossing alternating path on $P$ of length $ℓ$ is…

cs.CG2020

Computational Complexity of the $α$ -Ham-Sandwich Problem

Man-Kwun Chiu, Aruni Choudhary, Wolfgang Mulzer

The classic Ham-Sandwich theorem states that for any $d$ measurable sets in $R^{d}$ , there is a hyperplane that bisects them simultaneously. An extension by Bárány, Hubard,…

cs.CG2020★ 1 cited

Routing in Unit Disk Graphs without Dynamic Headers

Wolfgang Mulzer, Max Willert

Let $V \subset R^{2}$ be a set of $n$ sites in the plane. The unit disk graph $D G (V)$ of $V$ is the graph with vertex set $V$ in which two sites $v$ and $w$ are adjacent if an…

cs.CG2020★ 1 cited

The Tree Stabbing Number is not Monotone

Wolfgang Mulzer, Johannes Obenaus

Let $P \subseteq R^{2}$ be a set of points and $T$ be a spanning tree of $P$ . The \emph{stabbing number} of $T$ is the maximum number of intersections any line in the plane…

A Simple Randomized O(nlogn)--Time Closest-Pair Algorithm in Doubling Metrics

Long Alternating Paths Exist

Computational Complexity of the α-Ham-Sandwich Problem

Routing in Unit Disk Graphs without Dynamic Headers

The Tree Stabbing Number is not Monotone

A Simple Randomized $O (n lo g n)$ --Time Closest-Pair Algorithm in Doubling Metrics

Computational Complexity of the $α$ -Ham-Sandwich Problem