A. Karim Abu-Affash

51 papers A* 2A 2B 4C 1Journal 33Unranked 9

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