A. Karim Abu-Affash

Publication Activity (10 Years)

Years Active: 2008-2024
Publications (10 Years): 29

Top Topics

Minimum Total Cost

Top Venues

Theor. Comput. Sci.

Publications

A. Karim Abu-Affash, Sujoy Bhore, Paz Carmi
Dynamic Euclidean bottleneck matching. Theor. Comput. Sci. 1013 (2024)
A. Karim Abu-Affash, Paz Carmi, Meytal Maman
Piercing pairwise intersecting geodesic disks by five points. Comput. Geom. 109 (2023)
A. Karim Abu-Affash, Sujoy Bhore, Paz Carmi
Dynamic Euclidean Bottleneck Matching. CoRR (2023)
A. Karim Abu-Affash, Paz Carmi, Ori Luwisch, Joseph S. B. Mitchell
Geometric Spanning Trees Minimizing the Wiener Index. WADS (2023)
A. Karim Abu-Affash, Paz Carmi, Ori Luwisch, Joseph S. B. Mitchell
Geometric Spanning Trees Minimizing the Wiener Index. CoRR (2023)
A. Karim Abu-Affash, Paz Carmi, Meytal Maman
Piercing Diametral Disks Induced by Edges of Maximum Spanning Trees. WALCOM (2023)
A. Karim Abu-Affash, Gali Bar-On, Paz Carmi
-spanner. Comput. Geom. 100 (2022)
A. Karim Abu-Affash, Paz Carmi, Adi Krasin
A linear-time algorithm for minimum k-hop dominating set of a cactus graph. Discret. Appl. Math. 320 (2022)
A. Karim Abu-Affash, Paz Carmi, Meytal Maman
Piercing Diametral Disks Induced by Edges of Maximum Spanning Tree. CoRR (2022)
A. Karim Abu-Affash, Paz Carmi, Meytal Maman
Piercing Pairwise Intersecting Geodesic Disks by Five Points. CoRR (2021)
A. Karim Abu-Affash, Paz Carmi, Matthew J. Katz
Minimizing total interference in asymmetric sensor networks. Theor. Comput. Sci. 889 (2021)
A. Karim Abu-Affash, Sujoy Bhore, Paz Carmi, Joseph S. B. Mitchell
Planar bichromatic bottleneck spanning trees. J. Comput. Geom. 12 (1) (2021)
A. Karim Abu-Affash, Paz Carmi, Anil Maheshwari, Pat Morin, Michiel Smid, Shakhar Smorodinsky
Approximating Maximum Diameter-Bounded Subgraph in Unit Disk Graphs. Discret. Comput. Geom. 66 (4) (2021)
A. Karim Abu-Affash, Sujoy Bhore, Paz Carmi, Joseph S. B. Mitchell
Planar Bichromatic Bottleneck Spanning Trees. ESA (2020)
A. Karim Abu-Affash, Paz Carmi, Matthew J. Katz
Minimizing Total Interference in Asymmetric Sensor Networks. ALGOSENSORS (2020)
A. Karim Abu-Affash, Paz Carmi, Adi Krasin
A Linear-Time Algorithm for Minimum k-Hop Dominating Set of a Cactus Graph. CoRR (2020)
A. Karim Abu-Affash, Sujoy Bhore, Paz Carmi
Monochromatic plane matchings in bicolored point set. Inf. Process. Lett. 153 (2020)
A. Karim Abu-Affash, Sujoy Bhore, Paz Carmi, Joseph S. B. Mitchell
Planar Bichromatic Bottleneck Spanning Trees. CoRR (2020)
A. Karim Abu-Affash, Paz Carmi, Matthew J. Katz
Minimizing Total Interference in Asymmetric Sensor Networks. CoRR (2020)
A. Karim Abu-Affash, Sujoy Bhore, Paz Carmi, Dibyayan Chakraborty
Bottleneck bichromatic full Steiner trees. Inf. Process. Lett. 142 (2019)
A. Karim Abu-Affash, Paz Carmi, Anat Parush Tzur
Dual power assignment via second Hamiltonian cycle. J. Comput. Syst. Sci. 93 (2018)
A. Karim Abu-Affash, Paz Carmi, Anil Maheshwari, Pat Morin, Michiel H. M. Smid, Shakhar Smorodinsky
Approximating Maximum Diameter-Bounded Subgraph in Unit Disk Graphs. SoCG (2018)
A. Karim Abu-Affash, Paz Carmi, Anat Parush Tzur
Strongly Connected Spanning Subgraph for Almost Symmetric Networks. Int. J. Comput. Geom. Appl. 27 (3) (2017)
A. Karim Abu-Affash, Sujoy Bhore, Paz Carmi, Dibyayan Chakraborty
Bottleneck Bichromatic Full Steiner Trees. CCCG (2017)
A. Karim Abu-Affash, Sujoy Bhore, Paz Carmi
Monochromatic Plane Matchings in Bicolored Point Set. CCCG (2017)
A. Karim Abu-Affash, Ahmad Biniaz, Paz Carmi, Anil Maheshwari, Michiel H. M. Smid
Approximating the bottleneck plane perfect matching of a point set. Comput. Geom. 48 (9) (2015)
A. Karim Abu-Affash
The Euclidean Bottleneck Full Steiner Tree Problem. Algorithmica 71 (1) (2015)
A. Karim Abu-Affash, Paz Carmi, Anat Parush Tzur
Strongly Connected Spanning Subgraph for Almost Symmetric Networks. CCCG (2015)
A. Karim Abu-Affash, Paz Carmi, Matthew J. Katz
Bottleneck Steiner tree with bounded number of Steiner vertices. J. Discrete Algorithms 30 (2015)
Swaminathan Sankararaman, A. Karim Abu-Affash, Alon Efrat, Sylvester David Eriksson-Bique, Valentin Polishchuk, Srinivasan Ramasubramanian, Michael Segal
Optimization Schemes for Protective Jamming. Mob. Networks Appl. 19 (1) (2014)
A. Karim Abu-Affash, Paz Carmi, Matthew J. Katz, Michael Segal
The Euclidean Bottleneck Steiner Path Problem and Other Applications of (α, β)-Pair Decomposition. Discret. Comput. Geom. 51 (1) (2014)
A. Karim Abu-Affash, Paz Carmi, Anat Parush Tzur
Dual Power Assignment via Second Hamiltonian Cycle. CoRR (2014)
A. Karim Abu-Affash, Paz Carmi, Matthew J. Katz, Yohai Trabelsi
Bottleneck non-crossing matching in the plane. Comput. Geom. 47 (3) (2014)
A. Karim Abu-Affash, Paz Carmi, Matthew J. Katz, Yohai Trabelsi
Bottleneck Non-crossing Matching in the Plane. ESA (2012)
A. Karim Abu-Affash, Paz Carmi, Matthew J. Katz, Yohai Trabelsi
Bottleneck Non-Crossing Matching in the Plane CoRR (2012)
A. Karim Abu-Affash, Rom Aschner, Paz Carmi, Matthew J. Katz
The MST of symmetric disk graphs is light. Comput. Geom. 45 (1-2) (2012)
Swaminathan Sankararaman, A. Karim Abu-Affash, Alon Efrat, Sylvester David Eriksson-Bique, Valentin Polishchuk, Srinivasan Ramasubramanian, Michael Segal
Optimization schemes for protective jamming. MobiHoc (2012)
A. Karim Abu-Affash, Paz Carmi, Matthew J. Katz, Gila Morgenstern
Multi Cover of a Polygon Minimizing the Sum of Areas. WALCOM (2011)
A. Karim Abu-Affash, Paz Carmi, Matthew J. Katz, Michael Segal
The euclidean bottleneck steiner path problem. SCG (2011)
A. Karim Abu-Affash, Paz Carmi, Matthew J. Katz
Bottleneck Steiner Tree with Bounded Number of Steiner Vertices. CCCG (2011)
A. Karim Abu-Affash
On the euclidean bottleneck full Steiner tree problem. SCG (2011)
A. Karim Abu-Affash, Paz Carmi, Matthew J. Katz, Gila Morgenstern
Multi Cover of a Polygon Minimizing the Sum of Areas. Int. J. Comput. Geom. Appl. 21 (6) (2011)
A. Karim Abu-Affash, Rom Aschner, Paz Carmi, Matthew J. Katz
Minimum power energy spanners in wireless ad hoc networks. Wirel. Networks 17 (5) (2011)
A. Karim Abu-Affash, Rom Aschner, Paz Carmi, Matthew J. Katz
The MST of Symmetric Disk Graphs Is Light. SWAT (2010)
A. Karim Abu-Affash
An Approximation Algorithm for the Euclidean Bottleneck Steiner Tree Problem CoRR (2010)
A. Karim Abu-Affash, Rom Aschner, Paz Carmi, Matthew J. Katz
Minimum Power Energy Spanners in Wireless Ad Hoc Networks. INFOCOM (2010)
A. Karim Abu-Affash, Matthew J. Katz
Improved bounds on the average distance to the Fermat-Weber center of a convex object. Inf. Process. Lett. 109 (6) (2009)
A. Karim Abu-Affash, Matthew J. Katz
Improved Bounds on the Average Distance to the Fermat-Weber Center of a Convex Object. CCCG (2008)