Polynomial Time Algorithms for Constructing Optimal AIFV Codes. - Mordecai J. Golin; Elfarouk Harb (DCC, 2019)

KFC: A Scalable Approximation Algorithm for $k$-center Fair Clustering. - Elfarouk Harb; Ho Shan Lam (NeurIPS, 2020)

Polynomial Time Algorithms for Constructing Optimal Binary AIFV-2 Codes. - Mordecai J. Golin; Elfarouk Harb (CoRR, 2020)

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)

Faster and Scalable Algorithms for Densest Subgraph and Decomposition. - Elfarouk Harb; Kent Quanrud; Chandra Chekuri (NeurIPS, 2022)

Convergence to Lexicographically Optimal Base in a (Contra)Polymatroid and Applications to Densest Subgraph and Tree Packing. - Elfarouk Harb; Kent Quanrud; Chandra Chekuri (ESA, 2023)

Fishing For Better Constants: The Prophet Secretary Via Poissonization. - Elfarouk Harb (CoRR, 2023)

A Polynomial Time Algorithm for Constructing Optimal Binary AIFV-2 Codes. - Mordecai J. Golin; Elfarouk Harb (IEEE Trans. Inf. Theory, 2023)

Shortest Path Separators in Unit Disk Graphs. - Elfarouk Harb; Zhengcheng Huang; Da Wei Zheng (ESA, 2024)

Oracle-Augmented Prophet Inequalities. - Sariel Har-Peled; Elfarouk Harb; Vasilis Livanos (ICALP, 2024)

Revisiting Random Points: Combinatorial Complexity and Algorithms. - Sariel Har-Peled; Elfarouk Harb (SOSA, 2024)

New Prophet Inequalities via Poissonization and Sharding. - Elfarouk Harb (SODA, 2025)

ReFill: Reinforcement Learning for Fill-In Minimization. - Elfarouk Harb; Ho Shan Lam (CoRR, 2025)

Corporate Needs You to Find the Difference: Revisiting Submodular and Supermodular Ratio Optimization Problems. - Elfarouk Harb; Yousef Yassin; Chandra Chekuri (CoRR, 2025)