| 2023 | WSDM | DeMEtRIS: Counting (near)-Cliques by Crawling. | Suman K. Bera, Jayesh Choudhari, Shahrzad Haddadan, Sara Ahmadian |
| 2022 | WWW | A New Dynamic Algorithm for Densest Subhypergraphs. | Suman K. Bera, Sayan Bhattacharya, Jayesh Choudhari, Prantar Ghosh |
| 2022 | WWW | Fair k-Center Clustering in MapReduce and Streaming Settings. | Suman K. Bera, Syamantak Das, Sainyam Galhotra, Sagar Sudhir Kale |
| 2021 | SODA | Near-Linear Time Homomorphism Counting in Bounded Degeneracy Graphs: The Barrier of Long Induced Cycles. | Suman K. Bera, Noujan Pashanasangi, C. Seshadhri |
| 2020 | ICALP | Graph Coloring via Degeneracy in Streaming and Other Space-Conscious Models. | Suman K. Bera, Amit Chakrabarti, Prantar Ghosh |
| 2020 | KDD | How to Count Triangles, without Seeing the Whole Graph. | Suman K. Bera, C. Seshadhri |
| 2020 | PODS | How the Degeneracy Helps for Triangle Counting in Graph Streams. | Suman K. Bera, C. Seshadhri |
| 2017 | STACS | Towards Tighter Space Bounds for Counting Triangles and Other Substructures in Graph Streams. | Suman K. Bera, Amit Chakrabarti |