3 citations · 8 across the 15 of their papers we have counts for
4 papers · 1 filter
On Triangle Estimation using Tripartite Independent Set Queries
Anup Bhattacharya, Arijit Bishnu, Arijit Ghosh +1
Estimating the number of triangles in a graph is one of the most fundamental problems in sublinear algorithms. In this work, we provide an algorithm that approximately counts the n…
Almost optimal query algorithm for hitting set using a subset query
Arijit Bishnu, Arijit Ghosh, Sudeshna Kolay +2
Given access to the hypergraph through a subset query oracle in the query model, we give sublinear time algorithms for Hitting-Set with almost tight parameterized query complexity.…
On the streaming complexity of fundamental geometric problems
Arijit Bishnu, Arijit Ghosh, Gopinath Mishra +1
In this paper, we focus on lower bounds and algorithms for some basic geometric problems in the one-pass (insertion only) streaming model. The problems considered are grouped into…
FPT algorithms for embedding into low complexity graphic metrics
Arijit Ghosh, Sudeshna Kolay, Gopinath Mishra
The Metric Embedding problem takes as input two metric spaces and , and a positive integer . The objective is to determine whether there is an embedding $F:X…