Suman Kalyan Bera

According to our database, Suman Kalyan Bera authored at least 22 papers between 2011 and 2023.

Collaborative distances:

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

2023

DeMEtRIS: Counting (near)-Cliques by Crawling.

Suman K. Bera, Jayesh Choudhari, Shahrzad Haddadan, Sara Ahmadian

Proceedings of the Sixteenth ACM International Conference on Web Search and Data Mining, 2023

2022

Counting Subgraphs in Degenerate Graphs.

Suman K. Bera, Lior Gishboliner, Yevgeny Levanzov, C. Seshadhri, Asaf Shapira

J. ACM, 2022

Spectral Triadic Decompositions of Real-World Networks.

Sabyasachi Basu, Suman Kalyan Bera, C. Seshadhri

CoRR, 2022

Fair k-Center Clustering in MapReduce and Streaming Settings.

Suman K. Bera, Syamantak Das, Sainyam Galhotra, Sagar Sudhir Kale

Proceedings of the WWW '22: The ACM Web Conference 2022, Virtual Event, Lyon, France, April 25, 2022

A New Dynamic Algorithm for Densest Subhypergraphs.

Suman K. Bera, Sayan Bhattacharya, Jayesh Choudhari, Prantar Ghosh

Proceedings of the WWW '22: The ACM Web Conference 2022, Virtual Event, Lyon, France, April 25, 2022

2021

Near-Linear Time Homomorphism Counting in Bounded Degeneracy Graphs: The Barrier of Long Induced Cycles.

Suman K. Bera, Noujan Pashanasangi, C. Seshadhri

Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021

2020

Distributional Individual Fairness in Clustering.

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

CoRR, 2020

How the Degeneracy Helps for Triangle Counting in Graph Streams.

Suman K. Bera, C. Seshadhri

Proceedings of the 39th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2020

How to Count Triangles, without Seeing the Whole Graph.

Suman K. Bera, C. Seshadhri

Proceedings of the KDD '20: The 26th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, 2020

Linear Time Subgraph Counting, Graph Degeneracy, and the Chasm at Size Six.

Suman K. Bera, Noujan Pashanasangi, C. Seshadhri

Proceedings of the 11th Innovations in Theoretical Computer Science Conference, 2020

Graph Coloring via Degeneracy in Streaming and Other Space-Conscious Models.

Suman K. Bera, Amit Chakrabarti, Prantar Ghosh

Proceedings of the 47th International Colloquium on Automata, Languages, and Programming, 2020

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

2018

Coloring in Graph Streams.

Suman Kalyan Bera, Prantar Ghosh

CoRR, 2018

2017

Towards Tighter Space Bounds for Counting Triangles and Other Substructures in Graph Streams.

Suman K. Bera, Amit Chakrabarti

Proceedings of the 34th Symposium on Theoretical Aspects of Computer Science, 2017

2016

Minimizing average flow-time under knapsack constraint.

Suman Kalyan Bera, Syamantak Das, Amit Kumar

Theor. Comput. Sci., 2016

2015

A Depth-Five Lower Bound for Iterated Matrix Multiplication.

Suman K. Bera, Amit Chakrabarti

Proceedings of the 30th Conference on Computational Complexity, 2015

2014

Approximation algorithms for the partition vertex cover problem.

Suman Kalyan Bera, Shalmoli Gupta, Amit Kumar, Sambuddha Roy

Theor. Comput. Sci., 2014

2013

Streaming Quotient Filter: A Near Optimal Approximate Duplicate Detection Approach for Data Streams.

Sourav Dutta, Ankur Narang, Suman K. Bera

Proc. VLDB Endow., 2013

Fenchel Duals for Drifting Adversaries.

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

CoRR, 2013

2012

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

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

CoRR, 2012

2011

Approximation Algorithms for Edge Partitioned Vertex Cover Problems

Suman Kalyan Bera, Shalmoli Gupta, Amit Kumar, Sambuddha Roy

CoRR, 2011