Improved bounds on the average distance to the Fermat-Weber center of a convex object. - A. Karim Abu-Affash; Matthew J. Katz (Inf. Process. Lett., 2009)

An Approximation Algorithm for the Euclidean Bottleneck Steiner Tree Problem - A. Karim Abu-Affash (CoRR, 2010)

The euclidean bottleneck steiner path problem. - A. Karim Abu-Affash; Paz Carmi; Matthew J. Katz; Michael Segal 001 (SCG, 2011)

Multi Cover of a Polygon Minimizing the Sum of Areas. - A. Karim Abu-Affash; Paz Carmi; Matthew J. Katz; Gila Morgenstern (Int. J. Comput. Geom. Appl., 2011)

Minimum power energy spanners in wireless ad hoc networks. - A. Karim Abu-Affash; Rom Aschner; Paz Carmi; Matthew J. Katz (Wirel. Networks, 2011)

The MST of symmetric disk graphs is light. - A. Karim Abu-Affash; Rom Aschner; Paz Carmi; Matthew J. Katz (Comput. Geom., 2012)

Bottleneck non-crossing matching in the plane. - A. Karim Abu-Affash; Paz Carmi; Matthew J. Katz; Yohai Trabelsi (Comput. Geom., 2014)

The Euclidean Bottleneck Steiner Path Problem and Other Applications of (α, β)-Pair Decomposition. - A. Karim Abu-Affash; Paz Carmi; Matthew J. Katz; Michael Segal 001 (Discret. Comput. Geom., 2014)

Optimization Schemes for Protective Jamming. - Swaminathan Sankararaman; A. Karim Abu-Affash; Alon Efrat; Sylvester David Eriksson-Bique; Valentin Polishchuk; Srinivasan Ramasubramanian; Michael Segal 001 (Mob. Networks Appl., 2014)

The Euclidean Bottleneck Full Steiner Tree Problem. - A. Karim Abu-Affash (Algorithmica, 2015)

Approximating the bottleneck plane perfect matching of a point set. - A. Karim Abu-Affash; Ahmad Biniaz; Paz Carmi; Anil Maheshwari; Michiel H. M. Smid (Comput. Geom., 2015)

Bottleneck Steiner tree with bounded number of Steiner vertices. - A. Karim Abu-Affash; Paz Carmi; Matthew J. Katz (J. Discrete Algorithms, 2015)

Strongly Connected Spanning Subgraph for Almost Symmetric Networks. - A. Karim Abu-Affash; Paz Carmi; Anat Parush Tzur (Int. J. Comput. Geom. Appl., 2017)

Dual power assignment via second Hamiltonian cycle. - A. Karim Abu-Affash; Paz Carmi; Anat Parush Tzur (J. Comput. Syst. Sci., 2018)

Bottleneck bichromatic full Steiner trees. - A. Karim Abu-Affash; Sujoy Bhore; Paz Carmi; Dibyayan Chakraborty (Inf. Process. Lett., 2019)

Monochromatic plane matchings in bicolored point set. - A. Karim Abu-Affash; Sujoy Bhore; Paz Carmi (Inf. Process. Lett., 2020)

Approximating Maximum Diameter-Bounded Subgraph in Unit Disk Graphs. - A. Karim Abu-Affash; Paz Carmi; Anil Maheshwari; Pat Morin; Michiel Smid; Shakhar Smorodinsky (Discret. Comput. Geom., 2021)

Planar bichromatic bottleneck spanning trees. - A. Karim Abu-Affash; Sujoy Bhore; Paz Carmi; Joseph S. B. Mitchell (J. Comput. Geom., 2021)

Minimizing total interference in asymmetric sensor networks. - A. Karim Abu-Affash; Paz Carmi; Matthew J. Katz (Theor. Comput. Sci., 2021)

δ-Greedy t-spanner. - A. Karim Abu-Affash; Gali Bar-On; Paz Carmi (Comput. Geom., 2022)

Piercing Diametral Disks Induced by Edges of Maximum Spanning Tree. - A. Karim Abu-Affash; Paz Carmi; Meytal Maman (CoRR, 2022)

A linear-time algorithm for minimum k-hop dominating set of a cactus graph. - A. Karim Abu-Affash; Paz Carmi; Adi Krasin (Discret. Appl. Math., 2022)

Geometric Spanning Trees Minimizing the Wiener Index. - A. Karim Abu-Affash; Paz Carmi; Ori Luwisch; Joseph S. B. Mitchell (WADS, 2023)

Piercing pairwise intersecting geodesic disks by five points. - A. Karim Abu-Affash; Paz Carmi; Meytal Maman (Comput. Geom., 2023)

Piercing Diametral Disks Induced by Edges of Maximum Spanning Trees. - A. Karim Abu-Affash; Paz Carmi; Meytal Maman (J. Graph Algorithms Appl., 2024)

Dynamic Euclidean bottleneck matching. - A. Karim Abu-Affash; Sujoy Bhore; Paz Carmi (Theor. Comput. Sci., 2024)