Elfarouk Harb

21 papers A* 4A 2B 1Journal 13Unranked 1
YearRankTypeTitle / Venue / Authors
2025 J jnl
Corporate Needs You to Find the Difference: Revisiting Submodular and Supermodular Ratio Optimization Problems.
CoRR
Elfarouk Harb, Yousef Yassin, Chandra Chekuri
2025 J jnl
Dense Subgraph Clustering and a New Cluster Ensemble Method.
CoRR
The-Anh Vu-Le, João Alfredo Cardoso Lamy, Tomás Alessi, Ian Chen, Minhyuk Park, Elfarouk Harb, George Chacko, Tandy J. Warnow
2025 A* conf
New Prophet Inequalities via Poissonization and Sharding.
SODA
Elfarouk Harb
2025 J jnl
ReFill: Reinforcement Learning for Fill-In Minimization.
CoRR
Elfarouk Harb, Ho Shan Lam
2024 A* conf
Oracle-Augmented Prophet Inequalities.
ICALP
Sariel Har-Peled, Elfarouk Harb, Vasilis Livanos
2024 J jnl
Oracle-Augmented Prophet Inequalities.
CoRR
Sariel Har-Peled, Elfarouk Harb, Vasilis Livanos
2024 — conf
Revisiting Random Points: Combinatorial Complexity and Algorithms.
SOSA
Sariel Har-Peled, Elfarouk Harb
2024 A conf
Shortest Path Separators in Unit Disk Graphs.
ESA
Elfarouk Harb, Zhengcheng Huang, Da Wei Zheng
2024 J jnl
Shortest Path Separators in Unit Disk Graphs.
CoRR
Elfarouk Harb, Zhengcheng Huang, Da Wei Zheng
2023 J jnl
A Polynomial Time Algorithm for Constructing Optimal Binary AIFV-2 Codes.
IEEE Trans. Inf. Theory
Mordecai J. Golin, Elfarouk Harb
2023 A conf
Convergence to Lexicographically Optimal Base in a (Contra)Polymatroid and Applications to Densest Subgraph and Tree Packing.
ESA
Elfarouk Harb, Kent Quanrud, Chandra Chekuri
2023 J jnl
Convergence to Lexicographically Optimal Base in a (Contra)Polymatroid and Applications to Densest Subgraph and Tree Packing.
CoRR
Elfarouk Harb, Kent Quanrud, Chandra Chekuri
2023 J jnl
Fishing For Better Constants: The Prophet Secretary Via Poissonization.
CoRR
Elfarouk Harb
2022 A* conf
Faster and Scalable Algorithms for Densest Subgraph and Decomposition.
NeurIPS
Elfarouk Harb, Kent Quanrud, Chandra Chekuri
2022 J jnl
Revisiting Random Points: Combinatorial Complexity and Algorithms.
CoRR
Sariel Har-Peled, Elfarouk Harb
2021 J jnl
Speeding up the AIFV-2 dynamic programs by two orders of magnitude using Range Minimum Queries.
Theor. Comput. Sci.
Mordecai J. Golin, Elfarouk Harb
2020 A* conf
KFC: A Scalable Approximation Algorithm for $k$-center Fair Clustering.
NeurIPS
Elfarouk Harb, Ho Shan Lam
2020 J jnl
KFC: A Scalable Approximation Algorithm for k-center Fair Clustering.
CoRR
Elfarouk Harb, Ho Shan Lam
2020 J jnl
Polynomial Time Algorithms for Constructing Optimal Binary AIFV-2 Codes.
CoRR
Mordecai J. Golin, Elfarouk Harb
2020 J jnl
Speeding up the AIFV-2 dynamic programs by two orders of magnitude using Range Minimum Queries.
CoRR
Mordecai J. Golin, Elfarouk Harb
2019 B conf
Polynomial Time Algorithms for Constructing Optimal AIFV Codes.
DCC
Mordecai J. Golin, Elfarouk Harb