1 citations · 1 across the 4 of their papers we have counts for
4 papers
Geometric Spanning Trees Minimizing the Wiener Index
A. Karim Abu-Affash, Paz Carmi, Ori Luwisch +1
The Wiener index of a network, introduced by the chemist Harry Wiener, is the sum of distances between all pairs of nodes in the network. This index, originally used in chemical gr…
Dynamic Euclidean Bottleneck Matching
A. Karim Abu-Affash, Sujoy Bhore, Paz Carmi
A fundamental question in computational geometry is for a set of input points in the Euclidean space, that is subject to discrete changes (insertion/deletion of points at each time…
Piercing Pairwise Intersecting Geodesic Disks by Five Points
A. Karim Abu-Affash, Paz Carmi, Meytal Maman
Given a simple polygon on vertices, and a set of pairwise intersecting geodesic disks in , we show that five points in are always sufficient to pierce all th…
Bottleneck Non-Crossing Matching in the Plane
A. Karim Abu-Affash, Paz Carmi, Matthew J. Katz +1
Let be a set of points in the plane, and let (resp., ) denote a bottleneck matching (resp., a bottleneck non-crossing matching) of . We study th…