Hossein Esfandiari

I am a Research Scientist at Google NYC Algorithms and Optimization team. Prior to that I was a Postdoctoral Researcher at Harvard University (Theory of Computation group), where I was gladly advised by Professor Michael Mitzenmacher.


I received a Ph.D. in Computer Science from University of Maryland, where I was glad to have Professor Mohammad T. HajiAghayi as my advisor. I finished my undergraduate studies in Computer Engineering at Sharif University of Technology.


Research and Publications

  • Esfandiari, Mirrokni, Narayanan: Almost Tight Approximation Algorithms for Explainable Clustering, SODA 2022.

  • Ahmadian, Esfandiari, Mirrokni, Peng: Robust Load Balancing with Machine Learned Advice, SODA 2022.

  • Esfandiari, Karbasi, Mirrokni: Adaptivity of Adaptive Submodularity, COLT 2021.

  • At Google: Chen, Esfandiari, Fu, Mirrokni, Yu, Feature Cross Search via Submodular Optimization, ESA 2021.

  • Esfandiari, Mirrokni, Zhong: Almost Linear Time Density Level Set Estimation via DBSCAN, AAAI 2021.

  • Esfandiari, Karbasi, Mehrabian, Mirrokni: Regret Bounds for Batched Bandits, AAAI 2021.

  • Bateni, Esfandiari, Fischer, Mirrokni: Extreme k-Center Clustering, AAAI 2021.

  • Huchette, Lu, Esfandiari, Mirrokni: Contextual Reserve Price Optimization in Auctions, NeurIPS 2020.

  • Behnezhad, Dhulipala, Esfandiari, Łącki, Mirrokni, Schudy, Parallel Graph Algorithms in Constant Adaptive Rounds: Theory meets Practice, VLDB 2020.

  • Esfandiari, Hajiaghayi, Lucier, Mitzenmacher, Prophets, Secretaries, and Maximizing the Probability of Choosing the Best, AISTATS 2020.

  • Behnezhad, Dhulipala, Esfandiari, Łącki, Mirrokni, Near-Optimal Massively Parallel Graph Connectivity, FOCS 2019.

  • Eckles, Esfandiari, Mossel, Rahimian, Seeding with costly network information, EC 2019.

  • Chen, Bateni, Esfandiari, Fu, Mirrokni, Rostamizadeh, Categorical Feature Compression via Submodular Optimization, ICML 2019.

  • Behnezhad, Dhulipala, Esfandiari, Łącki, Mirrokni, Schudy, Massively Parallel Computation via Remote Memory Access, SPAA 2019 (Special Issue of TOPC).

  • Epasto, Esfandiari, Mirrokni, Efficient On-Device Public-Private Computation, WWW 2019.

  • Esfandiari, Hajiaghayi, Lucier, Mitzenmacher, Online Pandora's Boxes and Bandits, AAAI 2019.

  • Esfandiari, Mitzenmacher, Metric Sublinear Algorithms via Linear Sampling, FOCS 2018.

  • Esfandiari, Lattanzi, Mirrokni, Parallel and Streaming Algorithms for K-Core Decomposition, ICML 2018.

  • Bateni, Esfandiari, Mirrokni, Optimal Distributed Submodular Optimization via Sketching, KDD 2018.

  • Bateni, Esfandiari, Mirrokni, Almost Optimal Streaming Algorithms for Coverage Problems, SPAA 2017.

  • Behnezhad, Derakhshan, Esfandiari, Tan, Yami, Graph Matching in Massive Datasets, SPAA 2017.

  • Abolhassani, Ehsani, Esfandiari, Hajiaghayi, Kleinberg, Lucier, Beating 1-1/e for Ordered Prophets, STOC 2017.

  • Abolhassani, Esfandiari, Hajiaghayi, Lucier, Yami, Market Pricing for Data Streams, AAAI 2017.

  • Bateni, Esfandiari, Mirrokni, Seddighin , A Study of Compact Reserve Pricing Languages, AAAI 2017.

  • Esfandiari, Korula, Mirrokni, Bi-Objective Online Matching and Submodular Allocations, NIPS 2016.

  • Chitnis, Cormode, Esfandiari, Hajiaghayi, McGregor, Monemizadeh, Vorotnikova , Kernelization via Sampling with Applications to Dynamic Graph Streams, SODA 2016.

  • Esfandiari, Hajiaghayi, Monemizadeh, Finding Large Matchings in Semi-Streaming, ICDM 2016 (workshops).

  • Abolhassani, Chan, Chen, Esfandiari, Hajiaghayi, Mahini, Wu, Beating Ratio 0.5 for Weighted Oblivious Matching Problems, ESA 2016.

  • Esfandiari, Hajiaghayi, Woodruff, Applications of Uniform Sampling: Densest Subgraph and Beyond, SPAA 2016.

  • Esfandiari, Kortsarz, A Bounded-Risk Mechanism for the Kidney Exchange Game, LATIN 2016 (DAM).

  • Esfandiari, Korula, Mirrokni, Online Stochastic Budgeted Allocation with Traffic Spikes, EC 2015 (Special Issue of TEAC).

  • Esfandiari, Hajiaghayi, liaghat, Monemizadeh, Onak, Streaming Algorithms for Estimating the Matching Size in Planar Graphs and Beyond, SODA 2015 (TALG).

  • Esfandiari, Hajiaghayi, Liaghat, Monemizadeh, Prophet Secretary, ESA 2015 (SIDMA) .

  • Esfandiari, Hajiaghayi, Koenemann, Mahini, Malec, Sanita, Scheduling with Chain-like Precedence Constraints, ESA 2015.

  • Chitnis, Cormode, Esfandiari, Hajiaghayi, Monemizadeh, New Streaming Algorithms for Parameterized Maximal Matching and Beyond, SPAA 2015.

  • Esfandiari, Kortsarz, New Mechanisms for Pairwise Kidney Exchange, SAGT 2015.

  • Abolhassani, Esfandiari, Hajiaghayi, Mahini, Malec, Srinivasan, Selling Tomorrow's Bargains Today, AAMAS 2015.

  • Esfandiari, Hajiaghayi, Khani, Liaghat, Mahini, Racke, Stochastic Online Buffer Scheduling, ICALP 2014.

  • Chitnis, Esfandiari, Hajiaghayi, Khandekar, Kortsarz, Seddighin, A Tight Algorithm for Strongly Connected Steiner Subgraph On Two Terminals With Demands, IPEC 2014 (Algorithmica).
    Undergraduate Work:

  • Salehi, Esfandiari, Shirdareh Haghighi, Magnant, Second Hamiltonian cycles in claw-free graphs, Theory and Applications of Graphs, 2015.

  • Akbari, Esfandiari, Barzegari, Sedighin, A Lower Bound for the Signed Edge Domination Number of a Graph, Australasian Journal of Combinatorics, 2014.

  • Salehi Nobandegani, Esfandiari, Shirdareh Haghighi, Bibak, On the Erdős–Gyárfás conjecture in claw-free graphs, Discussiones Mathematicae Graph Theory, 2014 (Among the most downloaded papers of the Journal).


Program Committees


Honors and Awards

  • Google PhD Fellowship in Market Algorithms, 2016-2018,

  • Ann G. Wylie Dissertation Fellowship, University of Maryland, 2015-2016.

  • World Quantitative and Science Scholarship, 2014-2015.

  • Distinguished Graduate Student Teaching Award, University of Maryland, 2013-2014.

  • UPE Award [First to solve Problem J], ACM-ICPC International Programming Contest 2013, Russia.

  • 27th among 9800 teams, ACM-ICPC International Programming Contest 2013, Russia.

  • 1st team in ACM-ICPC Mid-Atlantic regional contest 2012, USA.

  • Dean’s Fellowships, University of Maryland at College Park, 2012-2014.

  • 4th rank in National Graduate Entrance Exam in Computer Science, Iran, 2011.

  • Awarded as Valedictorian by Sharif University of technology president, 2009.

  • Gold Medal in the Iranian National Olympiad in Informatics, Tehran, Iran, 2007.

  • Recipient of the Grant for Undergraduate Studies from the Iranian National Elite Foundation, 2008-2012.