Optimization schemes for protective jamming S Sankararaman, K Abu-Affash, A Efrat, SD Eriksson-Bique, V Polishchuk, ... Proceedings of the thirteenth ACM international symposium on Mobile Ad Hoc …, 2012 | 51 | 2012 |

Bottleneck non-crossing matching in the plane AK Abu-Affash, P Carmi, MJ Katz, Y Trabelsi Computational Geometry 47 (3), 447-457, 2014 | 29 | 2014 |

Multi cover of a polygon minimizing the sum of areas AK Abu-Affash, P Carmi, MJ Katz, G Morgenstern International Journal of Computational Geometry & Applications 21 (06), 685-698, 2011 | 24 | 2011 |

Improved bounds on the average distance to the Fermat–Weber center of a convex object AK Abu-Affash, MJ Katz Information Processing Letters 109 (6), 329-333, 2009 | 18 | 2009 |

Approximating the bottleneck plane perfect matching of a point set AK Abu-Affash, A Biniaz, P Carmi, A Maheshwari, M Smid Computational Geometry 48 (9), 718-731, 2015 | 17 | 2015 |

The Euclidean bottleneck Steiner path problem and other applications of (α, β)-pair decomposition AK Abu-Affash, P Carmi, MJ Katz, M Segal Discrete & Computational Geometry 51 (1), 1-23, 2014 | 17* | 2014 |

Minimum power energy spanners in wireless ad hoc networks AK Abu-Affash, R Aschner, P Carmi, MJ Katz Wireless Networks 17 (5), 1251-1258, 2011 | 16 | 2011 |

Dual power assignment via second hamiltonian cycle AK Abu-Affash, P Carmi, AP Tzur Journal of Computer and System Sciences 93, 41-53, 2018 | 11* | 2018 |

The Euclidean bottleneck full Steiner tree problem AK Abu-Affash Algorithmica 71, 139-151, 2015 | 11* | 2015 |

Bottleneck Steiner tree with bounded number of Steiner vertices AK Abu-Affash, P Carmi, MJ Katz Journal of Discrete Algorithms 30, 96-100, 2015 | 6* | 2015 |

The MST of symmetric disk graphs is light AK Abu-Affash, R Aschner, P Carmi, MJ Katz Scandinavian Workshop on Algorithm Theory, 236-247, 2010 | 6 | 2010 |

Minimizing total interference in asymmetric sensor networks AK Abu-Affash, P Carmi, MJ Katz Theoretical Computer Science 889, 171--181, 2021 | 2 | 2021 |

Monochromatic plane matchings in bicolored point set AK Abu-Affash, S Bhore, P Carmi Information Processing Letters 153, 105860, 2020 | 2 | 2020 |

Bottleneck bichromatic full Steiner trees AK Abu-Affash, S Bhore, P Carmi, D Chakraborty Information Processing Letters 142, 14-19, 2019 | 2 | 2019 |

δ-Greedy t-spanner AK Abu-Affash, G Bar-On, P Carmi Computational Geometry 100, 101807, 2022 | 1 | 2022 |

Piercing pairwise intersecting geodesic disks by five points AK Abu-Affash, P Carmi, M Maman Computational Geometry 109, 101947, 2023 | | 2023 |

A linear-time algorithm for minimum k-hop dominating set of a cactus graph AK Abu-Affash, P Carmi, A Krasin Discrete Applied Mathematics 320, 488-499, 2022 | | 2022 |

Piercing Diametral Disks Induced by Edges of Maximum Spanning Tree AK Abu-Affash, P Carmi, M Maman arXiv preprint arXiv:2209.11260, 2022 | | 2022 |

Approximating Maximum Diameter-Bounded Subgraph in Unit Disk Graphs AK Abu-Affash, PA Carmi, A Maheshwari, P Morin, M Smid, ... Discrete and Computational Geometry 66 (4), 1401--1414, 2021 | | 2021 |

Planar bichromatic bottleneck spanning trees AK Abu-Affash, S Bhore, P Carmi, JSB Mitchell Journal of Computational Geometry 12 (1), 109--127, 2021 | | 2021 |