ד"ר כרים אבו עפאש

A. Karim Abu-Affash, Paz Carmi, Meytal Maman, Piercing pairwise intersecting geodesic disks by five points, Computational Geometry, Volume 109, 2023

A. Karim Abu-Affash, Paz Carmi, Adi Krasin, A linear-time algorithm for minimum k-hop dominating set of a cactus graph, Discrete Applied Mathematics, Volume 320, 2022, Pages 488-499

A. Karim Abu-Affash, Gali Bar-On, Paz Carmi, δ-Greedy t-spanner, Computational Geometry, 100:101807, 2022

Abu-Affash, A.K., Carmi, P., Maheshwari, A. et al. Approximating Maximum Diameter-Bounded Subgraph in Unit Disk Graphs. Discrete Comput Geom 66, 1401–1414 (2021).

A. Karim Abu-Affash, Sujoy Bhore, Paz Carmi, Monochromatic plane matchings in bicolored point set, Information Processing Letters, Volume 153, 2020

Abu-Affash A. K., Bhore S., Carmi P., Mitchell J. S. B., Planar bichromatic bottleneck spanning trees. In: Proceedings of the European Symposium on Algorithms (ESA '20), pages 1:1-1:16, Pisa, Italy

A. Karim Abu-Affash, Sujoy Bhore, Paz Carmi, Dibyayan Chakraborty, Bottleneck bichromatic full Steiner trees, Information Processing Letters, Volume 142, 2019, Pages 14-19

A. Karim Abu-Affash, Paz Carmi, Anat Parush Tzur, Dual power assignment via second Hamiltonian cycle, Journal of Computer and System Sciences, Volume 93, 2018, Pages 41-53

Abu-Affash A. K., Carmi P., Maheshwari A., Morin P., Smid M. H. M., Smorodinsky S., Approximating maximum diameter-bounded subgraph in unit disk graphs. In: Proceedings of the 34th International Symposium on Computational Geometry (SoCG '18), pages 2:1-2:12, Budapest, Hungary

Abu-Affash A. K., Carmi P., Parush Tzur A., Strongly connected spanning subgraph for almost symmetric networks. International Journal of Computational Geometry and Application, 27(3):207-220

Abu-Affash A. K., The Euclidean bottleneck full Steiner tree problem. Algorithmica, 2015; 71(1):139-151

Abu-Affash A. K., Carmi P., Katz M. J., Segal M., The Euclidean bottleneck Steiner path problem and other applications of (α,β) Pair decomposition. Discrete and Computational Geometry, 2014; 51(1):1-23