In Submissions

Distributional Individual Fairness in Clustering

Introducing a notion of individual fairness for popular $k$-clustering problems such as $k$-means, $k$-center, $k$-median etc.

Nihesh Anderson, Suman K. Bera, Syamantak Das, Yang Liu

Publications

Click on each title to see the abstract and other details.

Suman K. Bera, Jayesh Choudhari, Shahrzad Haddadan, Sara Ahmadian (2023). DeMEtRIS: Counting (near)-Cliques by Crawling. WSDM 2023.

PDF Arxiv Version

Suman K. Bera, Lior Gishboliner, Yevgeny Levanzov, C. Seshadhri, Asaf Shapira (2022). Counting Subgraphs in Degenerate Graphs. JACM 2022.

PDF Arxiv Version

Suman K. Bera, Sayan Bhattacharya, Jayesh Choudhari, Prantar Ghosh (2022). A New Dynamic Algorithm for Densest Subhypergraphs. The Web Conference 2022.

PDF Arxiv Version

Suman K. Bera, Syamantak Das, Sainyam Galhotra, Sagar Sudhir Kale (2022). Fair k-Center Clustering in MapReduce and Streaming Settings. The Web Conference 2022.

Suman K. Bera, Noujan Pashanasangi, C. Seshadhri (2020). Near-Linear Time Homomorphism Counting in Bounded Degeneracy Graphs: The Barrier of Long Induced Cycles. SODA 2021.

PDF Arxiv Version

Suman K. Bera, C. Seshadhri (2020). How to Count Triangles, without Seeing the Whole Graph. KDD 2020.

PDF Code Video Arxiv Version

Suman K. Bera, C. Seshadhri (2020). How the Degeneracy Helps for Triangle Counting in Graph Streams. PODS 2020.

PDF Arxiv Version

Suman K. Bera, Amit Chakrabarti, Prantar Ghosh (2020). Graph Coloring via Degeneracy in Streaming and Other Space-Conscious Models. ICALP 2020.

PDF Arxiv Version

Suman K. Bera, Noujan Pashanasangi, C. Seshadhri (2020). Linear Time Subgraph Counting, Graph Degeneracy, and the Chasm at Size Six. ITCS 2020.

PDF Arxiv Version

Suman K. Bera, Deeparnab Chakrabarty, Nicolas Flores, Maryam Negahbani (2019). Fair Algorithms for Clustering. NeurIPS 2019.

PDF Code Poster Slides Arxiv Version

Suman K. Bera, Amit Chakrabarti (2017). Towards Tighter Space Bounds for Counting Triangles and Other Substructures in Graph Streams. STACS 2017.

Suman K. Bera, Amit Chakrabarti (2015). A Depth-Five Lower Bound for Iterated Matrix Multiplication. CCC 2015.

Suman K. Bera, Syamantak Das, Amit Kumar (2014). Minimizing Average Flow-Time under Knapsack Constraint. TCS 2016.

Suman K. Bera, Shalmoli Gupta, Amit Kumar, Sambuddha Roy (2013). Approximation Algorithms for the Partition Vertex Cover Problem. TCS 2014.

Sourav Dutta, Ankur Narang, Suman K. Bera (2013). Streaming Quotient Filter: A Near Optimal Approximate Duplicate Detection Approach for Data Streams. VLDB 2013.

Manuscripts

Fenchel Duals for Drifting Adversaries

Suman K. Bera, Anamitra R Choudhury, Syamantak Das, Sambuddha Roy, Jayram S Thatchachar

Advanced Bloom Filter Based Algorithms for Efficient Approximate Data De-Duplication in Streams

Suman K. Bera, Sourav Dutta, Ankur Narang, Souvik Bhattacherjee