40 citations · 190 across the 39 of their papers we have counts for
Showing 2008Show all
3 papers · 1 filter
cs.CG2008★ 4 cited
Delaunay Triangulations in Linear Time? (Part I)
Kevin Buchin
We present a new and simple randomized algorithm for constructing the Delaunay triangulation using nearest neighbor graphs for point location. Under suitable assumptions, it runs i…
cs.CG2008★ 13 cited
Drawing (Complete) Binary Tanglegrams: Hardness, Approximation, Fixed-Parameter Tractability
Kevin Buchin, Maike Buchin, Jaroslaw Byrka +4
A \emph{binary tanglegram} is a drawing of a pair of rooted binary trees whose leaf sets are in one-to-one correspondence; matching leaves are connected by inter-tree edges. For ap…
cs.NI2008★ 40 cited
Minimizing the Maximum Interference is Hard
Kevin Buchin
We consider the following interference model for wireless sensor and ad hoc networks: the receiver interference of a node is the number of transmission ranges it lies in. We model…