Fully Dynamic k-Median with Near-Optimal Update Time and Recourse. - Sayan Bhattacharya; Martín Costa; Ermiya Farokhnejad (CoRR, 2024)

Deterministic k-Median Clustering in Near-Optimal Time. - Martín Costa; Ermiya Farokhnejad (ICALP, 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 (STACS, 2025)

Fully Dynamic k-Median with Near-Optimal Update Time and Recourse. - Sayan Bhattacharya; Martín Costa; Ermiya Farokhnejad (STOC, 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, 2025)

Deterministic k-Median Clustering in Near-Optimal Time. - Martín Costa; Ermiya Farokhnejad (CoRR, 2025)

Fully Dynamic Euclidean k-Means. - Sayan Bhattacharya; Martín Costa; Ermiya Farokhnejad; Shaofeng H.-C. Jiang; Yaonan Jin; Jianing Lou (CoRR, 2025)