1. Clustering without Over-Representation
2. Communication Steps for Parallel Query Processing
3. Suman Kalyan Bera, Deeparnab Chakrabarty, Nicolas Flores, and Maryam Negahbani. 2019. Fair Algorithms for Clustering. In Proc. NeurIPS. Vancouver, CA, 4955--4966.
4. Fair k-Center Clustering in MapReduce and Streaming Settings
5. On the Cost of Essentially Fair Clusterings. In Proc. APPROX-RANDOM (LIPIcs, Vol. 145). Schloss Dagstuhl - Leibniz-Zentrum fü r Informatik, Cambridge;Bercea Ioana Oriana;MA USA,2019