Ermiya Farokhnejad
Embedded Files
About me:
I am Ermiya, a PhD student in the Department of Computer Science, University of Warwick. I am grateful to be supervised by Sayan Bhattacharya. My research is funded by the Chancellor's International Scholarship.
Research Interest:
I am generally interested in design and analysis of algorithms. My PhD research focuses on clustering and graph algorithms.
Education:
Bachelor's in Computer Science and Mathematics (Double Major), 2018-2023
Sharif University of Technology, Tehran, Iran.
Contact:
Institutional Email: ermiya dot farokhnejad at warwick dot ac dot uk
Gmail: ermiya dot farokhnejad at gmail dot com
Publications
Distributed Dominating Set With Optimal Rounds and Message Size in Bounded Arboricity Graphs
Sharareh Alipour, Ermiya Farokhnejad
Additive One Approximation for Minimum Degree Spanning Tree: Breaking the O(mn) Time Barrier
Sayan Bhattacharya, Ermiya Farokhnejad, Haoze Wang
Fully Dynamic Euclidean k-Means
Sayan Bhattacharya, Martín Costa, Ermiya Farokhnejad, Shaofeng Jiang, Yaonan Jin, Jianing Lou
(arXiv)
Almost Optimal Fully Dynamic k-Center Clustering with Recourse
Sayan Bhattacharya, Martín Costa, Ermiya Farokhnejad, Silvio Lattanzi, Nikos Parotsidis
Deterministic k-Median Clustering in Near-Optimal Time
Martín Costa, Ermiya Farokhnejad
(ICALP 2025)(arXiv)
Fully Dynamic k-Median with Near-Optimal Update Time and Recourse
Sayan Bhattacharya, Martín Costa, Ermiya Farokhnejad
(STOC 2025)(arXiv, video, poster)
Improved Approximation Algorithms for (1,2)-TSP and Max-TSP Using Path Covers in the Semi-Streaming Model
Sharareh Alipour, Ermiya Farokhnejad, Tobias Mömke
(STACS 2025)(arXiv, poster)
Invited Talks
Dagstuhl Seminar 26131: New Trends in Clustering
Deterministic k-Median Clustering in Near-Optimal Time
(Wadern, Germany, March 2026)
Trends in Approximation and Online Algorithms (TAO)
Fully Dynamic k-Median with Near-Optimal Update Time and Recourse
(Sydney, Australia, December 2025)
Presentations
IGAFIT Highlights of Algorithms (HALG)
Fully Dynamic k-Median with Near-Optimal Update Time and Recourse
(Stockholm, Sweden, June 2026)
EATCS International Colloquium on Automata, Languages, and Programming (ICALP)
Deterministic k-Median Clustering in Near-Optimal Time
(Aarhus, Denmark, July 2025)
ACM Symposium on Theory of Computing (STOC)
Fully Dynamic k-Median with Near-Optimal Update Time and Recourse
(Prague, Czech Republic, June 2025)
IGAFIT Highlights of Algorithms (HALG)
Fully Dynamic k-Median with Near-Optimal Update Time and Recourse
(Zürich, Switzerland, June 2025)
International Symposium on Theoretical Aspects of Computer Science (STACS)
Improved Approximation Algorithms for (1,2)-TSP and Max-TSP Using Path Covers in the Semi-Streaming Model
(Jena, Germany, March 2025)
Professional Service
I served as the editorial assistant for the report of Dagstuhl Seminar 26131: New Trends in Clustering.
I have served as an external reviewer for the following conferences: SODA 2025, ICALP 2025, SODA 2026, ITCS 2026, SWAT 2026, and ESA 2026.
Awards
Chancellor's International Scholarship 2024-2028
First prize at the International Mathematics Competition for University Students (IMC), Bulgaria, 2022 and 2023
Gold Medal at the National Mathematical Olympiad for Undergraduate Students, Iran, 2022 and 2023
Silver Medal at the National Mathematical Olympiad for High School Students, Iran, 2018
Teaching Assistant
I served as a GTA at the University of Warwick in the following modules:
CS356, Approximation and Randomised Algorithms (Term II 2025/26)
CS260, Algorithms (Term I 2025/26)
CS356, Approximation and Randomised Algorithms (Term II 2024/25)
CS260, Algorithms (Term I 2024/25)
I gave a guest lecture at the University of Warwick for the following module:
CS254, Algorithmic Graph Theory (Term II 2025/26)
Page updated
Google Sites
Report abuse