Ermiya Farokhnejad

According to our database, Ermiya Farokhnejad authored at least 7 papers between 2024 and 2025.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2025

Fully Dynamic Euclidean k-Means.

Sayan Bhattacharya, Martín Costa, Ermiya Farokhnejad, Shaofeng H.-C. Jiang, Yaonan Jin, Jianing Lou

CoRR, July, 2025

Deterministic <i>k</i>-Median Clustering in Near-Optimal Time.

Martín Costa, Ermiya Farokhnejad

CoRR, April, 2025

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

CoRR, January, 2025

Fully Dynamic k-Median with Near-Optimal Update Time and Recourse.

Sayan Bhattacharya, Martín Costa, Ermiya Farokhnejad

Proceedings of the 57th Annual ACM Symposium on Theory of Computing, 2025

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

Proceedings of the 42nd International Symposium on Theoretical Aspects of Computer Science, 2025

Deterministic k-Median Clustering in Near-Optimal Time.

Martín Costa, Ermiya Farokhnejad

Proceedings of the 52nd International Colloquium on Automata, Languages, and Programming, 2025

2024

Fully Dynamic <i>k</i>-Median with Near-Optimal Update Time and Recourse.

Sayan Bhattacharya, Martín Costa, Ermiya Farokhnejad

CoRR, 2024