3 citations · 7 across the 6 of their papers we have counts for
6 papers · 1 filter
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…
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.…
Online Coresets for Clustering with Bregman Divergences
Rachit Chhaya, Jayesh Choudhari, Anirban Dasgupta +1
We present algorithms that create coresets in an online setting for clustering problems according to a wide subset of Bregman divergences. Notably, our coresets have a small additi…
Efficient Hierarchical Clustering for Classification and Anomaly Detection
Ishita Doshi, Sreekalyan Sajjalla, Jayesh Choudhari +2
We address the problem of large scale real-time classification of content posted on social networks, along with the need to rapidly identify novel spam types. Obtaining manual labe…
Nearly Optimal Space Efficient Algorithm for Depth First Search
Jayesh Choudhari, Manoj Gupta, Shivdutt Sharma
We design a space-efficient algorithm for performing depth-first search traversal(DFS) of a graph in time using bits of space. While a normal DFS algorithm…
Saving Critical Nodes with Firefighters is FPT
Jayesh Choudhari, Anirban Dasgupta, Neeldhara Misra +1
We consider the problem of firefighting to save a critical subset of nodes. The firefighting game is a turn-based game played on a graph, where the fire spreads to vertices in a br…