46 citations · 166 across the 16 of their papers we have counts for
3 papers · 1 filter
Most vital segment barriers
Irina Kostitsyna, Maarten Löffler, Valentin Polishchuk +1
We study continuous analogues of "vitality" for discrete network flows/paths, and consider problems related to placing segment barriers that have highest impact on a flow/path in a…
Euclidean TSP, Motorcycle Graphs, and Other New Applications of Nearest-Neighbor Chains
Nil Mamano, Alon Efrat, David Eppstein +5
We show new applications of the nearest-neighbor chain algorithm, a technique that originated in agglomerative hierarchical clustering. We apply it to a diverse class of geometric…
Geometric secluded paths and planar satisfiability
Kevin Buchin, Valentin Polishchuk, Leonid Sedov +1
We consider paths with low \emph{exposure} to a 2D polygonal domain, i.e., paths which are seen as little as possible; we differentiate between \emph{integral} exposure (when we ca…