Scholar
Ermiya Farokhnejad
Google Scholar ID: ECm_5HoAAAAJ
University of Warwick
Approximation Algorithms
Dynamic Algorithms
Follow
Homepage
↗
Google Scholar
↗
Citations & Impact
All-time
Citations
7
H-index
1
i10-index
0
Publications
5
Co-authors
6
list available
Contact
CV
Open ↗
GitHub
Open ↗
LinkedIn
Open ↗
Publications
4 items
Additive One Approximation for Minimum Degree Spanning Tree: Breaking the $O(mn)$ Time Barrier
2026
Cited
0
Fully Dynamic Euclidean k-Means
2025
Cited
0
Deterministic $k$-Median Clustering in Near-Optimal Time
2025
Cited
0
Improved Approximation Algorithms for (1,2)-TSP and Max-TSP Using Path Covers in the Semi-Streaming Model
2025
Cited
0
Resume (English only)
Academic Achievements
Paper: 'Fully Dynamic Euclidean k-Means' (arXiv)
Paper: 'Almost Optimal Fully Dynamic k-Center Clustering with Recourse' (ICML 2025)
Paper: 'Deterministic k-Median Clustering in Near-Optimal Time' (ICALP 2025)
Paper: 'Fully Dynamic k-Median with Near-Optimal Update Time and Recourse' (STOC 2025)
Paper: 'Improved Approximation Algorithms for (1,2)-TSP and Max-TSP Using Path Covers in the Semi-Streaming Model' (STACS 2025)
Chancellor's International Scholarship (2024–2028)
First prize at the International Mathematics Competition for University Students (IMC, Bulgaria) in 2022 and 2023
Gold Medal at the National Mathematical Olympiad for Undergraduate Students, Iran (2022, 2023)
Silver Medal at the National Mathematical Olympiad for High School Students, Iran (2018)
Co-authors
6 total
Martín Costa
University of Warwick
Sayan Bhattacharya
University of Warwick
Silvio Lattanzi
Research Scientist at Google
Co-author 4
sharareh alipour
Institute for research in fundamental sciences
Tobias Mömke
Professor, Computer Science, University of Augsburg
×
Welcome back
Sign in to Agora
Welcome back! Please sign in to continue.
Email address
Password
Forgot password?
Continue
Do not have an account?
Sign up