Maryam Negahbani

According to our database, Maryam Negahbani authored at least 9 papers between 2019 and 2023.

Collaborative distances:

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

2023

Robust k-center with two types of radii.

Deeparnab Chakrabarty, Maryam Negahbani

Math. Program., February, 2023

Improved Approximation for Fair Correlation Clustering.

Sara Ahmadian, Maryam Negahbani

Proceedings of the International Conference on Artificial Intelligence and Statistics, 2023

2022

Approximation Algorithms for Continuous Clustering and Facility Location Problems.

Deeparnab Chakrabarty, Maryam Negahbani, Ankita Sarkar

Proceedings of the 30th Annual European Symposium on Algorithms, 2022

2021

Better Algorithms for Individually Fair k-Clustering.

Deeparnab Chakrabarty, Maryam Negahbani

CoRR, 2021

Better Algorithms for Individually Fair <i>k</i>-Clustering.

Maryam Negahbani, Deeparnab Chakrabarty

Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

Revisiting Priority k-Center: Fairness and Outliers.

Tanvi Bajpai, Deeparnab Chakrabarty, Chandra Chekuri, Maryam Negahbani

Proceedings of the 48th International Colloquium on Automata, Languages, and Programming, 2021

2019

Generalized Center Problems with Outliers.

Deeparnab Chakrabarty, Maryam Negahbani

ACM Trans. Algorithms, 2019

Fair Algorithms for Clustering.

Suman K. Bera, Deeparnab Chakrabarty, Maryam Negahbani

CoRR, 2019

Fair Algorithms for Clustering.

Suman Kalyan Bera, Deeparnab Chakrabarty, Nicolas Flores, Maryam Negahbani

Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019