Elfarouk Harb

According to our database, Elfarouk Harb authored at least 12 papers between 2019 and 2025.

Collaborative distances:

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

2025

New Prophet Inequalities via Poissonization and Sharding.

Elfarouk Harb

Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms, 2025

2024

Revisiting Random Points: Combinatorial Complexity and Algorithms.

Sariel Har-Peled, Elfarouk Harb

Proceedings of the 2024 Symposium on Simplicity in Algorithms, 2024

Oracle-Augmented Prophet Inequalities.

Sariel Har-Peled, Elfarouk Harb, Vasilis Livanos

Proceedings of the 51st International Colloquium on Automata, Languages, and Programming, 2024

Shortest Path Separators in Unit Disk Graphs.

Elfarouk Harb, Zhengcheng Huang, Da Wei Zheng

Proceedings of the 32nd Annual European Symposium on Algorithms, 2024

2023

A Polynomial Time Algorithm for Constructing Optimal Binary AIFV-2 Codes.

Mordecai J. Golin, Elfarouk Harb

IEEE Trans. Inf. Theory, October, 2023

Fishing For Better Constants: The Prophet Secretary Via Poissonization.

Elfarouk Harb

CoRR, 2023

Convergence to Lexicographically Optimal Base in a (Contra)Polymatroid and Applications to Densest Subgraph and Tree Packing.

Elfarouk Harb, Kent Quanrud, Chandra Chekuri

Proceedings of the 31st Annual European Symposium on Algorithms, 2023

2022

Faster and Scalable Algorithms for Densest Subgraph and Decomposition.

Elfarouk Harb, Kent Quanrud, Chandra Chekuri

Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

2021

Speeding up the AIFV-2 dynamic programs by two orders of magnitude using Range Minimum Queries.

Mordecai J. Golin, Elfarouk Harb

Theor. Comput. Sci., 2021

2020

Polynomial Time Algorithms for Constructing Optimal Binary AIFV-2 Codes.

Mordecai J. Golin, Elfarouk Harb

CoRR, 2020

KFC: A Scalable Approximation Algorithm for $k$-center Fair Clustering.

Elfarouk Harb, Ho Shan Lam

Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

2019

Polynomial Time Algorithms for Constructing Optimal AIFV Codes.

Mordecai J. Golin, Elfarouk Harb

Proceedings of the Data Compression Conference, 2019