Approximation Algorithms for Edge Partitioned Vertex Cover Problems - Suman Kalyan Bera; Shalmoli Gupta; Amit Kumar 001; Sambuddha Roy (CoRR, 2011)

Advanced Bloom Filter Based Algorithms for Efficient Approximate Data De-Duplication in Streams - Suman K. Bera 001; Sourav Dutta 001; Ankur Narang; Souvik Bhattacherjee (CoRR, 2012)

Fenchel Duals for Drifting Adversaries. - Suman Kalyan Bera; Anamitra R. Choudhury; Syamantak Das; Sambuddha Roy; Jayram S. Thatchachar (CoRR, 2013)

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

Approximation algorithms for the partition vertex cover problem. - Suman Kalyan Bera; Shalmoli Gupta; Amit Kumar 001; Sambuddha Roy (Theor. Comput. Sci., 2014)

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

Minimizing average flow-time under knapsack constraint. - Suman Kalyan Bera; Syamantak Das; Amit Kumar 001 (Theor. Comput. Sci., 2016)

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

Coloring in Graph Streams. - Suman Kalyan Bera; Prantar Ghosh (CoRR, 2018)

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

Fair Algorithms for Clustering. - Suman K. Bera 001; Deeparnab Chakrabarty; Maryam Negahbani (CoRR, 2019)

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

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

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

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

Distributional Individual Fairness in Clustering. - Nihesh Anderson; Suman K. Bera 001; Syamantak Das; Yang Liu 018 (CoRR, 2020)

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

A New Dynamic Algorithm for Densest Subhypergraphs. - Suman K. Bera 001; Sayan Bhattacharya; Jayesh Choudhari; Prantar Ghosh (WWW, 2022)

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

Counting Subgraphs in Degenerate Graphs. - Suman K. Bera 001; Lior Gishboliner; Yevgeny Levanzov; C. Seshadhri 001; Asaf Shapira (J. ACM, 2022)

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

Spectral Triadic Decompositions of Real-World Networks. - Sabyasachi Basu; Suman Kalyan Bera; C. Seshadhri 001 (SIAM J. Math. Data Sci., 2024)