2

Counting Subgraphs in Degenerate Graphs
A tighter characterization of the subgraphs for which the homomorphism count can be obtained in near-linear time in sparse graphs.
Suman K. Bera, Lior Gishboliner, Yevgeny Levanzov, C. Seshadhri, Asaf Shapira
PDF Arxiv Version
Minimizing Average Flow-Time under Knapsack Constraint
Suman K. Bera, Syamantak Das, Amit Kumar
PDF
Approximation Algorithms for the Partition Vertex Cover Problem
Suman K. Bera, Shalmoli Gupta, Amit Kumar, Sambuddha Roy
PDF
Streaming Quotient Filter: A Near Optimal Approximate Duplicate Detection Approach for Data Streams
Sourav Dutta, Ankur Narang, Suman K. Bera
PDF