default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDA. Karim Abu-Affash
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j22]A. Karim Abu-Affash, Paz Carmi, Meytal Maman:
Piercing Diametral Disks Induced by Edges of Maximum Spanning Trees. J. Graph Algorithms Appl. 28(3): 3-10 (2024)- [j21]A. Karim Abu-Affash, Sujoy Bhore
, Paz Carmi:
Dynamic Euclidean bottleneck matching. Theor. Comput. Sci. 1013: 114727 (2024) - 2023
- [j20]A. Karim Abu-Affash, Paz Carmi, Meytal Maman:
Piercing pairwise intersecting geodesic disks by five points. Comput. Geom. 109: 101947 (2023) - [c17]A. Karim Abu-Affash, Paz Carmi, Ori Luwisch, Joseph S. B. Mitchell:
Geometric Spanning Trees Minimizing the Wiener Index. WADS 2023: 1-14 - [c16]A. Karim Abu-Affash, Paz Carmi, Meytal Maman:
Piercing Diametral Disks Induced by Edges of Maximum Spanning Trees. WALCOM 2023: 71-77 - [i10]A. Karim Abu-Affash, Sujoy Bhore, Paz Carmi:
Dynamic Euclidean Bottleneck Matching. CoRR abs/2302.10513 (2023) - [i9]A. Karim Abu-Affash, Paz Carmi, Ori Luwisch, Joseph S. B. Mitchell:
Geometric Spanning Trees Minimizing the Wiener Index. CoRR abs/2303.01096 (2023) - 2022
- [j19]A. Karim Abu-Affash, Gali Bar-On, Paz Carmi:
δ-Greedy t-spanner. Comput. Geom. 100: 101807 (2022) - [j18]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: 488-499 (2022) - [i8]A. Karim Abu-Affash, Paz Carmi, Meytal Maman:
Piercing Diametral Disks Induced by Edges of Maximum Spanning Tree. CoRR abs/2209.11260 (2022) - 2021
- [j17]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): 1401-1414 (2021) - [j16]A. Karim Abu-Affash, Sujoy Bhore, Paz Carmi, Joseph S. B. Mitchell:
Planar bichromatic bottleneck spanning trees. J. Comput. Geom. 12(1): 109-127 (2021) - [j15]A. Karim Abu-Affash, Paz Carmi, Matthew J. Katz:
Minimizing total interference in asymmetric sensor networks. Theor. Comput. Sci. 889: 171-181 (2021) - [i7]A. Karim Abu-Affash, Paz Carmi, Meytal Maman:
Piercing Pairwise Intersecting Geodesic Disks by Five Points. CoRR abs/2112.05962 (2021) - 2020
- [j14]A. Karim Abu-Affash, Sujoy Bhore, Paz Carmi:
Monochromatic plane matchings in bicolored point set. Inf. Process. Lett. 153 (2020) - [c15]A. Karim Abu-Affash, Paz Carmi, Matthew J. Katz:
Minimizing Total Interference in Asymmetric Sensor Networks. ALGOSENSORS 2020: 1-16 - [c14]A. Karim Abu-Affash, Sujoy Bhore, Paz Carmi, Joseph S. B. Mitchell:
Planar Bichromatic Bottleneck Spanning Trees. ESA 2020: 1:1-1:16 - [i6]A. Karim Abu-Affash, Paz Carmi, Matthew J. Katz:
Minimizing Total Interference in Asymmetric Sensor Networks. CoRR abs/2004.08847 (2020) - [i5]A. Karim Abu-Affash, Sujoy Bhore, Paz Carmi, Joseph S. B. Mitchell:
Planar Bichromatic Bottleneck Spanning Trees. CoRR abs/2004.08854 (2020) - [i4]A. Karim Abu-Affash, Paz Carmi, Adi Krasin:
A Linear-Time Algorithm for Minimum k-Hop Dominating Set of a Cactus Graph. CoRR abs/2012.05869 (2020)
2010 – 2019
- 2019
- [j13]A. Karim Abu-Affash, Sujoy Bhore, Paz Carmi, Dibyayan Chakraborty:
Bottleneck bichromatic full Steiner trees. Inf. Process. Lett. 142: 14-19 (2019) - 2018
- [j12]A. Karim Abu-Affash, Paz Carmi, Anat Parush Tzur:
Dual power assignment via second Hamiltonian cycle. J. Comput. Syst. Sci. 93: 41-53 (2018) - [c13]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: 2:1-2:12 - 2017
- [j11]A. Karim Abu-Affash, Paz Carmi, Anat Parush Tzur:
Strongly Connected Spanning Subgraph for Almost Symmetric Networks. Int. J. Comput. Geom. Appl. 27(3): 207-220 (2017) - [c12]A. Karim Abu-Affash, Sujoy Bhore, Paz Carmi:
Monochromatic Plane Matchings in Bicolored Point Set. CCCG 2017: 7-12 - [c11]A. Karim Abu-Affash, Sujoy Bhore, Paz Carmi, Dibyayan Chakraborty:
Bottleneck Bichromatic Full Steiner Trees. CCCG 2017: 13-18 - 2015
- [j10]A. Karim Abu-Affash:
The Euclidean Bottleneck Full Steiner Tree Problem. Algorithmica 71(1): 139-151 (2015) - [j9]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): 718-731 (2015) - [j8]A. Karim Abu-Affash, Paz Carmi, Matthew J. Katz:
Bottleneck Steiner tree with bounded number of Steiner vertices. J. Discrete Algorithms 30: 96-100 (2015) - [c10]A. Karim Abu-Affash, Paz Carmi, Anat Parush Tzur:
Strongly Connected Spanning Subgraph for Almost Symmetric Networks. CCCG 2015 - 2014
- [j7]A. Karim Abu-Affash, Paz Carmi, Matthew J. Katz, Yohai Trabelsi:
Bottleneck non-crossing matching in the plane. Comput. Geom. 47(3): 447-457 (2014) - [j6]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): 1-23 (2014) - [j5]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): 45-60 (2014) - [i3]A. Karim Abu-Affash, Paz Carmi, Anat Parush Tzur:
Dual Power Assignment via Second Hamiltonian Cycle. CoRR abs/1402.5783 (2014) - 2012
- [j4]A. Karim Abu-Affash, Rom Aschner, Paz Carmi, Matthew J. Katz:
The MST of symmetric disk graphs is light. Comput. Geom. 45(1-2): 54-61 (2012) - [c9]A. Karim Abu-Affash, Paz Carmi, Matthew J. Katz, Yohai Trabelsi:
Bottleneck Non-crossing Matching in the Plane. ESA 2012: 36-47 - [c8]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: 65-74 - [i2]A. Karim Abu-Affash, Paz Carmi, Matthew J. Katz, Yohai Trabelsi:
Bottleneck Non-Crossing Matching in the Plane. CoRR abs/1202.4146 (2012) - 2011
- [j3]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): 685-698 (2011) - [j2]A. Karim Abu-Affash, Rom Aschner, Paz Carmi, Matthew J. Katz:
Minimum power energy spanners in wireless ad hoc networks. Wirel. Networks 17(5): 1251-1258 (2011) - [c7]A. Karim Abu-Affash, Paz Carmi, Matthew J. Katz:
Bottleneck Steiner Tree with Bounded Number of Steiner Vertices. CCCG 2011 - [c6]A. Karim Abu-Affash:
On the euclidean bottleneck full Steiner tree problem. SCG 2011: 433-439 - [c5]A. Karim Abu-Affash, Paz Carmi, Matthew J. Katz, Michael Segal:
The euclidean bottleneck steiner path problem. SCG 2011: 440-447 - [c4]A. Karim Abu-Affash, Paz Carmi, Matthew J. Katz, Gila Morgenstern:
Multi Cover of a Polygon Minimizing the Sum of Areas. WALCOM 2011: 134-145 - 2010
- [c3]A. Karim Abu-Affash, Rom Aschner, Paz Carmi, Matthew J. Katz:
Minimum Power Energy Spanners in Wireless Ad Hoc Networks. INFOCOM 2010: 2411-2416 - [c2]A. Karim Abu-Affash, Rom Aschner, Paz Carmi, Matthew J. Katz:
The MST of Symmetric Disk Graphs Is Light. SWAT 2010: 236-247 - [i1]A. Karim Abu-Affash:
An Approximation Algorithm for the Euclidean Bottleneck Steiner Tree Problem. CoRR abs/1012.1502 (2010)
2000 – 2009
- 2009
- [j1]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): 329-333 (2009) - 2008
- [c1]A. Karim Abu-Affash, Matthew J. Katz:
Improved Bounds on the Average Distance to the Fermat-Weber Center of a Convex Object. CCCG 2008
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-16 21:24 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
