A. Karim Abu-Affash

According to our database, A. Karim Abu-Affash authored at least 26 papers between 2009 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2023

Dynamic Euclidean Bottleneck Matching.

A. Karim Abu-Affash, Sujoy Bhore, Paz Carmi

CoRR, 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

Proceedings of the WALCOM: Algorithms and Computation, 2023

Geometric Spanning Trees Minimizing the Wiener Index.

A. Karim Abu-Affash, Paz Carmi, Ori Luwisch, Joseph S. B. Mitchell

Proceedings of the Algorithms and Data Structures - 18th International Symposium, 2023

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

Piercing Diametral Disks Induced by Edges of Maximum Spanning Tree.

A. Karim Abu-Affash, Paz Carmi, Meytal Maman

CoRR, 2022

<i>δ</i>-Greedy <i>t</i>-spanner.

A. Karim Abu-Affash, Gali Bar-On, Paz Carmi

Comput. Geom., 2022

2021

Minimizing total interference in asymmetric sensor networks.

A. Karim Abu-Affash, Paz Carmi, Matthew J. Katz

Theor. Comput. Sci., 2021

Planar bichromatic bottleneck spanning trees.

A. Karim Abu-Affash, Sujoy Bhore, Paz Carmi, Joseph S. B. Mitchell

J. Comput. Geom., 2021

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

2020

Monochromatic plane matchings in bicolored point set.

A. Karim Abu-Affash, Sujoy Bhore, Paz Carmi

Inf. Process. Lett., 2020

2019

Bottleneck bichromatic full Steiner trees.

A. Karim Abu-Affash, Sujoy Bhore, Paz Carmi, Dibyayan Chakraborty

Inf. Process. Lett., 2019

2018

Dual power assignment via second Hamiltonian cycle.

A. Karim Abu-Affash, Paz Carmi, Anat Parush Tzur

J. Comput. Syst. Sci., 2018

2017

Strongly Connected Spanning Subgraph for Almost Symmetric Networks.

A. Karim Abu-Affash, Paz Carmi, Anat Parush Tzur

Int. J. Comput. Geom. Appl., 2017

2015

Bottleneck Steiner tree with bounded number of Steiner vertices.

A. Karim Abu-Affash, Paz Carmi, Matthew J. Katz

J. Discrete Algorithms, 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

The Euclidean Bottleneck Full Steiner Tree Problem.

A. Karim Abu-Affash

Algorithmica, 2015

2014

Optimization Schemes for Protective Jamming.

Swaminathan Sankararaman, A. Karim Abu-Affash, Alon Efrat, Sylvester David Eriksson-Bique, Valentin Polishchuk, Srinivasan Ramasubramanian, Michael Segal

Mob. Networks Appl., 2014

The Euclidean Bottleneck Steiner Path Problem and Other Applications of (α, β)-Pair Decomposition.

A. Karim Abu-Affash, Paz Carmi, Matthew J. Katz, Michael Segal

Discret. Comput. Geom., 2014

Bottleneck non-crossing matching in the plane.

A. Karim Abu-Affash, Paz Carmi, Matthew J. Katz, Yohai Trabelsi

Comput. Geom., 2014

2012

The MST of symmetric disk graphs is light.

A. Karim Abu-Affash, Rom Aschner, Paz Carmi, Matthew J. Katz

Comput. Geom., 2012

2011

Minimum power energy spanners in wireless ad hoc networks.

A. Karim Abu-Affash, Rom Aschner, Paz Carmi, Matthew J. Katz

Wirel. Networks, 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

The euclidean bottleneck steiner path problem.

A. Karim Abu-Affash, Paz Carmi, Matthew J. Katz, Michael Segal

Proceedings of the 27th ACM Symposium on Computational Geometry, 2011

2010

An Approximation Algorithm for the Euclidean Bottleneck Steiner Tree Problem

A. Karim Abu-Affash

CoRR, 2010

2009

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