14 citations · 32 across the 13 of their papers we have counts for
14 papers
DeMEtRIS: Counting (near)-Cliques by Crawling
Suman K. Bera, Jayesh Choudhari, Shahrzad Haddadan +1
We study the problem of approximately counting cliques and near cliques in a graph, where the access to the graph is only available through crawling its vertices; thus typically se…
Spectral Triadic Decompositions of Real-World Networks
Sabyasachi Basu, Suman Kalyan Bera, C. Seshadhri
A fundamental problem in mathematics and network analysis is to find conditions under which a graph can be partitioned into smaller pieces. The most important tool for this partiti…
A New Dynamic Algorithm for Densest Subhypergraphs
Suman K. Bera, Sayan Bhattacharya, Jayesh Choudhari +1
Computing a dense subgraph is a fundamental problem in graph mining, with a diverse set of applications ranging from electronic commerce to community detection in social networks.…
Near-Linear Time Homomorphism Counting in Bounded Degeneracy Graphs: The Barrier of Long Induced Cycles
Suman K. Bera, Noujan Pashanasangi, C. Seshadhri
Counting homomorphisms of a constant sized pattern graph in an input graph is a fundamental computational problem. There is a rich history of studying the complexity of thi…
Counting Subgraphs in Degenerate Graphs
Suman K. Bera, Lior Gishboliner, Yevgeny Levanzov +2
We consider the problem of counting the number of copies of a fixed graph within an input graph . This is one of the most well-studied algorithmic graph problems, with many…
How to Count Triangles, without Seeing the Whole Graph
Suman K. Bera, C. Seshadhri
Triangle counting is a fundamental problem in the analysis of large graphs. There is a rich body of work on this problem, in varying streaming and distributed models, yet all these…
How the Degeneracy Helps for Triangle Counting in Graph Streams
Suman K. Bera, C. Seshadhri
We revisit the well-studied problem of triangle count estimation in graph streams. Given a graph represented as a stream of edges, our aim is to compute a -a…
Linear Time Subgraph Counting, Graph Degeneracy, and the Chasm at Size Six
Suman K. Bera, Noujan Pashanasangi, C. Seshadhri
We consider the problem of counting all -vertex subgraphs in an input graph, for any constant . This problem (denoted sub-cnt) has been studied extensively in both theory…
Graph Coloring via Degeneracy in Streaming and Other Space-Conscious Models
Suman K. Bera, Amit Chakrabarti, Prantar Ghosh
We study the problem of coloring a given graph using a small number of colors in several well-established models of computation for big data. These include the data streaming model…
Fair Algorithms for Clustering
Suman K. Bera, Deeparnab Chakrabarty, Nicolas J. Flores +1
We study the problem of finding low-cost Fair Clusterings in data where each data point may belong to many protected groups. Our work significantly generalizes the seminal work of…
Coloring in Graph Streams
Suman Kalyan Bera, Prantar Ghosh
In this paper, we initiate the study of the vertex coloring problem of a graph in the semi streaming model. In this model, the input graph is defined by a stream of edges, arriving…
Fenchel Duals for Drifting Adversaries
Suman K Bera, Anamitra R Choudhury, Syamantak Das +2
We describe a primal-dual framework for the design and analysis of online convex optimization algorithms for {\em drifting regret}. Existing literature shows (nearly) optimal drift…
Advanced Bloom Filter Based Algorithms for Efficient Approximate Data De-Duplication in Streams
Suman K. Bera, Sourav Dutta, Ankur Narang +1
Applications involving telecommunication call data records, web pages, online transactions, medical records, stock markets, climate warning systems, etc., necessitate efficient man…
Approximation Algorithms for Edge Partitioned Vertex Cover Problems
Suman Kalyan Bera, Shalmoli Gupta, Amit Kumar +1
We consider a natural generalization of the Partial Vertex Cover problem. Here an instance consists of a graph G = (V,E), a positive cost function c: V-> Z^{+}, a partition $P_1,..…