default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDElfarouk Harb
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c7]Elfarouk Harb, Zhengcheng Huang, Da Wei Zheng:
Shortest Path Separators in Unit Disk Graphs. ESA 2024: 66:1-66:14- [c6]Sariel Har-Peled, Elfarouk Harb, Vasilis Livanos:
Oracle-Augmented Prophet Inequalities. ICALP 2024: 81:1-81:19 - [c5]Sariel Har-Peled, Elfarouk Harb:
Revisiting Random Points: Combinatorial Complexity and Algorithms. SOSA 2024: 244-268 - [i8]Sariel Har-Peled, Elfarouk Harb, Vasilis Livanos:
Oracle-Augmented Prophet Inequalities. CoRR abs/2404.11853 (2024) - [i7]Elfarouk Harb, Zhengcheng Huang, Da Wei Zheng:
Shortest Path Separators in Unit Disk Graphs. CoRR abs/2407.15980 (2024) - 2023
- [j2]Mordecai J. Golin
, Elfarouk Harb:
A Polynomial Time Algorithm for Constructing Optimal Binary AIFV-2 Codes. IEEE Trans. Inf. Theory 69(10): 6269-6278 (2023) - [c4]Elfarouk Harb, Kent Quanrud, Chandra Chekuri:
Convergence to Lexicographically Optimal Base in a (Contra)Polymatroid and Applications to Densest Subgraph and Tree Packing. ESA 2023: 56:1-56:17 - [i6]Elfarouk Harb, Kent Quanrud, Chandra Chekuri:
Convergence to Lexicographically Optimal Base in a (Contra)Polymatroid and Applications to Densest Subgraph and Tree Packing. CoRR abs/2305.02987 (2023) - [i5]Elfarouk Harb:
Fishing For Better Constants: The Prophet Secretary Via Poissonization. CoRR abs/2307.00971 (2023) - 2022
- [c3]Elfarouk Harb, Kent Quanrud, Chandra Chekuri:
Faster and Scalable Algorithms for Densest Subgraph and Decomposition. NeurIPS 2022 - [i4]Sariel Har-Peled, Elfarouk Harb:
Revisiting Random Points: Combinatorial Complexity and Algorithms. CoRR abs/2208.03829 (2022) - 2021
- [j1]Mordecai J. Golin, Elfarouk Harb:
Speeding up the AIFV-2 dynamic programs by two orders of magnitude using Range Minimum Queries. Theor. Comput. Sci. 865: 99-118 (2021) - 2020
- [c2]Elfarouk Harb, Ho Shan Lam:
KFC: A Scalable Approximation Algorithm for $k$-center Fair Clustering. NeurIPS 2020 - [i3]Mordecai J. Golin, Elfarouk Harb:
Polynomial Time Algorithms for Constructing Optimal Binary AIFV-2 Codes. CoRR abs/2001.11170 (2020) - [i2]Mordecai J. Golin, Elfarouk Harb:
Speeding up the AIFV-2 dynamic programs by two orders of magnitude using Range Minimum Queries. CoRR abs/2002.09885 (2020) - [i1]Elfarouk Harb, Ho Shan Lam:
KFC: A Scalable Approximation Algorithm for k-center Fair Clustering. CoRR abs/2010.13949 (2020)
2010 – 2019
- 2019
- [c1]Mordecai J. Golin, Elfarouk Harb:
Polynomial Time Algorithms for Constructing Optimal AIFV Codes. DCC 2019: 231-240
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-09-26 01:51 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:
