8 citations · 24 across the 31 of their papers we have counts for
39 papers
The Minimum Dominating Set Problem on Bipartite Circle Graphs: Complexity and Approximation
A. Karim Abu-Affash, Paz Carmi, Joseph S. B. Mitchell
A circle graph is the intersection graph of a set of chords in a circle. A dominating set of a graph is a subset such that every vertex in i…
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 Diametral Disks Induced by Edges of Maximum Spanning Tree
A. Karim Abu-Affash, Paz Carmi, Meytal Maman
Let be a set of points in the plane and let be a maximum-weight spanning tree of . For an edge , let be the diametral disk induced by , i.e., the…
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…
Grids have Unbounded Anagram-Free Chromatic Number
Saman Bazarghani, Paz Carmi, Vida Dujmović +1
We show that anagram-free vertex colouring a square grid requires a number of colours that increases with . This answers an open question in Wilson's thesis and show…